sparse_set
| Crates.io | sparse_set |
| lib.rs | sparse_set |
| version | 0.8.2 |
| source | src |
| created_at | 2022-07-04 13:21:28.218511 |
| updated_at | 2023-07-27 18:13:31.999392 |
| description | Implementation of the sparse set data structure |
| homepage | |
| repository | https://github.com/sgodwincs/sparse_set |
| max_upload_size | |
| id | 618962 |
| size | 158,619 |
Scott Godwin (sgodwincs)
documentation
README
Sparse Set
This crate is a sparse set implementation.
This won't go into detail on what it is, but instead I'll recommend reading https://research.swtch.com/sparse for a nice, succinct description.
One thing to note is that a separate buffer is used to store the actual indices. This makes a tradeoff between value insertion/removal and iteration speed.
Nightly is required and I have no motivation to change it as I use this crate for other projects on nightly.
License
Licensed under either of
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Contribution
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.
See CONTRIBUTING.md.