Searched refs:buckets (Results 1 - 25 of 97) sorted by relevance

1234

/external/chromium-trace/catapult/telemetry/telemetry/value/
H A Dhistogram_util.py26 buckets = raw_value.get('buckets', [])
27 if buckets:
32 buckets[-1].setdefault('high', buckets[-1]['low'])
33 return buckets
75 histogram['buckets'] = new_buckets
91 buckets = collections.defaultdict(int)
95 buckets[key] += b['count']
97 buckets
[all...]
H A Dhistogram_util_unittest.py12 baseline_histogram = """{"count": 3, "buckets": [
16 later_histogram = """{"count": 14, "buckets": [
24 for b in new_histogram['buckets']:
33 histograms.append("""{"count": 3, "buckets": [
37 histograms.append("""{"count": 20, "buckets": [
41 histograms.append("""{"count": 15, "buckets": [
48 for b in new_histogram['buckets']:
56 raw_value = {'buckets': [
61 buckets = histogram_util.GetHistogramBucketsFromRawValue(raw_value)
66 buckets)
[all...]
H A Dhistogram.py44 self.buckets = []
46 self.buckets.append(HistogramValueBucket(
51 self.buckets = []
89 return '{"buckets": [%s]}' % (
90 ', '.join([b.ToJSONString() for b in self.buckets]))
106 d['buckets'] = [b.AsDict() for b in self.buckets]
/external/emma/core/java12/com/vladium/util/
H A DIntObjectMap.java48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
87 final Entry [] buckets = m_buckets;
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
112 final Entry [] buckets = m_buckets;
113 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
164 Entry [] buckets = m_buckets;
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
189 buckets
[all...]
H A DIntIntMap.java48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
87 final Entry [] buckets = m_buckets;
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
111 final Entry [] buckets = m_buckets;
112 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
130 final Entry [] buckets = m_buckets;
131 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
134 for (Entry entry = buckets [bucketInde
[all...]
H A DIntSet.java46 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
85 final Entry [] buckets = m_buckets;
86 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
145 Entry [] buckets = m_buckets;
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
161 buckets = m_buckets;
162 bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
163 final Entry bucketListHead = buckets [bucketIndex];
165 buckets [bucketInde
[all...]
H A DObjectIntMap.java50 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
91 final Entry [] buckets = m_buckets;
93 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length;
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
119 final Entry [] buckets = m_buckets;
121 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length;
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
171 Entry [] buckets = m_buckets;
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
193 buckets
[all...]
H A DSoftValueMap.java61 * @param initialCapacity initial number of hash buckets in the table
163 final SoftEntry [] buckets = m_buckets;
164 final int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
234 SoftEntry [] buckets = m_buckets;
235 int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
281 buckets = m_buckets;
282 bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
283 final SoftEntry bucketListHead = buckets [bucketInde
[all...]
/external/libvpx/libvpx/
H A Drate_hist.c126 int buckets = *num_buckets; local
129 /* Find the extrema for this list of buckets */
131 for (i = 0; i < buckets; i++) {
138 /* If we have too many buckets, merge the smallest with an adjacent
141 while (buckets > max_buckets) {
142 int last_bucket = buckets - 1;
155 assert(small_bucket < buckets);
156 assert(big_bucket < buckets);
157 assert(merge_bucket < buckets);
170 buckets
191 show_histogram(const struct hist_bucket *bucket, int buckets, int total, int scale) argument
252 int buckets = 0; local
274 int buckets = 0; local
[all...]
/external/chromium-trace/catapult/third_party/gsutil/gslib/tests/
H A Dmock_cloud_api.py117 """Simple mock service for buckets/objects that implements Cloud API.
123 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_objec
[all...]
/external/libdrm/
H A Dxf86drmHash.h44 HashBucketPtr buckets[HASH_SIZE]; member in struct:HashTable
H A Dxf86drmHash.c120 for (i = 0; i < HASH_SIZE; i++) table->buckets[i] = NULL;
134 for (bucket = table->buckets[i]; bucket;) {
156 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
161 bucket->next = table->buckets[hash];
162 table->buckets[hash] = bucket;
202 bucket->next = table->buckets[hash];
203 table->buckets[hash] = bucket;
222 table->buckets[hash] = bucket->next;
238 table->p1 = table->buckets[table->p0];
251 table->p1 = table->buckets[
[all...]
/external/mesa3d/src/mesa/program/
H A Dhash_table.c45 struct node buckets[1]; member in struct:hash_table
69 * sizeof(ht->buckets[0])));
76 make_empty_list(& ht->buckets[i]);
101 foreach_s(node, temp, & ht->buckets[i]) {
106 assert(is_empty_list(& ht->buckets[i]));
118 foreach(node, & ht->buckets[bucket]) {
149 insert_at_head(& ht->buckets[bucket], & node->link);
160 foreach(node, & ht->buckets[bucket]) {
174 insert_at_head(& ht->buckets[bucket], & hn->link);
200 foreach_s(node, temp, &ht->buckets[bucke
[all...]
/external/chromium-trace/catapult/telemetry/
H A Dcloud_storage36 """Returns a dict of all files and which buckets they're in."""
37 # Preprocessing: get the contents of all buckets.
103 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 i
[all...]
/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/
H A DCollectionUtils.java29 Map buckets = new HashMap();
33 List bucket = (List)buckets.get(key);
35 buckets.put(key, bucket = new LinkedList());
39 return buckets;
/external/webrtc/webrtc/base/
H A Drandom_unittest.cc33 // Sample a number of random integers of type T. Divide them into buckets
38 std::vector<int> buckets(bucket_count, 0);
51 // the number of buckets. If we are unlucky and hit one of the excluded
52 // numbers we just resample. Note that if the number of buckets is a
56 buckets[fdiv_remainder(sample, bucket_count)]++;
61 EXPECT_NEAR(buckets[i], samples / bucket_count,
117 std::vector<unsigned int> buckets(bucket_count, 0);
137 buckets[static_cast<uint32_t>(sample - low) / numbers_per_bucket]++;
144 EXPECT_NEAR(buckets[i], mean, sigma_level * sqrt(mean));
157 std::vector<unsigned int> buckets(bucket_coun
[all...]
/external/boringssl/src/crypto/lhash/
H A Dlhash.c65 /* kMinNumBuckets is the minimum size of the buckets array in an |_LHASH|. */
83 ret->buckets = OPENSSL_malloc(sizeof(LHASH_ITEM *) * ret->num_buckets);
84 if (ret->buckets == NULL) {
88 memset(ret->buckets, 0, sizeof(LHASH_ITEM *) * ret->num_buckets);
111 for (n = lh->buckets[i]; n != NULL; n = next) {
117 OPENSSL_free(lh->buckets);
126 * element of |lh->buckets|, otherwise it returns a pointer to the |next|
139 ret = &lh->buckets[hash % lh->num_buckets];
163 * redistributes the existing items into it before making it |lh->buckets| and
181 for (cur = lh->buckets[
[all...]
/external/libdrm/amdgpu/
H A Dutil_hash.c85 struct util_node **buckets; member in struct:util_hash_data
144 struct util_node **oldBuckets = hash->buckets;
150 hash->buckets = malloc(sizeof(struct util_node*) * hash->numBuckets);
152 hash->buckets[i] = e;
166 beforeFirstNode = &hash->buckets[h % hash->numBuckets];
196 struct util_node **bucket = hash->buckets;
211 node = (struct util_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]);
254 hash->data.d->buckets = 0;
267 struct util_node **bucket = (struct util_node **)(hash->data.d->buckets);
277 free(hash->data.d->buckets);
[all...]
/external/mesa3d/src/glx/
H A Dglxhash.c121 __glxHashBucketPtr buckets[HASH_SIZE]; member in struct:__glxHashTable
171 table->buckets[i] = NULL;
187 for (bucket = table->buckets[i]; bucket;) {
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
215 bucket->next = table->buckets[hash];
216 table->buckets[hash] = bucket;
264 bucket->next = table->buckets[hash];
265 table->buckets[hash] = bucket;
287 table->buckets[hash] = bucket->next;
304 table->p1 = table->buckets[tabl
[all...]
/external/pdfium/xfa/src/fxbarcode/common/
H A DBC_GlobalHistogramBinarizer.h24 static int32_t EstimateBlackPoint(CFX_Int32Array& buckets, int32_t& e);
H A DBC_GlobalHistogramBinarizer.cpp122 CFX_Int32Array& buckets,
124 int32_t numBuckets = buckets.GetSize();
130 if (buckets[x] > firstPeakSize) {
132 firstPeakSize = buckets[x];
134 if (buckets[x] > maxBucketCount) {
135 maxBucketCount = buckets[x];
142 int32_t score = buckets[x] * distanceToBiggest * distanceToBiggest;
162 (maxBucketCount - buckets[x]);
121 EstimateBlackPoint( CFX_Int32Array& buckets, int32_t& e) argument
/external/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_bufmgr_slab.c162 struct pb_manager **buckets; member in struct:pb_slab_range_manager
498 return mgr->buckets[i]->create_buffer(mgr->buckets[i], size, desc);
527 mgr->buckets[i]->destroy(mgr->buckets[i]);
528 FREE(mgr->buckets);
567 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets));
568 if (!mgr->buckets)
573 mgr->buckets[
[all...]
/external/freetype/src/cache/
H A Dftccache.c101 pnode = cache->buckets + idx;
109 * buckets array appropriately, we simply degrade the hash table's
120 FT_UFast count = mask + p + 1; /* number of buckets */
123 /* do we need to shrink the buckets array? */
129 /* try to expand the buckets array _before_ splitting
139 if ( FT_RENEW_ARRAY( cache->buckets,
145 pnode = cache->buckets + p;
163 cache->buckets[p + mask + 1] = new_list;
176 /* do we need to expand the buckets array? */
193 if ( FT_RENEW_ARRAY( cache->buckets,
[all...]
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cache/
H A Dftccache.c101 pnode = cache->buckets + idx;
109 * buckets array appropriately, we simply degrade the hash table's
120 FT_UFast count = mask + p + 1; /* number of buckets */
123 /* do we need to shrink the buckets array? */
129 /* try to expand the buckets array _before_ splitting
139 if ( FT_RENEW_ARRAY( cache->buckets,
145 pnode = cache->buckets + p;
163 cache->buckets[p + mask + 1] = new_list;
176 /* do we need to expand the buckets array? */
193 if ( FT_RENEW_ARRAY( cache->buckets,
[all...]
/external/mesa3d/src/gallium/auxiliary/cso_cache/
H A Dcso_hash.c82 struct cso_node **buckets; member in struct:cso_hash_data
141 struct cso_node **oldBuckets = hash->buckets;
147 hash->buckets = MALLOC(sizeof(struct cso_node*) * hash->numBuckets);
149 hash->buckets[i] = e;
163 beforeFirstNode = &hash->buckets[h % hash->numBuckets];
193 struct cso_node **bucket = hash->buckets;
208 node = (struct cso_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]);
251 hash->data.d->buckets = 0;
264 struct cso_node **bucket = (struct cso_node **)(hash->data.d->buckets);
274 FREE(hash->data.d->buckets);
[all...]

Completed in 689 milliseconds

1234