| Package | Description |
|---|---|
| com.vesoft.nebula.storage |
| Modifier and Type | Field and Description |
|---|---|
RequestCommon |
ScanEdgeRequest.common |
RequestCommon |
DeleteEdgesRequest.common |
RequestCommon |
GetPropRequest.common |
RequestCommon |
ScanVertexRequest.common |
RequestCommon |
UpdateVertexRequest.common |
RequestCommon |
GetNeighborsRequest.common |
RequestCommon |
LookupIndexRequest.common |
RequestCommon |
DeleteVerticesRequest.common |
RequestCommon |
LookupAndTraverseRequest.common |
RequestCommon |
DeleteTagsRequest.common |
RequestCommon |
UpdateEdgeRequest.common |
RequestCommon |
AddEdgesRequest.common |
RequestCommon |
GetUUIDReq.common |
RequestCommon |
AddVerticesRequest.common |
| Modifier and Type | Method and Description |
|---|---|
RequestCommon |
RequestCommon.Builder.build() |
RequestCommon |
RequestCommon.deepCopy() |
RequestCommon |
ScanEdgeRequest.getCommon() |
RequestCommon |
DeleteEdgesRequest.getCommon() |
RequestCommon |
GetPropRequest.getCommon() |
RequestCommon |
ScanVertexRequest.getCommon() |
RequestCommon |
UpdateVertexRequest.getCommon() |
RequestCommon |
GetNeighborsRequest.getCommon() |
RequestCommon |
LookupIndexRequest.getCommon() |
RequestCommon |
DeleteVerticesRequest.getCommon() |
RequestCommon |
LookupAndTraverseRequest.getCommon() |
RequestCommon |
DeleteTagsRequest.getCommon() |
RequestCommon |
UpdateEdgeRequest.getCommon() |
RequestCommon |
AddEdgesRequest.getCommon() |
RequestCommon |
GetUUIDReq.getCommon() |
RequestCommon |
AddVerticesRequest.getCommon() |
RequestCommon |
RequestCommon.setPlan_id(long plan_id) |
RequestCommon |
RequestCommon.setProfile_detail(boolean profile_detail) |
RequestCommon |
RequestCommon.setSession_id(long session_id) |
| Constructor and Description |
|---|
AddEdgesRequest(int space_id,
Map<Integer,List<NewEdge>> parts,
List<byte[]> prop_names,
boolean if_not_exists,
boolean ignore_existed_index,
RequestCommon common) |
AddVerticesRequest(int space_id,
Map<Integer,List<NewVertex>> parts,
Map<Integer,List<byte[]>> prop_names,
boolean if_not_exists,
boolean ignore_existed_index,
RequestCommon common) |
DeleteEdgesRequest(int space_id,
Map<Integer,List<EdgeKey>> parts,
RequestCommon common) |
DeleteTagsRequest(int space_id,
Map<Integer,List<DelTags>> parts,
RequestCommon common) |
DeleteVerticesRequest(int space_id,
Map<Integer,List<Value>> parts,
RequestCommon common) |
GetNeighborsRequest(int space_id,
List<byte[]> column_names,
Map<Integer,List<Row>> parts,
TraverseSpec traverse_spec,
RequestCommon common) |
GetPropRequest(int space_id,
Map<Integer,List<Row>> parts,
List<VertexProp> vertex_props,
List<EdgeProp> edge_props,
List<Expr> expressions,
boolean dedup,
List<OrderBy> order_by,
long limit,
byte[] filter,
RequestCommon common) |
GetUUIDReq(int space_id,
int part_id,
byte[] name,
RequestCommon common) |
LookupAndTraverseRequest(int space_id,
List<Integer> parts,
IndexSpec indices,
TraverseSpec traverse_spec,
RequestCommon common) |
LookupIndexRequest(int space_id,
List<Integer> parts,
IndexSpec indices,
List<byte[]> return_columns,
RequestCommon common,
long limit,
List<OrderBy> order_by) |
RequestCommon(RequestCommon other)
Performs a deep copy on other.
|
ScanEdgeRequest(int space_id,
Map<Integer,ScanCursor> parts,
List<EdgeProp> return_columns,
long limit,
long start_time,
long end_time,
byte[] filter,
boolean only_latest_version,
boolean enable_read_from_follower,
RequestCommon common) |
ScanVertexRequest(int space_id,
Map<Integer,ScanCursor> parts,
List<VertexProp> return_columns,
long limit,
long start_time,
long end_time,
byte[] filter,
boolean only_latest_version,
boolean enable_read_from_follower,
RequestCommon common) |
UpdateEdgeRequest(int space_id,
int part_id,
EdgeKey edge_key,
List<UpdatedProp> updated_props,
boolean insertable,
List<byte[]> return_props,
byte[] condition,
RequestCommon common) |
UpdateVertexRequest(int space_id,
int part_id,
Value vertex_id,
int tag_id,
List<UpdatedProp> updated_props,
boolean insertable,
List<byte[]> return_props,
byte[] condition,
RequestCommon common) |
Copyright © 2022. All rights reserved.