anchor.diff:  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 ->
  +							 D == Dir ->
   			    Suites1 = skip_cases1(Suite,Cases,Cmt,Suites0),
   			    {[{{N,D},Suites1}|Merged],true};
   		       (T,{Merged,Match}) ->
  
positive.code: 	    Cases1 = Cases0 ++ SkipCases,
  	    insert_in_order({Suite,Cases1},Suites0,replace);
  	false ->
  	    insert_in_order({Suite,SkipCases},Suites0,replace)
      end.
  
  append(Elem, List) ->
  
negative.code: 
  insert_elem({all,_}=E,_,SoFar,_Replace) ->
      lists:reverse([E|SoFar]);
  insert_elem(_E,[all|_],SoFar,_Replace) ->
      lists:reverse(SoFar);
  insert_elem(_E,[{all,_}],SoFar,_Replace) ->
      lists:reverse(SoFar);
  