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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
//! HashMap creation utilities.
//!
//!
//! The `map!` macro provides a convenient way to create `HashMap` instances
//! with initial key-value pairs, supporting any types that implement the
//! required traits for HashMap keys and values.
/// A convenience macro for creating `HashMap` instances with initial key-value pairs.
///
/// Requires the `map` feature to be enabled.
///
/// This macro provides two ways to create a `HashMap`:
/// - Create an empty map
/// - Create a map with initial key-value pairs
///
/// # Examples
///
/// ## Creating an empty map
/// ```
/// # use smacro::map;
/// use std::collections::HashMap;
///
/// let empty: HashMap<String, i32> = map![];
/// assert!(empty.is_empty());
/// ```
///
/// ## Creating a map with key-value pairs
/// ```
/// # use smacro::map;
/// let colors = map![
/// "red" => "#FF0000",
/// "green" => "#00FF00",
/// "blue" => "#0000FF"
/// ];
///
/// assert_eq!(colors.len(), 3);
/// assert_eq!(colors["red"], "#FF0000");
/// assert_eq!(colors["green"], "#00FF00");
/// assert_eq!(colors["blue"], "#0000FF");
/// ```
///
/// ## Trailing commas are supported
/// ```
/// # use smacro::map;
/// let scores = map![
/// "Alice" => 95,
/// "Bob" => 87,
/// "Charlie" => 92,
/// ];
///
/// assert_eq!(scores.len(), 3);
/// assert_eq!(scores["Alice"], 95);
/// ```
///
/// ## Works with any types that implement the required traits
/// ```
/// # use smacro::map;
/// let coordinates = map![
/// 1 => (10, 20),
/// 2 => (30, 40),
/// 3 => (50, 60)
/// ];
///
/// assert_eq!(coordinates[&1], (10, 20));
/// assert_eq!(coordinates[&2], (30, 40));
/// ```
///
/// ## Using expressions as keys and values
/// ```
/// # use smacro::map;
/// let x = 5;
/// let calculations = map![
/// x => x * 2,
/// x + 1 => x * 3,
/// x + 2 => x * 4
/// ];
///
/// assert_eq!(calculations[&5], 10);
/// assert_eq!(calculations[&6], 15);
/// assert_eq!(calculations[&7], 20);
/// ```
///
/// # Duplicate Keys
///
/// If duplicate keys are provided, the last value wins (same behavior as `HashMap::insert`):
/// ```
/// # use smacro::map;
/// let overrides = map![
/// "key" => "first",
/// "key" => "second"
/// ];
///
/// assert_eq!(overrides["key"], "second");
/// ```
///
/// # Type Inference
///
/// When creating an empty map, you may need to specify the types explicitly:
/// ```
/// # use smacro::map;
/// use std::collections::HashMap;
///
/// let empty: HashMap<String, i32> = map![];
/// // or
/// let empty = map![] as HashMap<String, i32>;
/// ```
;
=> ;
}