pub struct LexicalCandidate<I> { /* private fields */ }Expand description
One ranked lexical candidate. BM25 is higher-is-better.
Implementations§
Trait Implementations§
Source§impl<I: Clone> Clone for LexicalCandidate<I>
impl<I: Clone> Clone for LexicalCandidate<I>
Source§impl<I: Debug> Debug for LexicalCandidate<I>
impl<I: Debug> Debug for LexicalCandidate<I>
Source§impl<I: PartialEq> PartialEq for LexicalCandidate<I>
impl<I: PartialEq> PartialEq for LexicalCandidate<I>
impl<I: PartialEq> StructuralPartialEq for LexicalCandidate<I>
Auto Trait Implementations§
impl<I> Freeze for LexicalCandidate<I>where
I: Freeze,
impl<I> RefUnwindSafe for LexicalCandidate<I>where
I: RefUnwindSafe,
impl<I> Send for LexicalCandidate<I>where
I: Send,
impl<I> Sync for LexicalCandidate<I>where
I: Sync,
impl<I> Unpin for LexicalCandidate<I>where
I: Unpin,
impl<I> UnsafeUnpin for LexicalCandidate<I>where
I: UnsafeUnpin,
impl<I> UnwindSafe for LexicalCandidate<I>where
I: UnwindSafe,
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