ari 0.0.6

ari. the extras library.
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131

// :: collection macros.

// a helper macro that returns the number of items passed to it.
#[macro_export]
macro_rules! _ari_item_count {
    (=a $($x: tt)*) => (
        ()
    );

    ($($items: expr),*) => (
        <[()]>::len(&[
            $(
                $crate::_ari_item_count![=a $items]
            ), *
        ])
    );
}

/// creates a `HashMap` containing the specified entries.
///
/// # examples.
///
/// ```
/// # use ari::hash_map;
///
/// let map = hash_map![
///     "key_1" => "value_1",
///     "key_2" => "value_2",
/// ];
///
/// assert_eq!(map["key_1"], "value_1");
/// assert_eq!(map["key_2"], "value_2");
/// ```
#[macro_export]
macro_rules! hash_map {
    ($($key: expr => $value: expr),* $(,)*) => ({
        let count      = $crate::_ari_item_count!($($key), *);
        let mut object = ::std::collections::HashMap::with_capacity(count);

        $(
            object.insert($key, $value);
        )*

        object
    });
}

/// creates a `BTreeMap` containing the specified entries.
///
/// # examples.
///
/// ```
/// # use ari::btree_map;
///
/// let map = btree_map![
///     "key_1" => "value_1",
///     "key_2" => "value_2",
/// ];
///
/// assert_eq!(map["key_1"], "value_1");
/// assert_eq!(map["key_2"], "value_2");
/// ```
#[macro_export]
macro_rules! btree_map {
    ($($key: expr => $value: expr),* $(,)*) => ({
        let mut object = ::std::collections::BTreeMap::new();

        $(
            object.insert($key, $value);
        )*

        object
    });
}

/// creates a `HashSet` containing the specified values.
///
/// # examples.
///
/// ```
/// # use ari::hash_set;
///
/// let map = hash_set![1, 2, 3, 4];
///
/// assert_eq!(map.contains(&1), true);
/// assert_eq!(map.contains(&2), true);
/// assert_eq!(map.contains(&3), true);
/// assert_eq!(map.contains(&4), true);
/// assert_eq!(map.contains(&5), false);
/// ```
#[macro_export]
macro_rules! hash_set {
    ($($key: expr),* $(,)*) => ({
        let count      = $crate::_ari_item_count!($($key), *);
        let mut object = ::std::collections::HashSet::with_capacity(count);

        $(
            object.insert($key);
        )*

        object
    });
}

/// creates a `BTreeSet` containing the specified values.
///
/// # examples.
///
/// ```
/// # use ari::btree_set;
///
/// let map = btree_set![1, 2, 3, 4];
///
/// assert_eq!(map.contains(&1), true);
/// assert_eq!(map.contains(&2), true);
/// assert_eq!(map.contains(&3), true);
/// assert_eq!(map.contains(&4), true);
/// assert_eq!(map.contains(&5), false);
/// ```
#[macro_export]
macro_rules! btree_set {
    ($($key: expr),* $(,)*) => ({
        let mut object = ::std::collections::BTreeSet::new();

        $(
            object.insert($key);
        )*

        object
    });
}