anchor.diff:      %% If the size is greater than 0
       KV1 = map(fun rank/1, KV),
       reverse(sort(KV1)).
  -		     
  +             
   rank({X, K}) when is_atom(X) ->
       case length(atom_to_list(X)) of
  -	N when N > 1, K > 1 ->
  -	    {(N-1) * K, X};
  -	_ ->
  -	    {0, X}
  +    N when N > 1, K > 1 ->
  +        {(N-1) * K, X};
  +    _ ->
  +        {0, X}
       end;
   rank({X, K}) when is_integer(X) ->
       case length(integer_to_list(X)) of
  -	N when N > 1, K > 1 ->
  -	    {(N-1) * K, X};
  -	_ ->
  -	    {0, X}
  +    N when N > 1, K > 1 ->
  +        {(N-1) * K, X};
  +    _ ->
  +        {0, X}
       end;
   rank({X, _}) ->
       {0, X}.
  
positive.code: 
  -compile(export_all).
  
  -export([decode_init/0, decode/1, decode/2, encode/1, encode/2]).
  -export([encode_print/1, deabstract/1]).
  
  -import(lists, [foldl/3, reverse/1, map/2, seq/2, sort/1]).
  
  
  bug() ->
      C = decode("{'abc"),
  
negative.code:     foldl(fun analyse/2, Dict, tuple_to_list(T)); 
  analyse(X, Dict) ->
      case dict:find(X, Dict) of
      {ok, Val} ->
          dict:store(X, Val+1, Dict);
      error ->
          dict:store(X, 1, Dict)
      end.
  
  encode_obj(X) when is_atom(X) -> encode_atom(X);
  