mphf 0.2.0

An exercise in implementing minimal perfect hash table.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

// Compile-time test: this const ensures the StaticMap is built at compile time
static_map! {
	TEST_MAP: i32, 2; {
		"apple" => 1,
		"banana" => 2,
		"cherry" => 3,
		"date" => 4,
		"elderberry" => 5,
	}
}

#[test]
fn lookup() {
	let map = TEST_MAP.as_ref();
	assert_eq!(map.get("apple"), Some(&1));
	assert_eq!(map.get("banana"), Some(&2));
	assert_eq!(map.get("cherry"), Some(&3));
	assert_eq!(map.get("date"), Some(&4));
	assert_eq!(map.get("elderberry"), Some(&5));
}

#[test]
fn missing_keys() {
	let map = TEST_MAP.as_ref();
	assert_eq!(map.get("fig"), None);
	assert_eq!(map.get("grape"), None);
	assert_eq!(map.get(""), None);
}

#[test]
fn larger() {
	#[derive(Copy, Clone, Debug, PartialEq)]
	enum Keyword { If, Else, While, For, Return, Fn, Let, Const, Struct, Enum }
	static_map!(KEYWORDS: Keyword, 16; {
		"if" => Keyword::If,
		"else" => Keyword::Else,
		"while" => Keyword::While,
		"for" => Keyword::For,
		"return" => Keyword::Return,
		"fn" => Keyword::Fn,
		"let" => Keyword::Let,
		"const" => Keyword::Const,
		"struct" => Keyword::Struct,
		"enum" => Keyword::Enum,
	});

	let keywords = KEYWORDS.as_ref();
	assert_eq!(keywords.get("if"), Some(&Keyword::If));
	assert_eq!(keywords.get("else"), Some(&Keyword::Else));
	assert_eq!(keywords.get("while"), Some(&Keyword::While));
	assert_eq!(keywords.get("for"), Some(&Keyword::For));
	assert_eq!(keywords.get("return"), Some(&Keyword::Return));
	assert_eq!(keywords.get("fn"), Some(&Keyword::Fn));
	assert_eq!(keywords.get("let"), Some(&Keyword::Let));
	assert_eq!(keywords.get("const"), Some(&Keyword::Const));
	assert_eq!(keywords.get("struct"), Some(&Keyword::Struct));
	assert_eq!(keywords.get("enum"), Some(&Keyword::Enum));
	assert_eq!(keywords.get("match"), None);
}