| /external/emma/core/java12/com/vladium/util/ |
| ObjectIntMap.java | 90 // index into the corresponding hash bucket:
95 // traverse the singly-linked list of entries in the bucket:
118 // index into the corresponding hash bucket:
123 // traverse the singly-linked list of entries in the bucket:
166 // index into the corresponding hash bucket:
170 // traverse the singly-linked list of entries in the bucket:
212 // index into the corresponding hash bucket:
216 // traverse the singly-linked list of entries in the bucket:
249 out.append ("size = " + m_size + ", bucket table size = " + m_buckets.length + ", load factor = " + m_loadFactor + EOL);
283 // and then with that value reduced to actually shrink capacity. As it is right now, the bucket table ca
[all...] |
| IntObjectMap.java | 86 // index into the corresponding hash bucket:
90 // traverse the singly-linked list of entries in the bucket:
111 // index into the corresponding hash bucket:
115 // traverse the singly-linked list of entries in the bucket:
160 // index into the corresponding hash bucket:
163 // traverse the singly-linked list of entries in the bucket:
211 out.append ("size = " + m_size + ", bucket table size = " + m_buckets.length + ", load factor = " + m_loadFactor + EOL);
245 // and then with that value reduced to actually shrink capacity. As it is right now, the bucket table can
253 // rehash all entry chains in every bucket:
261 // index into the corresponding new hash bucket
[all...] |
| IntSet.java | 84 // index into the corresponding hash bucket:
88 // traverse the singly-linked list of entries in the bucket:
141 // index into the corresponding hash bucket:
144 // traverse the singly-linked list of entries in the bucket:
185 out.append ("size = " + m_size + ", bucket table size = " + m_buckets.length + ", load factor = " + m_loadFactor + EOL);
217 // and then with that value reduced to actually shrink capacity. As it is right now, the bucket table can
225 // rehash all entry chains in every bucket:
233 // index into the corresponding new hash bucket:
|
| SoftValueMap.java | 161 // index into the corresponding hash bucket:
168 // traverse the singly-linked list of entries in the bucket:
232 // index into the corresponding hash bucket:
237 // traverse the singly-linked list of entries in the bucket:
280 // recompute the hash bucket index:
299 // index into the corresponding hash bucket:
306 // traverse the singly-linked list of entries in the bucket:
415 out.append ("size = " + m_size + ", bucket table size = " + m_buckets.length + ", load factor = " + m_loadFactor + EOL);
425 * An extension of WeakReference that can store an index of the bucket it
473 // and then with that value reduced to actually shrink capacity. As it is right now, the bucket table ca
[all...] |
| /external/stlport/test/unit/ |
| unordered_test.cpp | 93 lit = us.begin(us.bucket(i));
94 litEnd = us.end(us.bucket(i));
96 usettype::size_type bucket_pos = us.bucket(*lit);
98 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
137 lit = us.begin(us.bucket(i));
138 litEnd = us.end(us.bucket(i));
140 usettype::size_type bucket_pos = us.bucket(*lit);
142 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
207 lit = us.begin(us.bucket(i));
208 litEnd = us.end(us.bucket(i))
[all...] |
| /frameworks/base/sax/java/android/sax/ |
| Children.java | 36 // We have no children in this bucket yet.
41 // Search this bucket.
55 // Add a new child to the bucket.
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| unordered_test.cpp | 93 lit = us.begin(us.bucket(i));
94 litEnd = us.end(us.bucket(i));
96 usettype::size_type bucket_pos = us.bucket(*lit);
98 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
137 lit = us.begin(us.bucket(i));
138 litEnd = us.end(us.bucket(i));
140 usettype::size_type bucket_pos = us.bucket(*lit);
142 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
207 lit = us.begin(us.bucket(i));
208 litEnd = us.end(us.bucket(i))
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| unordered_test.cpp | 93 lit = us.begin(us.bucket(i));
94 litEnd = us.end(us.bucket(i));
96 usettype::size_type bucket_pos = us.bucket(*lit);
98 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
137 lit = us.begin(us.bucket(i));
138 litEnd = us.end(us.bucket(i));
140 usettype::size_type bucket_pos = us.bucket(*lit);
142 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
207 lit = us.begin(us.bucket(i));
208 litEnd = us.end(us.bucket(i))
[all...] |
| /external/chromium/net/base/ |
| ssl_false_start_blacklist.h | 82 // kHashTable contains an offset into |kHashData| for each bucket. The
86 // into this array. Each bucket consists of zero or more, 8-bit length
89 // assign a string to a hash bucket, the last two labels (not including the
90 // root label) are hashed. Thus, the bucket for "www.example.com" is
|
| connection_type_histograms.cc | 21 // Each histogram has an unused bucket at the end to allow seamless future
|
| /external/valgrind/main/perf/ |
| heap.c | 27 // 8, so the 8B bucket will get twice as much traffic.
|
| /frameworks/base/core/java/com/android/internal/util/ |
| ArrayUtils.java | 107 int bucket = ((System.identityHashCode(kind) / 8) & 0x7FFFFFFF) % CACHE_SIZE; local
108 Object cache = sCache[bucket];
112 sCache[bucket] = cache;
114 // Log.e("cache", "new empty " + kind.getName() + " at " + bucket);
|
| /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/util/ |
| ArrayUtils.java | 107 int bucket = ((System.identityHashCode(kind) / 8) & 0x7FFFFFFF) % CACHE_SIZE; local
108 Object cache = sCache[bucket];
112 sCache[bucket] = cache;
114 // Log.e("cache", "new empty " + kind.getName() + " at " + bucket);
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/power/ |
| PowerUI.java | 84 * the bucket going up when the battery level was going down. --joeo
125 int bucket = findBatteryLevelBucket(mBatteryLevel);
135 Slog.d(TAG, "bucket " + oldBucket + " --> " + bucket);
151 && (bucket < oldBucket || oldPlugged)
153 && bucket < 0) {
156 // only play SFX when the dialog comes up or the bucket changes
157 if (bucket != oldBucket || oldPlugged) {
160 } else if (plugged || (bucket > oldBucket && bucket > 0))
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/video/fbcon/ |
| SDL_fbvideo.h | 161 vidmem_bucket *bucket; local
167 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
168 bucket->dirty = 0;
|
| /external/qemu/ |
| qdict.c | 110 const char *key, unsigned int bucket)
114 QLIST_FOREACH(entry, &qdict->table[bucket], next)
134 unsigned int bucket; local
137 bucket = tdb_hash(key) % QDICT_BUCKET_MAX;
138 entry = qdict_find(qdict, key, bucket);
146 QLIST_INSERT_HEAD(&qdict->table[bucket], entry, next);
172 unsigned int bucket = tdb_hash(key) % QDICT_BUCKET_MAX; local
173 return (qdict_find(qdict, key, bucket) == NULL ? 0 : 1);
396 unsigned int bucket = tdb_hash(entry->key) % QDICT_BUCKET_MAX; local
397 ret = qdict_next_entry(qdict, bucket + 1)
[all...] |
| /docs/source.android.com/src/source/ |
| life-of-a-bug.md | 41 1. Each bucket includes a number of states that provide more detail on the
44 1. Bugs in the "Resolved" bucket will eventually be included in a future
47 # Bucket Details #
49 Here is some additional information on each bucket, what it means, and how
69 This bucket contains bugs that need action, but which are still
104 This bucket contains bugs that have for one reason or another been
135 This bucket contains bugs that have had action taken, and are now
|
| /libcore/luni/src/main/native/ |
| org_apache_harmony_xml_ExpatParser.cpp | 116 InternedString** bucket = internedStrings[i]; local
118 while ((current = *(bucket++)) != NULL) {
122 // Free the bucket.
290 * Allocates a new bucket with one entry.
292 * @param entry to store in the bucket
293 * @returns a reference to the bucket
296 InternedString** bucket = new InternedString*[2]; local
297 if (bucket != NULL) {
298 bucket[0] = entry;
299 bucket[1] = NULL
360 InternedString** bucket = buckets[bucketIndex]; local
[all...] |
| /external/iproute2/man/man8/ |
| tc-sfq.8 | 25 On enqueueing, each packet is assigned to a hash bucket, based on
42 get hashed to the same bucket, the hashing algorithm is perturbed at configurable
50 on the fullest bucket, thus maintaining fairness.
|
| /external/opencv/cvaux/src/ |
| cvfindhandregion.cpp | 49 flag = 0 (use left bucket) flag = 1 (use right bucket)
169 /* compute the length of one bucket */
173 /* compute the number of points in each bucket */
192 /* find the leftmost bucket */
207 /* find the rightmost bucket */
264 flag = 0 (use left bucket) flag = 1 (use right bucket)
446 /* compute the length of one bucket along the line */
459 /* compute the number of points in each bucket along the line *
[all...] |
| /external/bluetooth/glib/glib/ |
| gconvert.c | 267 * Creates a new cache bucket, inserts it into the cache and
272 * Returns a pointer to the newly allocated cache bucket.
277 struct _iconv_cache_bucket *bucket; local
279 bucket = g_new (struct _iconv_cache_bucket, 1);
280 bucket->key = key;
281 bucket->refcount = 1;
282 bucket->used = TRUE;
283 bucket->cd = cd;
285 g_hash_table_insert (iconv_cache, bucket->key, bucket);
351 struct _iconv_cache_bucket *bucket; local
372 struct _iconv_cache_bucket *bucket; local
469 struct _iconv_cache_bucket *bucket; local
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DenseMap.h | 286 // The later case is tricky. For example, if we had one empty bucket with
288 // probe almost the entire table until it found the empty bucket. If the
320 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
321 /// FoundBucket. If the bucket contains the key and a value, this returns
322 /// true, otherwise it returns a bucket with an empty marker or tombstone and
344 // Found Val's bucket? If so, return it.
350 // If we found an empty bucket, the key doesn't exist in the set.
354 // of the empty bucket we eventually probed to.
483 typedef std::pair<KeyT, ValueT> Bucket;
489 typedef typename conditional<IsConst, const Bucket, Bucket>::type value_type
[all...] |
| FoldingSet.h | 31 /// it, otherwise return the bucket it should be inserted into.
36 /// node). The last node points back to the bucket to simplify node removal.
106 /// structure is an array of buckets. Each bucket is indexed by the hash of
107 /// the nodes it contains. The bucket itself points to the nodes contained
108 /// in the bucket via a singly linked list. The last node in the list points
109 /// back to the bucket to facilitate node removal.
113 /// Buckets - Array of bucket chains.
130 /// Node - This class is used to maintain the singly linked bucket list in
135 // NextInFoldingSetBucket - next link in the bucket list.
526 FoldingSetIteratorImpl(void **Bucket);
[all...] |
| /external/chromium/chrome/browser/ |
| oom_priority_manager.h | 25 // (see BUCKET_INTERVAL_MINUTES in the source) so that we can bucket
|
| /external/chromium/chrome/browser/ui/webui/ |
| app_launcher_handler.h | 93 // Records an app launch in the corresponding |bucket| of the app launch
96 extension_misc::AppLaunchBucket bucket);
98 // Records an app launch in the corresponding |bucket| of the app launch
102 extension_misc::AppLaunchBucket bucket);
|
