public static final class Distribution.ExplicitBuckets.Builder extends GeneratedMessage.Builder<Distribution.ExplicitBuckets.Builder> implements Distribution.ExplicitBucketsOrBuilderDescribing buckets with arbitrary user-provided width.
Protobuf type google.api.servicecontrol.v1.Distribution.ExplicitBuckets
Inheritance
java.lang.Object > AbstractMessageLite.Builder<MessageType,BuilderType> > AbstractMessage.Builder<BuilderType> > GeneratedMessage.Builder > Distribution.ExplicitBuckets.BuilderImplements
Distribution.ExplicitBucketsOrBuilderStatic Methods
getDescriptor()
public static final Descriptors.Descriptor getDescriptor()| Returns | |
|---|---|
| Type | Description |
Descriptor |
|
Methods
addAllBounds(Iterable<? extends Double> values)
public Distribution.ExplicitBuckets.Builder addAllBounds(Iterable<? extends Double> values) 'bound' is a list of strictly increasing boundaries between
buckets. Note that a list of length N-1 defines N buckets because
of fenceposting. See comments on bucket_options for details.
The i'th finite bucket covers the interval [bound[i-1], bound[i]) where i ranges from 1 to bound_size() - 1. Note that there are no finite buckets at all if 'bound' only contains a single element; in that special case the single bound defines the boundary between the underflow and overflow buckets.
bucket number lower bound upper bound i == 0 (underflow) -inf bound[i] 0 < i < bound_size() bound[i-1] bound[i] i == bound_size() (overflow) bound[i-1] +inf
repeated double bounds = 1;
| Parameter | |
|---|---|
| Name | Description |
values |
Iterable<? extends java.lang.Double>The bounds to add. |
| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets.Builder |
This builder for chaining. |
addBounds(double value)
public Distribution.ExplicitBuckets.Builder addBounds(double value) 'bound' is a list of strictly increasing boundaries between
buckets. Note that a list of length N-1 defines N buckets because
of fenceposting. See comments on bucket_options for details.
The i'th finite bucket covers the interval [bound[i-1], bound[i]) where i ranges from 1 to bound_size() - 1. Note that there are no finite buckets at all if 'bound' only contains a single element; in that special case the single bound defines the boundary between the underflow and overflow buckets.
bucket number lower bound upper bound i == 0 (underflow) -inf bound[i] 0 < i < bound_size() bound[i-1] bound[i] i == bound_size() (overflow) bound[i-1] +inf
repeated double bounds = 1;
| Parameter | |
|---|---|
| Name | Description |
value |
doubleThe bounds to add. |
| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets.Builder |
This builder for chaining. |
build()
public Distribution.ExplicitBuckets build()| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets |
|
buildPartial()
public Distribution.ExplicitBuckets buildPartial()| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets |
|
clear()
public Distribution.ExplicitBuckets.Builder clear()| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets.Builder |
|
clearBounds()
public Distribution.ExplicitBuckets.Builder clearBounds() 'bound' is a list of strictly increasing boundaries between
buckets. Note that a list of length N-1 defines N buckets because
of fenceposting. See comments on bucket_options for details.
The i'th finite bucket covers the interval [bound[i-1], bound[i]) where i ranges from 1 to bound_size() - 1. Note that there are no finite buckets at all if 'bound' only contains a single element; in that special case the single bound defines the boundary between the underflow and overflow buckets.
bucket number lower bound upper bound i == 0 (underflow) -inf bound[i] 0 < i < bound_size() bound[i-1] bound[i] i == bound_size() (overflow) bound[i-1] +inf
repeated double bounds = 1;
| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets.Builder |
This builder for chaining. |
getBounds(int index)
public double getBounds(int index) 'bound' is a list of strictly increasing boundaries between
buckets. Note that a list of length N-1 defines N buckets because
of fenceposting. See comments on bucket_options for details.
The i'th finite bucket covers the interval [bound[i-1], bound[i]) where i ranges from 1 to bound_size() - 1. Note that there are no finite buckets at all if 'bound' only contains a single element; in that special case the single bound defines the boundary between the underflow and overflow buckets.
bucket number lower bound upper bound i == 0 (underflow) -inf bound[i] 0 < i < bound_size() bound[i-1] bound[i] i == bound_size() (overflow) bound[i-1] +inf
repeated double bounds = 1;
| Parameter | |
|---|---|
| Name | Description |
index |
intThe index of the element to return. |
| Returns | |
|---|---|
| Type | Description |
double |
The bounds at the given index. |
getBoundsCount()
public int getBoundsCount() 'bound' is a list of strictly increasing boundaries between
buckets. Note that a list of length N-1 defines N buckets because
of fenceposting. See comments on bucket_options for details.
The i'th finite bucket covers the interval [bound[i-1], bound[i]) where i ranges from 1 to bound_size() - 1. Note that there are no finite buckets at all if 'bound' only contains a single element; in that special case the single bound defines the boundary between the underflow and overflow buckets.
bucket number lower bound upper bound i == 0 (underflow) -inf bound[i] 0 < i < bound_size() bound[i-1] bound[i] i == bound_size() (overflow) bound[i-1] +inf
repeated double bounds = 1;
| Returns | |
|---|---|
| Type | Description |
int |
The count of bounds. |
getBoundsList()
public List<Double> getBoundsList() 'bound' is a list of strictly increasing boundaries between
buckets. Note that a list of length N-1 defines N buckets because
of fenceposting. See comments on bucket_options for details.
The i'th finite bucket covers the interval [bound[i-1], bound[i]) where i ranges from 1 to bound_size() - 1. Note that there are no finite buckets at all if 'bound' only contains a single element; in that special case the single bound defines the boundary between the underflow and overflow buckets.
bucket number lower bound upper bound i == 0 (underflow) -inf bound[i] 0 < i < bound_size() bound[i-1] bound[i] i == bound_size() (overflow) bound[i-1] +inf
repeated double bounds = 1;
| Returns | |
|---|---|
| Type | Description |
List<Double> |
A list containing the bounds. |
getDefaultInstanceForType()
public Distribution.ExplicitBuckets getDefaultInstanceForType()| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets |
|
getDescriptorForType()
public Descriptors.Descriptor getDescriptorForType()| Returns | |
|---|---|
| Type | Description |
Descriptor |
|
internalGetFieldAccessorTable()
protected GeneratedMessage.FieldAccessorTable internalGetFieldAccessorTable()| Returns | |
|---|---|
| Type | Description |
FieldAccessorTable |
|
isInitialized()
public final boolean isInitialized()| Returns | |
|---|---|
| Type | Description |
boolean |
|
mergeFrom(Distribution.ExplicitBuckets other)
public Distribution.ExplicitBuckets.Builder mergeFrom(Distribution.ExplicitBuckets other)| Parameter | |
|---|---|
| Name | Description |
other |
Distribution.ExplicitBuckets |
| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets.Builder |
|
mergeFrom(CodedInputStream input, ExtensionRegistryLite extensionRegistry)
public Distribution.ExplicitBuckets.Builder mergeFrom(CodedInputStream input, ExtensionRegistryLite extensionRegistry)| Parameters | |
|---|---|
| Name | Description |
input |
CodedInputStream |
extensionRegistry |
ExtensionRegistryLite |
| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets.Builder |
|
| Exceptions | |
|---|---|
| Type | Description |
IOException |
|
mergeFrom(Message other)
public Distribution.ExplicitBuckets.Builder mergeFrom(Message other)| Parameter | |
|---|---|
| Name | Description |
other |
Message |
| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets.Builder |
|
setBounds(int index, double value)
public Distribution.ExplicitBuckets.Builder setBounds(int index, double value) 'bound' is a list of strictly increasing boundaries between
buckets. Note that a list of length N-1 defines N buckets because
of fenceposting. See comments on bucket_options for details.
The i'th finite bucket covers the interval [bound[i-1], bound[i]) where i ranges from 1 to bound_size() - 1. Note that there are no finite buckets at all if 'bound' only contains a single element; in that special case the single bound defines the boundary between the underflow and overflow buckets.
bucket number lower bound upper bound i == 0 (underflow) -inf bound[i] 0 < i < bound_size() bound[i-1] bound[i] i == bound_size() (overflow) bound[i-1] +inf
repeated double bounds = 1;
| Parameters | |
|---|---|
| Name | Description |
index |
intThe index to set the value at. |
value |
doubleThe bounds to set. |
| Returns | |
|---|---|
| Type | Description |
Distribution.ExplicitBuckets.Builder |
This builder for chaining. |