| Package | Description |
|---|---|
| com.vesoft.nebula.storage |
| Modifier and Type | Field and Description |
|---|---|
AddVerticesRequest |
GraphStorageService.addVertices_args.req |
| Modifier and Type | Method and Description |
|---|---|
AddVerticesRequest |
AddVerticesRequest.Builder.build() |
AddVerticesRequest |
AddVerticesRequest.deepCopy() |
AddVerticesRequest |
GraphStorageService.addVertices_args.getReq() |
AddVerticesRequest |
AddVerticesRequest.setCommon(RequestCommon common) |
AddVerticesRequest |
AddVerticesRequest.setIf_not_exists(boolean if_not_exists) |
AddVerticesRequest |
AddVerticesRequest.setIgnore_existed_index(boolean ignore_existed_index) |
AddVerticesRequest |
AddVerticesRequest.setParts(Map<Integer,List<NewVertex>> parts) |
AddVerticesRequest |
AddVerticesRequest.setProp_names(Map<Integer,List<byte[]>> prop_names) |
AddVerticesRequest |
AddVerticesRequest.setSpace_id(int space_id) |
| Modifier and Type | Method and Description |
|---|---|
ExecResponse |
GraphStorageService.Iface.addVertices(AddVerticesRequest req) |
ExecResponse |
GraphStorageService.Client.addVertices(AddVerticesRequest req) |
void |
GraphStorageService.AsyncIface.addVertices(AddVerticesRequest req,
com.facebook.thrift.async.AsyncMethodCallback resultHandler) |
void |
GraphStorageService.AsyncClient.addVertices(AddVerticesRequest req,
com.facebook.thrift.async.AsyncMethodCallback resultHandler352) |
void |
GraphStorageService.Client.send_addVertices(AddVerticesRequest req) |
GraphStorageService.addVertices_args |
GraphStorageService.addVertices_args.setReq(AddVerticesRequest req) |
| Constructor and Description |
|---|
addVertices_args(AddVerticesRequest req) |
addVertices_call(AddVerticesRequest req,
com.facebook.thrift.async.AsyncMethodCallback resultHandler353,
com.facebook.thrift.async.TAsyncClient client349,
com.facebook.thrift.protocol.TProtocolFactory protocolFactory350,
com.facebook.thrift.transport.TNonblockingTransport transport351) |
AddVerticesRequest(AddVerticesRequest other)
Performs a deep copy on other.
|
Copyright © 2022. All rights reserved.