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
60
61
62
63
64
65
/// `Map` is our typical map collection and is an ordered map.
///
/// This is implemented in Rust by using `BTreeMap`.
///
/// Example:
///
/// ```
/// let my_map: Map<i32, i32> = Map::new();
/// ```
///
pub type Map<K,V> = BTreeMap;
/// Create a typical map collection with elements.
///
/// Example:
///
/// ```
/// let x: Map<i32, i32> = map!(
/// 1 => 2,
/// 3 => 4,
/// );
/// assert_eq!(x[1], 2);
/// ```
///
/// OPTIMIZE: add pre-allocation logic.
///