| Package | Description |
|---|---|
| com.vesoft.nebula.storage |
| Modifier and Type | Field and Description |
|---|---|
LookupIndexRequest |
GraphStorageService.lookupIndex_args.req |
| Modifier and Type | Method and Description |
|---|---|
LookupIndexRequest |
LookupIndexRequest.Builder.build() |
LookupIndexRequest |
LookupIndexRequest.deepCopy() |
LookupIndexRequest |
GraphStorageService.lookupIndex_args.getReq() |
LookupIndexRequest |
LookupIndexRequest.setCommon(RequestCommon common) |
LookupIndexRequest |
LookupIndexRequest.setIndices(IndexSpec indices) |
LookupIndexRequest |
LookupIndexRequest.setLimit(long limit) |
LookupIndexRequest |
LookupIndexRequest.setOrder_by(List<OrderBy> order_by) |
LookupIndexRequest |
LookupIndexRequest.setParts(List<Integer> parts) |
LookupIndexRequest |
LookupIndexRequest.setReturn_columns(List<byte[]> return_columns) |
LookupIndexRequest |
LookupIndexRequest.setSpace_id(int space_id) |
| Modifier and Type | Method and Description |
|---|---|
LookupIndexResp |
GraphStorageService.Iface.lookupIndex(LookupIndexRequest req) |
LookupIndexResp |
GraphStorageService.Client.lookupIndex(LookupIndexRequest req) |
void |
GraphStorageService.AsyncIface.lookupIndex(LookupIndexRequest req,
com.facebook.thrift.async.AsyncMethodCallback resultHandler) |
void |
GraphStorageService.AsyncClient.lookupIndex(LookupIndexRequest req,
com.facebook.thrift.async.AsyncMethodCallback resultHandler402) |
void |
GraphStorageService.Client.send_lookupIndex(LookupIndexRequest req) |
GraphStorageService.lookupIndex_args |
GraphStorageService.lookupIndex_args.setReq(LookupIndexRequest req) |
| Constructor and Description |
|---|
lookupIndex_args(LookupIndexRequest req) |
lookupIndex_call(LookupIndexRequest req,
com.facebook.thrift.async.AsyncMethodCallback resultHandler403,
com.facebook.thrift.async.TAsyncClient client399,
com.facebook.thrift.protocol.TProtocolFactory protocolFactory400,
com.facebook.thrift.transport.TNonblockingTransport transport401) |
LookupIndexRequest(LookupIndexRequest other)
Performs a deep copy on other.
|
Copyright © 2022. All rights reserved.