| /art/compiler/optimizing/ |
| gvn.cc | 169 // Hash table remains the same size. We copy the bucket pointers and leave
223 // Creates our own copy of a bucket that is currently pointing to a parent.
224 // This algorithm can be called while iterating over the bucket because it
225 // preserves the order of entries in the bucket and will return the clone of
261 // Bucket is not owned but maybe we won't need to change it at all.
265 // We do need to delete an entry but we do not own the bucket.
266 // Clone the bucket, make sure 'previous' and 'node' point to
277 // By this point we either own the bucket and can start deleting entries,
299 // Computes a bucket count such that the load factor is reasonable.
324 // Converts a hash code to a bucket index
[all...] |
| /device/google/contexthub/firmware/os/algos/calibration/accelerometer/ |
| accel_cal.h | 79 // Bucket counters.
82 // Bucket full values.
167 * sphere cap (Bucket) is needed to reach full.
|
| /external/chromium-trace/catapult/telemetry/telemetry/page/ |
| page_test_unittest.py | 123 story_set.bucket)
134 story_set.bucket)
142 story_set.bucket)
|
| /external/chromium-trace/catapult/telemetry/telemetry/story/ |
| story_set.py | 26 cloud_storage_bucket: The cloud storage bucket used to download
89 def bucket(self): member in class:StorySet
97 os.path.join(self.base_dir, self.archive_data_file), self.bucket)
|
| /external/curl/tests/unit/ |
| unit1603.c | 101 /* Delete the second of two entries in a bucket */
115 /* Delete the first of two entries in a bucket */
123 /* Delete the remaining one of two entries in a bucket */
|
| /frameworks/base/tests/net/java/android/net/ |
| NetworkStatsHistoryTest.java | 95 // record data into narrow window to get single bucket
121 // split almost completely into middle bucket, but with a few minutes
129 // first bucket should have (1/20 of value)
131 // second bucket should have (15/20 of value)
133 // final bucket should have (4/20 of value)
172 // record some data in one bucket, and another overlapping buckets
194 // combine together with identical bucket size
210 // create history just over hour bucket boundary
218 // combine together with minute bucket size
265 // try removing just moments into first bucket; should be no chang
[all...] |
| /frameworks/data-binding/compiler/src/main/java/android/databinding/tool/writer/ |
| FlagSet.java | 145 for (long bucket : buckets) {
146 hash = (hash * 7) ^ (int)(bucket >>> 32);
147 hash = (hash * 13) ^ (int)(bucket & 0xFFFF);
|
| /cts/tests/tests/os/src/android/os/cts/ |
| DebugTest.java | 238 String bucket = buckets[i]; local
239 assertTrue(bucket.length() > 0);
240 String[] kv = bucket.split(":");
255 // least one bucket in the histograms.
281 // least one bucket in the histograms.
|
| /packages/apps/Car/libs/car-apps-common/src/com/android/car/apps/common/ |
| BitmapDownloader.java | 81 // Bitmaps within same bucket share the largest cache item.
253 // should never happen because last bucket is Integer.MAX_VALUE
266 // If somebody else happened to get a larger one in the bucket, discard our bitmap.
282 // 1. find the bitmap in the size bucket
288 // now we have the bitmap in the bucket, use it when the bitmap is not scaled or
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/debug/ |
| safe_local_iterator.h | 60 /// The bucket this local iterator belongs to
225 * @brief Return the bucket
228 bucket() const { return _M_bucket; } function in class:__gnu_debug::_Safe_local_iterator
275 /// Is this iterator part of the same bucket as the other one?
279 { return _M_bucket == __other.bucket(); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/debug/ |
| safe_local_iterator.h | 60 /// The bucket this local iterator belongs to
225 * @brief Return the bucket
228 bucket() const { return _M_bucket; } function in class:__gnu_debug::_Safe_local_iterator
275 /// Is this iterator part of the same bucket as the other one?
279 { return _M_bucket == __other.bucket(); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/debug/ |
| safe_local_iterator.h | 60 /// The bucket this local iterator belongs to
225 * @brief Return the bucket
228 bucket() const { return _M_bucket; } function in class:__gnu_debug::_Safe_local_iterator
275 /// Is this iterator part of the same bucket as the other one?
279 { return _M_bucket == __other.bucket(); }
|
| /external/iproute2/man/man8/ |
| tc-u32.8 | 171 computed and used as key to lookup the table's bucket which contains filters for
197 parameter, which gives sample data to hash and thereby define the table bucket
255 (which identifies the hash table's bucket) and
287 Spefify what packet data to use to calculate a hash key for bucket lookup. The
315 to specify which bucket to add this filter to. This allows one to avoid having
325 have to be omitted. By default, bucket number 0 will be used and can be
531 and bucket
582 determine which table and bucket to redirect to. In this case the hash key
599 The bucket is defined using the
602 this case, the resulting bucket ID is obviously 8, but as soon a
[all...] |
| /external/clang/lib/Lex/ |
| HeaderMap.cpp | 125 /// getBucket - Return the specified hash table bucket from the header map,
126 /// bswap'ing its fields as appropriate. If the bucket number is not valid,
127 /// this return a bucket with an empty key (0).
131 "Expected bucket to be in range");
219 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) {
220 HMapBucket B = getBucket(Bucket & (NumBuckets-1));
|
| /external/libmojo/third_party/jinja2/ |
| loaders.py | 119 bucket = bcc.get_bucket(environment, name, filename, source)
120 code = bucket.code
127 # if the bytecode cache is available and the bucket doesn't
128 # have a code so far, we give the bucket the new code and put
130 if bcc is not None and bucket.code is None:
131 bucket.code = code
132 bcc.set_bucket(bucket)
|
| /packages/apps/Calendar/src/com/android/calendar/widget/ |
| CalendarAppWidgetModel.java | 320 LinkedList<RowInfo> bucket = mBuckets.get(day - mTodayJulianDay); local
323 bucket.addFirst(rowInfo);
325 bucket.add(rowInfo);
332 for (LinkedList<RowInfo> bucket : mBuckets) {
333 if (!bucket.isEmpty()) {
344 mRowInfos.addAll(bucket);
345 count += bucket.size();
|
| /prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.c | 140 /* Returns the iterator before the first iterator of the bucket __n and set
141 * __n to the first previous bucket having the same first iterator as bucket
184 //We always insert this element as 1st in the bucket to not break
208 //equivalent value might not be in the same bucket
215 * insertion after the first bucket element is faster than what is
239 //equivalent value might not be in the same bucket
|
| /prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.c | 140 /* Returns the iterator before the first iterator of the bucket __n and set
141 * __n to the first previous bucket having the same first iterator as bucket
184 //We always insert this element as 1st in the bucket to not break
208 //equivalent value might not be in the same bucket
215 * insertion after the first bucket element is faster than what is
239 //equivalent value might not be in the same bucket
|
| /prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.c | 140 /* Returns the iterator before the first iterator of the bucket __n and set
141 * __n to the first previous bucket having the same first iterator as bucket
184 //We always insert this element as 1st in the bucket to not break
208 //equivalent value might not be in the same bucket
215 * insertion after the first bucket element is faster than what is
239 //equivalent value might not be in the same bucket
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| hashtable.h | 76 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
77 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
79 // determines whether, if the current bucket count is n_bkt and the
80 // current element count is n_elt, we need to increase the bucket
82 // bucket count. If not, returns make_pair(false, <anything>).
270 // Bucket operations
284 bucket(const key_type& __k) const function in class:tr1::_Hashtable
412 // Unconditionally change size of bucket array to n.
491 // We allocate one extra bucket to hold a sentinel, an arbitrar
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| hashtable.h | 76 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
77 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
79 // determines whether, if the current bucket count is n_bkt and the
80 // current element count is n_elt, we need to increase the bucket
82 // bucket count. If not, returns make_pair(false, <anything>).
270 // Bucket operations
284 bucket(const key_type& __k) const function in class:tr1::_Hashtable
412 // Unconditionally change size of bucket array to n.
491 // We allocate one extra bucket to hold a sentinel, an arbitrar
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| hashtable.h | 76 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
77 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
79 // determines whether, if the current bucket count is n_bkt and the
80 // current element count is n_elt, we need to increase the bucket
82 // bucket count. If not, returns make_pair(false, <anything>).
270 // Bucket operations
284 bucket(const key_type& __k) const function in class:tr1::_Hashtable
412 // Unconditionally change size of bucket array to n.
491 // We allocate one extra bucket to hold a sentinel, an arbitrar
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| hashtable.h | 76 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
77 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
79 // determines whether, if the current bucket count is n_bkt and the
80 // current element count is n_elt, we need to increase the bucket
82 // bucket count. If not, returns make_pair(false, <anything>).
270 // Bucket operations
284 bucket(const key_type& __k) const function in class:tr1::_Hashtable
412 // Unconditionally change size of bucket array to n.
491 // We allocate one extra bucket to hold a sentinel, an arbitrar
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| hashtable.h | 76 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
77 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
79 // determines whether, if the current bucket count is n_bkt and the
80 // current element count is n_elt, we need to increase the bucket
82 // bucket count. If not, returns make_pair(false, <anything>).
270 // Bucket operations
284 bucket(const key_type& __k) const function in class:tr1::_Hashtable
412 // Unconditionally change size of bucket array to n.
491 // We allocate one extra bucket to hold a sentinel, an arbitrar
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| hashtable.h | 76 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
77 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
79 // determines whether, if the current bucket count is n_bkt and the
80 // current element count is n_elt, we need to increase the bucket
82 // bucket count. If not, returns make_pair(false, <anything>).
270 // Bucket operations
284 bucket(const key_type& __k) const function in class:tr1::_Hashtable
412 // Unconditionally change size of bucket array to n.
491 // We allocate one extra bucket to hold a sentinel, an arbitrar
[all...] |
