mirror of
https://github.com/Mercury-Language/mercury.git
synced 2026-04-20 03:43:51 +00:00
library/pretty_printer.m:
Register default handlers for sparse bitsets of all forms.
Since we no way to find the from_uint methods needed to turn
each uint in the set back to the value it came from, print
the uints themselves, since that is still much better than nothing.
tests/hard_coded/test_pretty_printer_defaults.{m,exp}:
Add tests of all the new handlers.
87 lines
3.1 KiB
Plaintext
87 lines
3.1 KiB
Plaintext
The types in the default formatter map:
|
|
formatter_map_entry("array", "array", 1)
|
|
formatter_map_entry("builtin", "character", 0)
|
|
formatter_map_entry("builtin", "float", 0)
|
|
formatter_map_entry("builtin", "int", 0)
|
|
formatter_map_entry("builtin", "int16", 0)
|
|
formatter_map_entry("builtin", "int32", 0)
|
|
formatter_map_entry("builtin", "int64", 0)
|
|
formatter_map_entry("builtin", "int8", 0)
|
|
formatter_map_entry("builtin", "string", 0)
|
|
formatter_map_entry("builtin", "uint", 0)
|
|
formatter_map_entry("builtin", "uint16", 0)
|
|
formatter_map_entry("builtin", "uint32", 0)
|
|
formatter_map_entry("builtin", "uint64", 0)
|
|
formatter_map_entry("builtin", "uint8", 0)
|
|
formatter_map_entry("fat_sparse_bitset", "fat_sparse_bitset", 1)
|
|
formatter_map_entry("fatter_sparse_bitset", "fatter_sparse_bitset", 1)
|
|
formatter_map_entry("list", "list", 1)
|
|
formatter_map_entry("one_or_more", "one_or_more", 1)
|
|
formatter_map_entry("sparse_bitset", "sparse_bitset", 1)
|
|
formatter_map_entry("tree234", "tree234", 2)
|
|
formatter_map_entry("tree_bitset", "tree_bitset", 1)
|
|
formatter_map_entry("version_array", "version_array", 1)
|
|
|
|
ints:
|
|
42 -123
|
|
|
|
floats:
|
|
3.141 -10.0
|
|
|
|
chars:
|
|
['a', '*', '\n']
|
|
|
|
string:
|
|
"this is a string"
|
|
|
|
tuple:
|
|
{1, '2', 3.0, "four"}
|
|
|
|
array:
|
|
array([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, ...])
|
|
|
|
version_array:
|
|
version_array([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, ...])
|
|
|
|
list:
|
|
[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, ...]
|
|
|
|
one_or_more:
|
|
one_or_more(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, ...])
|
|
|
|
map:
|
|
map([(1 -> 1), (2 -> 2), (3 -> 3), (4 -> 4), (5 -> 5), (6 -> 6), (7 -> 7),
|
|
(8 -> 8), (9 -> 9), (10 -> 10), (11 -> 11), (12 -> 12), (13 -> 13),
|
|
(14 -> 14), (15 -> 15), (16 -> 16), (17 -> 17), (18 -> 18), (19 -> 19),
|
|
(20 -> 20), (21 -> 21), (22 -> 22), (23 -> 23), (24 -> 24), (25 -> 25),
|
|
(26 -> 26), (27 -> 27), (28 -> 28), (29 -> 29), (30 -> 30), (31 -> 31),
|
|
(32 -> 32), (33 -> 33), (34 -> 34), (35 -> 35), (36 -> 36), (37 -> 37),
|
|
(38 -> 38), (39 -> 39), (40 -> 40), (41 -> 41), (42 -> 42), (43 -> 43),
|
|
(44 -> 44), (45 -> 45), (46 -> 46), (47 -> 47), (48 -> 48), (49 -> 49),
|
|
(... -> ...), ...])
|
|
|
|
sparse_bitset:
|
|
sparse_bitset([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53,
|
|
59, 61, 67, 71, 73, 79, 83, 89, 97])
|
|
|
|
fat_sparse_bitset:
|
|
fat_sparse_bitset([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,
|
|
53, 59, 61, 67, 71, 73, 79, 83, 89, 97])
|
|
|
|
fatter_sparse_bitset:
|
|
fatter_sparse_bitset([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47,
|
|
53, 59, 61, 67, 71, 73, 79, 83, 89, 97])
|
|
|
|
tree_bitset:
|
|
tree_bitset([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59,
|
|
61, 67, 71, 73, 79, 83, 89, 97])
|
|
|