#DIR@ short description @ Longer description.
mod@ modular arithmetics @ Modular arithmetics and number theory.
fft@ fast Fourier and Walsh transform @ Fast Fourier and Walsh transform.
arith@ arithmetical algorithms @ Arithmetical algorithms like CORDIC and powering.
ds@ data structures @ Data structures like FIFO, heap and deque.
graph@ graph search @ Searching directed graphs, mostly to find combinatorial objects.
bits@ bit wizardry @ Bit fiddling routines.
comb@ combinatorics @ Combinatorial objects like combinations, permutations, Gray codes, partitions and necklaces.
sort@ sorting and searching @ Sorting and searching: quick sort, radix sort and binary search.
gf2n@ binary polynomials and finite fields @ Binary polynomials, finite fields GF(2^n) and shift registers.
perm@ permutations @ Routines for computations with permutations.
