mirrors/janet
1
0
Fork 0
mirror of https://github.com/janet-lang/janet synced 2024-12-26 00:10:27 +00:00
Code Issues 1 Releases Wiki Activity

Improve pretty printing for table and struct

Browse Source 
entry values.
This commit is contained in:
Calvin Rose 2018-12-06 17:26:59 -05:00
parent 7668cd5772
commit f2743aca36
3 changed files with 13 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -43,7 +43,7 @@ Janet makes a good system scripting language, or a language to embed in other pr
* Lexical scoping * Lexical scoping
* Imperative programming as well as functional * Imperative programming as well as functional
* REPL * REPL
* 300+ functions and macros in the core library * 300+ functions and macros in the core library
* Interactive environment with detailed stack traces * Interactive environment with detailed stack traces
## Documentation ## Documentation

12
src/core/string.c
View File

@ -490,7 +490,7 @@ static void print_newline(struct pretty *S, int just_a_space) {
} }
/* Helper for pretty printing */ /* Helper for pretty printing */
static void janet_pretty_one(struct pretty *S, Janet x) { static void janet_pretty_one(struct pretty *S, Janet x, int is_dict_value) {
/* Add to seen */ /* Add to seen */
switch (janet_type(x)) { switch (janet_type(x)) {
case JANET_NIL: case JANET_NIL:
@ -534,9 +534,10 @@ static void janet_pretty_one(struct pretty *S, Janet x) {
janet_indexed_view(x, &arr, &len); janet_indexed_view(x, &arr, &len);
if (!isarray && len >= 5) if (!isarray && len >= 5)
janet_buffer_push_u8(S->buffer, ' '); janet_buffer_push_u8(S->buffer, ' ');
if (is_dict_value && len >= 5) print_newline(S, 0);
for (i = 0; i < len; i++) { for (i = 0; i < len; i++) {
if (i) print_newline(S, len < 5); if (i) print_newline(S, len < 5);
janet_pretty_one(S, arr[i]); janet_pretty_one(S, arr[i], 0);
} }
} }
S->indent -= 2; S->indent -= 2;
@ -575,6 +576,7 @@ static void janet_pretty_one(struct pretty *S, Janet x) {
janet_dictionary_view(x, &kvs, &len, &cap); janet_dictionary_view(x, &kvs, &len, &cap);
if (!istable && len >= 4) if (!istable && len >= 4)
janet_buffer_push_u8(S->buffer, ' '); janet_buffer_push_u8(S->buffer, ' ');
if (is_dict_value && len >= 5) print_newline(S, 0);
for (i = 0; i < cap; i++) { for (i = 0; i < cap; i++) {
if (!janet_checktype(kvs[i].key, JANET_NIL)) { if (!janet_checktype(kvs[i].key, JANET_NIL)) {
if (first_kv_pair) { if (first_kv_pair) {
@ -582,9 +584,9 @@ static void janet_pretty_one(struct pretty *S, Janet x) {
} else { } else {
print_newline(S, len < 4); print_newline(S, len < 4);
} }
janet_pretty_one(S, kvs[i].key); janet_pretty_one(S, kvs[i].key, 0);
janet_buffer_push_u8(S->buffer, ' '); janet_buffer_push_u8(S->buffer, ' ');
janet_pretty_one(S, kvs[i].value); janet_pretty_one(S, kvs[i].value, 1);
} }
} }
} }
@ -610,7 +612,7 @@ JanetBuffer *janet_pretty(JanetBuffer *buffer, int depth, Janet x) {
S.depth = depth; S.depth = depth;
S.indent = 0; S.indent = 0;
janet_table_init(&S.seen, 10); janet_table_init(&S.seen, 10);
janet_pretty_one(&S, x); janet_pretty_one(&S, x, 0);
janet_table_deinit(&S.seen); janet_table_deinit(&S.seen);
return S.buffer; return S.buffer;
} }