anchor.diff:  to_orddict_1(E, R, _D, I) ->
       push_tuple_pairs(I+1, R, E, []).
   
  -to_orddict_2(E=?NODEPATTERN(S), R, D, L) ->
  +to_orddict_2(E=?NODEPATTERN(S), R, D, L) when is_integer(S) ->
       to_orddict_3(?NODESIZE, R, D, L, E, S);
   to_orddict_2(E, R, D, L) when is_integer(E) ->
       push_pairs(E, R, D, L);
  
positive.code:       Function :: fun((Index :: array_indx(), Value :: Type, Acc :: A) -> B).
  
  sparse_foldl(Function, A, #array{size = N, elements = E, default = D})
    when is_function(Function, 3) ->
      if N > 0 ->
  	    sparse_foldl_1(N-1, E, A, 0, Function, D);
         true ->
  
negative.code:     end;
  
  from_orddict_0(Xs=[{Ix1, _}|_], Ix, Max0, D, Es0) 
    when is_integer(Ix1), Ix1 > Max0  ->
      %% We have a hole larger than a leaf
      Hole = Ix1-Ix,
      Step = Hole - (Hole rem ?LEAFSIZE),
  