public static interface SpeedTestRequest.PayloadOrBuilder
extends com.google.protobuf.MessageOrBuilder
Modifier and Type | Method and Description |
---|---|
int |
getClusterParallelism()
optional uint32 clusterParallelism = 3; |
String |
getDataSize()
optional string dataSize = 5; |
com.google.protobuf.ByteString |
getDataSizeBytes()
optional string dataSize = 5; |
String |
getMountPoint()
optional string mountPoint = 1; |
com.google.protobuf.ByteString |
getMountPointBytes()
optional string mountPoint = 1; |
int |
getNodeParallelism()
optional uint32 nodeParallelism = 4; |
String |
getPath()
optional string path = 2; |
com.google.protobuf.ByteString |
getPathBytes()
optional string path = 2; |
boolean |
hasClusterParallelism()
optional uint32 clusterParallelism = 3; |
boolean |
hasDataSize()
optional string dataSize = 5; |
boolean |
hasMountPoint()
optional string mountPoint = 1; |
boolean |
hasNodeParallelism()
optional uint32 nodeParallelism = 4; |
boolean |
hasPath()
optional string path = 2; |
findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
boolean hasMountPoint()
optional string mountPoint = 1;
String getMountPoint()
optional string mountPoint = 1;
com.google.protobuf.ByteString getMountPointBytes()
optional string mountPoint = 1;
boolean hasPath()
optional string path = 2;
String getPath()
optional string path = 2;
com.google.protobuf.ByteString getPathBytes()
optional string path = 2;
boolean hasClusterParallelism()
optional uint32 clusterParallelism = 3;
int getClusterParallelism()
optional uint32 clusterParallelism = 3;
boolean hasNodeParallelism()
optional uint32 nodeParallelism = 4;
int getNodeParallelism()
optional uint32 nodeParallelism = 4;
boolean hasDataSize()
optional string dataSize = 5;
String getDataSize()
optional string dataSize = 5;
com.google.protobuf.ByteString getDataSizeBytes()
optional string dataSize = 5;
Copyright © 2023. All Rights Reserved.