| /external/grpc-grpc/tools/run_tests/performance/ |
| D | massage_qps_stats.py | 323 "%f" % x for x in h.buckets)
328 h.buckets, 50, h.boundaries)
331 h.buckets, 95, h.boundaries)
334 h.buckets, 99, h.boundaries)
338 "%f" % x for x in h.buckets)
343 h.buckets, 50, h.boundaries)
346 h.buckets, 95, h.boundaries)
349 h.buckets, 99, h.boundaries)
352 stats["core_tcp_write_size"] = ",".join("%f" % x for x in h.buckets)
357 h.buckets, 50, h.boundaries)
[all …]
|
| D | massage_qps_stats_helpers.py | 18 def _threshold_for_count_below(buckets, boundaries, count_below): argument
20 for lower_idx in range(0, len(buckets)):
21 count_so_far += buckets[lower_idx]
27 for upper_idx in range(lower_idx + 1, len(buckets)):
28 if buckets[upper_idx] != 0:
37 (count_so_far - count_below) / float(buckets[lower_idx]))
40 def percentile(buckets, pctl, boundaries): argument
41 return _threshold_for_count_below(buckets, boundaries,
42 sum(buckets) * pctl / 100.0)
51 Histogram = collections.namedtuple('Histogram', 'buckets boundaries')
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | DenseMap.h | 42 BucketT *Buckets; variable
68 for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { in ~DenseMap()
76 memset((void*)Buckets, 0x5a, sizeof(BucketT)*NumBuckets); in ~DenseMap()
78 operator delete(Buckets); in ~DenseMap()
86 return empty() ? end() : iterator(Buckets, Buckets+NumBuckets); in begin()
89 return iterator(Buckets+NumBuckets, Buckets+NumBuckets); in end()
92 return empty() ? end() : const_iterator(Buckets, Buckets+NumBuckets); in begin()
95 return const_iterator(Buckets+NumBuckets, Buckets+NumBuckets); in end()
101 /// Grow the densemap so that it has at least Size buckets. Does not shrink
118 for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) { in clear()
[all …]
|
| /external/tensorflow/tensorflow/core/lib/monitoring/ |
| D | mobile_sampler.h | 44 // Buckets which has a null implementation.
45 class Buckets {
47 Buckets() = default;
48 ~Buckets() = default;
50 static std::unique_ptr<Buckets> Explicit( in Explicit()
52 return std::unique_ptr<Buckets>(new Buckets()); in Explicit()
55 static std::unique_ptr<Buckets> Exponential(double scale, in Exponential()
58 return std::unique_ptr<Buckets>(new Buckets()); in Exponential()
68 TF_DISALLOW_COPY_AND_ASSIGN(Buckets);
80 std::unique_ptr<Buckets> buckets) { in New() argument
[all …]
|
| D | sampler.h | 75 class Buckets {
77 virtual ~Buckets() = default;
79 // Sets up buckets of the form:
84 static std::unique_ptr<Buckets> Exponential(double scale,
88 // Sets up buckets of the form:
90 static std::unique_ptr<Buckets> Explicit(
117 // Creates the metric based on the metric-definition arguments and buckets.
124 std::unique_ptr<Buckets> buckets);
136 std::unique_ptr<Buckets> buckets) in Sampler() argument
138 buckets_(std::move(buckets)), in Sampler()
[all …]
|
| /external/syzkaller/vendor/golang.org/x/net/trace/ |
| D | histogram.go | 24 // histogram keeps counts of values in buckets that are spaced
30 buckets []int64 // bucketed values for histogram member
48 h.buckets[bucketIndex]++
53 if h.buckets == nil {
54 h.buckets = make([]int64, bucketCount)
55 h.buckets[h.value] = h.valueCount
88 for _, val := range h.buckets {
133 for i := range h.buckets {
134 value := h.buckets[i]
140 // bucket. If the remaining buckets are all empty, then we use the
[all …]
|
| /external/python/google-api-python-client/docs/dyn/ |
| D | servicecontrol_v1.services.html | 183 # The buckets are defined below in `bucket_option`. There are N buckets.
186 # in each of the finite buckets. And `bucket_counts[N] is the number
193 …"exponentialBuckets": { # Describing buckets with exponentially growing width. # Buckets with expo…
202 … "numFiniteBuckets": 42, # The number of finite buckets. With the underflow and overflow buckets,
203 # the total number of buckets is `num_finite_buckets` + 2.
208 … "linearBuckets": { # Describing buckets with constant width. # Buckets with constant width.
213 … "numFiniteBuckets": 42, # The number of finite buckets. With the underflow and overflow buckets,
214 # the total number of buckets is `num_finite_buckets` + 2.
220 …"explicitBuckets": { # Describing buckets with arbitrary user-provided width. # Buckets with arbit…
222 # buckets. Note that a list of length N-1 defines N buckets because
[all …]
|
| D | monitoring_v3.projects.collectdTimeSeries.html | 100 …buckets.The summary statistics are the count, mean, sum of the squared deviation from the mean, th…
102 …buckets, if any, have numbers 1 through N-2; and the overflow bucket has number N-1. The size of b…
105 …buckets can be in a linear sequence, an exponential sequence, or each bucket can be specified expl…
106 …buckets that have a width that is proportional to the value of the lower bound. Each bucket repres…
111 …buckets that all have the same width (except overflow and underflow). Each bucket represents a con…
116 …buckets with arbitrary widths.There are size(bounds) + 1 (= N) buckets. Bucket i has the following…
144 …buckets.The summary statistics are the count, mean, sum of the squared deviation from the mean, th…
146 …buckets, if any, have numbers 1 through N-2; and the overflow bucket has number N-1. The size of b…
149 …buckets can be in a linear sequence, an exponential sequence, or each bucket can be specified expl…
150 …buckets that have a width that is proportional to the value of the lower bound. Each bucket repres…
[all …]
|
| D | monitoring_v3.projects.timeSeries.html | 113 …buckets.The summary statistics are the count, mean, sum of the squared deviation from the mean, th…
115 …buckets, if any, have numbers 1 through N-2; and the overflow bucket has number N-1. The size of b…
118 …buckets can be in a linear sequence, an exponential sequence, or each bucket can be specified expl…
119 …buckets that have a width that is proportional to the value of the lower bound. Each bucket repres…
124 …buckets that all have the same width (except overflow and underflow). Each bucket represents a con…
129 …buckets with arbitrary widths.There are size(bounds) + 1 (= N) buckets. Bucket i has the following…
227 …buckets.The summary statistics are the count, mean, sum of the squared deviation from the mean, th…
229 …buckets, if any, have numbers 1 through N-2; and the overflow bucket has number N-1. The size of b…
232 …buckets can be in a linear sequence, an exponential sequence, or each bucket can be specified expl…
233 …buckets that have a width that is proportional to the value of the lower bound. Each bucket repres…
[all …]
|
| /external/opencensus-java/impl_core/src/main/java/io/opencensus/implcore/stats/ |
| D | MutableViewData.java | 188 * For each IntervalView, we always keep a queue of N + 1 buckets (by default N is 4).
191 * 1. the buckets should always be up-to-date,
194 * 3. there are always N buckets before the current one, which holds the stats in the past
198 * buckets (part of the stats from the oldest bucket could have expired).
200 * However, in reality, we couldn't track the status of buckets all the time (keep monitoring and
202 * of the buckets might be outdated, and we will need to "pad" new buckets to the queue and remove
203 * outdated ones. After refreshing buckets, the bucket queue will able to maintain the three
208 * 2. Initially there will be 5 buckets: [2.0, 4.0), [4.0, 6.0), ..., [10.0, 12.0).
210 * buckets could expire.
212 * two new buckets [12.0, 14.0) and [14.0, 16.0), and remove two expired buckets [2.0, 4.0)
[all …]
|
| /external/libaom/libaom/stats/ |
| D | rate_hist.c | 120 int buckets = *num_buckets; in merge_hist_buckets() local
123 /* Find the extrema for this list of buckets */ in merge_hist_buckets()
125 for (i = 0; i < buckets; i++) { in merge_hist_buckets()
130 /* If we have too many buckets, merge the smallest with an adjacent in merge_hist_buckets()
133 while (buckets > max_buckets) { in merge_hist_buckets()
134 int last_bucket = buckets - 1; in merge_hist_buckets()
147 assert(small_bucket < buckets); in merge_hist_buckets()
148 assert(big_bucket < buckets); in merge_hist_buckets()
149 assert(merge_bucket < buckets); in merge_hist_buckets()
162 buckets--; in merge_hist_buckets()
[all …]
|
| /external/libvpx/libvpx/ |
| D | rate_hist.c | 129 int buckets; in merge_hist_buckets() local
135 buckets = *num_buckets; in merge_hist_buckets()
137 /* Find the extrema for this list of buckets */ in merge_hist_buckets()
139 for (i = 0; i < buckets; i++) { in merge_hist_buckets()
144 /* If we have too many buckets, merge the smallest with an adjacent in merge_hist_buckets()
147 while (buckets > max_buckets) { in merge_hist_buckets()
148 int last_bucket = buckets - 1; in merge_hist_buckets()
161 assert(small_bucket < buckets); in merge_hist_buckets()
162 assert(big_bucket < buckets); in merge_hist_buckets()
163 assert(merge_bucket < buckets); in merge_hist_buckets()
[all …]
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DwarfAccelTable.cpp | 87 // Figure out how many buckets we need, then compute the bucket in FinalizeTable()
95 Buckets.resize(Header.bucket_count); in FinalizeTable()
98 Buckets[bucket].push_back(Data[i]); in FinalizeTable()
102 // Sort the contents of the buckets by hash value so that hash in FinalizeTable()
105 for (size_t i = 0; i < Buckets.size(); ++i) in FinalizeTable()
106 std::stable_sort(Buckets[i].begin(), Buckets[i].end(), in FinalizeTable()
139 // Walk through and emit the buckets for the table. Each index is
143 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in EmitBuckets()
145 if (Buckets[i].size() != 0) in EmitBuckets()
149 // Buckets point in the list of hashes, not to the data. Do not in EmitBuckets()
[all …]
|
| /external/tensorflow/tensorflow/contrib/boosted_trees/python/kernel_tests/ |
| D | quantile_ops_test.py | 132 are_ready_flush, buckets = (accumulator.get_buckets(stamp_token=1))
133 buckets, are_ready_flush = (sess.run(
134 [buckets, are_ready_flush]))
136 self.assertEqual(num_quantiles + 1, len(buckets))
137 self.assertAllEqual([1, 86., 170., 253.], buckets)
165 # validate the number of buckets is returned, in cases where the input
179 are_ready_flush, buckets = (accumulator.get_buckets(stamp_token=1))
180 buckets, are_ready_flush = (sess.run(
181 [buckets, are_ready_flush]))
183 self.assertEqual(num_quantiles + 1, len(buckets))
[all …]
|
| /external/tensorflow/tensorflow/python/kernel_tests/boosted_trees/ |
| D | quantile_ops_test.py | 98 buckets = boosted_trees_ops.get_bucket_boundaries(
101 [self._feature_0, self._feature_1], buckets)
104 self.assertAllClose(self._feature_0_boundaries, buckets[0].eval())
105 self.assertAllClose(self._feature_1_boundaries, buckets[1].eval())
155 buckets = accumulator.get_bucket_boundaries()
156 self.assertAllClose([], buckets[0].eval())
157 self.assertAllClose([], buckets[1].eval())
163 self.assertAllClose(self._feature_0_boundaries, buckets[0].eval())
164 self.assertAllClose(self._feature_1_boundaries, buckets[1].eval())
172 buckets = accumulator.get_bucket_boundaries()
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | OnDiskHashTable.h | 86 Bucket *Buckets; variable
90 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument
91 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
97 /// \brief Resize the hash table, moving the old entries into the new buckets.
102 for (Item *E = Buckets[I].Head; E;) { in resize()
109 free(Buckets); in resize()
111 Buckets = NewBuckets; in resize()
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains()
158 // 64 buckets.) We aim for an occupancy ratio in [3/8, 3/4). in Emit()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
| D | OnDiskHashTable.h | 85 Bucket *Buckets; variable
89 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument
90 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
96 /// Resize the hash table, moving the old entries into the new buckets.
102 for (Item *E = Buckets[I].Head; E;) { in resize()
109 free(Buckets); in resize()
111 Buckets = NewBuckets; in resize()
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains()
158 // 64 buckets.) We aim for an occupancy ratio in [3/8, 3/4). in Emit()
[all …]
|
| /external/emma/core/java12/com/vladium/util/ |
| D | IntIntMap.java | 48 …* @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is eq…
87 final Entry [] buckets = m_buckets; in contains() local
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in contains()
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
111 final Entry [] buckets = m_buckets; in get() local
112 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in get()
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
130 final Entry [] buckets = m_buckets; in get() local
131 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in get()
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
[all …]
|
| D | ObjectIntMap.java | 50 …* @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is eq…
91 final Entry [] buckets = m_buckets; in contains() local
93 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length; in contains()
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
119 final Entry [] buckets = m_buckets; in get() local
121 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length; in get()
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
171 Entry [] buckets = m_buckets; in put() local
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
193 buckets = m_buckets; in put()
[all …]
|
| D | IntObjectMap.java | 48 …* @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is eq…
87 final Entry [] buckets = m_buckets; in contains() local
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in contains()
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
112 final Entry [] buckets = m_buckets; in get() local
113 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in get()
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
164 Entry [] buckets = m_buckets; in put() local
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
189 buckets = m_buckets; in put()
[all …]
|
| /external/ltp/utils/ffsb-6.0-rc2/ |
| D | ffsb_stats.c | 42 fsc->buckets = NULL; in ffsb_statsc_init()
52 temp = ffsb_realloc(fsc->buckets, sizeof(struct stat_bucket) * in ffsb_statsc_addbucket()
55 fsc->buckets = temp; in ffsb_statsc_addbucket()
58 fsc->buckets[fsc->num_buckets - 1].min = min; in ffsb_statsc_addbucket()
59 fsc->buckets[fsc->num_buckets - 1].max = max; in ffsb_statsc_addbucket()
64 free(fsc->buckets); in ffsb_statsc_destroy()
90 fsd->buckets[i] = ffsb_malloc(sizeof(uint32_t) * in ffsb_statsd_init()
92 assert(fsd->buckets[i] != NULL); in ffsb_statsd_init()
94 memset(fsd->buckets[i], 0, sizeof(uint32_t) * fsc->num_buckets); in ffsb_statsd_init()
103 free(fsd->buckets[i]); in ffsb_statsd_destroy()
[all …]
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| D | AlphabeticIndex.java | 48 * The class also supports having buckets for strings before the first (underflow),
70 * // Show index at top. We could skip or gray out empty buckets
78 * // Show the buckets with their contents, skipping empty buckets
90 * if its bucket is empty. Small buckets could also be combined based on size, such as:
102 * they "lazily" build the index buckets.
105 * buckets and their labels and label types.
128 * Prefix string for Chinese index buckets.
156 private BucketList<V> buckets; field in AlphabeticIndex
165 * and random access to buckets and their properties,
173 private final BucketList<V> buckets; field in AlphabeticIndex.ImmutableIndex
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | AlphabeticIndex.java | 49 * The class also supports having buckets for strings before the first (underflow),
71 * // Show index at top. We could skip or gray out empty buckets
79 * // Show the buckets with their contents, skipping empty buckets
91 * if its bucket is empty. Small buckets could also be combined based on size, such as:
103 * they "lazily" build the index buckets.
106 * buckets and their labels and label types.
128 * Prefix string for Chinese index buckets.
156 private BucketList<V> buckets; field in AlphabeticIndex
165 * and random access to buckets and their properties,
172 private final BucketList<V> buckets; field in AlphabeticIndex.ImmutableIndex
[all …]
|
| /external/opencensus-java/api/src/test/java/io/opencensus/metrics/export/ |
| D | DistributionTest.java | 151 List<Bucket> buckets = in createAndGet_Distribution() local
154 Distribution distribution = Distribution.create(10, 6.6, 678.54, bucketOptions, buckets); in createAndGet_Distribution()
174 assertThat(distribution.getBuckets()).containsExactlyElementsIn(buckets).inOrder(); in createAndGet_Distribution()
212 List<Bucket> buckets = in createDistribution_NegativeCount() local
216 Distribution.create(-10, 6.6, 678.54, bucketOptions, buckets); in createDistribution_NegativeCount()
224 List<Bucket> buckets = in createDistribution_NegativeSumOfSquaredDeviations() local
228 Distribution.create(0, 6.6, -678.54, bucketOptions, buckets); in createDistribution_NegativeSumOfSquaredDeviations()
236 List<Bucket> buckets = in createDistribution_ZeroCountAndPositiveMean() local
240 Distribution.create(0, 6.6, 0, bucketOptions, buckets); in createDistribution_ZeroCountAndPositiveMean()
247 List<Bucket> buckets = in createDistribution_ZeroCountAndSumOfSquaredDeviations() local
[all …]
|
| /external/webrtc/webrtc/base/ |
| D | random_unittest.cc | 33 // Sample a number of random integers of type T. Divide them into buckets
38 std::vector<int> buckets(bucket_count, 0); in UniformBucketTest() local
51 // the number of buckets. If we are unlucky and hit one of the excluded in UniformBucketTest()
52 // numbers we just resample. Note that if the number of buckets is a in UniformBucketTest()
56 buckets[fdiv_remainder(sample, bucket_count)]++; in UniformBucketTest()
61 EXPECT_NEAR(buckets[i], samples / bucket_count, in UniformBucketTest()
117 std::vector<unsigned int> buckets(bucket_count, 0); in BucketTestSignedInterval() local
137 buckets[static_cast<uint32_t>(sample - low) / numbers_per_bucket]++; in BucketTestSignedInterval()
144 EXPECT_NEAR(buckets[i], mean, sigma_level * sqrt(mean)); in BucketTestSignedInterval()
157 std::vector<unsigned int> buckets(bucket_count, 0); in BucketTestUnsignedInterval() local
[all …]
|