banzai is a bzip2 encoder with linear-time complexity, written entirely in safe Rust. It is currently alpha software, which means that it is not battle-hardened and is not guaranteed to perform well and not eat your data. That's not to say, however, that I don't care about performance or reliability - bug reports are warmly appreciated! In the long term I would like to get this library to a state where it can be relied upon in production software.
To use banzai as a command-line tool with a similar interface to
bzip(1), install bnz through cargo.
banzai currently uses a near-identical method of choosing Huffman trees to the reference implementation and therefore achieves very similar compression ratios. Compared to the reference implementation, banzai has worse average runtime but better worst-case runtime. This is because of the different algorithms used to compute the Burrows-Wheeler Transform. The choice of algorithm used in banzai is SA-IS, which computes a suffix array in linear time. Since bzip2 uses a 'wrap-around' version of the BWT, we are obliged to compute the suffix array of the input concatenated with itself. I intend to investigate ways in which the redundancy inherent to inputs of this form can be exploited to optimise suffix array construction.
This library does not (currently) include a decompressor. Paolo Barbolini's bzip2-rs offers a pure Rust bzip2 decompressor, though I have not used it myself and cannot vouch for its quality.
fn encode(reader: R, writer: io::BufWriter<W>, level: usize) -> io::Result<usize>
encode with a reference to an input buffer and a
BufWriter. The final parameter is
level, which is a number between
9 inclusive, which corresponds to the block size (block size is
level * 100_000 bytes). The typical default is
9. Returns the number of input bytes encoded.
banzai is written entirely in safe Rust. This is a deliberate choice which will, in future, make banzai a good choice for applications where memory-safety is of paramount importance. However, this decisions comes with some performance costs. Experiments suggest that banzai could be approximately 10% faster if the extremely hot
Index impls on
bwt.rs were changed to be unchecked. In the future such performance boosts may be made available to consumers of the library behind a feature gate.
This is original libre software. However, implementation guidance was derived from several free-software sources.
The suffix array construction algorithm used in banzai is SA-IS, which was developed by Ge Nong, Sen Zhang, and Wai Hong Chan. Guidance for implementing SA-IS was derived from Yuta Mori's sais and burntsushi's suffix.
The implementation of Huffman coding used in banzai takes heavy inspiration from the reference implementation of bzip2, originally authored by Julian Seward, currently maintained by Micah Snyder.
Finally, the unofficial bzip2 Format Specification written by Joe Tsai was extremely helpful when it came to the specifics of the bzip2 binary format.