#[repr(u16)]pub enum VShardMessageType {
Show 46 variants
SegmentChunk = 1,
SegmentComplete = 2,
WalTail = 3,
RoutingUpdate = 4,
RoutingAck = 5,
GhostCreate = 10,
GhostDelete = 11,
GhostVerifyRequest = 12,
GhostVerifyResponse = 13,
MigrationBaseCopy = 20,
GsiForward = 22,
EdgeValidation = 23,
GraphAlgoSuperstep = 30,
GraphAlgoContributions = 31,
GraphAlgoSuperstepAck = 32,
GraphAlgoComplete = 33,
TsScatterRequest = 40,
TsScatterResponse = 41,
TsRetentionCommand = 42,
TsRetentionAck = 43,
TsArchiveCommand = 44,
TsArchiveAck = 45,
VectorScatterRequest = 50,
VectorScatterResponse = 51,
VectorCoarseRouteRequest = 52,
VectorCoarseRouteResponse = 53,
VectorBuildExchangeRequest = 54,
VectorBuildExchangeResponse = 55,
VectorMemRegionRequest = 56,
VectorMemRegionResponse = 57,
SpatialScatterRequest = 60,
SpatialScatterResponse = 61,
CrossShardEvent = 70,
CrossShardEventAck = 71,
NotifyBroadcast = 72,
NotifyBroadcastAck = 73,
ArrayShardSliceReq = 80,
ArrayShardSliceResp = 81,
ArrayShardAggReq = 82,
ArrayShardAggResp = 83,
ArrayShardPutReq = 84,
ArrayShardPutResp = 85,
ArrayShardDeleteReq = 86,
ArrayShardDeleteResp = 87,
ArrayShardSurrogateBitmapReq = 88,
ArrayShardSurrogateBitmapResp = 89,
}Expand description
Message types for vShard wire protocol.
Variants§
SegmentChunk = 1
Phase 1: Segment file chunk during base copy.
SegmentComplete = 2
Phase 1: Segment transfer complete marker.
WalTail = 3
Phase 2: WAL tail entries for catch-up.
RoutingUpdate = 4
Phase 3: Routing table update (atomic cut-over).
RoutingAck = 5
Routing table acknowledgement.
GhostCreate = 10
Ghost stub creation notification.
GhostDelete = 11
Ghost stub deletion notification.
GhostVerifyRequest = 12
Anti-entropy sweep query.
GhostVerifyResponse = 13
Anti-entropy sweep response.
MigrationBaseCopy = 20
Migration base-copy segment data.
GsiForward = 22
GSI forward entry.
EdgeValidation = 23
Edge validation request.
GraphAlgoSuperstep = 30
Superstep barrier: coordinator tells all shards to begin iteration N.
GraphAlgoContributions = 31
Boundary vertex contributions: shard sends rank contributions for vertices owned by the target shard (scatter phase).
GraphAlgoSuperstepAck = 32
Superstep complete: shard reports local convergence delta and vertex count to coordinator (gather phase).
GraphAlgoComplete = 33
Algorithm complete: coordinator broadcasts final signal with global convergence status.
TsScatterRequest = 40
Scatter: coordinator sends aggregation query to a shard.
TsScatterResponse = 41
Gather: shard responds with partial aggregates.
TsRetentionCommand = 42
Coordinator broadcasts retention command to all shards.
TsRetentionAck = 43
Shard acknowledges retention execution.
TsArchiveCommand = 44
S3 archival command: coordinator tells shard to archive partitions.
TsArchiveAck = 45
S3 archival acknowledgement.
VectorScatterRequest = 50
Scatter: coordinator sends k-NN query to a shard.
VectorScatterResponse = 51
Gather: shard responds with local top-K hits.
VectorCoarseRouteRequest = 52
Phase 1 request: coordinator asks a shard for its coarse routing
descriptor (learned coarse codes, centroid summary, or equivalent).
The shard responds with VectorCoarseRouteResponse before the
coordinator selects the shard subset for the fine search phase.
VectorCoarseRouteResponse = 53
Phase 1 response: shard returns its coarse routing descriptor so the coordinator can decide whether to include it in phase 2.
VectorBuildExchangeRequest = 54
Build-time request: a shard sends its IVF centroid table to a peer so the peer can build cross-shard centroid knowledge. Sent shard-to-shard without coordinator involvement.
VectorBuildExchangeResponse = 55
Build-time response: receiving shard acknowledges and optionally echoes its own centroid summary back to the sender.
VectorMemRegionRequest = 56
Registration request: a shard asks a peer to expose a named memory
region (e.g. a pinned HNSW graph segment) for one-sided reads.
The peer responds with VectorMemRegionInfo containing the address
and rkey, or indicates the region is unavailable.
VectorMemRegionResponse = 57
Registration response: peer returns address/rkey for the requested
memory region, or available = false when not supported.
SpatialScatterRequest = 60
Scatter: coordinator sends spatial predicate query to a shard.
SpatialScatterResponse = 61
Gather: shard responds with matching document IDs.
CrossShardEvent = 70
Cross-shard event write request (trigger DML, CDC, etc.).
CrossShardEventAck = 71
Acknowledgement for a cross-shard event write.
NotifyBroadcast = 72
Broadcast NOTIFY message to all peers (LISTEN/NOTIFY cluster-wide).
NotifyBroadcastAck = 73
Acknowledgement for a NOTIFY broadcast.
ArrayShardSliceReq = 80
Scatter: coordinator sends a coord-range slice query to a shard.
ArrayShardSliceResp = 81
Gather: shard responds with matching row bytes.
ArrayShardAggReq = 82
Scatter: coordinator sends an aggregate query to a shard.
ArrayShardAggResp = 83
Gather: shard responds with partial aggregate(s).
ArrayShardPutReq = 84
Coordinator forwards a cell write batch to the owning shard.
ArrayShardPutResp = 85
Shard acknowledges a cell write batch.
ArrayShardDeleteReq = 86
Coordinator forwards a coord-based delete to the owning shard.
ArrayShardDeleteResp = 87
Shard acknowledges a coord-based delete.
ArrayShardSurrogateBitmapReq = 88
Scatter: coordinator requests a surrogate bitmap scan from a shard.
ArrayShardSurrogateBitmapResp = 89
Gather: shard returns the surrogate bitmap for matching cells.
Trait Implementations§
Source§impl Clone for VShardMessageType
impl Clone for VShardMessageType
Source§fn clone(&self) -> VShardMessageType
fn clone(&self) -> VShardMessageType
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for VShardMessageType
impl Debug for VShardMessageType
Source§impl<'de> Deserialize<'de> for VShardMessageType
impl<'de> Deserialize<'de> for VShardMessageType
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Source§impl PartialEq for VShardMessageType
impl PartialEq for VShardMessageType
Source§fn eq(&self, other: &VShardMessageType) -> bool
fn eq(&self, other: &VShardMessageType) -> bool
self and other values to be equal, and is used by ==.Source§impl Serialize for VShardMessageType
impl Serialize for VShardMessageType
impl Copy for VShardMessageType
impl Eq for VShardMessageType
impl StructuralPartialEq for VShardMessageType
Auto Trait Implementations§
impl Freeze for VShardMessageType
impl RefUnwindSafe for VShardMessageType
impl Send for VShardMessageType
impl Sync for VShardMessageType
impl Unpin for VShardMessageType
impl UnsafeUnpin for VShardMessageType
impl UnwindSafe for VShardMessageType
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<'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
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§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.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.