2 releases

Uses old Rust 2015

0.1.1 Nov 6, 2017
0.1.0 Aug 29, 2017

#2417 in Data structures

Download history 37/week @ 2024-11-23 43/week @ 2024-11-30 51/week @ 2024-12-07 344/week @ 2024-12-14 303/week @ 2024-12-21 163/week @ 2024-12-28 428/week @ 2025-01-04 232/week @ 2025-01-11 867/week @ 2025-01-18 780/week @ 2025-01-25 579/week @ 2025-02-01 934/week @ 2025-02-08 785/week @ 2025-02-15 1023/week @ 2025-02-22 937/week @ 2025-03-01 811/week @ 2025-03-08

3,799 downloads per month
Used in 10 crates (3 directly)

MIT/Apache

9KB
177 lines

any_key

Documentation Crates.io Travis CI Build Status

Documentation for the master branch

Dynamically typed keys for associative arrays.


lib.rs:

Dynamically typed keys for associative arrays.

Example

use std::collections::{BTreeMap, HashMap};
use any_key::{AnyHash, AnyOrd};

#[derive(PartialEq, Eq, Hash, PartialOrd, Ord)]
struct Foo;

// AnyHash can be used as a key for HashMap-like types
let mut map = HashMap::new();
map.insert(Box::new("hello") as Box<AnyHash>, 1);
map.insert(Box::new(42) as Box<AnyHash>, 2);
map.insert(Box::new(Foo) as Box<AnyHash>, 3);
assert_eq!(map.get(&(Box::new("hello") as Box<AnyHash>)), Some(&1));
assert_eq!(map.get(&(Box::new(42) as Box<AnyHash>)), Some(&2));
assert_eq!(map.get(&(Box::new(Foo) as Box<AnyHash>)), Some(&3));

// AnyOrd can be used as a key for HashMap-like types
let mut map = BTreeMap::new();
map.insert(Box::new("hello") as Box<AnyOrd>, 1);
map.insert(Box::new(42) as Box<AnyOrd>, 2);
map.insert(Box::new(Foo) as Box<AnyOrd>, 3);
assert_eq!(map.get(&(Box::new("hello") as Box<AnyOrd>)), Some(&1));
assert_eq!(map.get(&(Box::new(42) as Box<AnyOrd>)), Some(&2));
assert_eq!(map.get(&(Box::new(Foo) as Box<AnyOrd>)), Some(&3));

Dependencies

~33KB