Struct StemIndex 

pub struct StemIndex {
    pub ambiguous: usize,
    pub keys_in: usize,
    /* private fields */
}

The second, sorted hash index of a table: hashes of the STEMMED key texts (stem_key), each mapped to its entry. A stem two keys of DIFFERENT entries share is ambiguous and is left out (ambiguous); the same stem from several keys of one entry (ромашка аптечная, ромашки аптечной) is one row. Consulted only when the exact index finds nothing.

Fields

ambiguous: usize

Stems dropped because they named more than one entry.

keys_in: usize

Keys the index was built from.

Implementations

impl StemIndex

pub fn from_keys<'a>(keys: impl IntoIterator<Item = (&'a str, u32)>) -> Self

From (normalised key, entry) pairs.

pub fn find(&self, h: u64) -> Option<u32>

The entry of stem hash h (binary search).

pub fn len(&self) -> usize

Stems in the index.

pub fn is_empty(&self) -> bool

Trait Implementations

impl Clone for StemIndex

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for StemIndex

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for StemIndex

fn default() -> Self

Returns the “default value” for a type.

impl Eq for StemIndex

impl PartialEq for StemIndex

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for StemIndex