hashindexed
| Crates.io | hashindexed |
| lib.rs | hashindexed |
| version | 0.1.1 |
| source | src |
| created_at | 2015-10-21 15:12:45.443973 |
| updated_at | 2016-05-10 10:46:26.27581 |
| description | A cache. A set which compares elements in a customisable way without overriding the eq() and hash() functions on the type itself. |
| homepage | https://github.com/dhardy/hashindexed |
| repository | https://github.com/dhardy/hashindexed |
| max_upload_size | |
| id | 3278 |
| size | 22,914 |
Diggory Hardy (dhardy)
documentation
README
Hash-indexed collection
You could call this a cache, or a kind of set. It is a simple wrapper around
HashSet to allow values of type T to be stored in a set indexed by some
type K, where values of type K can be somehow "extracted" from those of
type T.
Check documentation on type HashIndexed for usage.
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.