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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
use crate::entries::Entry;
use std::collections::HashMap;
/// Constructs a `HashMap` from a slice of `Entry` structs.
///
/// Iterates over each `Entry` in the provided slice and inserts them into a new `HashMap`.
/// If duplicate keys are present, the value from the last `Entry` with that key will be used.
///
/// # Arguments
/// * `entries` - A slice of `Entry` structs to convert into a `HashMap`.
///
/// # Returns
/// * `HashMap<K, V>` - A new `HashMap` containing all key-value pairs from the `entries` slice.
///
/// # Examples
/// ```rust
/// use lowdash::{Entry, from_entries};
/// use std::collections::HashMap;
///
/// let entries = vec![
/// Entry { key: "a", value: 1 },
/// Entry { key: "b", value: 2 },
/// ];
///
/// let result = from_entries(&entries);
/// let mut expected = HashMap::new();
/// expected.insert("a", 1);
/// expected.insert("b", 2);
///
/// assert_eq!(result.len(), expected.len());
/// for (key, value) in &expected {
/// assert_eq!(result.get(key), Some(value));
/// }
/// ```
pub fn from_entries<K, V>(entries: &[Entry<K, V>]) -> HashMap<K, V>
where
K: Clone + std::cmp::Eq + std::hash::Hash,
V: Clone,
{
let mut map = HashMap::with_capacity(entries.len());
for entry in entries {
map.insert(entry.key.clone(), entry.value.clone());
}
map
}
#[cfg(test)]
mod tests {
use super::*;
use crate::entries::Entry;
#[test]
fn test_from_entries_single_entry() {
let entries = vec![Entry { key: "a", value: 1 }];
let result = from_entries(&entries);
let mut expected = HashMap::new();
expected.insert("a", 1);
assert_eq!(result.len(), expected.len());
for (key, value) in &expected {
assert_eq!(result.get(key), Some(value));
}
assert_eq!(result, expected);
}
#[test]
fn test_from_entries_multiple_entries() {
let entries = vec![
Entry { key: "a", value: 1 },
Entry { key: "b", value: 2 },
Entry { key: "c", value: 3 },
];
let result = from_entries(&entries);
let mut expected = HashMap::new();
expected.insert("a", 1);
expected.insert("b", 2);
expected.insert("c", 3);
assert_eq!(result, expected);
}
#[test]
fn test_from_entries_empty_entries() {
let entries: Vec<Entry<&str, i32>> = vec![];
let result = from_entries(&entries);
let expected: HashMap<&str, i32> = HashMap::new();
assert_eq!(result, expected);
}
#[test]
fn test_from_entries_with_integers() {
let entries = vec![
Entry {
key: 1,
value: "one",
},
Entry {
key: 2,
value: "two",
},
];
let result = from_entries(&entries);
let mut expected = HashMap::new();
expected.insert(1, "one");
expected.insert(2, "two");
assert_eq!(result, expected);
}
#[test]
fn test_from_entries_with_complex_values() {
let entries = vec![
Entry {
key: "a",
value: vec![1, 2, 3],
},
Entry {
key: "b",
value: vec![4, 5],
},
Entry {
key: "c",
value: vec![6],
},
];
let result = from_entries(&entries);
let mut expected: HashMap<&str, Vec<i32>> = HashMap::new();
expected.insert("a", vec![1, 2, 3]);
expected.insert("b", vec![4, 5]);
expected.insert("c", vec![6]);
assert_eq!(result, expected);
}
#[test]
fn test_from_entries_with_duplicate_keys() {
let entries = vec![
Entry { key: "a", value: 1 },
Entry { key: "b", value: 2 },
Entry { key: "a", value: 3 }, // Duplicate key "a"
];
let result = from_entries(&entries);
let mut expected = HashMap::new();
expected.insert("a", 3); // Expect the last value for key "a"
expected.insert("b", 2);
assert_eq!(result, expected);
}
}