Previous: Benchmark, Up: k9: Manual
I expect you are pleasantly surprised by the speed of k9 and by the fact that it all fits in 134,152 bytes! (For comparison the ls program weighs in at 51,888 bytes and can’t even change directory.)
If you’re frustrated by the syntax or terse errors, then you’re not alone. Many have had the same problems, but persevered, and finally came away a power user able to squeeze information from data faster than previously imagined.
Eventually, you’ll realize that this manual isn’t needed and it’s all here...
select count first last min max sum avg var dev .. by ..
in n_(rand) n@(multiply) n?(divide) n@n?(bar)
Verb monad Adverb Type
+ + ' each char " ab"
- - / over sym ``ab
* * \ scan bool 011b
% div int 2 3 4
! mod where System float 2 3e4
& & flip \l load -fixed 2.0 3.4
| | reverse \t time -locus -74::40.7
< < asc \v vars z.d date 2001.02.03
> > desc \w work z.t time 12:34:56.789
= = freq z.T datetime
~ ~ ~
, , ,
# take count I/O Class
_ drop first 0' line expr :2+a
^ cut sort 1' char/stdout func f[a] 2+a
@ @ type 2' data/stderr
? find unique *3' set list (2;3.4)
$ parse str *4' get dict {a:2 3}
. dict value *5' ffi table [a:2 3]