Returns an iterator over all (index, hash) pairs in table order. The iterator yields entries in index order (0, 1, 2, ...). # Examples ```rust use atomic_core::change::format_v3::HashDedupTable; let h0 = [0u8; 32]; let h1 = [1u8; 32]; let mut table = HashDedupTable::new(h0); table.insert(h1).unwrap(); let entries: Vec<_> = table.iter().collect(); assert_eq!(entries.len(), 2); assert_eq!(entri
(&self)
| 496 | /// assert_eq!(entries[1], (1u16, &h1)); |
| 497 | /// ``` |
| 498 | pub fn iter(&self) -> impl Iterator<Item = (HashIndex, &[u8; 32])> { |
| 499 | self.hashes |
| 500 | .iter() |
| 501 | .enumerate() |
| 502 | .map(|(i, h)| (i as HashIndex, h)) |
| 503 | } |
| 504 | |
| 505 | /// Returns a slice of all hashes in table order. |
| 506 | /// |
no outgoing calls