#collection #rational #ordered #buckets #lexically #binary #key

nightly treeid

An implementation of rational buckets for lexically ordered collections

19 releases

0.3.11 Jun 28, 2019
0.3.10 May 10, 2019
0.3.9 Apr 12, 2019
0.3.6 Feb 22, 2019
0.1.2 Feb 3, 2019

#6 in #buckets

41 downloads per month

MIT license

38KB
570 lines

treeid crates.io docs.rs travis-ci.org

An implementation of rational buckets for lexically ordered collections.

References

License(s)

MIT

Internally, this project makes use of a partial Rust port of icza/bitio in src/bitter.rs, which is licensed under Apache 2.0. The full license text can be found at src/bitter.LICENSE. In some areas the behavior has been changed (notably, we ignore certain bits of written integers where the source library did not), and method names have been changed to better align with Rust conventions.

Dependencies

~465KB