anchor.diff:      [print1_map_assoc(KV, D, I, L)|print1_map_rest(KVs, D-1, I, L)].
   
   print1_map_rest([], _, _, _) -> [];
  -print1_map_rest(_, 0, _, _) -> "...";
  +print1_map_rest(_, 0, _, _) -> " ...";
   print1_map_rest([KV|KVs], D, I, L) ->
       Massoc = print1_map_assoc(KV, D, I, L),
       [$\n,blanks(I, []),Massoc|print1_map_rest(KVs, D-1, I, L)].
  
positive.code:         {yes,Print}  -> ["#(",Print,")"];
          no -> ["#(",print1_list(Es, D-1, I+2, L),")"]
      end;
  print1(Bit, _, _, _) when is_bitstring(Bit) ->
      ["#B(",lfe_io:print1_bits(Bit, 30),$)];     %First 30 bytes
  print1(Map, D, I, L) when ?IS_MAP(Map) ->
      print1_map(Map, D, I, L);
  print1(Other, _, _, _) ->
  
negative.code: %%  we just quit as we know necessary "..." will have come from an
  %%  earlier print1 at same depth.
  
  print1_tail_max(_, _, I, L, _) when I >= L ->   %No more room
      no;
  print1_tail_max([], _, _, _, Acc) -> {yes,reverse(Acc)};
  print1_tail_max(_, 0, _, _, Acc) -> {yes,reverse(Acc, [" ..."])};
  print1_tail_max([Car|Cdr], D, I, L, Acc) ->
  