prefix_array
| Crates.io | prefix_array |
| lib.rs | prefix_array |
| version | 0.3.2 |
| source | src |
| created_at | 2023-03-14 05:58:08.70721 |
| updated_at | 2023-10-16 03:25:51.65263 |
| description | A generic container for searching on prefixes of keys |
| homepage | https://github.com/ultrabear/prefix_array_rs |
| repository | https://github.com/ultrabear/prefix_array_rs |
| max_upload_size | |
| id | 809543 |
| size | 84,808 |
Alex H (ultrabear)
documentation
README
prefix_array
This crate provides the PrefixArray and PrefixArraySet datastructures that implement some Map-like and Set-like interfaces, while also being capable of querying data based on what it starts with (its prefix).
prefix_array boasts zero memory overhead, log n searching, and searching on subsets of the main array. This crate also has the advantage of cache locality over a tree type datastructure.
no_std Support
This crate is no_std capable, but has the std feature enabled by default (currently this adds From impls for HashMap and HashSet).
License
This crate is licensed under MPL-2.0 (less common for rust crates), broadly this implies that you may use this crate in a closed source project, and statically link it, but any modifications to the crate itself must be made public. This is not legal advice.