Planned features

Everything is subject to change until released.

Already implemented

Planning

e( - array min
e) - array max
e+ - accumulation
e, - frequencies
e: - combinations
e^ - range(?)
eb - break (loop?)
ec - continue loop
ef - flood fill
eg - get from map (dict) - what about missing key?
eh - hex
ei - read from file
ek - closure
em - trim
eo - write to file
ep - put in map (dict)
ev - comparison with -1/0/1 result
ey (or y?) - binary search

k - copy multiple stack items
n - read single character?
m$ - sorting permutation
m/ - divisors
mG - ext. Euclid
mb - binomial coeff.
mg - gcd

exec
contains
find duplicates
regex
matrix padding, cropping
lexicographic comparison of arrays with block
wrap n items from stack in array
move deeper item from stack
collect n items from repeated block
extensions for b, array number *, array number /, t
convert set of indices <-> array of 0/1
permutation inverse
sgnabs
exponent of divisor
backtracking
...and many more

later: string flag for arrays and reference counting