pub struct RaBitQRerank { /* private fields */ }Expand description
Object-safe RerankCodec wrapper around RaBitQCodec.
The codec starts untrained. encode and prepare_query return
RerankError::NotTrained until train() has been called with a
representative sample of vectors.
from_codec accepts a pre-calibrated RaBitQCodec (used when restoring
from a snapshot).
Implementations§
Source§impl RaBitQRerank
impl RaBitQRerank
Sourcepub fn new(dim: usize, rotation_seed: u64) -> Self
pub fn new(dim: usize, rotation_seed: u64) -> Self
Construct an untrained wrapper.
encode / distance_prepared return RerankError::NotTrained until
train() is called.
Sourcepub fn from_codec(codec: RaBitQCodec) -> Self
pub fn from_codec(codec: RaBitQCodec) -> Self
Construct from a pre-calibrated codec (used when restoring from snapshot).
Trait Implementations§
Source§impl RerankCodec for RaBitQRerank
impl RerankCodec for RaBitQRerank
Source§fn encode(&self, v: &[f32]) -> Result<Vec<u8>, RerankError>
fn encode(&self, v: &[f32]) -> Result<Vec<u8>, RerankError>
Encode a full-precision vector to RaBitQ 1-bit bytes.
The serialised form is the raw UnifiedQuantizedVector buffer
(as_bytes()): 32-byte QuantHeader followed by dim.div_ceil(8)
sign-packed bits.
Source§fn prepare_query(&self, q: &[f32]) -> Result<PreparedQuery, RerankError>
fn prepare_query(&self, q: &[f32]) -> Result<PreparedQuery, RerankError>
Prepare the query by computing its centroid-subtracted, rotated sign pack and the exact query norm.
The prepared form is PreparedQuery::Bytes with the layout:
4 bytes query_norm (f32 LE) || sign bytes (dim.div_ceil(8)).
Source§fn distance_prepared(
&self,
prepared: &PreparedQuery,
encoded: &[u8],
) -> Result<f32, RerankError>
fn distance_prepared( &self, prepared: &PreparedQuery, encoded: &[u8], ) -> Result<f32, RerankError>
Compute asymmetric Hamming-based L2 distance from a prepared query to a RaBitQ-encoded candidate.
Inlines RaBitQCodec::exact_asymmetric_distance (without bias_correct)
using UnifiedQuantizedVectorRef to avoid a redundant allocation:
approx = q_norm² + v_norm² − 2·q_norm·v_norm·(1 − 2·hamming/dim)
Expects PreparedQuery::Bytes produced by prepare_query.
Auto Trait Implementations§
impl Freeze for RaBitQRerank
impl RefUnwindSafe for RaBitQRerank
impl Send for RaBitQRerank
impl Sync for RaBitQRerank
impl Unpin for RaBitQRerank
impl UnsafeUnpin for RaBitQRerank
impl UnwindSafe for RaBitQRerank
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out indicating that a T is niched.impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.