()
| 4334 | |
| 4335 | #[test] |
| 4336 | fn mixed_empty_and_conflicting() { |
| 4337 | let m1 = HashMap::from([("key".into(), "a".into())]); |
| 4338 | let m2 = HashMap::new(); |
| 4339 | let m3 = HashMap::from([("key".into(), "b".into())]); |
| 4340 | let result = intersect_metadata_for_union([&m1, &m2, &m3]); |
| 4341 | // m2 is skipped; m1 and m3 conflict → dropped |
| 4342 | assert!(result.is_empty()); |
| 4343 | } |
| 4344 | |
| 4345 | #[test] |
| 4346 | fn no_inputs() { |
nothing calls this directly
no test coverage detected
searching dependent graphs…