Home
last modified time | relevance | path

Searched refs:buckets (Results 1 – 25 of 104) sorted by relevance

12345

/external/emma/core/java12/com/vladium/util/
DIntIntMap.java87 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()
178 Entry [] buckets = m_buckets; in put() local
[all …]
DObjectIntMap.java91 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()
194 bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length; in put()
[all …]
DIntObjectMap.java87 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()
190 bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in put()
[all …]
DSoftValueMap.java163 final SoftEntry [] buckets = m_buckets; in get() local
164 final int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length; in get()
169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
234 SoftEntry [] buckets = m_buckets; in put() local
235 int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length; in put()
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
281 buckets = m_buckets; in put()
282 bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length; in put()
283 final SoftEntry bucketListHead = buckets [bucketIndex]; in put()
285 buckets [bucketIndex] = newEntry; in put()
[all …]
DIntSet.java85 final Entry [] buckets = m_buckets; in contains() local
86 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in contains()
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
145 Entry [] buckets = m_buckets; in add() local
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in add()
161 buckets = m_buckets; in add()
162 bucketIndex = (key & 0x7FFFFFFF) % buckets.length; in add()
163 final Entry bucketListHead = buckets [bucketIndex]; in add()
165 buckets [bucketIndex] = newEntry; in add()
220 final Entry [] buckets = m_buckets; in rehash() local
[all …]
/external/libvpx/libvpx/
Drate_hist.c126 int buckets = *num_buckets; in merge_hist_buckets() local
131 for (i = 0; i < buckets; i++) { in merge_hist_buckets()
141 while (buckets > max_buckets) { in merge_hist_buckets()
142 int last_bucket = buckets - 1; in merge_hist_buckets()
155 assert(small_bucket < buckets); in merge_hist_buckets()
156 assert(big_bucket < buckets); in merge_hist_buckets()
157 assert(merge_bucket < buckets); in merge_hist_buckets()
170 buckets--; in merge_hist_buckets()
176 for (i = 0; i < buckets; i++) { in merge_hist_buckets()
187 *num_buckets = buckets; in merge_hist_buckets()
[all …]
/external/chromium-trace/catapult/telemetry/telemetry/value/
Dhistogram_util.py26 buckets = raw_value.get('buckets', [])
27 if buckets:
32 buckets[-1].setdefault('high', buckets[-1]['low'])
33 return buckets
91 buckets = collections.defaultdict(int)
95 buckets[key] += b['count']
97 buckets = [{'low': key[0], 'high': key[1], 'count': value}
98 for key, value in buckets.iteritems()]
99 buckets.sort(key=lambda h: h['low'])
102 result_histogram['buckets'] = buckets
Dhistogram_util_unittest.py61 buckets = histogram_util.GetHistogramBucketsFromRawValue(raw_value)
66 buckets)
75 buckets = histogram_util.GetHistogramBucketsFromJson(json_value)
80 buckets)
/external/chromium-trace/catapult/telemetry/
Dcloud_storage103 for file_path, buckets in sorted(files.iteritems()):
104 if buckets:
105 buckets = [BUCKETS[bucket] for bucket in buckets]
106 print '%-11s %s' % (','.join(buckets), file_path)
126 for file_path, buckets in sorted(files.iteritems()):
127 if not buckets:
130 for file_path, buckets in sorted(files.iteritems()):
131 if args.bucket in buckets:
132 buckets.remove(args.bucket)
133 if not buckets:
[all …]
/external/chromium-trace/catapult/third_party/gsutil/gslib/tests/
Dmock_cloud_api.py123 self.buckets = {}
128 if bucket_name in self.buckets:
131 self.buckets[bucket_name] = MockBucket(bucket_name)
135 if bucket_name in self.buckets:
138 self.buckets[bucket_name] = MockBucket(bucket_name, versioned=True)
142 if bucket_name not in self.buckets:
144 self.buckets[bucket_name].CreateObject(object_name, contents=contents)
150 if apitools_object.bucket not in self.buckets:
152 return self.buckets[apitools_object.bucket].CreateObjectWithMetadata(
161 if bucket_name in self.buckets:
[all …]
/external/webrtc/webrtc/base/
Drandom_unittest.cc38 std::vector<int> buckets(bucket_count, 0); in UniformBucketTest() local
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
177 buckets[static_cast<uint32_t>(sample - low) / numbers_per_bucket]++; in BucketTestUnsignedInterval()
184 EXPECT_NEAR(buckets[i], mean, sigma_level * sqrt(mean)); in BucketTestUnsignedInterval()
223 std::vector<unsigned int> buckets(bucket_count, 0); in BucketTestFloat() local
[all …]
/external/mesa3d/src/mesa/program/
Dhash_table.c45 struct node buckets[1]; member
69 * sizeof(ht->buckets[0]))); in hash_table_ctor()
76 make_empty_list(& ht->buckets[i]); in hash_table_ctor()
101 foreach_s(node, temp, & ht->buckets[i]) { in hash_table_clear()
106 assert(is_empty_list(& ht->buckets[i])); in hash_table_clear()
118 foreach(node, & ht->buckets[bucket]) { in get_node()
149 insert_at_head(& ht->buckets[bucket], & node->link); in hash_table_insert()
160 foreach(node, & ht->buckets[bucket]) { in hash_table_replace()
174 insert_at_head(& ht->buckets[bucket], & hn->link); in hash_table_replace()
200 foreach_s(node, temp, &ht->buckets[bucket]) { in hash_table_call_foreach()
/external/libdrm/
Dxf86drmHash.c120 for (i = 0; i < HASH_SIZE; i++) table->buckets[i] = NULL; in drmHashCreate()
134 for (bucket = table->buckets[i]; bucket;) { in drmHashDestroy()
156 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
161 bucket->next = table->buckets[hash]; in HashFind()
162 table->buckets[hash] = bucket; in HashFind()
202 bucket->next = table->buckets[hash]; in drmHashInsert()
203 table->buckets[hash] = bucket; in drmHashInsert()
222 table->buckets[hash] = bucket->next; in drmHashDelete()
238 table->p1 = table->buckets[table->p0]; in drmHashNext()
251 table->p1 = table->buckets[0]; in drmHashFirst()
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/
DAlphabeticIndex.java153 private BucketList<V> buckets; field in AlphabeticIndex
170 private final BucketList<V> buckets; field in AlphabeticIndex.ImmutableIndex
174 this.buckets = bucketList; in ImmutableIndex()
185 return buckets.getBucketCount(); in getBucketCount()
197 return buckets.getBucketIndex(name, collatorPrimaryOnly); in getBucketIndex()
208 if (0 <= index && index < buckets.getBucketCount()) { in getBucket()
209 return buckets.immutableVisibleList.get(index); in getBucket()
220 return buckets.iterator(); in iterator()
308 buckets = null; in addLabels()
322 buckets = null; in addLabels()
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/text/
DAlphabeticIndex.java153 private BucketList<V> buckets; field in AlphabeticIndex
169 private final BucketList<V> buckets; field in AlphabeticIndex.ImmutableIndex
173 this.buckets = bucketList; in ImmutableIndex()
183 return buckets.getBucketCount(); in getBucketCount()
194 return buckets.getBucketIndex(name, collatorPrimaryOnly); in getBucketIndex()
204 if (0 <= index && index < buckets.getBucketCount()) { in getBucket()
205 return buckets.immutableVisibleList.get(index); in getBucket()
215 return buckets.iterator(); in iterator()
299 buckets = null; in addLabels()
312 buckets = null; in addLabels()
[all …]
/external/boringssl/src/crypto/lhash/
Dlhash.c83 ret->buckets = OPENSSL_malloc(sizeof(LHASH_ITEM *) * ret->num_buckets); in lh_new()
84 if (ret->buckets == NULL) { in lh_new()
88 memset(ret->buckets, 0, sizeof(LHASH_ITEM *) * ret->num_buckets); in lh_new()
111 for (n = lh->buckets[i]; n != NULL; n = next) { in lh_free()
117 OPENSSL_free(lh->buckets); in lh_free()
139 ret = &lh->buckets[hash % lh->num_buckets]; in get_next_ptr_and_hash()
181 for (cur = lh->buckets[i]; cur != NULL; cur = next) { in lh_rebucket()
189 OPENSSL_free(lh->buckets); in lh_rebucket()
192 lh->buckets = new_buckets; in lh_rebucket()
293 for (cur = lh->buckets[i]; cur != NULL; cur = next) { in lh_doall_internal()
/external/mesa3d/src/gallium/auxiliary/pipebuffer/
Dpb_bufmgr_slab.c162 struct pb_manager **buckets; member
498 return mgr->buckets[i]->create_buffer(mgr->buckets[i], size, desc); in pb_slab_range_manager_create_buffer()
527 mgr->buckets[i]->destroy(mgr->buckets[i]); in pb_slab_range_manager_destroy()
528 FREE(mgr->buckets); in pb_slab_range_manager_destroy()
567 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets)); in pb_slab_range_manager_create()
568 if (!mgr->buckets) in pb_slab_range_manager_create()
573 mgr->buckets[i] = pb_slab_manager_create(provider, bufSize, slabSize, desc); in pb_slab_range_manager_create()
574 if(!mgr->buckets[i]) in pb_slab_range_manager_create()
583 if(mgr->buckets[i]) in pb_slab_range_manager_create()
584 mgr->buckets[i]->destroy(mgr->buckets[i]); in pb_slab_range_manager_create()
[all …]
/external/freetype/src/cache/
Dftccache.c101 pnode = cache->buckets + idx; in ftc_get_top_node_for_hash()
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()
193 if ( FT_RENEW_ARRAY( cache->buckets, in ftc_cache_resize()
203 pnode = cache->buckets + p; in ftc_cache_resize()
207 pold = cache->buckets + old_index; in ftc_cache_resize()
345 (void)FT_NEW_ARRAY( cache->buckets, FTC_HASH_INITIAL_SIZE * 2 ); in ftc_cache_init()
353 if ( cache && cache->buckets ) in FTC_Cache_Clear()
364 FTC_Node *pnode = cache->buckets + i, next, node = *pnode; in FTC_Cache_Clear()
[all …]
/external/libdrm/amdgpu/
Dutil_hash.c85 struct util_node **buckets; member
144 struct util_node **oldBuckets = hash->buckets; in util_data_rehash()
150 hash->buckets = malloc(sizeof(struct util_node*) * hash->numBuckets); in util_data_rehash()
152 hash->buckets[i] = e; in util_data_rehash()
166 beforeFirstNode = &hash->buckets[h % hash->numBuckets]; in util_data_rehash()
196 struct util_node **bucket = hash->buckets; in util_data_first_node()
211 node = (struct util_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]); in util_hash_find_node()
254 hash->data.d->buckets = 0; in util_hash_create()
267 struct util_node **bucket = (struct util_node **)(hash->data.d->buckets); in util_hash_delete()
277 free(hash->data.d->buckets); in util_hash_delete()
[all …]
/external/mesa3d/src/glx/
Dglxhash.c121 __glxHashBucketPtr buckets[HASH_SIZE]; member
171 table->buckets[i] = NULL; in __glxHashCreate()
187 for (bucket = table->buckets[i]; bucket;) { in __glxHashDestroy()
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
215 bucket->next = table->buckets[hash]; in HashFind()
216 table->buckets[hash] = bucket; in HashFind()
264 bucket->next = table->buckets[hash]; in __glxHashInsert()
265 table->buckets[hash] = bucket; in __glxHashInsert()
287 table->buckets[hash] = bucket->next; in __glxHashDelete()
304 table->p1 = table->buckets[table->p0]; in __glxHashNext()
[all …]
/external/skia/infra/project-config/
Dcr-buildbucket.cfg1 # 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 {
/external/pdfium/xfa/src/fxbarcode/common/
DBC_GlobalHistogramBinarizer.cpp122 CFX_Int32Array& buckets, in EstimateBlackPoint() argument
124 int32_t numBuckets = buckets.GetSize(); in EstimateBlackPoint()
130 if (buckets[x] > firstPeakSize) { in EstimateBlackPoint()
132 firstPeakSize = buckets[x]; in EstimateBlackPoint()
134 if (buckets[x] > maxBucketCount) { in EstimateBlackPoint()
135 maxBucketCount = buckets[x]; in EstimateBlackPoint()
142 int32_t score = buckets[x] * distanceToBiggest * distanceToBiggest; in EstimateBlackPoint()
162 (maxBucketCount - buckets[x]); in EstimateBlackPoint()
/external/mesa3d/src/gallium/auxiliary/cso_cache/
Dcso_hash.c82 struct cso_node **buckets; member
141 struct cso_node **oldBuckets = hash->buckets; in cso_data_rehash()
147 hash->buckets = MALLOC(sizeof(struct cso_node*) * hash->numBuckets); in cso_data_rehash()
149 hash->buckets[i] = e; in cso_data_rehash()
163 beforeFirstNode = &hash->buckets[h % hash->numBuckets]; in cso_data_rehash()
193 struct cso_node **bucket = hash->buckets; in cso_data_first_node()
208 node = (struct cso_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]); in cso_hash_find_node()
251 hash->data.d->buckets = 0; in cso_hash_create()
264 struct cso_node **bucket = (struct cso_node **)(hash->data.d->buckets); in cso_hash_delete()
274 FREE(hash->data.d->buckets); in cso_hash_delete()
[all …]
/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/
DEmitUtils.java193 final Map buckets = CollectionUtils.bucket(Arrays.asList(strings), new Transformer() { in string_switch_trie() local
200 e.process_switch(getSwitchKeys(buckets), new ProcessSwitchCallback() { in string_switch_trie()
202 List bucket = (List)buckets.get(new Integer(key)); in string_switch_trie()
222 final Map buckets = CollectionUtils.bucket(strings, new Transformer() { in stringSwitchHelper() local
230 e.process_switch(getSwitchKeys(buckets), new ProcessSwitchCallback() { in stringSwitchHelper()
232 List bucket = (List)buckets.get(new Integer(key)); in stringSwitchHelper()
246 static int[] getSwitchKeys(Map buckets) { in getSwitchKeys() argument
247 int[] keys = new int[buckets.size()]; in getSwitchKeys()
249 for (Iterator it = buckets.keySet().iterator(); it.hasNext();) { in getSwitchKeys()
260 final Map buckets = CollectionUtils.bucket(Arrays.asList(strings), new Transformer() { in string_switch_hash() local
[all …]
/external/libunwind/src/ia64/
DGscript.c87 cache->buckets[i].lru_chain = (i - 1); in flush_script_cache()
88 cache->buckets[i].coll_chain = -1; in flush_script_cache()
89 cache->buckets[i].ip = 0; in flush_script_cache()
154 struct ia64_script *script = cache->buckets + c->hint; in script_lookup()
168 script = cache->buckets + index; in script_lookup()
174 c->hint = cache->buckets[c->prev_script].hint = in script_lookup()
175 (script - cache->buckets); in script_lookup()
180 script = cache->buckets + script->coll_chain; in script_lookup()
201 script = cache->buckets + head; in script_new()
205 cache->buckets[cache->lru_tail].lru_chain = head; in script_new()
[all …]

12345