#[non_exhaustive]#[repr(u8)]pub enum OpCode {
Show 76 variants
Auth = 1,
Ping = 2,
Status = 3,
PointGet = 16,
PointPut = 17,
PointDelete = 18,
VectorSearch = 19,
RangeScan = 20,
CrdtRead = 21,
CrdtApply = 22,
GraphRagFusion = 23,
AlterCollectionPolicy = 24,
Sql = 32,
Ddl = 33,
Explain = 34,
CopyFrom = 35,
Set = 48,
Show = 49,
Reset = 50,
Begin = 64,
Commit = 65,
Rollback = 66,
GraphHop = 80,
GraphNeighbors = 81,
GraphPath = 82,
GraphSubgraph = 83,
EdgePut = 84,
EdgeDelete = 85,
GraphAlgo = 86,
GraphMatch = 87,
SpatialScan = 25,
TimeseriesScan = 26,
TimeseriesIngest = 27,
TextSearch = 96,
HybridSearch = 97,
VectorBatchInsert = 112,
DocumentBatchInsert = 113,
KvScan = 114,
KvExpire = 115,
KvPersist = 116,
KvGetTtl = 117,
KvBatchGet = 118,
KvBatchPut = 119,
KvFieldGet = 120,
KvFieldSet = 121,
DocumentUpdate = 122,
DocumentScan = 123,
DocumentUpsert = 124,
DocumentBulkUpdate = 125,
DocumentBulkDelete = 126,
VectorInsert = 127,
VectorMultiSearch = 128,
VectorDelete = 129,
ColumnarScan = 130,
ColumnarInsert = 131,
RecursiveScan = 132,
DocumentTruncate = 133,
DocumentEstimateCount = 134,
DocumentInsertSelect = 135,
DocumentRegister = 136,
DocumentDropIndex = 137,
KvRegisterIndex = 138,
KvDropIndex = 139,
KvTruncate = 140,
VectorSetParams = 141,
KvIncr = 142,
KvIncrFloat = 143,
KvCas = 144,
KvGetSet = 145,
KvRegisterSortedIndex = 146,
KvDropSortedIndex = 147,
KvSortedIndexRank = 148,
KvSortedIndexTopK = 149,
KvSortedIndexRange = 150,
KvSortedIndexCount = 151,
KvSortedIndexScore = 152,
}Expand description
Operation codes for the native binary protocol.
Encoded as a single u8 in both the MessagePack frame and JSON frame
(e.g. {"op":3} for Status). The #[serde(try_from = "u8", into = "u8")]
attribute makes JSON encoding consistent with the numeric opcode values.
#[non_exhaustive] — new operation codes may be added as engines grow.
Wire-side unknown-op handling is covered by Unknown(u8);
this attribute adds Rust API hygiene.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
Auth = 1
Ping = 2
Status = 3
Report startup/readiness status. Returns the current startup phase and whether the node is healthy. Does not require authentication.
PointGet = 16
PointPut = 17
PointDelete = 18
VectorSearch = 19
RangeScan = 20
CrdtRead = 21
CrdtApply = 22
GraphRagFusion = 23
AlterCollectionPolicy = 24
Sql = 32
Ddl = 33
Explain = 34
CopyFrom = 35
Set = 48
Show = 49
Reset = 50
Begin = 64
Commit = 65
Rollback = 66
GraphHop = 80
GraphNeighbors = 81
GraphPath = 82
GraphSubgraph = 83
EdgePut = 84
EdgeDelete = 85
GraphAlgo = 86
GraphMatch = 87
SpatialScan = 25
TimeseriesScan = 26
TimeseriesIngest = 27
TextSearch = 96
HybridSearch = 97
VectorBatchInsert = 112
DocumentBatchInsert = 113
KvScan = 114
KvExpire = 115
KvPersist = 116
KvGetTtl = 117
KvBatchGet = 118
KvBatchPut = 119
KvFieldGet = 120
KvFieldSet = 121
DocumentUpdate = 122
DocumentScan = 123
DocumentUpsert = 124
DocumentBulkUpdate = 125
DocumentBulkDelete = 126
VectorInsert = 127
VectorMultiSearch = 128
VectorDelete = 129
ColumnarScan = 130
ColumnarInsert = 131
RecursiveScan = 132
DocumentTruncate = 133
DocumentEstimateCount = 134
DocumentInsertSelect = 135
DocumentRegister = 136
DocumentDropIndex = 137
KvRegisterIndex = 138
KvDropIndex = 139
KvTruncate = 140
VectorSetParams = 141
KvIncr = 142
KvIncrFloat = 143
KvCas = 144
KvGetSet = 145
KvRegisterSortedIndex = 146
KvDropSortedIndex = 147
KvSortedIndexRank = 148
KvSortedIndexTopK = 149
KvSortedIndexRange = 150
KvSortedIndexCount = 151
KvSortedIndexScore = 152
Implementations§
Trait Implementations§
Source§impl<'de> Deserialize<'de> for OpCode
impl<'de> Deserialize<'de> for OpCode
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>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<'__msgpack_de> FromMessagePack<'__msgpack_de> for OpCode
impl<'__msgpack_de> FromMessagePack<'__msgpack_de> for OpCode
Source§impl ToMessagePack for OpCode
impl ToMessagePack for OpCode
impl Copy for OpCode
impl Eq for OpCode
impl StructuralPartialEq for OpCode
Auto Trait Implementations§
impl Freeze for OpCode
impl RefUnwindSafe for OpCode
impl Send for OpCode
impl Sync for OpCode
impl Unpin for OpCode
impl UnsafeUnpin for OpCode
impl UnwindSafe for OpCode
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<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§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.