public static interface LocalSearchStatistics.LocalSearchOperatorStatisticsOrBuilder
extends com.google.protobuf.MessageOrBuilder
Modifier and Type | Method and Description |
---|---|
double |
getAcceptNeighborDurationSeconds()
Time spent in accepting a neighbor (restoration and storage, not
including filtering).
|
double |
getDurationSeconds()
Time spent in the operator.
|
java.lang.String |
getLocalSearchOperator()
Name of the operator.
|
com.google.protobuf.ByteString |
getLocalSearchOperatorBytes()
Name of the operator.
|
double |
getMakeNextNeighborDurationSeconds()
Time spent in creating neighbors (calling MakeNextNeighbor).
|
long |
getNumAcceptedNeighbors()
Number of neighbors eventually accepted.
|
long |
getNumFilteredNeighbors()
Number of neighbors which were filtered.
|
long |
getNumNeighbors()
Number of neighbors generated by the operator.
|
findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
java.lang.String getLocalSearchOperator()
Name of the operator.
string local_search_operator = 1;
com.google.protobuf.ByteString getLocalSearchOperatorBytes()
Name of the operator.
string local_search_operator = 1;
long getNumNeighbors()
Number of neighbors generated by the operator.
int64 num_neighbors = 2;
long getNumFilteredNeighbors()
Number of neighbors which were filtered.
int64 num_filtered_neighbors = 3;
long getNumAcceptedNeighbors()
Number of neighbors eventually accepted.
int64 num_accepted_neighbors = 4;
double getDurationSeconds()
Time spent in the operator.
double duration_seconds = 5;
double getMakeNextNeighborDurationSeconds()
Time spent in creating neighbors (calling MakeNextNeighbor).
double make_next_neighbor_duration_seconds = 6;
double getAcceptNeighborDurationSeconds()
Time spent in accepting a neighbor (restoration and storage, not including filtering).
double accept_neighbor_duration_seconds = 7;
Copyright © 2025. All rights reserved.