Enum kvarn_search::IndexKind
source · pub enum IndexKind {
Simple,
Lossless,
}
Variants§
Simple
Stores only which documents words appear in. Requires reading each of those documents when getting the occurrences.
Lossless
Stores all the occurrences of all the words.
Much faster than IndexKind::Simple
byt requires more memory.
This is basically like loading the entire website into memory.
Trait Implementations§
source§impl PartialEq<IndexKind> for IndexKind
impl PartialEq<IndexKind> for IndexKind
impl Eq for IndexKind
impl StructuralEq for IndexKind
impl StructuralPartialEq for IndexKind
Auto Trait Implementations§
impl RefUnwindSafe for IndexKind
impl Send for IndexKind
impl Sync for IndexKind
impl Unpin for IndexKind
impl UnwindSafe for IndexKind
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.