anchor.diff:  
   insert_elem({all,_}=E,_,SoFar,_Replace) ->
       lists:reverse([E|SoFar]);
  -insert_elem(_E,[all],SoFar,_Replace) ->
  +insert_elem(_E,[all|_],SoFar,_Replace) ->
       lists:reverse(SoFar);
   insert_elem(_E,[{all,_}],SoFar,_Replace) ->
       lists:reverse(SoFar);
  
positive.code: skip_cases(Node,Dir,Suite,Cases,Cmt,Tests,true) when is_list(Cases) ->
      {Tests1,Done} =
  	lists:foldr(fun({{N,D},Suites0},{Merged,_}) when N == Node,
  							   D == Dir ->
  			    Suites1 = skip_cases1(Suite,Cases,Cmt,Suites0),
  			    {[{{N,D},Suites1}|Merged],true};
  		       (T,{Merged,Match}) ->
  
negative.code: 
      %% Get all Run tests sorted per node basis.
      NodeList1 = run_per_node(Run,NodeList, 
  			     TestSpec#testspec.merge_tests),
      
      %% Get all Skip entries sorted per node basis.
      NodeList2 = skip_per_node(Skip,NodeList1),
  
  