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§
impl Eq for IndexKind
impl StructuralPartialEq for IndexKind
Auto Trait Implementations§
impl Freeze for IndexKind
impl RefUnwindSafe for IndexKind
impl Send for IndexKind
impl Sync for IndexKind
impl Unpin for IndexKind
impl UnwindSafe for IndexKind
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit)§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more