Double Map

Like a HashMap, but allows you to use two different keys to the same value/data.

Sometimes during development, it may be necessary to have a data structure like a HashMap but with two different keys referring to the same data.

For example, if you have some data with a unique ID and a name, then you create a structure that contains the name, and store it in a normal HashMap using the unique ID as the key. However, finding the element throughout the name will be performed with O(n) time. The same is true for the reverse case.

This crate tries to resolve this contradiction by providing a DHashMap structure - a map where you can add, look up and remove elements using either the first key of type K1 or the second key of type K2.

Internally, it uses two maps: the first is of type HashMap<K1, (K2, V)> and the second is of type HashMap<K2, K1>. Using two HashMap's inside instead one brings to the performance and memory penalty.

It is recommended to use the first key of type K1 of quick access to the data, because indexing by the second key of type K2 requires two HashMap lookups.

Change log

Current Status

Double Map is in active development. The design goal is implementing the whole HashMap interface. Look at Change log for more information.

Methods

• new: Done since v0.1.0
• with_capacity: Done since v0.1.0
• with_hasher: Done since v0.1.0
• with_capacity_and_hasher: Done since v0.1.0
• capacity: Done since v0.1.0
• keys: Done since v0.6.0
• into_keys: Done since v0.12.0
• values: Done since v0.6.0
• values_mut: Done since v0.6.0
• into_values: Done since v0.12.0
• iter: Done since v0.4.0
• iter_mut: Done since v0.5.0
• len: Done since v0.1.0
• is_empty: Done since v0.1.0
• drain: Done since v0.10.0
• drain_filter: Under development
• retain: Under development
• clear: Done since v0.1.0
• hasher: Done since v0.1.0
• reserve: Done since v0.1.0
• try_reserve: Done since v0.1.0
• shrink_to_fit: Done since v0.1.0
• shrink_to: Done since v0.1.0
• entry: Done since v0.1.0
• get: Done since v0.1.0 and v0.8.0 (get_key1, get_key2, get_keys methods)
• get_key_value: Done since v0.8.0 (get_key1_value, get_key2_value, get_keys_value methods)
• contains_key: Done since v0.7.0 (contains_key1, contains_key2 and contains_keys methods)
• get_mut: Done since v0.1.0 (get_mut_key1 and get_mut_key2 methods)
• insert: Done since v0.1.0 (insert_unchecked and insert methods)
• try_insert: Done since v0.1.0
• remove: Done since v0.1.0 (remove_key1 and remove_key2 methods)
• remove_entry: Under development
• raw_entry_mut: Under development
• raw_entry: Under development

Trait Implementations

• Clone: Done since v0.1.0
• Debug: Done since v0.9.0
• Default: Done since v0.3.0
• Extend: Done since v0.2.0 (some update in version v0.12.0)
• From: Done since v0.14.0
• FromIterator: Done since v0.2.0
• Index: Done since v0.14.0
• IntoIterator: Done since v0.11.0
• PartialEq: Done since v0.9.0
• Eq: Done since v0.11.0

License

Licensed under Apache License, Version 2.0, (LICENSE or https://www.apache.org/licenses/LICENSE-2.0) 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 licensed as above, without any additional terms or conditions.