Extends the map with entries and then clears it, asserting correct behavior before and after.
(map: &mut Map<N, M>, entries: &HashSet<(K, V)>)
| 240 | /// Extends the map with entries and then clears it, |
| 241 | /// asserting correct behavior before and after. |
| 242 | fn extend_clear<const N: usize, const M: usize>(map: &mut Map<N, M>, entries: &HashSet<(K, V)>) { |
| 243 | map.extend(entries.iter().cloned()); |
| 244 | assert_not_empty(map, entries.len()); |
| 245 | |
| 246 | map.clear(); |
| 247 | assert_empty(map, &0, 0); |
| 248 | } |
| 249 | |
| 250 | /// Asserts that the map contains `key` with value `val`. |
| 251 | fn assert_key_eq<const N: usize, const M: usize>(map: &mut Map<N, M>, key: K, mut val: V) { |
nothing calls this directly
no test coverage detected
searching dependent graphs…