(len: usize, values: I)
| 158 | } |
| 159 | |
| 160 | fn find_duplicate_value<T, I>(len: usize, values: I) -> Option<T> |
| 161 | where |
| 162 | T: Copy + Eq + Hash, |
| 163 | I: IntoIterator<Item = T>, |
| 164 | { |
| 165 | let mut seen_keys = HashSet::with_capacity(len); |
| 166 | values.into_iter().find(|value| !seen_keys.insert(*value)) |
| 167 | } |
| 168 | |
| 169 | fn validate_unique_keys_generic(array: &dyn Array) -> Result<()> { |
| 170 | let mut seen_keys = HashSet::with_capacity(array.len()); |
no test coverage detected
searching dependent graphs…