Reference documentation and code samples for the Google Cloud Service Control V1 Client class ExplicitBuckets.
Describing buckets with arbitrary user-provided width.
Generated from protobuf message google.api.servicecontrol.v1.Distribution.ExplicitBuckets
Namespace
Google \ Cloud \ ServiceControl \ V1 \ Distribution
Methods
__construct
Constructor.
Parameters
Name
Description
data
array
Optional. Data for populating the Message object.
↳ bounds
array
'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
getBounds
'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
'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
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Hard to understand","hardToUnderstand","thumb-down"],["Incorrect information or sample code","incorrectInformationOrSampleCode","thumb-down"],["Missing the information/samples I need","missingTheInformationSamplesINeed","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2025-09-04 UTC."],[],[],null,["# Google Cloud Service Control V1 Client - Class ExplicitBuckets (2.0.4)\n\nVersion latestkeyboard_arrow_down\n\n- [2.0.4 (latest)](/php/docs/reference/cloud-service-control/latest/V1.Distribution.ExplicitBuckets)\n- [2.0.3](/php/docs/reference/cloud-service-control/2.0.3/V1.Distribution.ExplicitBuckets)\n- [1.4.4](/php/docs/reference/cloud-service-control/1.4.4/V1.Distribution.ExplicitBuckets)\n- [1.3.0](/php/docs/reference/cloud-service-control/1.3.0/V1.Distribution.ExplicitBuckets)\n- [1.2.1](/php/docs/reference/cloud-service-control/1.2.1/V1.Distribution.ExplicitBuckets)\n- [1.1.1](/php/docs/reference/cloud-service-control/1.1.1/V1.Distribution.ExplicitBuckets)\n- [1.0.6](/php/docs/reference/cloud-service-control/1.0.6/V1.Distribution.ExplicitBuckets) \nReference documentation and code samples for the Google Cloud Service Control V1 Client class ExplicitBuckets.\n\nDescribing buckets with arbitrary user-provided width.\n\nGenerated from protobuf message `google.api.servicecontrol.v1.Distribution.ExplicitBuckets`\n\nNamespace\n---------\n\nGoogle \\\\ Cloud \\\\ ServiceControl \\\\ V1 \\\\ Distribution\n\nMethods\n-------\n\n### __construct\n\nConstructor.\n\n### getBounds\n\n'bound' is a list of strictly increasing boundaries between\nbuckets. Note that a list of length N-1 defines N buckets because\nof fenceposting. See comments on `bucket_options` for details.\n\nThe i'th finite bucket covers the interval\n\\[bound\\[i-1\\], bound\\[i\\])\nwhere i ranges from 1 to bound_size() - 1. Note that there are no\nfinite buckets at all if 'bound' only contains a single element; in\nthat special case the single bound defines the boundary between the\nunderflow and overflow buckets.\nbucket number lower bound upper bound\ni == 0 (underflow) -inf bound\\[i\\]\n0 \\\u003c i \\\u003c bound_size() bound\\[i-1\\] bound\\[i\\]\ni == bound_size() (overflow) bound\\[i-1\\] +inf\n\n### setBounds\n\n'bound' is a list of strictly increasing boundaries between\nbuckets. Note that a list of length N-1 defines N buckets because\nof fenceposting. See comments on `bucket_options` for details.\n\nThe i'th finite bucket covers the interval\n\\[bound\\[i-1\\], bound\\[i\\])\nwhere i ranges from 1 to bound_size() - 1. Note that there are no\nfinite buckets at all if 'bound' only contains a single element; in\nthat special case the single bound defines the boundary between the\nunderflow and overflow buckets.\nbucket number lower bound upper bound\ni == 0 (underflow) -inf bound\\[i\\]\n0 \\\u003c i \\\u003c bound_size() bound\\[i-1\\] bound\\[i\\]\ni == bound_size() (overflow) bound\\[i-1\\] +inf"]]
