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

12345

/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.h25 AVECTOR_DECL(void*,buckets);
32 AVECTOR_INIT(s,buckets);
38 AVECTOR_DONE(s,buckets);
44 AVECTOR_CLEAR(s,buckets);
51 return (int) AVECTOR_SIZE(s,buckets);
68 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/third_party/libvpx/source/libvpx/
H A Drate_hist.c123 int buckets = *num_buckets; local
126 /* Find the extrema for this list of buckets */
128 for (i = 0; i < buckets; i++) {
135 /* If we have too many buckets, merge the smallest with an adjacent
138 while (buckets > max_buckets) {
139 int last_bucket = buckets - 1;
152 assert(small_bucket < buckets);
153 assert(big_bucket < buckets);
154 assert(merge_bucket < buckets);
167 buckets
188 show_histogram(const struct hist_bucket *bucket, int buckets, int total, int scale) argument
249 int buckets = 0; local
271 int buckets = 0; local
[all...]
/external/chromium_org/tools/telemetry/telemetry/value/
H A Dhistogram_util.py32 if 'buckets' not in start_histogram:
43 for b in start_histogram['buckets']:
47 for b in histogram['buckets']:
57 histogram['buckets'] = new_buckets
73 buckets = collections.defaultdict(int)
76 for b in h['buckets']:
78 buckets[key] += b['count']
80 buckets = [{'low': key[0], 'high': key[1], 'count': value}
81 for key, value in buckets.iteritems()]
82 buckets
[all...]
H A Dhistogram.py40 assert 'buckets' in raw_value
41 assert isinstance(raw_value['buckets'], list)
42 self.buckets = []
43 for bucket in raw_value['buckets']:
44 self.buckets.append(HistogramValueBucket(
49 self.buckets = []
83 return '{"buckets": [%s]}' % (
84 ', '.join([b.ToJSONString() for b in self.buckets]))
100 d['buckets'] = [b.AsDict() for b in self.buckets]
[all...]
/external/libvpx/libvpx/
H A Drate_hist.c123 int buckets = *num_buckets; local
126 /* Find the extrema for this list of buckets */
128 for (i = 0; i < buckets; i++) {
135 /* If we have too many buckets, merge the smallest with an adjacent
138 while (buckets > max_buckets) {
139 int last_bucket = buckets - 1;
152 assert(small_bucket < buckets);
153 assert(big_bucket < buckets);
154 assert(merge_bucket < buckets);
167 buckets
188 show_histogram(const struct hist_bucket *bucket, int buckets, int total, int scale) argument
249 int buckets = 0; local
271 int buckets = 0; local
[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/
H A Dcloud_storage32 """Returns a dict of all files and which buckets they're in."""
33 # Preprocessing: get the contents of all buckets.
100 for file_path, buckets in sorted(files.iteritems()):
101 if buckets:
102 buckets = [BUCKETS[bucket] for bucket in buckets]
103 print '%-11s %s' % (','.join(buckets), file_path)
123 for file_path, buckets in sorted(files.iteritems()):
124 if not buckets:
127 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/chromium_org/components/omnibox/
H A Domnibox_field_trial_unittest.cc353 ASSERT_EQ(3u, scoring_params.typed_count_buckets.buckets().size());
355 scoring_params.typed_count_buckets.buckets()[0]);
357 scoring_params.typed_count_buckets.buckets()[1]);
359 scoring_params.typed_count_buckets.buckets()[2]);
362 ASSERT_EQ(2u, scoring_params.visited_count_buckets.buckets().size());
364 scoring_params.visited_count_buckets.buckets()[0]);
366 scoring_params.visited_count_buckets.buckets()[1]);
370 HUPScoringParams::ScoreBuckets buckets; local
373 EXPECT_EQ(1.0, buckets.HalfLifeTimeDecay(base::TimeDelta::FromDays(7)));
375 buckets
[all...]
/external/chromium_org/chrome/browser/extensions/api/metrics_private/
H A Dmetrics_private_api.cc38 // buckets; there is no real need for them
81 int min, int max, size_t buckets,
87 buckets = std::min(buckets, kMaxBuckets);
91 buckets = std::max(buckets, static_cast<size_t>(3));
92 // Trim buckets down to a maximum of the given range + over/underflow buckets
93 if (buckets > static_cast<size_t>(max - min + 2))
94 buckets
78 RecordValue( const std::string& name, base::HistogramType type, int min, int max, size_t buckets, int sample) argument
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/lhash/
H A Dlhash.c63 /* kMinNumBuckets is the minimum size of the buckets array in an |_LHASH|. */
81 ret->buckets = OPENSSL_malloc(sizeof(LHASH_ITEM *) * ret->num_buckets);
82 if (ret->buckets == NULL) {
86 memset(ret->buckets, 0, sizeof(LHASH_ITEM *) * ret->num_buckets);
109 for (n = lh->buckets[i]; n != NULL; n = next) {
115 OPENSSL_free(lh->buckets);
124 * element of |lh->buckets|, otherwise it returns a pointer to the |next|
137 ret = &lh->buckets[hash % lh->num_buckets];
161 * redistributes the existing items into it before making it |lh->buckets| and
179 for (cur = lh->buckets[
[all...]
/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...]

Completed in 853 milliseconds

12345