Struct jupiter::idb::table::IndexEntry

pub struct IndexEntry { /* private fields */ }

Represents an entry in the lookup index.

Basically an entry is either exact (matching the whole field contents) or loose (matching a word / token within a field while comparing case-insensitive). Internally each entry contains the field symbol it points to along with the position (row number) for which is was created.

Trait Implementations

impl PartialEq for IndexEntry

Note that when comparing index entries, we only check if their field and row matches no matter if these are exact or loose.

The idea is that when building the index, we first record all exact matches and then compute the loose ones. Still we want to de-duplicate the index entries, so that for a single match (as in path within the TRIE) a document only occurs once. We do not need two entries for the same word and field (one being loose and one being exact) as all exact matches are also considered valid when performing a loose (IDB.SEARCH) search.

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.