/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/ |
H A D | unordered_base.h | 43 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper 52 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper 54 { return __uc.bucket(__node->_M_v); } 64 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper 66 { return __uc.bucket(__node->_M_v.first); } 76 return __bucket_index_helper::bucket(__uc, __node);
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/profile/ |
H A D | unordered_base.h | 43 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper 52 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper 54 { return __uc.bucket(__node->_M_v); } 64 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper 66 { return __uc.bucket(__node->_M_v.first); } 76 return __bucket_index_helper::bucket(__uc, __node);
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/ |
H A D | unordered_base.h | 43 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper 52 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper 54 { return __uc.bucket(__node->_M_v); } 64 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper 66 { return __uc.bucket(__node->_M_v.first); } 76 return __bucket_index_helper::bucket(__uc, __node);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
H A D | 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 inde 1267 bucket(const key_type& __key) const function in class:unordered_multimap [all...] |
H A D | unordered_set.h | 555 // bucket interface. 568 * @brief Returns the number of elements in a given bucket. 569 * @param __n A bucket index. 570 * @return The number of elements in the bucket. 577 * @brief Returns the bucket index of a given element. 579 * @return The key bucket index. 582 bucket(const key_type& __key) const function in class:unordered_set 583 { return _M_h.bucket(__key); } 588 * bucket element. 589 * @param __n The bucket inde 1164 bucket(const key_type& __key) const function in class:unordered_multiset [all...] |
H A D | 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 514 bucket(const key_type& __k) const function in class:_Hashtable [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/debug/ |
H A D | 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/mingw/include/c++/4.8.3/bits/ |
H A D | 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 inde 1267 bucket(const key_type& __key) const function in class:unordered_multimap [all...] |
H A D | unordered_set.h | 555 // bucket interface. 568 * @brief Returns the number of elements in a given bucket. 569 * @param __n A bucket index. 570 * @return The number of elements in the bucket. 577 * @brief Returns the bucket index of a given element. 579 * @return The key bucket index. 582 bucket(const key_type& __key) const function in class:unordered_set 583 { return _M_h.bucket(__key); } 588 * bucket element. 589 * @param __n The bucket inde 1164 bucket(const key_type& __key) const function in class:unordered_multiset [all...] |
H A D | 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 514 bucket(const key_type& __k) const function in class:_Hashtable [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/debug/ |
H A D | 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/bits/ |
H A D | 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 inde 1267 bucket(const key_type& __key) const function in class:unordered_multimap [all...] |
H A D | unordered_set.h | 555 // bucket interface. 568 * @brief Returns the number of elements in a given bucket. 569 * @param __n A bucket index. 570 * @return The number of elements in the bucket. 577 * @brief Returns the bucket index of a given element. 579 * @return The key bucket index. 582 bucket(const key_type& __key) const function in class:unordered_set 583 { return _M_h.bucket(__key); } 588 * bucket element. 589 * @param __n The bucket inde 1164 bucket(const key_type& __key) const function in class:unordered_multiset [all...] |
H A D | 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 514 bucket(const key_type& __k) const function in class:_Hashtable [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/debug/ |
H A D | 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/tr1/ |
H A D | 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>). 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 arbitrary 816 // at p (usually the head of a bucket) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/tr1/ |
H A D | 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>). 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 arbitrary 816 // at p (usually the head of a bucket) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
H A D | 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>). 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 arbitrary 816 // at p (usually the head of a bucket) [all...] |
/prebuilts/tools/common/m2/repository/com/google/apis/google-api-services-storage/v1-rev82-1.22.0/ |
H A D | google-api-services-storage-v1-rev82-1.22.0.jar | ... storage.StorageRequest {
private static final String REST_PATH private String bucket private String entity final synthetic com.google.api ... |
/prebuilts/tools/common/m2/repository/com/tunnelvisionlabs/antlr4-runtime/4.5/ |
H A D | antlr4-runtime-4.5.jar | META-INF/ META-INF/MANIFEST.MF META-INF/services/ org/ org/antlr/ org/antlr/v4/ ... |
/prebuilts/tools/common/m2/repository/com/fasterxml/jackson/core/jackson-core/2.6.6/ |
H A D | jackson-core-2.6.6.jar | META-INF/MANIFEST.MF META-INF/ META-INF/LICENSE META-INF/NOTICE META- ... |
/prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-s3/1.11.18/ |
H A D | aws-java-sdk-s3-1.11.18.jar | ... com.amazonaws.services.s3.model.Bucket createBucket (com.amazonaws.services.s3.model ... |
/prebuilts/tools/common/m2/repository/com/fasterxml/jackson/core/jackson-core/2.1.3/ |
H A D | jackson-core-2.1.3.jar | META-INF/ META-INF/MANIFEST.MF com/ com/fasterxml/ com/fasterxml/jackson/ com/fasterxml/jackson/core/ ... |
/prebuilts/tools/common/m2/repository/com/amazonaws/aws-java-sdk-cloudfront/1.11.18/ |
H A D | aws-java-sdk-cloudfront-1.11.18.jar | META-INF/ META-INF/MANIFEST.MF models/ com/ com/amazonaws/ com/amazonaws/services/ com/amazonaws/services/ ... |
/prebuilts/tools/common/m2/repository/io/netty/netty-common/4.1.0.CR3/ |
H A D | netty-common-4.1.0.CR3.jar | META-INF/ META-INF/MANIFEST.MF io/ io/netty/ io/netty/util/ io/netty/util/internal/ ... |