| /prebuilt/ndk/android-ndk-r5/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
|
| _hashtable.h | 197 //Returns the bucket size next to a required size
200 // Returns the bucket range containing sorted list of prime numbers <= __hint.
389 //The number of buckets is size() - 1 because the last bucket always contains
397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); } function in class:hashtable
588 //__n is set to the first bucket that has to be modified if any
|
| /prebuilt/ndk/android-ndk-r6/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
|
| _hashtable.h | 197 //Returns the bucket size next to a required size
200 // Returns the bucket range containing sorted list of prime numbers <= __hint.
389 //The number of buckets is size() - 1 because the last bucket always contains
397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); } function in class:hashtable
588 //__n is set to the first bucket that has to be modified if any
|
| /prebuilt/ndk/android-ndk-r7/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
|
| _hashtable.h | 197 //Returns the bucket size next to a required size
200 // Returns the bucket range containing sorted list of prime numbers <= __hint.
389 //The number of buckets is size() - 1 because the last bucket always contains
397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); } function in class:hashtable
588 //__n is set to the first bucket that has to be modified if any
|
| /external/chromium/chrome/browser/ |
| chrome_browser_application_mac_unittest.mm | 79 // The unknown exceptions should end up in the overflow bucket.
|
| /external/chromium/chrome/browser/ui/webui/ |
| app_launcher_handler.cc | 57 extension_misc::AppLaunchBucket bucket = local
59 CHECK(bucket < extension_misc::APP_LAUNCH_BUCKET_BOUNDARY);
60 return bucket;
518 bool promo_active, extension_misc::AppLaunchBucket bucket) {
519 CHECK(bucket != extension_misc::APP_LAUNCH_BUCKET_INVALID);
521 UMA_HISTOGRAM_ENUMERATION(extension_misc::kAppLaunchHistogram, bucket,
535 extension_misc::AppLaunchBucket bucket) {
536 CHECK(bucket != extension_misc::APP_LAUNCH_BUCKET_INVALID);
543 UMA_HISTOGRAM_ENUMERATION(extension_misc::kAppLaunchHistogram, bucket,
|
| /external/freetype/src/base/ |
| ftdbgmem.c | 930 FT_MemSource* bucket = table->sources; local
931 FT_MemSource* limit = bucket + FT_MEM_SOURCE_BUCKETS;
938 for ( ; bucket < limit; bucket++ )
940 FT_MemSource source = *bucket;
951 for ( bucket = table->sources; bucket < limit; bucket++ )
953 FT_MemSource source = *bucket;
|
| /external/oprofile/libdb/ |
| db_insert.c | 79 * this bucket so this loop will see first a
|
| /bionic/linker/ |
| dlfcn.c | 242 /* Fake out a hash table with a single bucket.
273 bucket: libdl_buckets,
|
| /external/blktrace/ |
| stats.h | 116 static inline void histlog2_account(__u32 *bucket, __u32 val,
120 bucket[index]++;
|
| /external/iproute2/man/man8/ |
| tc-htb.8 | 3 HTB \- Hierarchy Token Bucket
42 Unlike CBQ, HTB shapes traffic based on the Token Bucket Filter algorithm
|
| /external/jdiff/src/jdiff/ |
| HTMLStatistics.java | 203 int bucket = (int)(pkg.pdiff); local
204 hist[bucket]++;
206 if (bucket != 0)
207 h_.writeText(" <TD ALIGN=\"center\">" + bucket + "</TD>");
290 int bucket = (int)(classDiff.pdiff); local
291 hist[bucket]++;
293 if (bucket != 0)
294 h_.writeText(" <TD ALIGN=\"center\">" + bucket + "</TD>");
|
| /packages/apps/Gallery2/src/com/android/gallery3d/gadget/ |
| LocalPhotoSource.java | 188 * Builds the bucket ID for the public external storage Downloads directory
189 * @return the bucket ID
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| hashtable_policy.h | 120 // Local iterators, used to iterate within a bucket but not between
270 // This loop requires the bucket array to have a non-null sentinel.
413 // Default value for rehash policy. Bucket size is (usually) the
424 // Return a bucket size no smaller than n.
428 // Return a bucket count appropriate for n elements
432 // __n_bkt is current bucket count, __n_elt is current element count,
434 // increase bucket count? If so, return make_pair(true, n), where n
435 // is the new bucket count. If not, return make_pair(false, 0).
|
| hashtable | 86 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
87 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
89 // determines whether, if the current bucket count is n_bkt and the
90 // current element count is n_elt, we need to increase the bucket
92 // bucket count. If not, returns make_pair(false, <anything>).
303 // Bucket operations
317 bucket(const key_type& __k) const
462 // Unconditionally change size of bucket array to n.
549 // We allocate one extra bucket to hold a sentinel, an arbitrar
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 120 // Local iterators, used to iterate within a bucket but not between
270 // This loop requires the bucket array to have a non-null sentinel.
413 // Default value for rehash policy. Bucket size is (usually) the
424 // Return a bucket size no smaller than n.
428 // Return a bucket count appropriate for n elements
432 // __n_bkt is current bucket count, __n_elt is current element count,
434 // increase bucket count? If so, return make_pair(true, n), where n
435 // is the new bucket count. If not, return make_pair(false, 0).
|
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 120 // Local iterators, used to iterate within a bucket but not between
270 // This loop requires the bucket array to have a non-null sentinel.
413 // Default value for rehash policy. Bucket size is (usually) the
424 // Return a bucket size no smaller than n.
428 // Return a bucket count appropriate for n elements
432 // __n_bkt is current bucket count, __n_elt is current element count,
434 // increase bucket count? If so, return make_pair(true, n), where n
435 // is the new bucket count. If not, return make_pair(false, 0).
|
| /prebuilt/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| hashtable_policy.h | 120 // Local iterators, used to iterate within a bucket but not between
270 // This loop requires the bucket array to have a non-null sentinel.
413 // Default value for rehash policy. Bucket size is (usually) the
424 // Return a bucket size no smaller than n.
428 // Return a bucket count appropriate for n elements
432 // __n_bkt is current bucket count, __n_elt is current element count,
434 // increase bucket count? If so, return make_pair(true, n), where n
435 // is the new bucket count. If not, return make_pair(false, 0).
|
| /external/elfutils/src/ |
| strip.c | 1373 Elf32_Word *bucket = (Elf32_Word *) hashd->d_buf; local
1436 Elf64_Xword *bucket = (Elf64_Xword *) hashd->d_buf; local
[all...] |
| /external/stlport/stlport/stl/ |
| _hashtable.h | 197 //Returns the bucket size next to a required size
200 // Returns the bucket range containing sorted list of prime numbers <= __hint.
389 //The number of buckets is size() - 1 because the last bucket always contains
397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); } function in class:hashtable
588 //__n is set to the first bucket that has to be modified if any
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 197 //Returns the bucket size next to a required size
200 // Returns the bucket range containing sorted list of prime numbers <= __hint.
389 //The number of buckets is size() - 1 because the last bucket always contains
397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); } function in class:hashtable
588 //__n is set to the first bucket that has to be modified if any
|
| /external/bzip2/ |
| blocksort.c | 230 VPrintf0 ( " bucket sorting ...\n" );
277 /*-- find the next non-singleton bucket --*/
294 /*-- now [l, r] bracket current bucket --*/
299 /*-- scan bucket and generate header bits-- */
800 if (verb >= 4) VPrintf0 ( " bucket sorting ...\n" );
833 Now ftab contains the first loc of every small bucket.
835 big bucket.
880 Complete the big bucket [ss] by quicksorting
913 Now scan this big bucket [ss] so as to synthesise the
915 including, magically, the bucket [ss,ss] too
[all...] |
| /external/chromium/base/metrics/ |
| histogram.cc | 158 // Prepare to normalize graphical rendering of bucket contents.
163 // Calculate space needed to print bucket range numbers. Leave room to print
164 // nearly the largest bucket range without sliding over the histogram.
172 // Calculate largest print width needed for any of our bucket range displays.
427 // Calculate what range of values are held in each bucket.
430 // (effectively making one bucket get no values). We need to avoid:
432 // To avoid that, we just do a fine-grained bucket width as far as we need to
434 // that bucket onward we do use the exponential growth of buckets.
447 // See where the next bucket would start.
454 ++current; // Just do a narrow bucket, and keep trying
[all...] |
