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

1234

/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/
H A Dbisect_test_ordering.py62 self.buckets = [Bucket([self.expected_failure])]
69 # Split the list of test into buckets. Each bucket has at least one test required to cause
70 # the expected failure at the end. Split buckets in half until there are only buckets left
72 self.buckets = [Bucket(self.tests[:-1]), Bucket([self.expected_failure])]
87 if self.test_bucket_list_fails(self.buckets):
93 for bucket in self.buckets:
95 print '%d tests left, %d buckets' % (count, len(self.buckets))
99 for bucket in self.buckets
[all...]
/external/qemu/android/utils/
H A Drefset.h22 AVECTOR_DECL(void*,buckets);
29 AVECTOR_INIT(s,buckets);
35 AVECTOR_DONE(s,buckets);
41 AVECTOR_CLEAR(s,buckets);
48 return (int) AVECTOR_SIZE(s,buckets);
65 void* __refset_item = (_set)->buckets[__refset_nn]; \
H A Drefset.c36 void** pnode = &s->buckets[index];
55 void** pnode = &s->buckets[index];
90 AVECTOR_INIT_ALLOC(&newSet,buckets, newSize);
93 void* item = s->buckets[nn];
100 AVECTOR_DONE(s,buckets);
101 s->buckets = newSet.buckets;
118 AVECTOR_INIT_ALLOC(s,buckets,4);
165 if (s->buckets[nn] == AREFSET_DELETED) {
166 s->buckets[n
[all...]
/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/chromium_org/tools/deep_memory_profiler/subcommands/
H A D__init__.py5 from subcommands.buckets import BucketsCommand
/external/chromium_org/third_party/mesa/src/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/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_org/tools/telemetry/telemetry/value/
H A Dhistogram.py29 assert 'buckets' in raw_value
30 assert isinstance(raw_value['buckets'], list)
31 self.buckets = []
32 for bucket in raw_value['buckets']:
33 self.buckets.append(HistogramValueBucket(
38 self.buckets = []
70 return '{"buckets": [%s]}' % (
71 ', '.join([b.ToJSONString() for b in self.buckets]))
/external/chromium_org/chrome/browser/extensions/api/metrics_private/
H A Dmetrics_private_api.cc42 // buckets; there is no real need for them
116 int min, int max, size_t buckets,
122 buckets = std::min(buckets, kMaxBuckets);
126 buckets = std::max(buckets, static_cast<size_t>(3));
127 // Trim buckets down to a maximum of the given range + over/underflow buckets
128 if (buckets > static_cast<size_t>(max - min + 2))
129 buckets
113 RecordValue( const std::string& name, base::HistogramType type, int min, int max, size_t buckets, int sample) argument
[all...]
/external/chromium/chrome/browser/extensions/
H A Dextension_metrics_module.cc75 size_t buckets,
83 buckets,
89 buckets,
109 int buckets; local
114 EXTENSION_FUNCTION_VALIDATE(metric_type->GetInteger("buckets", &buckets));
118 return RecordValue(name, histogram_type, min, max, buckets, sample);
71 RecordValue(const std::string& name, Histogram::ClassType type, int min, int max, size_t buckets, int sample) argument
/external/chromium_org/extensions/browser/
H A Dquota_service.cc112 BucketList* buckets) {
113 buckets->push_back(&bucket_);
125 BucketList buckets; local
126 bucket_mapper_->GetBucketsForArgs(args, &buckets);
127 for (BucketList::iterator i = buckets.begin(); i != buckets.end(); ++i) {
110 GetBucketsForArgs( const base::ListValue* args, BucketList* buckets) argument
/external/guava/guava/src/com/google/common/hash/
H A DHashing.java159 * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform
160 * manner that minimizes the need for remapping as {@code buckets} grows. That is,
171 public static int consistentHash(HashCode hashCode, int buckets) { argument
172 return consistentHash(padToLong(hashCode), buckets);
176 * Assigns to {@code input} a "bucket" in the range {@code [0, buckets)}, in a uniform
177 * manner that minimizes the need for remapping as {@code buckets} grows. That is,
188 public static int consistentHash(long input, int buckets) { argument
189 checkArgument(buckets > 0, "buckets must be positive: %s", buckets);
[all...]
/external/chromium_org/third_party/mesa/src/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/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/chromium_org/third_party/mesa/src/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/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/smack/src/org/jivesoftware/smack/util/
H A DDNSUtil.java165 // create the priority buckets
166 SortedMap<Integer, List<SRVRecord>> buckets = new TreeMap<Integer, List<SRVRecord>>();
169 List<SRVRecord> bucket = buckets.get(priority);
173 buckets.put(priority, bucket);
180 for (Integer priority : buckets.keySet()) {
181 List<SRVRecord> bucket = buckets.get(priority);
/external/chromium_org/courgette/third_party/
H A Dbsdiff_create.cc117 int buckets[256]; local
120 for(i=0;i<256;i++) buckets[i]=0;
121 for(i=0;i<oldsize;i++) buckets[old[i]]++;
122 for(i=1;i<256;i++) buckets[i]+=buckets[i-1];
123 for(i=255;i>0;i--) buckets[i]=buckets[i-1];
124 buckets[0]=0;
126 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
128 for(i=0;i<oldsize;i++) V[i]=buckets[ol
[all...]
/external/chromium_org/third_party/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/chromium_org/third_party/mesa/src/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...]
/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...]

Completed in 805 milliseconds

1234