anchor.diff:  print1_tail_max([], _, _, _, Acc) -> {yes,reverse(Acc)};
   print1_tail_max(_, 0, _, _, Acc) -> {yes,reverse(Acc, [" ..."])};
   print1_tail_max([Car|Cdr], D, I, L, Acc) ->
  -    Cs = print1(Car, D, 0, 99999),          %Never break the line
  +    Cs = print1(Car, D, 0, 99999),              %Never break the line
       print1_tail_max(Cdr, D-1, I + flatlength(Cs) + 1, L, [Cs," "|Acc]);
   print1_tail_max(S, D, I, L, Acc) ->
  -    Cs = print1(S, D, 0, 99999),            %Never break the line
  +    Cs = print1(S, D, 0, 99999),                %Never break the line
       print1_tail_max([], D-1, I + flatlength(Cs) + 3, L, [Cs," . "|Acc]).
   
   %% print1_list(List, Depth, Indentation, LineLength)
  
positive.code: indent_type('bc') -> 1;                %Binary comprehensions
  indent_type('match-spec') -> 0;
  indent_type(_) -> none.
  
negative.code: 
  print1_defun([Def,Name,Args|Rest], D, I, L) when
        is_atom(Name), (D > 3) or (D < 0) ->
      Dcs = atom_to_list(Def),                    %Might not actually be defun
      Ncs = atom_to_list(Name),
      case lfe_lib:is_symb_list(Args) of
          true ->                                 %Traditional
              Acs = print1(Args, D-2, I + length(Dcs) + length(Ncs) + 3, L),
              Tcs = print1_tail(Rest, D-3, I+2, L),
              ["(",Dcs," ",Ncs," ",Acs,Tcs,")"];
          false ->                                %Matching
              Tcs = print1_tail([Args|Rest], D-2, I+2, L),
              ["(",Dcs," ",Ncs,Tcs,")"]
          end;
  print1_defun(List, D, I, L) ->
      %% Too short to get worked up about, or not a "proper" defun or
      %% not enough depth.
  