generated on
Fri Mar  4 12:55:00 MST 2022

arity 0
types , sum = 1144
~ ...tition -> 2
")" string -> 2
`, range from 0 auto1 -> 2
 sorry, i don't understand this code. please report. -> 2
256 integer -> 2
~ default -> 2
"#" string -> 2
32 integer -> 2
8 integer -> 2
2 to base from data arg -> 2
5 hashmod arg -> 2
35 integer -> 2
n isAlphaNum -> 2
"*" string -> 2
'@' char -> 2
-4 integer -> 2
> foldop: max by fn -> 2
"[" string -> 2
"!" string -> 2
"]" string -> 2
"YES" string -> 2
"NO" string -> 2
~ par...... -> 2
50 integer -> 2
11 integer -> 3
"+" string -> 3
; foldop: rev cons -> 3
16 integer -> 3
":" string -> 3
, zipop: make tuple -> 3
;;$  -> 3
] foldop: max -> 3
"." string -> 3
40 integer -> 3
: foldop: cons -> 3
: zipop: cons -> 4
= zipop: subscript -> 4
"," string -> 5
~ zipop: by -> 5
9 integer -> 6
^ pow auto1 auto2 -> 6
~ not -> 6
4 integer -> 7
`D to base from data -> 8
, range from 1 auto1 -> 8
6 integer -> 8
10 integer -> 10
5 integer -> 10
"\n" string -> 11
;@  -> 11
3 integer -> 11
1 integer -> 12
0 integer -> 15
;_  -> 17
;$  -> 19
" " string -> 19
2 integer -> 24
;;@  -> 26
_  -> 65
 implicit arg  -> 113
~ auto -> 132
@  -> 152
$  -> 237


arity 1
types [[int],[int]], sum = 1

types [[chr,int]], sum = 1

types [int,int,int,int], sum = 2

types int,int,int,int, sum = 2
`. iterate while uniq -> 2

types [int,int,int], sum = 2

types [int,chr], sum = 2

types int,int, sum = 2
`. iterate while uniq -> 2

types int,int,int, sum = 2
`. iterate while uniq -> 2

types [chr,int], sum = 2

types [int,int], sum = 6
. map -> 2

types [[[chr]]], sum = 10
`' transpose -> 2
. map -> 2
 implicit map -> 2
+ concat -> 2

types [[int]], sum = 21
>> tail -> 2
`* nary cartesian product -> 2
 implicit map -> 2
+ concat -> 5
. map -> 6

types chr, sum = 28
, range from 1 -> 2
o ord -> 2
+ add auto2 -> 2
`( to lowercase -> 3
`) to uppercase -> 6
\ char class -> 7

types [[chr]], sum = 120
=~ group by (also sorts) -> 2
; save -> 2
/ foldr -> 2
`< sort -> 3
>> tail -> 3
, length -> 4
`( uncons -> 4
! zip with -> 5
`* nary cartesian product -> 6
| filter -> 7
 implicit map -> 8
`' transpose -> 9
/ foldr1 -> 9
\ reverse -> 11
. map -> 13
+ concat -> 23

types [int], sum = 167
``p permutations -> 2
+ add auto1 -> 2
=\ scanl1 -> 2
=\ scanl -> 2
`/ special folds -> 2
 implicit foldl1 -> 2
`/ chunks of auto1 -> 3
`_ subsequences auto1 -> 3
: append auto2 -> 3
<< init -> 3
=~ group by (also sorts) -> 3
`< sort -> 5
; save -> 6
, length -> 6
>> tail -> 8
! zip with -> 9
`* product -> 9
| filter -> 11
/ foldr1 -> 12
 implicit map -> 12
\ reverse -> 14
+ sum -> 15
. map -> 25

types int, sum = 168
`. iterate while uniq -> 2
* multiply auto1 -> 2
`# hashmod -> 2
: append auto2 -> 2
hex to/from hex -> 2
 implicit string concatenation -> 2
- subtract auto1 -> 3
ch chr -> 4
^ pow auto2 -> 4
`$ signum -> 5
^ pow auto1 -> 6
/ divide auto2 -> 6
- subtract auto2 -> 7
`p int to str -> 7
% modulus auto2 -> 8
* multiply auto2 -> 8
 implicit map with implicit range -> 10
`, range from 0 -> 15
; save -> 15
+ add auto2 -> 16
, range from 1 -> 38

types [chr], sum = 171
`% step auto1 -> 2
hex to/from hex -> 2
/ foldr -> 2
`' transpose -> 3
`/ chunks of auto1 -> 3
`$ uniq -> 3
`. iterate while uniq -> 3
== equal? -> 3
`( uncons -> 4
! zip with -> 4
`# hashmod -> 4
`= chunk by -> 4
; save -> 5
`< sort -> 6
`r read int -> 8
`\ special scans -> 9
| filter -> 10
\ reverse -> 13
. map -> 15
, length -> 17
% split (remove empties) auto2 -> 18
/ foldr1 -> 18


arity 2
types [[[chr]]], [[chr]],int, sum = 1

types ???, [???], sum = 1

types [[[chr]]], int, sum = 1

types [int,int,int], int, sum = 1

types int, int,int, sum = 1

types [int], chr, sum = 1

types [[chr]], [[chr]], sum = 1

types [[int]], int, sum = 2

types [int,int], int, sum = 2
< take -> 2

types [int], [int], sum = 3
: append -> 2

types chr, chr, sum = 10
- subtract -> 2
: append -> 2
? if/else -> 3

types [chr], [int], sum = 10
: append -> 2
* join -> 8

types [chr], chr, sum = 11
 implicit string concatenation -> 2
: append -> 7

types chr, int, sum = 13
^ replicate -> 2
- subtract -> 2
/ divide -> 2
? if/else -> 3

types [[chr]], int, sum = 14
< take -> 2
=~ subscript nowrap -> 2
^ replicate -> 2
= subscript (wrapped) -> 4

types [[chr]], [chr], sum = 17
? index -> 2
: append -> 5
* join -> 10

types [int], int, sum = 22
= subscript (wrapped) -> 2
> drop -> 2
+ add -> 2
`@ from base -> 2
: append -> 3
< take -> 8

types [chr], int, sum = 51
`< take also drop -> 3
> drop -> 4
 implicit string concatenation -> 4
? if/else -> 5
= subscript (wrapped) -> 5
: append -> 12
^ replicate -> 15

types [chr], [chr], sum = 66
`% split list (keep empties) -> 2
`: list of 2 lists -> 3
- diff -> 6
% split (remove empties) -> 11
: append -> 20
 implicit string concatenation -> 22

types int, int, sum = 193
;$  -> 2
`^ bit xor -> 3
 implicit tuple -> 3
`& bit intersection -> 4
`/ divmod -> 4
~ tuple -> 4
? if/else -> 8
`@ to base -> 14
/ divide -> 17
^ pow -> 17
% modulus -> 20
- subtract -> 28
+ add -> 30
* multiply -> 34


arity 3
types [chr], [chr], [chr], sum = 1

types int, int, int,int, sum = 1

types [chr], int, int, sum = 2
& justify -> 2

types [[chr]], [chr], int, sum = 2
& justify -> 2

types int, int, int, sum = 4
~~ 3-ary tuple -> 2
 implicit tuple -> 2

types [chr], [chr], int, sum = 5
& justify -> 4


arity 4
types int, int, int, int, sum = 4
~~~ 4-ary tuple -> 2
 implicit tuple -> 2