Struct libdonet::hashgen::DCHashGenerator

pub struct DCHashGenerator {
    hash: i32,
    index: u16,
    primes: PrimeNumberGenerator,
}

The following is an excerpt from Panda3D’s source:

We multiply each consecutive integer by the next prime number and add it to the total. This will generate pretty evenly-distributed hash numbers for an arbitrary sequence of integers.

We do recycle the prime number table at some point, just to keep it from growing insanely large, however (and to avoid wasting time computing large prime numbers unnecessarily), and we also truncate the result to the low- order 32 bits.

Fields

hash: i32

index: u16

primes: PrimeNumberGenerator

Implementations

impl DCHashGenerator

pub fn add_int(&mut self, number: i32)

Adds another integer to the hash so far.

pub fn add_blob(&mut self, blob: Vec<u8>)

Adds a blob to the hash, by breaking it down into a sequence of integers.

pub fn add_string(&mut self, string: String)

Adds a string to the hash, by breaking it down into a sequence of integers.

pub const fn get_hash(&self) -> DCFileHash

Trait Implementations

impl Default for DCHashGenerator

fn default() -> DCHashGenerator

Returns the “default value” for a type.