| /prebuilts/gradle-plugin/com/android/tools/analytics-library/tracker/25.3.0-beta2/ |
| tracker-25.3.0-beta2.jar | |
| /art/test/099-vmdebug/src/ |
| Main.java | 150 String bucket = buckets[i]; local
151 if (bucket.length() == 0) {
152 System.out.println("Got empty bucket");
155 String[] kv = bucket.split(":");
157 System.out.println("Got bad bucket " + bucket);
163 System.out.println("Got negative key or value " + bucket);
167 System.out.println("Got decreasing key " + bucket);
176 // least one bucket in the histograms.
202 // least one bucket in the histograms
[all...] |
| /external/emma/core/java12/com/vladium/util/ |
| 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...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| AlphabeticIndexTest.java | 32 import android.icu.text.AlphabeticIndex.Bucket;
33 import android.icu.text.AlphabeticIndex.Bucket.LabelType;
228 Bucket<Integer> bucket = find(alphabeticIndex, probe); local
229 assertEquals("locale " + test[0] + " name=" + probe + " in bucket",
230 expectedLabel, bucket.getLabel());
234 private Bucket<Integer> find(AlphabeticIndex<Integer> alphabeticIndex, final String probe) {
235 for (Bucket<Integer> bucket : alphabeticIndex) {
236 for (Record<Integer> record : bucket) {
497 Set<R4<RawCollationKey, String, Integer, Double>> bucket = myBucketContents.get(i); local
1019 Bucket<Integer> bucket = index.iterator().next(); local
[all...] |
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| AlphabeticIndexTest.java | 31 import com.ibm.icu.text.AlphabeticIndex.Bucket;
32 import com.ibm.icu.text.AlphabeticIndex.Bucket.LabelType;
227 Bucket<Integer> bucket = find(alphabeticIndex, probe); local
228 assertEquals("locale " + test[0] + " name=" + probe + " in bucket",
229 expectedLabel, bucket.getLabel());
233 private Bucket<Integer> find(AlphabeticIndex<Integer> alphabeticIndex, final String probe) {
234 for (Bucket<Integer> bucket : alphabeticIndex) {
235 for (Record<Integer> record : bucket) {
496 Set<R4<RawCollationKey, String, Integer, Double>> bucket = myBucketContents.get(i); local
1018 Bucket<Integer> bucket = index.iterator().next(); local
[all...] |
| /external/mesa3d/src/gallium/drivers/svga/ |
| svga_screen_cache.c | 77 * Compute the bucket for this key.
100 unsigned bucket; local
105 bucket = svga_screen_cache_bucket(key);
109 curr = cache->bucket[bucket].next;
111 while (curr != &cache->bucket[bucket]) {
151 debug_printf("%s: cache %s after %u tries (bucket %d)\n", __FUNCTION__,
152 handle ? "hit" : "miss", tries, bucket);
304 unsigned bucket; local
[all...] |
| /external/libdrm/tests/ |
| hash.c | 87 static int count_entries(HashBucketPtr bucket)
91 for (; bucket; bucket = bucket->next)
107 HashBucketPtr bucket; local
113 bucket = table->buckets[i];
114 update_dist(count_entries(bucket));
|
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| hashtable.h | 86 * which govern the bucket count. _M_next_bkt(n) returns a bucket
88 * bucket count appropriate for an element count of n.
90 * current bucket count is n_bkt and the current element count is
91 * n_elt, we need to increase the bucket count. If so, returns
92 * make_pair(true, n), where n is the new bucket count. If not,
118 * bucket. This design makes it possible to implement something like a
125 * node pointer in a bucket shall never be dereferenced, only its
128 * Walking through a bucket's nodes requires a check on the hash code to
129 * see if each node is still in the bucket. Such a design assumes
535 bucket(const key_type& __k) const function in class:_Hashtable
[all...] |
| unordered_map.h | 651 // bucket interface.
664 * @brief Returns the number of elements in a given bucket.
665 * @param __n A bucket index.
666 * @return The number of elements in the bucket.
673 * @brief Returns the bucket index of a given element.
675 * @return The key bucket index.
678 bucket(const key_type& __key) const function in class:unordered_map
679 { return _M_h.bucket(__key); }
682 * @brief Returns a read/write iterator pointing to the first bucket
684 * @param __n The bucket index
1329 bucket(const key_type& __key) const function in class:unordered_multimap
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| hashtable.h | 86 * which govern the bucket count. _M_next_bkt(n) returns a bucket
88 * bucket count appropriate for an element count of n.
90 * current bucket count is n_bkt and the current element count is
91 * n_elt, we need to increase the bucket count. If so, returns
92 * make_pair(true, n), where n is the new bucket count. If not,
118 * bucket. This design makes it possible to implement something like a
125 * node pointer in a bucket shall never be dereferenced, only its
128 * Walking through a bucket's nodes requires a check on the hash code to
129 * see if each node is still in the bucket. Such a design assumes
535 bucket(const key_type& __k) const function in class:_Hashtable
[all...] |
| unordered_map.h | 651 // bucket interface.
664 * @brief Returns the number of elements in a given bucket.
665 * @param __n A bucket index.
666 * @return The number of elements in the bucket.
673 * @brief Returns the bucket index of a given element.
675 * @return The key bucket index.
678 bucket(const key_type& __key) const function in class:unordered_map
679 { return _M_h.bucket(__key); }
682 * @brief Returns a read/write iterator pointing to the first bucket
684 * @param __n The bucket index
1329 bucket(const key_type& __key) const function in class:unordered_multimap
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| hashtable.h | 86 * which govern the bucket count. _M_next_bkt(n) returns a bucket
88 * bucket count appropriate for an element count of n.
90 * current bucket count is n_bkt and the current element count is
91 * n_elt, we need to increase the bucket count. If so, returns
92 * make_pair(true, n), where n is the new bucket count. If not,
118 * bucket. This design makes it possible to implement something like a
125 * node pointer in a bucket shall never be dereferenced, only its
128 * Walking through a bucket's nodes requires a check on the hash code to
129 * see if each node is still in the bucket. Such a design assumes
535 bucket(const key_type& __k) const function in class:_Hashtable
[all...] |
| unordered_map.h | 651 // bucket interface.
664 * @brief Returns the number of elements in a given bucket.
665 * @param __n A bucket index.
666 * @return The number of elements in the bucket.
673 * @brief Returns the bucket index of a given element.
675 * @return The key bucket index.
678 bucket(const key_type& __key) const function in class:unordered_map
679 { return _M_h.bucket(__key); }
682 * @brief Returns a read/write iterator pointing to the first bucket
684 * @param __n The bucket index
1329 bucket(const key_type& __key) const function in class:unordered_multimap
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/ |
| safe_local_iterator.h | 219 * @brief Return the bucket
222 bucket() const { return _M_current._M_get_bucket(); } function in class:__gnu_debug::_Safe_local_iterator
263 /// Is this iterator equal to the sequence's begin(bucket) iterator?
265 { return base() == _M_get_sequence()->_M_base().begin(bucket()); }
267 /// Is this iterator equal to the sequence's end(bucket) iterator?
269 { return base() == _M_get_sequence()->_M_base().end(bucket()); }
271 /// Is this iterator part of the same bucket as the other one?
276 { return bucket() == __other.bucket(); }
|
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/ |
| safe_local_iterator.h | 219 * @brief Return the bucket
222 bucket() const { return _M_current._M_get_bucket(); } function in class:__gnu_debug::_Safe_local_iterator
263 /// Is this iterator equal to the sequence's begin(bucket) iterator?
265 { return base() == _M_get_sequence()->_M_base().begin(bucket()); }
267 /// Is this iterator equal to the sequence's end(bucket) iterator?
269 { return base() == _M_get_sequence()->_M_base().end(bucket()); }
271 /// Is this iterator part of the same bucket as the other one?
276 { return bucket() == __other.bucket(); }
|
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/ |
| safe_local_iterator.h | 219 * @brief Return the bucket
222 bucket() const { return _M_current._M_get_bucket(); } function in class:__gnu_debug::_Safe_local_iterator
263 /// Is this iterator equal to the sequence's begin(bucket) iterator?
265 { return base() == _M_get_sequence()->_M_base().begin(bucket()); }
267 /// Is this iterator equal to the sequence's end(bucket) iterator?
269 { return base() == _M_get_sequence()->_M_base().end(bucket()); }
271 /// Is this iterator part of the same bucket as the other one?
276 { return bucket() == __other.bucket(); }
|
| /external/skia/site/dev/testing/ |
| automated_testing.md | 48 $ git cl try -B <bucket name> -b <job name>
50 The bucket name refers to the [Buildbucket](https://chromium.googlesource.com/infra/infra/+/master/appengine/cr-buildbucket/README.md)
51 bucket to which the request will be submitted. Most public Skia repos use the
52 "skia.primary" bucket, and most private Skia repos use the "skia.internal"
53 bucket.
|
| /packages/apps/Gallery2/src/com/android/gallery3d/onetimeinitializer/ |
| GalleryWidgetMigrator.java | 43 * bucket ID (i.e., directory hash) change in JB and JB MR1 (The external storage path has changed
58 * due to bucket ID (i.e., directory hash) change.
85 // Check each entry's relativePath. If exists, update bucket id using relative
87 // storage paths to find the relative path that matches the old bucket id, and then update
88 // bucket id and relative path
|
| /libcore/luni/src/main/native/ |
| org_apache_harmony_xml_ExpatParser.cpp | 121 InternedString** bucket = internedStrings[i]; local
123 while ((current = *(bucket++)) != NULL) {
127 // Free the bucket.
303 * Allocates a new bucket with one entry.
305 * @param entry to store in the bucket
306 * @returns a reference to the bucket
309 InternedString** bucket = new InternedString*[2]; local
310 if (bucket != NULL) {
311 bucket[0] = entry;
312 bucket[1] = NULL
374 InternedString** bucket = buckets[bucketIndex]; local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| unordered_map.h | 620 // bucket interface.
633 * @brief Returns the number of elements in a given bucket.
634 * @param __n A bucket index.
635 * @return The number of elements in the bucket.
642 * @brief Returns the bucket index of a given element.
644 * @return The key bucket index.
647 bucket(const key_type& __key) const function in class:unordered_map
648 { return _M_h.bucket(__key); }
651 * @brief Returns a read/write iterator pointing to the first bucket
653 * @param __n The bucket index
1267 bucket(const key_type& __key) const function in class:unordered_multimap
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| unordered_map.h | 620 // bucket interface.
633 * @brief Returns the number of elements in a given bucket.
634 * @param __n A bucket index.
635 * @return The number of elements in the bucket.
642 * @brief Returns the bucket index of a given element.
644 * @return The key bucket index.
647 bucket(const key_type& __key) const function in class:unordered_map
648 { return _M_h.bucket(__key); }
651 * @brief Returns a read/write iterator pointing to the first bucket
653 * @param __n The bucket index
1267 bucket(const key_type& __key) const function in class:unordered_multimap
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| unordered_map.h | 620 // bucket interface.
633 * @brief Returns the number of elements in a given bucket.
634 * @param __n A bucket index.
635 * @return The number of elements in the bucket.
642 * @brief Returns the bucket index of a given element.
644 * @return The key bucket index.
647 bucket(const key_type& __key) const function in class:unordered_map
648 { return _M_h.bucket(__key); }
651 * @brief Returns a read/write iterator pointing to the first bucket
653 * @param __n The bucket index
1267 bucket(const key_type& __key) const function in class:unordered_multimap
[all...] |
| /external/autotest/frontend/afe/ |
| moblab_rpc_interface.py | 39 # Google Cloud Storage bucket url regex pattern. The pattern is used to extract
40 # the bucket name from the bucket URL. For example, "gs://image_bucket/google"
41 # should result in a bucket name "image_bucket".
43 r'gs://(?P<bucket>[a-zA-Z][a-zA-Z0-9-_]*)/?.*')
331 """Gets the bucket name from a bucket url.
333 @param: bucket_url: the bucket url string.
338 return match.group('bucket')
364 """Checks if a bucket is valid and accessible
[all...] |
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| ContactLocaleUtils.java | 197 * Returns the bucket index for the specified string. AlphabeticIndex
200 * used in a particular locale. This routine adds one additional bucket
202 * the bucket indexes returned by AlphabeticIndex in order to make room
203 * for the new # bucket, so the returned range becomes 0 to N+1.
238 final int bucket = mAlphabeticIndex.getBucketIndex(name); local
239 if (bucket < 0) {
242 if (bucket >= mNumberBucketIndex) {
243 return bucket + 1;
245 return bucket;
250 * uses, because this class adds a bucket for phone numbers)
[all...] |
| /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...] |
