pub struct RaBitQQuery {
pub rotated_signs: Vec<u8>,
pub query_norm: f32,
}Expand description
Prepared query for RaBitQCodec distance computations.
Fields§
§rotated_signs: Vec<u8>Sign-packed rotated query (same bit layout as the stored codes).
query_norm: f32‖q − centroid‖.
Auto Trait Implementations§
impl Freeze for RaBitQQuery
impl RefUnwindSafe for RaBitQQuery
impl Send for RaBitQQuery
impl Sync for RaBitQQuery
impl Unpin for RaBitQQuery
impl UnsafeUnpin for RaBitQQuery
impl UnwindSafe for RaBitQQuery
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<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.