| /third_party/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 …]
|
| /third_party/boost/libs/unordered/doc/ |
| D | buckets.qbk | 5 [section:buckets The Data Structure]
7 The containers are made up of a number of 'buckets', each of which can contain
9 boost::unordered_set unordered_set] with 7 buckets containing 5 elements, `A`,
11 have more buckets).
13 [diagram buckets]
20 then the number of buckets, so the container applies another transformation to
27 evenly distributed amongst the buckets so only a small number of elements will
39 <table frame="all"><title>Methods for Accessing Buckets</title>
48 <entry>'''The number of buckets.'''</entry>
52 <entry>'''An upper bound on the number of buckets.'''</entry>
[all …]
|
| /third_party/iowow/src/utils/ |
| D | iwhmap.c | 28 bucket_t *buckets; member
127 hm->buckets = calloc(MIN_BUCKETS, sizeof(hm->buckets[0])); in iwhmap_create()
128 if (!hm->buckets) { in iwhmap_create()
164 bucket_t *bucket = hm->buckets + (hash & hm->buckets_mask); in _entry_find()
176 bucket_t *bucket = hm->buckets + (hash & hm->buckets_mask); in _entry_add()
209 bucket_t *buckets = calloc(num_buckets, sizeof(*buckets)); in _rehash() local
210 if (!buckets) { in _rehash()
217 *bucket_end = hm->buckets + _n_buckets(hm); in _rehash()
222 hm_copy.buckets = buckets; in _rehash()
224 for (bucket = hm->buckets; bucket < bucket_end; ++bucket) { in _rehash()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.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 …]
|
| /third_party/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 …]
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/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 …]
|
| /third_party/glib/glib/tests/ |
| D | gpoll.c | 174 gint buckets[], in bucketize() argument
182 buckets[count - 1] += 1; in bucketize()
189 buckets[i] += 1; in bucketize()
193 buckets[0] += 1; in bucketize()
197 print_buckets (gint buckets[], in print_buckets() argument
216 if (buckets[i] < 10) in print_buckets()
218 else if (buckets[i] < 100) in print_buckets()
220 else if (buckets[i] < 1000) in print_buckets()
227 if (buckets[i] != 0) in print_buckets()
228 g_print ("%*d", len, buckets[i]); in print_buckets()
[all …]
|
| /third_party/grpc/src/php/tests/qps/generated_code/Grpc/Core/ |
| D | Histogram.php | 17 * Generated from protobuf field <code>repeated .grpc.core.Bucket buckets = 1;</code>
19 private $buckets; variable in Grpc\\Core\\Histogram
27 * @type \Grpc\Core\Bucket[]|\Google\Protobuf\Internal\RepeatedField $buckets
36 * Generated from protobuf field <code>repeated .grpc.core.Bucket buckets = 1;</code>
41 return $this->buckets;
45 * Generated from protobuf field <code>repeated .grpc.core.Bucket buckets = 1;</code>
52 $this->buckets = $arr;
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/PDB/Native/ |
| D | HashTable.h | 74 return Map->Buckets[Index];
83 while (Index < Map->Buckets.size()) {
115 HashTable() { Buckets.resize(8); } in HashTable()
117 Buckets.resize(Capacity); in HashTable()
131 Buckets.resize(H->Capacity); in load()
146 if (auto EC = Stream.readInteger(Buckets[P].first)) in load()
151 Buckets[P].second = *Value; in load()
207 Buckets.resize(8); in clear()
213 uint32_t capacity() const { return Buckets.size(); } in capacity()
228 if (Traits.storageKeyToLookupKey(Buckets[I].first) == K) in find_as()
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | delta_stepping_shortest_paths.hpp | 28 * - The size of the "buckets" data structure can be bounded to *
29 * max_edge_weight/delta buckets, if we treat the buckets as a *
150 std::vector<Bucket*> buckets; member in boost::graph::distributed::delta_stepping_impl
259 while (current_bucket < buckets.size() in run()
260 && (!buckets[current_bucket] || buckets[current_bucket]->empty())) in run()
262 if (current_bucket >= buckets.size()) in run()
276 // There are no non-empty buckets in any process; exit. in run()
295 if (current_bucket < buckets.size() && buckets[current_bucket]) { in run()
296 Bucket& bucket = *buckets[current_bucket]; in run()
330 nonempty_bucket = (current_bucket < buckets.size() in run()
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/cpu/ |
| D | unique_cpu_kernel.h | 137 … const std::vector<std::shared_ptr<UniqueParam<DataType, IndexType>>> &buckets) { in SegmentToBuckets() argument
142 auto bucket_size = buckets.size(); in SegmentToBuckets()
154 auto &bucket = buckets[bucket_id]; in SegmentToBuckets()
184 auto &buckets = *buckets_ptr; in GatherSegmentsToBuckets() local
186 buckets.reserve(thread_num); in GatherSegmentsToBuckets()
204 (void)buckets.emplace_back(bucket); in GatherSegmentsToBuckets()
212 bucket->input_ = buckets[j]->input_ + tmp_bucket_data_size[j]; in GatherSegmentsToBuckets()
213 bucket->input_size_ = buckets[j]->input_size_ - tmp_bucket_data_size[j]; in GatherSegmentsToBuckets()
214 bucket->workspace_idx_ = buckets[j]->workspace_idx_ + tmp_bucket_data_size[j]; in GatherSegmentsToBuckets()
292 …d UniqueEachBucket(const std::vector<std::shared_ptr<UniqueParam<DataType, IndexType>>> &buckets) { in UniqueEachBucket() argument
[all …]
|
| D | sparse_optimizer_cpu_kernel.h | 110 std::vector<std::shared_ptr<BucketSparseGradient<T>>> buckets; in BucketReduceSparseGradient() local
111 … GatherSegmentIndicesToOutputBucket(multi_thread_param, segments, segment_bucket_sizes, &buckets); in BucketReduceSparseGradient()
114 ReduceBucketSparseGradientToWorkspace(multi_thread_param, buckets, &reduced_buckets); in BucketReduceSparseGradient()
206 … const std::vector<std::shared_ptr<BucketSparseGradient<T>>> &buckets) { in CopySegmentIndicesToBucket() argument
219 buckets[bucket_id]->indices_[bucket_index] = index; in CopySegmentIndicesToBucket()
220 buckets[bucket_id]->global_indices_[bucket_index] = bucket_offset + i; in CopySegmentIndicesToBucket()
237 auto &buckets = *buckets_ptr; in GatherSegmentIndicesToOutputBucket() local
250 (void)buckets.emplace_back(std::make_shared<BucketSparseGradient<T>>()); in GatherSegmentIndicesToOutputBucket()
251 … buckets[i]->value_ = param.output_grad_->value_ + current_indices_offset * param.value_stride_; in GatherSegmentIndicesToOutputBucket()
252 buckets[i]->indices_ = param.output_grad_->indices_ + current_indices_offset; in GatherSegmentIndicesToOutputBucket()
[all …]
|
| /third_party/grpc/test/core/util/ |
| D | histogram.cc | 34 There are sufficient buckets to reach max_bucket_start */
52 /* number of buckets */
54 /* the buckets themselves */
55 uint32_t* buckets; member
92 h->buckets = in grpc_histogram_create()
98 gpr_free(h->buckets); in grpc_histogram_destroy()
112 h->buckets[bucket_for(h, x)]++; in grpc_histogram_add()
121 grpc_histogram_merge_contents(dst, src->buckets, src->num_buckets, in grpc_histogram_merge()
143 dst->buckets[i] += data[i]; in grpc_histogram_merge_contents()
168 count_so_far += h->buckets[lower_idx]; in threshold_for_count_below()
[all …]
|
| /third_party/grpc/src/csharp/Grpc.IntegrationTesting/ |
| D | Histogram.cs | 44 readonly uint[] buckets; field in Grpc.IntegrationTesting.Histogram
59 this.buckets = new uint[FindBucket(maxPossible) + 1]; in Histogram()
114 this.buckets[FindBucket(value)]++; in AddObservationUnsafe()
119 …pcPreconditions.CheckArgument(mergeTo.Bucket.Count == 0 || mergeTo.Bucket.Count == buckets.Length); in GetSnapshotUnsafe()
136 mergeTo.Bucket.AddRange(buckets); in GetSnapshotUnsafe()
140 for (int i = 0; i < buckets.Length; i++) in GetSnapshotUnsafe()
142 mergeTo.Bucket[i] += buckets[i]; in GetSnapshotUnsafe()
159 for (int i = 0; i < this.buckets.Length; i++) in ResetUnsafe()
161 this.buckets[i] = 0; in ResetUnsafe()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | FoldingSet.cpp | 187 /// The problem with this is that the start of the hash buckets are not
208 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
211 return Buckets + BucketNum; in GetBucketFor()
216 void **Buckets = static_cast<void**>(safe_calloc(NumBuckets + 1, in AllocateBuckets() local
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
220 return Buckets; in AllocateBuckets()
232 Buckets = AllocateBuckets(NumBuckets); in FoldingSetBase()
237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetBase()
238 Arg.Buckets = nullptr; in FoldingSetBase()
244 free(Buckets); // This may be null if the set is in a moved-from state. in operator =()
[all …]
|
| /third_party/boost/doc/html/unordered/ |
| D | buckets.html | 28 <a name="unordered.buckets"></a><a class="link" href="buckets.html" title="The Data Structure">The …
31 The containers are made up of a number of 'buckets', each of which can contain
32 …d_set.html" title="Class template unordered_set">unordered_set</a></code> with 7 buckets containing
35 (this is just for illustration, containers will typically have more buckets).
38 …<span class="inlinemediaobject"><img src="../../../libs/unordered/doc/diagrams/buckets.png" align=…
48 then the number of buckets, so the container applies another transformation
56 has worked well the elements will be evenly distributed amongst the buckets
73 <a name="id-1.3.45.4.8.1"></a><p class="title"><b>Table 44.1. Methods for Accessing Buckets</b></p>
74 <div class="table-contents"><table class="table" summary="Methods for Accessing Buckets">
87 number of buckets.</td>
[all …]
|
| /third_party/flutter/skia/infra/project-config/ |
| D | cr-buildbucket.cfg | 1 # Defines buckets on cr-buildbucket.appspot.com, used to schedule builds
2 # on buildbot. In particular, CQ uses some of these buckets to schedule tryjobs.
9 buckets {
29 buckets {
49 buckets {
69 buckets {
|
| /third_party/skia/infra/project-config/ |
| D | cr-buildbucket.cfg | 1 # Defines buckets on cr-buildbucket.appspot.com, used to schedule builds
2 # on buildbot. In particular, CQ uses some of these buckets to schedule tryjobs.
9 buckets {
29 buckets {
49 buckets {
69 buckets {
|
| /third_party/python/Python/ |
| D | hashtable.c | 58 ((_Py_hashtable_entry_t *)_Py_SLIST_HEAD(&(HT)->buckets[BUCKET]))
105 /* makes sure the real size of the buckets array is a power of 2 */
123 /* buckets */ in _Py_hashtable_size()
193 _Py_slist_remove(&ht->buckets[index], (_Py_slist_item_t *)previous, in _Py_hashtable_steal()
242 _Py_slist_prepend(&ht->buckets[index], (_Py_slist_item_t*)entry); in _Py_hashtable_set()
287 size_t buckets_size = new_size * sizeof(ht->buckets[0]); in hashtable_rehash()
296 _Py_hashtable_entry_t *entry = BUCKETS_HEAD(ht->buckets[bucket]); in hashtable_rehash()
308 ht->alloc.free(ht->buckets); in hashtable_rehash()
310 ht->buckets = new_buckets; in hashtable_rehash()
339 size_t buckets_size = ht->nbuckets * sizeof(ht->buckets[0]); in _Py_hashtable_new_full()
[all …]
|
| /third_party/grpc/src/core/lib/debug/ |
| D | stats_data.yaml | 25 buckets: 64
42 buckets: 128
83 buckets: 64
87 buckets: 64
91 buckets: 64
95 buckets: 64
99 buckets: 64
124 buckets: 64
128 buckets: 64
132 buckets: 64
[all …]
|
| /third_party/skia/third_party/externals/freetype/src/cache/ |
| D | ftccache.c | 100 return cache->buckets + idx; in ftc_get_top_node_for_hash()
107 * buckets array appropriately, we simply degrade the hash table's
118 FT_UFast count = mask + p + 1; /* number of buckets */ in ftc_cache_resize()
121 /* do we need to expand the buckets array? */ in ftc_cache_resize()
127 /* try to expand the buckets array _before_ splitting in ftc_cache_resize()
137 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
143 pnode = cache->buckets + p; in ftc_cache_resize()
161 cache->buckets[p + mask + 1] = new_list; in ftc_cache_resize()
174 /* do we need to shrink the buckets array? */ in ftc_cache_resize()
191 if ( FT_QRENEW_ARRAY( cache->buckets, in ftc_cache_resize()
[all …]
|
| /third_party/freetype/src/cache/ |
| D | ftccache.c | 100 pnode = cache->buckets + idx; in ftc_get_top_node_for_hash()
108 * buckets array appropriately, we simply degrade the hash table's
119 FT_UFast count = mask + p + 1; /* number of buckets */ in ftc_cache_resize()
122 /* do we need to shrink the buckets array? */ in ftc_cache_resize()
128 /* try to expand the buckets array _before_ splitting in ftc_cache_resize()
138 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
144 pnode = cache->buckets + p; in ftc_cache_resize()
162 cache->buckets[p + mask + 1] = new_list; in ftc_cache_resize()
175 /* do we need to expand the buckets array? */ in ftc_cache_resize()
192 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
[all …]
|
| /third_party/flutter/skia/third_party/externals/freetype/src/cache/ |
| D | ftccache.c | 101 pnode = cache->buckets + idx; in ftc_get_top_node_for_hash()
109 * buckets array appropriately, we simply degrade the hash table's
120 FT_UFast count = mask + p + 1; /* number of buckets */ in ftc_cache_resize()
123 /* do we need to shrink the buckets array? */ in ftc_cache_resize()
129 /* try to expand the buckets array _before_ splitting in ftc_cache_resize()
139 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
145 pnode = cache->buckets + p; in ftc_cache_resize()
163 cache->buckets[p + mask + 1] = new_list; in ftc_cache_resize()
176 /* do we need to expand the buckets array? */ in ftc_cache_resize()
193 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
[all …]
|
| /third_party/boost/boost/hana/detail/ |
| D | hash_table.hpp | 34 template <typename ...Buckets>
36 : Buckets...
73 // This is a peephole optimization for buckets that have a single entry.
113 template <typename ...Buckets, typename Key, std::size_t Index>
114 struct bucket_insert<hash_table<Buckets...>, Key, Index, true> {
117 using type = hash_table<typename update_bucket<Buckets, Hash, Index>::type...>;
120 template <typename ...Buckets, typename Key, std::size_t Index>
121 struct bucket_insert<hash_table<Buckets...>, Key, Index, false> {
124 using type = hash_table<Buckets..., bucket<Hash, Index>>;
|