pub struct VectorScatterGather {
pub source_node: u64,
pub shard_ids: Vec<u32>,
/* private fields */
}Expand description
Scatter-gather coordinator for distributed k-NN vector search.
Fields§
§source_node: u64Source node ID (this coordinator’s node).
shard_ids: Vec<u32>Target shard IDs to fan out to.
Implementations§
Source§impl VectorScatterGather
impl VectorScatterGather
pub fn new(source_node: u64, shard_ids: Vec<u32>) -> Self
Sourcepub fn build_scatter_envelopes(
&self,
collection: &str,
query_vector: &[f32],
top_k: usize,
ef_search: usize,
filter_bitmap: Option<&[u8]>,
) -> Vec<(u32, VShardEnvelope)>
pub fn build_scatter_envelopes( &self, collection: &str, query_vector: &[f32], top_k: usize, ef_search: usize, filter_bitmap: Option<&[u8]>, ) -> Vec<(u32, VShardEnvelope)>
Build scatter envelopes for a k-NN search query.
Returns one VShardEnvelope per shard. Each contains the query
vector + parameters as JSON payload.
Sourcepub fn record_response(&mut self, result: &ShardSearchResult)
pub fn record_response(&mut self, result: &ShardSearchResult)
Record a shard’s response.
Sourcepub fn all_responded(&self) -> bool
pub fn all_responded(&self) -> bool
Whether all shards have responded.
Sourcepub fn merge_top_k(&mut self, top_k: usize) -> Vec<VectorHit>
pub fn merge_top_k(&mut self, top_k: usize) -> Vec<VectorHit>
Merge all shard results and return the global top-K.
Sourcepub fn response_count(&self) -> usize
pub fn response_count(&self) -> usize
Number of shards that have responded.
Auto Trait Implementations§
impl Freeze for VectorScatterGather
impl RefUnwindSafe for VectorScatterGather
impl Send for VectorScatterGather
impl Sync for VectorScatterGather
impl Unpin for VectorScatterGather
impl UnsafeUnpin for VectorScatterGather
impl UnwindSafe for VectorScatterGather
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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> 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>
Returns the layout of the type.
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
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.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.