google.api.servicecontrol.v1.Distribution.ExplicitBuckets */ class ExplicitBuckets extends \Google\Protobuf\Internal\Message { /** * '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 * * Generated from protobuf field repeated double bounds = 1; */ private $bounds; /** * Constructor. * * @param array $data { * Optional. Data for populating the Message object. * * @type array|\Google\Protobuf\Internal\RepeatedField $bounds * '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 * } */ public function __construct($data = NULL) { \GPBMetadata\Google\Api\Servicecontrol\V1\Distribution::initOnce(); parent::__construct($data); } /** * '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 * * Generated from protobuf field repeated double bounds = 1; * @return \Google\Protobuf\Internal\RepeatedField */ public function getBounds() { return $this->bounds; } /** * '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 * * Generated from protobuf field repeated double bounds = 1; * @param array|\Google\Protobuf\Internal\RepeatedField $var * @return $this */ public function setBounds($var) { $arr = GPBUtil::checkRepeatedField($var, \Google\Protobuf\Internal\GPBType::DOUBLE); $this->bounds = $arr; return $this; } }