Release Notes: Speedups, minor additional functions, and bugfixes were added.
Release Notes: New functionality includes Bit wizardry, Reed-Muller transform, Combinatorics, Permutations, Sorting, Searching, Stack (FIFO), Queue (LIFO), heap and priority-queue Bit-manipulations, modular arithmetics and computations in finite fields (GF(2^n)), factorization of binary polynomials, searching paths in directed graphs, and gray codes.
Release Notes: This version has an additional complex-valued fht, short-length fft, and fht. Walsh transforms were improved. Now both dif- and dit- split radix ffts are supported. Auxiliary routines for sorting, searching, permutations, combinations, and partitions were added. Basic self-test functionality was added. The tutorial was improved. Many improvements were made with respect to general consistency and performance.