| /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 …]
|
| D | rationale.qbk | 21 By specifying an interface for accessing the buckets of the container the
49 For containers with unique keys I store the buckets in a single-linked list.
80 [h2 Number of Buckets]
82 There are two popular methods for choosing the number of buckets in a hash
83 table. One is to have a prime number of buckets, another is to use a power
86 Using a prime number of buckets, and choosing a bucket by using the modulus
108 indicate that it's safe to be used directly with power of 2 buckets, in
|
| /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/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/boringssl/src/crypto/lhash/ |
| D | lhash.c | 68 // kMinNumBuckets is the minimum size of the buckets array in an |_LHASH|.
79 // buckets is an array of |num_buckets| pointers. Each points to the head of
82 LHASH_ITEM **buckets; member
83 // num_buckets contains the length of |buckets|. This value is always >=
87 // calls. If non-zero then this suppresses resizing of the |buckets| array,
103 ret->buckets = OPENSSL_malloc(sizeof(LHASH_ITEM *) * ret->num_buckets); in lh_new()
104 if (ret->buckets == NULL) { in lh_new()
108 OPENSSL_memset(ret->buckets, 0, sizeof(LHASH_ITEM *) * ret->num_buckets); in lh_new()
122 for (LHASH_ITEM *n = lh->buckets[i]; n != NULL; n = next) { in lh_free()
128 OPENSSL_free(lh->buckets); in lh_free()
[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/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/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/python/Modules/ |
| D | hashtable.c | 58 ((_Py_hashtable_entry_t *)_Py_SLIST_HEAD(&(HT)->buckets[BUCKET]))
126 /* makes sure the real size of the buckets array is a power of 2 */
167 buckets_size = ht->num_buckets * sizeof(ht->buckets[0]); in _Py_hashtable_new_full()
168 ht->buckets = alloc.malloc(buckets_size); in _Py_hashtable_new_full()
169 if (ht->buckets == NULL) { in _Py_hashtable_new_full()
173 memset(ht->buckets, 0, buckets_size); in _Py_hashtable_new_full()
201 /* buckets */ in _Py_hashtable_size()
297 _Py_slist_remove(&ht->buckets[index], (_Py_slist_item_t *)previous, in _Py_hashtable_pop_entry()
344 _Py_slist_prepend(&ht->buckets[index], (_Py_slist_item_t*)entry); in _Py_hashtable_set()
425 buckets_size = new_size * sizeof(ht->buckets[0]); in hashtable_rehash()
[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/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/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>>;
|
| /third_party/node/deps/npm/node_modules/cacache/lib/ |
| D | verify.js | 162 const buckets = {}
169 if (buckets[hashed] && !excluded) {
170 buckets[hashed].push(entry)
171 } else if (buckets[hashed] && excluded) {
174 buckets[hashed] = []
175 buckets[hashed]._path = index._bucketPath(cache, k)
177 buckets[hashed] = [entry]
178 buckets[hashed]._path = index._bucketPath(cache, k)
182 return BB.map(Object.keys(buckets), key => {
183 return rebuildBucket(cache, buckets[key], stats, opts)
|
| /third_party/boost/libs/lockfree/test/ |
| D | test_helpers.hpp | 24 template <typename int_type, size_t buckets>
32 size_t factor = size_t((float)buckets * 1.616f); in calc_index()
34 return ((size_t)id * factor) % buckets; in calc_index()
76 for (int i = 0; i != buckets; ++i) { in count_nodes()
84 boost::array<std::set<int_type>, buckets> data;
85 mutable boost::array<boost::mutex, buckets> ref_mutex;
|
| /third_party/boost/boost/interprocess/indexes/ |
| D | iunordered_set_index.hpp | 175 bucket_ptr buckets = alloc.allocate(num); in create_buckets() local
176 bucket_ptr buckets_init = buckets; in create_buckets()
180 return buckets; in create_buckets()
184 ( bucket_ptr buckets, size_type old_size in shrink_buckets() argument
191 …:try_shrink_in_place | boost::interprocess::nothrow_allocation, old_size, received_size, buckets)){ in shrink_buckets()
195 for( bucket_type *p = ipcdetail::to_raw_pointer(buckets) + received_size in shrink_buckets()
196 , *pend = ipcdetail::to_raw_pointer(buckets) + old_size in shrink_buckets()
203 …:shrink_in_place | boost::interprocess::nothrow_allocation, received_size, received_size, buckets); in shrink_buckets()
204 BOOST_ASSERT(buckets == shunk_p); (void)shunk_p; in shrink_buckets()
206 bucket_ptr buckets_init = buckets + received_size; in shrink_buckets()
[all …]
|
| /third_party/grpc/src/ruby/qps/ |
| D | histogram.rb | 41 @buckets=Array.new(bucket_for(max_possible)+1, 0)
56 @buckets[bucket_for(value)] += 1
74 @buckets
85 @buckets = @buckets.map.with_index{ |m,i| m + received_bucket[i].to_i }
|
| /third_party/node/deps/brotli/c/enc/ |
| D | hash_longest_match_quickly_inc.h | 58 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN() local
66 buckets[key] = 0; in FN()
70 buckets[(key + (j << 3)) & BUCKET_MASK] = 0; in FN()
79 memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE); in FN()
155 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN() local
179 buckets[key] = (uint32_t)cur_ix; in FN()
194 prev_ix = buckets[key]; in FN()
195 buckets[key] = (uint32_t)cur_ix; in FN()
226 prev_ix = buckets[keys[i]]; in FN()
257 buckets[key_out] = (uint32_t)cur_ix; in FN()
|
| /third_party/libdrm/ |
| D | xf86drmHash.c | 126 for (bucket = table->buckets[i]; bucket;) { in drmHashDestroy()
148 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
153 bucket->next = table->buckets[hash]; in HashFind()
154 table->buckets[hash] = bucket; in HashFind()
194 bucket->next = table->buckets[hash]; in drmHashInsert()
195 table->buckets[hash] = bucket; in drmHashInsert()
211 table->buckets[hash] = bucket->next; in drmHashDelete()
227 table->p1 = table->buckets[table->p0]; in drmHashNext()
240 table->p1 = table->buckets[0]; in drmHashFirst()
|