Method from_hashes

atomic-core/src/change/format_v3/hash_table.rs:217–233

Reconstruct a dedup table from a list of hashes (read from a file). The first hash in the list is assumed to be the change's own hash (index 0). The order of hashes in the vector determines their indices. # Arguments `hashes` - Ordered list of 32-byte hashes as read from the file. # Errors - [`FormatError::HashTableFull`] if there are more than [`MAX_HASH_TABLE_ENTRIES`] hashes. - [`FormatErr

(hashes: Vec<[u8; 32]>)

    /// assert_eq!(table.resolve(1).unwrap(), &h1);
    /// ```
    pub fn from_hashes(hashes: Vec<[u8; 32]>) -> FormatResult<Self> {
        if hashes.len() > MAX_HASH_TABLE_ENTRIES {
            return Err(FormatError::HashTableFull);
        }

        let mut index_map = HashMap::with_capacity(hashes.len());
        for (i, hash) in hashes.iter().enumerate() {
            let index = i as HashIndex;
            if index_map.insert(*hash, index).is_some() {
                return Err(FormatError::InvalidHeader {
                    reason: format!("duplicate hash in dedup table at index {}", i),
                });
            }
        }

        Ok(Self { hashes, index_map })
    }

    /// Insert a hash into the table, returning its index.
    ///