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
151
152
153
154
155
156
157
158
use crate::entries;
use crate::entries::Entry;
use std::collections::HashMap;
/// Collects all entries from a map into a vector of `Entry` structs.
///
/// This function is an alias for the `entries` function and provides the same functionality.
/// It exists for semantic clarity in contexts where representing map entries as pairs is more intuitive.
///
/// # Arguments
/// * `map` - The input map from which to collect entries.
///
/// # Returns
/// * `Vec<Entry<K, V>>` - A vector containing all key-value pairs as `Entry` structs.
///
/// # Examples
/// ```rust
/// use lowdash::{Entry, to_pairs};
/// use std::collections::HashMap;
///
/// let mut map = HashMap::new();
/// map.insert("a", 1);
/// map.insert("b", 2);
///
/// let result = to_pairs(&map);
/// let expected = vec![
/// Entry { key: "a", value: 1 },
/// Entry { key: "b", value: 2 },
/// ];
///
/// let mut sorted_result = result.clone();
/// sorted_result.sort_by(|a, b| a.key.cmp(&b.key));
///
/// let mut sorted_expected = expected.clone();
/// sorted_expected.sort_by(|a, b| a.key.cmp(&b.key));
///
/// assert_eq!(sorted_result, sorted_expected);
/// ```
pub fn to_pairs<K, V>(map: &HashMap<K, V>) -> Vec<Entry<K, V>>
where
K: Clone + std::cmp::Eq + std::hash::Hash,
V: Clone,
{
entries::entries(map)
}
#[cfg(test)]
mod tests {
use super::*;
use crate::entries::Entry;
use std::collections::HashMap;
#[test]
fn test_to_pairs_single_entry() {
let mut map = HashMap::new();
map.insert("a", 1);
let result = to_pairs(&map);
let expected = vec![Entry { key: "a", value: 1 }];
assert_eq!(result, expected);
}
#[test]
fn test_to_pairs_multiple_entries() {
let mut map = HashMap::new();
map.insert("a", 1);
map.insert("b", 2);
map.insert("c", 3);
let result = to_pairs(&map);
let expected = vec![
Entry { key: "a", value: 1 },
Entry { key: "b", value: 2 },
Entry { key: "c", value: 3 },
];
// Since HashMap does not guarantee order, sort both vectors before comparison
let mut sorted_result = result.clone();
sorted_result.sort_by(|a, b| a.key.cmp(&b.key));
let mut sorted_expected = expected.clone();
sorted_expected.sort_by(|a, b| a.key.cmp(&b.key));
assert_eq!(sorted_result, sorted_expected);
}
#[test]
fn test_to_pairs_empty_map() {
let map: HashMap<&str, i32> = HashMap::new();
let result = to_pairs(&map);
let expected: Vec<Entry<&str, i32>> = vec![];
assert_eq!(result, expected);
}
#[test]
fn test_to_pairs_with_integers() {
let mut map = HashMap::new();
map.insert(1, "one");
map.insert(2, "two");
let result = to_pairs(&map);
let expected = vec![
Entry {
key: 1,
value: "one",
},
Entry {
key: 2,
value: "two",
},
];
// Sort for comparison
let mut sorted_result = result.clone();
sorted_result.sort_by(|a, b| a.key.cmp(&b.key));
let mut sorted_expected = expected.clone();
sorted_expected.sort_by(|a, b| a.key.cmp(&b.key));
assert_eq!(sorted_result, sorted_expected);
}
#[test]
fn test_to_pairs_with_complex_values() {
let mut map = HashMap::new();
map.insert("a", vec![1, 2, 3]);
map.insert("b", vec![4, 5]);
map.insert("c", vec![6]);
let result = to_pairs(&map);
let expected = vec![
Entry {
key: "a",
value: vec![1, 2, 3],
},
Entry {
key: "b",
value: vec![4, 5],
},
Entry {
key: "c",
value: vec![6],
},
];
// Since HashMap does not guarantee order, sort before comparison
let mut sorted_result = result.clone();
sorted_result.sort_by(|a, b| a.key.cmp(&b.key));
let mut sorted_expected = expected.clone();
sorted_expected.sort_by(|a, b| a.key.cmp(&b.key));
assert_eq!(sorted_result, sorted_expected);
}
}