anchor.diff:  	     true ->
   		 L2
   	 end,
  -    #sorted{list = L3}.
  +    S#sorted{list = L3, total = Total + 1}.
   
   insert1(_, _, [], E) ->
       [E];
  
positive.code: to_list(#sorted{list = L}) ->
      L.
  
  insert(#sorted{n = N,
  	       dir = Dir,
  	       max = Max,
  	       list = L}, E) ->
      L2 = insert1(N, Dir, L, E),
      L3 = if
  	     is_integer(Max) andalso length(L2) > Max ->
  
negative.code:     end.
  
  compare(N, Dir, A, B) ->
      A1 = element(N, A),
      B1 = element(N, B),
      case Dir of
  	desc -> A1 < B1;
  	asc -> A1 > B1
      end.
  
  	    
  