scailist
| Crates.io | scailist |
| lib.rs | scailist |
| version | 0.2.0 |
| source | src |
| created_at | 2019-09-20 19:47:36.729964 |
| updated_at | 2019-09-22 18:20:32.571367 |
| description | A fast and easy interval overlap library |
| homepage | |
| repository | https://github.com/sstadick/ScAIList |
| max_upload_size | |
| id | 166293 |
| size | 33,433 |
Seth (sstadick)
documentation
https://docs.rs/scailist
README
ScAIList
This is rust implementation of the AIList algorithm as described here. The biggest difference is that this implementation dynamicaly determines the max number of components instead of capping at 10. One might call it a Scaled Augmented Interval List. It takes the log2 of the input element lengths to be the max number of components and then decomposes into that.
It seems to be very fast. As fast as rust-lapper in all easy cases with
spread our intervals, and faster when things get nested. Benchmarks will
be added as the interval_bakeoff project moves along.