-
Notifications
You must be signed in to change notification settings - Fork 138
/
lfe_io_pretty.erl
399 lines (351 loc) · 14.9 KB
/
lfe_io_pretty.erl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
%% Copyright (c) 2008-2021 Robert Virding
%%
%% Licensed under the Apache License, Version 2.0 (the "License");
%% you may not use this file except in compliance with the License.
%% You may obtain a copy of the License at
%%
%% http://www.apache.org/licenses/LICENSE-2.0
%%
%% Unless required by applicable law or agreed to in writing, software
%% distributed under the License is distributed on an "AS IS" BASIS,
%% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
%% See the License for the specific language governing permissions and
%% limitations under the License.
%% File : lfe_io_pretty.erl
%% Author : Robert Virding
%% Purpose : Pretty printer for Lisp Flavoured Erlang.
-module(lfe_io_pretty).
%% The basic API.
-export([term/1,term/2,term/3,term/4]).
%% These might be useful somewhere else.
-export([newline/1,newline/2,last_length/1,last_length/2]).
%% -compile(export_all).
-import(lists, [reverse/1,reverse/2,flatlength/1]).
-include("lfe.hrl").
-define(MAPVIND, 2). %Extra indentation of map value
%% term(Sexpr [, Depth [, Indentation [, LineLength]]]) -> [char()].
%% A relatively simple pretty print function, but with some
%% customisation. N.B. We know about the standard character macros
%% and use them instead of their expanded forms.
term(S) -> term(S, -1, 0, 80).
term(S, D) -> term(S, D, 0, 80).
term(S, D, I) -> term(S, D, I, 80).
term(_, 0, _, _) -> "...";
term(Symb, _, _, _) when is_atom(Symb) -> lfe_io_write:symbol(Symb);
term(Numb, _, _, _) when is_integer(Numb) -> integer_to_list(Numb);
term(Numb, _, _, _) when is_float(Numb) -> io_lib_format:fwrite_g(Numb);
%% Handle some default special cases, standard character macros. These
%% don't increase depth as they really should.
term([quote,E], D, I, L) -> ["'",term(E, D, I+1, L)];
term([backquote,E], D, I, L) -> ["`",term(E, D, I+1, L)];
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([Car|_]=List, D, I, L) ->
%% Handle printable lists specially.
case io_lib:printable_unicode_list(List) of
true -> lfe_io_write:string(List, $"); %"
false ->
case list_max(List, D-1, I+1, L-1) of
{yes,Print} -> ["(",Print,")"];
no ->
%% Customise printing of lists.
case indent_type(Car) of
none -> %Normal lists.
["(",list(List, D-1, I+1, L-1),")"];
defun -> %Special case for defuns
defun(List, D, I, L);
N when is_integer(N) -> %Special N first elements
type(List, D, I, L, N)
end
end
end;
term([], _, _, _) -> "()";
term({}, _, _, _) -> "#()";
term(Tup, D, I, L) when is_tuple(Tup) ->
Es = tuple_to_list(Tup),
case list_max(Es, D-1, I+2, L-1) of
{yes,Print} -> ["#(",Print,")"];
no -> ["#(",list(Es, D-1, I+2, L),")"]
end;
term(Bit, D, _, _) when is_bitstring(Bit) ->
bitstring(Bit, D); %First D bytes
term(Map, D, I, L) when ?IS_MAP(Map) ->
%% Preserve kv pair ordering, the extra copying is trivial here.
map(Map, D, I, L);
term(Other, _, _, _) ->
lfe_io_write:term(Other). %Use standard LFE for rest
%% map(Map, Depth, Indentation, LineLength) -> string().
%% Print a map but specially detect structs.
map(Map, D, I, L) ->
case maps:is_key('__struct__', Map) of
true ->
struct(Map, D, I, L);
false ->
%% Preserve kv pair ordering, the extra copying is trivial here.
Mkvs = maps:to_list(Map),
Mcs = map_body(Mkvs, D, I+3, L),
["#M(",Mcs,$)]
end.
%% struct(Map, Depth, Indentation, LineLength) -> string()
%% Print a struct from the map.
struct(Map, D, I, L) ->
{StructName,Struct} = maps:take('__struct__', Map),
Skvs = maps:to_list(Struct), %The struct kvs
NameCs = lfe_io_write:symbol(StructName),
NameLen = length(NameCs),
%% Struct name is first "KV" so now we want the rest of them.
Scs = map_rest(Skvs, I+3+NameLen, D-1, I+3, L),
["#S(",NameCs,Scs,$)].
%% bitstring(Bitstring, Depth) -> [char()]
%% Print the bytes in a bitstring. Print bytes except for last which
%% we add size field if not 8 bits big.
bitstring(Bit, D) ->
try
Chars = unicode:characters_to_list(Bit, utf8),
true = io_lib:printable_unicode_list(Chars),
[$#|lfe_io_write:string(Chars, $")]
catch
_:_ -> lfe_io_write:bitstring(Bit, D)
end.
%% defun(List, Depth, Indentation, LineLength) -> [char()].
%% Print a defun depending on whether it is traditional or matching.
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 = term(Args, D-2, I + length(Dcs) + length(Ncs) + 3, L),
Tcs = list_tail(Rest, D-3, I+2, L),
["(",Dcs," ",Ncs," ",Acs,Tcs,")"];
false -> %Matching
Tcs = list_tail([Args|Rest], D-2, I+2, L),
["(",Dcs," ",Ncs,Tcs,")"]
end;
defun(List, D, I, L) ->
%% Too short to get worked up about, or not a "proper" defun or
%% not enough depth.
["(",list(List, D-1, I+1, L),")"].
%% type(List, Depth, Indentation, LineLength, TypeCount) -> [char()].
%% Print a special type form indenting first TypeCount elements afer
%% type and rest indented 2 steps.
type([Car|Cdr], D, I, L, N) when (D > 2) or (D < 0) ->
%% Handle special lists, we KNOW Car is an atom.
Cs = atom_to_list(Car),
NewI = I + length(Cs) + 2,
{Spec,Rest} = split(N, Cdr),
Tcs = [list(Spec, D-1, NewI, L),
list_tail(Rest, D-2, I+2, L)],
["(" ++ Cs," ",Tcs,")"];
type(List, D, I, L, _) ->
%% Too short to get worked up about or not enough depth.
[$(,list(List, D-1, I+1, L),$)].
%% split(N, List) -> {List1,List2}.
%% Split a list into two lists, the first containing the first N
%% elements and the second the rest. Be tolerant of too few elements.
split(0, L) -> {[],L};
split(_, []) -> {[],[]};
split(N, [H|T]) ->
{H1,T1} = split(N-1, T),
{[H|H1],T1}.
%% list_max(List, Depth, Indentation, LineLength) -> {yes,Chars} | no.
%% Maybe print a list on one line, but abort if it goes past
%% LineLength.
list_max([], _, _, _) -> {yes,[]};
list_max(_, 0, _, _) -> {yes,"..."};
list_max([Car|Cdr], D, I, L) ->
Cs = term(Car, D, 0, 99999), %Never break the line
tail_max(Cdr, D-1, I + flatlength(Cs), L, [Cs]).
%% tail_max(Tail, Depth, Indentation, LineLength) -> {yes,Chars} | no.
%% Maybe print the tail of a list on one line, but abort if it goes
%% past LineLength. We know about dotted pairs. When we reach depth 0
%% we just quit as we know necessary "..." will have come from an
%% earlier print1 at same depth.
tail_max(_, _, I, L, _) when I >= L -> no; %No more room
tail_max([], _, _, _, Acc) -> {yes,reverse(Acc)};
tail_max(_, 0, _, _, Acc) -> {yes,reverse(Acc, [" ..."])};
tail_max([Car|Cdr], D, I, L, Acc) ->
Cs = term(Car, D, 0, 99999), %Never break the line
tail_max(Cdr, D-1, I + flatlength(Cs) + 1, L, [Cs," "|Acc]);
tail_max(S, D, I, L, Acc) ->
Cs = term(S, D, 0, 99999), %Never break the line
tail_max([], D-1, I + flatlength(Cs) + 3, L, [Cs," . "|Acc]).
%% list(List, Depth, Indentation, LineLength)
%% Print a list, one element per line but print multiple atomic
%% elements on one line. No leading/trailing ().
list([], _, _, _) -> [];
list(_, 0, _, _) -> "...";
list([Car|Cdr], D, I, L) ->
case list_element(Car, I, D, I, L) of
{join,Ccs,Cl} -> %Atomic that fits
[Ccs|list_tail(Cdr, I+Cl, D, I, L)];
{break,Ccs,_} -> %Atomic that does not fit
[Ccs|list_tail(Cdr, L, D, I, L)];
{break,Ccs} -> %Non-atomic
%% Force a break after not an atomic.
[Ccs|list_tail(Cdr, L, D, I, L)]
end.
%% list_tail(Tail, Depth, Indentation, LineLength)
%% list_tail(Tail, CurrentLength, Depth, Indentation, LineLength)
%% Print the tail of a list decreasing the depth for each element. We
%% print multiple atomic elements on one line and we know about
%% dotted pairs.
list_tail(Tail, D, I, L) ->
list_tail(Tail, L, D, I, L). %Force a break
list_tail([], _, _, _, _) -> "";
list_tail(_, _, 0, _, _) -> " ...";
list_tail([Car|Cdr], CurL, D, I, L) ->
case list_element(Car, CurL+1, D, I, L) of
{join,Ccs,Cl} -> %Atomic that fits
[$\s,Ccs,list_tail(Cdr, CurL+1+Cl, D-1, I, L)];
{break,Ccs,Cl} -> %Atomic that does not fit
[newline(I, Ccs),list_tail(Cdr, I+Cl, D-1, I, L)];
{break,Ccs} -> %Non-atomic
%% Force a break after not an atomic.
[newline(I, Ccs),list_tail(Cdr, L, D-1, I, L)]
end;
list_tail(Cdr, CurL, D, I, L) ->
case list_element(Cdr, CurL+3, D, I, L) of
{join,Ccs,_} -> [" . "|Ccs]; %Atomic that fits
{break,Ccs,_} -> %Atomic that does not fit
[" .\n",blanks(I, Ccs)];
{break,Ccs} -> %Non-atomic
[" .\n",blanks(I, Ccs)]
end.
list_element(E, CurL, D, _, L) when is_number(E);
is_atom(E);
is_pid(E);
is_reference(E);
is_port(E);
is_function(E);
E =:= [] ->
Ecs = lfe_io_write:term(E, D),
El = flatlength(Ecs),
if CurL+El =< L - 10 -> {join,Ecs,El}; %Don't make the line too wide
true -> {break,Ecs,El}
end;
list_element(E, _, D, I, L) ->
{break,term(E, D, I, L)}.
blanks(N, Tail) -> string:chars($\s, N, Tail).
newline(N) -> newline(N, []).
newline(N, Tail) ->
[$\n|blanks(N, Tail)].
%% indent_type(Form) -> N | none.
%% Defines special indentation. None means default, N is number of
%% sexprs in list which are indented *after* Form while all following
%% that end up at indent+2.
%% Old style forms.
indent_type('define') -> 1;
indent_type('define-syntax') -> 1;
indent_type('define-record') -> 1;
indent_type('begin') -> 0;
indent_type('let-syntax') -> 1;
indent_type('syntax-rules') -> 0;
indent_type('macro') -> 0;
%% New style forms.
indent_type('defmodule') -> 1;
indent_type('defun') -> defun;
indent_type('defmacro') -> defun;
indent_type('defsyntax') -> 1;
indent_type('defrecord') -> 1;
indent_type('deftest') -> 1;
%% Core forms.
indent_type('progn') -> 0;
indent_type('lambda') -> 1;
indent_type('match-lambda') -> 0;
indent_type('let') -> 1;
indent_type('let-function') -> 1;
indent_type('letrec-function') -> 1;
indent_type('let-macro') -> 1;
indent_type('if') -> 1;
indent_type('case') -> 1;
indent_type('receive') -> 0;
indent_type('catch') -> 0;
indent_type('try') -> 1;
indent_type('funcall') -> 1;
indent_type('call') -> 2;
indent_type('eval-when-compile') -> 0;
indent_type('define-function') -> 1;
indent_type('define-macro') -> 1;
indent_type('define-module') -> 1;
indent_type('extend-module') -> 0;
indent_type('define-type') -> 1;
indent_type('define-opaque-type') -> 1;
indent_type('define-function-spec') -> 1;
%% Core macros.
indent_type(':') -> 2;
indent_type('cond') -> 999; %All following forms
indent_type('let*') -> 1;
indent_type('flet') -> 1;
indent_type('flet*') -> 1;
indent_type('fletrec') -> 1;
indent_type(macrolet) -> 1;
indent_type(syntaxlet) -> 1;
indent_type('do') -> 2;
indent_type('lc') -> 1; %List comprehensions
indent_type('list-comp') -> 1;
indent_type('bc') -> 1; %Binary comprehensions
indent_type('binary-comp') -> 1;
indent_type('match-spec') -> 0;
indent_type(_) -> none.
%% map_body(KVs, Depth, Indentation, LineLength).
%% map_body(KVs, CurrentLineIndent, Depth, Indentation, LineLength)
%% Don't include the start and end of the map as this is called from
%% differenct functions.
map_body(KVs, D, I, L) ->
map_body(KVs, I, D, I, L-1).
map_body([KV|KVs], CurL, D, I, L) ->
case map_assoc(KV, CurL, D, I, L) of
{curr_line,KVcs,KVl} -> %Both fit on current line
[KVcs,map_rest(KVs, CurL+KVl, D-1, I, L)];
{one_line,KVcs,KVl} -> %Both fit on one line
[KVcs,map_rest(KVs, I+KVl, D-1, I, L)];
{sep_lines,Kcs,Vcs} -> %On separate lines
%% Force a break after K/V split.
[Kcs,newline(I+?MAPVIND, Vcs),map_rest(KVs, L, D-1, I, L)]
end;
map_body([], _CurL, _D, _I, _L) -> [].
%% map_rest(KVs, CurrentLineIndent, Depth, Indentation, LineLength)
map_rest(_, _, 0, _, _) -> " ..."; %Reached our depth
map_rest([KV|KVs], CurL, D, I, L) ->
case map_assoc(KV, CurL+1, D, I, L) of
{curr_line,KVcs,KVl} -> %Both fit on current line
[$\s,KVcs,map_rest(KVs, CurL+KVl+1, D-1, I, L)];
{one_line,KVcs,KVl} -> %Both fit on one line
[newline(I, KVcs),map_rest(KVs, I+KVl, D-1, I, L)];
{sep_lines,Kcs,Vcs} -> %On separate lines
%% Force a break after K/V split.
[newline(I, Kcs),newline(I+?MAPVIND, Vcs),
map_rest(KVs, L, D-1, I, L)]
end;
map_rest([], _CurL, _D, _I, _L) -> [].
map_assoc({K,V}, CurL, D, I, L) ->
Kcs = term(K, D, 0, 99999), %Never break the line
Kl = flatlength(Kcs),
Vcs = term(V, D, 0, 99999), %Never break the line
Vl = flatlength(Vcs),
if CurL+Kl+Vl < L-10 -> %Both fit on current line
{curr_line,[Kcs,$\s,Vcs],Kl+1+Vl};
I+Kl+Vl < L-10 -> %Both fit on one line
{one_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;
true -> term(K, D, I, L)
end,
Vs = if I+Vl < L-10 -> Vcs;
true -> term(V, D, I+?MAPVIND, L)
end,
{sep_lines,Ks,Vs}
end.
%% last_length(Chars) -> Length.
%% last_length(Chars, CurrentLine) -> Length.
%% Return the length of the last line in the text.
last_length(S) -> last_length(S, 0).
last_length([H|T], L0) when is_list(H) ->
L1 = last_length(H, L0), %Must go left-to-right
last_length(T, L1);
last_length([$\n|T], _) ->
last_length(T, 0);
last_length([_|T], L) ->
last_length(T, L+1);
last_length([], L) -> L.