pub struct EmbeddingState {
pub input_hash: Option<String>,
pub vector_epoch: Option<i64>,
}Expand description
What a store holds of one node’s vector, for the coordinator’s skip
decision. Two facts, because both are needed: a vector is worth keeping
only if it was made from the node’s current text (input_hash) and is
rankable under the current space (vector_epoch).
Fields§
§input_hash: Option<String>Hash of the text the stored vector was made from, when a vector is stored; the hash of the current input otherwise.
vector_epoch: Option<i64>The epoch the stored vector is current under. None when there is no
vector, or when it is stale.
Trait Implementations§
Source§impl Clone for EmbeddingState
impl Clone for EmbeddingState
Source§impl Debug for EmbeddingState
impl Debug for EmbeddingState
impl Eq for EmbeddingState
Source§impl PartialEq for EmbeddingState
impl PartialEq for EmbeddingState
impl StructuralPartialEq for EmbeddingState
Auto Trait Implementations§
impl Freeze for EmbeddingState
impl RefUnwindSafe for EmbeddingState
impl Send for EmbeddingState
impl Sync for EmbeddingState
impl Unpin for EmbeddingState
impl UnsafeUnpin for EmbeddingState
impl UnwindSafe for EmbeddingState
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§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.