anchor.diff:      Vcs = term(V, D, 0, 99999),                 %Never break the line
       Vl = flatlength(Vcs),
       if CurL+Kl+Vl < L-10 ->                     %Both fit together here
  -            {join,[Kcs,$\s,Vcs],Kl+1+Vl};
  +            {both_fit,[Kcs,$\s,Vcs],Kl+1+Vl};
          I+Kl+Vl < L-10 ->                        %Both fit on single line
  -            {break,[Kcs,$\s,Vcs],Kl+1+Vl};
  +            {both_line,[Kcs,$\s,Vcs],Kl+1+Vl};
          true ->                                  %On separate lines
               %% Try to reuse flat prints if they fit on one line.
               Ks = if I+Kl < L-10 -> Kcs;
  
positive.code: term(Bit, D, _, _) when is_bitstring(Bit) ->
      bitstring(Bit, D);                          %First D bytes
  term(Map, D, I, L) when ?IS_MAP(Map) ->
      map(Map, D, I, L);
  term(Other, _, _, _) ->
      lfe_io_write:term(Other).                   %Use standard LFE for rest
  
  
negative.code: term([comma,E], D, I, L) -> [",",term(E, D, I+1, L)];
  term(['comma-at',E], D, I, L) -> [",@",term(E, D, I+2, L)];
  term([map|MapBody], D, I, L) ->
      Mcs = map_body(MapBody, D, I+5, L),
      ["(map ",Mcs,$)];
  term([Car|_]=List, D, I, L) ->
      %% Handle printable lists specially.
      case io_lib:printable_unicode_list(List) of
  