/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/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/elfutils/src/ |
readelf.c | 77 N_("Display histogram of bucket list lengths"), 0 }, 148 /* True if bucket list length histogram should be printed. */ 2544 Elf32_Word *bucket = &((Elf32_Word *) data->d_buf)[2]; local 2586 Elf64_Xword *bucket = &((Elf64_Xword *) data->d_buf)[2]; local 2640 Elf32_Word *bucket = &((Elf32_Word *) data->d_buf)[4 + bitmask_words]; local [all...] |
elflint.c | 2266 const Elf32_Word *bucket = &hasharr[2]; local 2283 const Elf64_Xword *bucket = &hasharr[2]; local [all...] |
ldgeneric.c | 4054 Elf32_Word *bucket = NULL; local [all...] |
/prebuilts/tools/common/cglib/ |
cglib-2.2.3.jar | |
cglib-nodep-2.2.3.jar | |
/prebuilts/tools/common/m2/internal/cglib/cglib-nodep/2.2.2/ |
cglib-nodep-2.2.2.jar | |
/bionic/linker/ |
linker.cpp | 452 for (n = si->bucket[hash % si->nbucket]; n != 0; n = si->chain[n]) { [all...] |
/external/chromium/chrome/browser/resources/ |
new_new_tab.js | 36 function getAppPingUrl(prefix, data, bucket) { 39 APP_LAUNCH[bucket]].join('+'); [all...] |
/external/robolectric/lib/test/ |
mockito-core-1.8.5.jar | |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar | |
/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/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/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/dexmaker/lib/ |
mockito-core-1.9.1-SNAPSHOT.jar | |
/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...] |
/external/blktrace/btt/doc/ |
btt.tex | 557 single bucket for all sizes greater than or equal to 1,024 blocks. [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.pde.build_3.6.1.R36x_v20100823/ |
pdebuild.jar | |