| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| hashtable.h | 73 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
74 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
76 // determines whether, if the current bucket count is n_bkt and the
77 // current element count is n_elt, we need to increase the bucket
79 // bucket count. If not, returns make_pair(false, <anything>).
180 size_type _M_begin_bucket_index; // First non-empty bucket.
288 // Bucket operations
302 bucket(const key_type& __k) const function in class:_Hashtable
464 // Unconditionally change size of bucket array to n
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| hashtable.h | 73 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
74 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
76 // determines whether, if the current bucket count is n_bkt and the
77 // current element count is n_elt, we need to increase the bucket
79 // bucket count. If not, returns make_pair(false, <anything>).
180 size_type _M_begin_bucket_index; // First non-empty bucket.
288 // Bucket operations
302 bucket(const key_type& __k) const function in class:_Hashtable
464 // Unconditionally change size of bucket array to n
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/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/5/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
|
| /prebuilts/ndk/6/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
|
| /prebuilts/ndk/7/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
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hashtable.h | 73 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
74 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
76 // determines whether, if the current bucket count is n_bkt and the
77 // current element count is n_elt, we need to increase the bucket
79 // bucket count. If not, returns make_pair(false, <anything>).
180 size_type _M_begin_bucket_index; // First non-empty bucket.
288 // Bucket operations
302 bucket(const key_type& __k) const function in class:_Hashtable
464 // Unconditionally change size of bucket array to n
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/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/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hashtable.h | 74 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
75 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
77 // determines whether, if the current bucket count is n_bkt and the
78 // current element count is n_elt, we need to increase the bucket
80 // bucket count. If not, returns make_pair(false, <anything>).
111 * The non-empty buckets contain the node before the first bucket node. This
116 * Note that one of the non-empty bucket contains &_M_before_begin which is
120 * Walk through a bucket nodes require a check on the hash code to see if the
121 * node is still in the bucket. Such a design impose a quite efficient has
393 bucket(const key_type& __k) const function in class:_Hashtable
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/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/8/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
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/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
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| hashtable.h | 73 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
74 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
76 // determines whether, if the current bucket count is n_bkt and the
77 // current element count is n_elt, we need to increase the bucket
79 // bucket count. If not, returns make_pair(false, <anything>).
180 size_type _M_begin_bucket_index; // First non-empty bucket.
288 // Bucket operations
302 bucket(const key_type& __k) const function in class:_Hashtable
464 // Unconditionally change size of bucket array to n
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/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/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| hashtable.h | 74 // the bucket count. _M_next_bkt(n) returns a bucket count no smaller
75 // than n. _M_bkt_for_elements(n) returns a bucket count appropriate
77 // determines whether, if the current bucket count is n_bkt and the
78 // current element count is n_elt, we need to increase the bucket
80 // bucket count. If not, returns make_pair(false, <anything>).
111 * The non-empty buckets contain the node before the first bucket node. This
116 * Note that one of the non-empty bucket contains &_M_before_begin which is
120 * Walk through a bucket nodes require a check on the hash code to see if the
121 * node is still in the bucket. Such a design impose a quite efficient has
393 bucket(const key_type& __k) const function in class:_Hashtable
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/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/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| hashtable.h | 90 * which govern the bucket count. _M_next_bkt(n) returns a bucket
92 * bucket count appropriate for an element count of n.
94 * current bucket count is n_bkt and the current element count is
95 * n_elt, we need to increase the bucket count. If so, returns
96 * make_pair(true, n), where n is the new bucket count. If not,
122 * bucket. This design makes it possible to implement something like a
129 * node pointer in a bucket shall never be dereferenced, only its
132 * Walking through a bucket's nodes requires a check on the hash code to
133 * see if each node is still in the bucket. Such a design assumes
514 bucket(const key_type& __k) const function in class:_Hashtable
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/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...] |
| /external/chromium/chrome/browser/ui/ |
| browser_init.cc | 424 int bucket = (mode == LM_TO_BE_DECIDED) ? GetLaunchShortcutKind() : mode; local
425 UMA_HISTOGRAM_COUNTS_100("Launch.Modes", bucket);
[all...] |
| /external/chromium_org/gpu/command_buffer/service/ |
| program_manager_unittest.cc | 875 CommonDecoder::Bucket bucket; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| deep-heap-profile.cc | 410 // Write the bucket listing into a .bucket file.
538 buffer->AppendInt64(bucket->alloc_size - bucket->free_size, 10);
542 buffer->AppendInt(bucket->allocs, 6, false);
544 buffer->AppendInt(bucket->frees, 6, false);
566 for (int depth = 0; depth < bucket->depth; depth++) {
568 buffer->AppendPtr(reinterpret_cast<uintptr_t>(bucket->stack[depth]), 8);
600 Bucket* bucket,
655 Bucket* bucket = deep_bucket->bucket; local
678 Bucket* bucket = deep_bucket->bucket; local
1072 Bucket* bucket = MemoryRegionMap::GetBucket( local
[all...] |
| /external/elfutils/src/ |
| strip.c | 1412 Elf32_Word *bucket = (Elf32_Word *) hashd->d_buf; local
1466 Elf64_Xword *bucket = (Elf64_Xword *) hashd->d_buf; local
[all...] |
| /external/icu4c/i18n/ |
| alphaindex.cpp | 81 inline AlphabeticIndex::Bucket *getBucket(const UVector &list, int32_t i) {
82 return static_cast<AlphabeticIndex::Bucket *>(list[i]);
150 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); local
152 collatorPrimaryOnly.compare(name, bucket->lowerBoundary_, errorCode);
159 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); local
160 if (bucket->displayBucket_ != NULL) {
161 bucket = bucket->displayBucket_
461 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); local
683 Bucket *bucket = currentBucket; local
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/video/fbcon/ |
| SDL_fbvideo.c | 1192 vidmem_bucket *bucket; local
1220 vidmem_bucket *bucket; local
1252 vidmem_bucket *bucket, *freeable; local
1265 vidmem_bucket *bucket; local
1340 vidmem_bucket *bucket, *freeable; local
[all...] |
