| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| FoldingSet.h | 32 /// it, otherwise return the bucket it should be inserted into.
37 /// node). The last node points back to the bucket to simplify node removal.
108 /// structure is an array of buckets. Each bucket is indexed by the hash of
109 /// the nodes it contains. The bucket itself points to the nodes contained
110 /// in the bucket via a singly linked list. The last node in the list points
111 /// back to the bucket to facilitate node removal.
117 /// Buckets - Array of bucket chains.
136 /// Node - This class is used to maintain the singly linked bucket list in
141 // NextInFoldingSetBucket - next link in the bucket list.
207 /// bucket count
[all...] |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
481 // The later case is tricky. For example, if we had one empty bucket with
483 // probe almost the entire table until it found the empty bucket. If the
499 // Only update the state after we've grown our bucket space appropriately
511 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
512 /// FoundBucket. If the bucket contains the key and a value, this returns
513 /// true, otherwise it returns a bucket with an empty marker or tombstone and
538 // Found Val's bucket? If so, return it.
544 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| FoldingSet.h | 32 /// it, otherwise return the bucket it should be inserted into.
37 /// node). The last node points back to the bucket to simplify node removal.
108 /// structure is an array of buckets. Each bucket is indexed by the hash of
109 /// the nodes it contains. The bucket itself points to the nodes contained
110 /// in the bucket via a singly linked list. The last node in the list points
111 /// back to the bucket to facilitate node removal.
117 /// Buckets - Array of bucket chains.
136 /// Node - This class is used to maintain the singly linked bucket list in
141 // NextInFoldingSetBucket - next link in the bucket list.
207 /// bucket count
[all...] |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
481 // The later case is tricky. For example, if we had one empty bucket with
483 // probe almost the entire table until it found the empty bucket. If the
499 // Only update the state after we've grown our bucket space appropriately
511 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
512 /// FoundBucket. If the bucket contains the key and a value, this returns
513 /// true, otherwise it returns a bucket with an empty marker or tombstone and
538 // Found Val's bucket? If so, return it.
544 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| FoldingSet.h | 32 /// it, otherwise return the bucket it should be inserted into.
37 /// node). The last node points back to the bucket to simplify node removal.
108 /// structure is an array of buckets. Each bucket is indexed by the hash of
109 /// the nodes it contains. The bucket itself points to the nodes contained
110 /// in the bucket via a singly linked list. The last node in the list points
111 /// back to the bucket to facilitate node removal.
117 /// Buckets - Array of bucket chains.
136 /// Node - This class is used to maintain the singly linked bucket list in
141 // NextInFoldingSetBucket - next link in the bucket list.
207 /// bucket count
[all...] |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
481 // The later case is tricky. For example, if we had one empty bucket with
483 // probe almost the entire table until it found the empty bucket. If the
499 // Only update the state after we've grown our bucket space appropriately
511 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
512 /// FoundBucket. If the bucket contains the key and a value, this returns
513 /// true, otherwise it returns a bucket with an empty marker or tombstone and
538 // Found Val's bucket? If so, return it.
544 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| FoldingSet.h | 32 /// it, otherwise return the bucket it should be inserted into.
37 /// node). The last node points back to the bucket to simplify node removal.
108 /// structure is an array of buckets. Each bucket is indexed by the hash of
109 /// the nodes it contains. The bucket itself points to the nodes contained
110 /// in the bucket via a singly linked list. The last node in the list points
111 /// back to the bucket to facilitate node removal.
117 /// Buckets - Array of bucket chains.
136 /// Node - This class is used to maintain the singly linked bucket list in
141 // NextInFoldingSetBucket - next link in the bucket list.
207 /// bucket count
[all...] |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
481 // The later case is tricky. For example, if we had one empty bucket with
483 // probe almost the entire table until it found the empty bucket. If the
499 // Only update the state after we've grown our bucket space appropriately
511 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
512 /// FoundBucket. If the bucket contains the key and a value, this returns
513 /// true, otherwise it returns a bucket with an empty marker or tombstone and
538 // Found Val's bucket? If so, return it.
544 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /frameworks/base/core/java/android/app/usage/ |
| NetworkStatsManager.java | 23 import android.app.usage.NetworkStats.Bucket;
42 * discrete bins of time called 'Buckets'. See {@link NetworkStats.Bucket} for details.
55 * bucket for a particular key, state, metered and roaming combination. In case of the user-wide
56 * and device-wide summaries a single bucket containing the totalised network usage is returned.
63 * Therefore there can be multiple buckets for a particular key but all Bucket's state is going to
64 * be {@link NetworkStats.Bucket#STATE_ALL}, all Bucket's metered is going to be
65 * {@link NetworkStats.Bucket#METERED_ALL}, and all Bucket's roaming is going to be
66 * {@link NetworkStats.Bucket#ROAMING_ALL}
163 Bucket bucket = null; local
[all...] |
| /frameworks/base/core/java/com/android/internal/widget/ |
| ChildHelper.java | 44 final Bucket mBucket;
50 mBucket = new Bucket();
395 static class Bucket {
403 Bucket mNext;
416 mNext = new Bucket();
|
| /frameworks/support/v7/recyclerview/src/android/support/v7/widget/ |
| ChildHelper.java | 44 final Bucket mBucket;
50 mBucket = new Bucket();
395 static class Bucket {
403 Bucket mNext;
416 mNext = new Bucket();
|
| /frameworks/ex/common/tools/ |
| make-iana-tld-pattern.py | 52 class Bucket:
126 bucket = buckets.get(letter)
128 if bucket is None:
129 bucket = Bucket(letter)
130 buckets[letter] = bucket
132 return bucket
|
| /device/linaro/bootloader/edk2/NetworkPkg/Ip6Dxe/ |
| Ip6Input.h | 98 LIST_ENTRY Bucket[IP6_ASSEMLE_HASH_SIZE];
|
| /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));
|
| /prebuilts/tools/common/m2/repository/com/google/apis/google-api-services-storage/v1-rev82-1.22.0/ |
| google-api-services-storage-v1-rev82-1.22.0.jar | |
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/Ip4Dxe/ |
| Ip4Input.h | 78 LIST_ENTRY Bucket[IP4_ASSEMLE_HASH_SIZE];
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCLoopPreIncPrep.cpp | 114 struct Bucket {
115 Bucket(const SCEV *B, Instruction *I) : BaseSCEV(B),
183 SmallVector<Bucket, 16> Buckets;
237 Buckets.push_back(Bucket(LSCEV, MemI));
262 // The base address of each bucket is transformed into a phi and the others
267 // bucket does not work well, specifically because that instruction might
272 // instruction in each bucket, and adjust the recurrence and other offsets
311 // The instruction corresponding to the Bucket's BaseSCEV must be the first
|
| /development/tools/logblame/ |
| analyze_logs.py | 14 class Bucket(object):
15 """Bucket of stats for a particular key managed by the Stats object."""
31 bucket = self._data.get(key)
32 if not bucket:
33 bucket = Bucket()
34 self._data[key] = bucket
35 bucket.count += 1
36 bucket.memory += logLine.memory()
37 bucket.lines.append(logLine
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
49 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
478 // The later case is tricky. For example, if we had one empty bucket with
480 // probe almost the entire table until it found the empty bucket. If the
496 // Only update the state after we've grown our bucket space appropriately
508 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
509 /// FoundBucket. If the bucket contains the key and a value, this returns
510 /// true, otherwise it returns a bucket with an empty marker or tombstone and
535 // Found Val's bucket? If so, return it.
541 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
476 // The later case is tricky. For example, if we had one empty bucket with
478 // probe almost the entire table until it found the empty bucket. If the
494 // Only update the state after we've grown our bucket space appropriately
506 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
507 /// FoundBucket. If the bucket contains the key and a value, this returns
508 /// true, otherwise it returns a bucket with an empty marker or tombstone and
533 // Found Val's bucket? If so, return it.
539 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
481 // The later case is tricky. For example, if we had one empty bucket with
483 // probe almost the entire table until it found the empty bucket. If the
499 // Only update the state after we've grown our bucket space appropriately
511 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
512 /// FoundBucket. If the bucket contains the key and a value, this returns
513 /// true, otherwise it returns a bucket with an empty marker or tombstone and
538 // Found Val's bucket? If so, return it.
544 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
481 // The later case is tricky. For example, if we had one empty bucket with
483 // probe almost the entire table until it found the empty bucket. If the
499 // Only update the state after we've grown our bucket space appropriately
511 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
512 /// FoundBucket. If the bucket contains the key and a value, this returns
513 /// true, otherwise it returns a bucket with an empty marker or tombstone and
538 // Found Val's bucket? If so, return it.
544 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
481 // The later case is tricky. For example, if we had one empty bucket with
483 // probe almost the entire table until it found the empty bucket. If the
499 // Only update the state after we've grown our bucket space appropriately
511 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
512 /// FoundBucket. If the bucket contains the key and a value, this returns
513 /// true, otherwise it returns a bucket with an empty marker or tombstone and
538 // Found Val's bucket? If so, return it.
544 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| DenseMap.h | 36 // We extend a pair to allow users to override the bucket type with their own
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
481 // The later case is tricky. For example, if we had one empty bucket with
483 // probe almost the entire table until it found the empty bucket. If the
499 // Only update the state after we've grown our bucket space appropriately
511 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
512 /// FoundBucket. If the bucket contains the key and a value, this returns
513 /// true, otherwise it returns a bucket with an empty marker or tombstone and
538 // Found Val's bucket? If so, return it.
544 // If we found an empty bucket, the key doesn't exist in the set
[all...] |
| /external/libmojo/third_party/jinja2/ |
| bccache.py | 57 class Bucket(object):
73 """Resets the bucket (unloads the bytecode)."""
93 raise TypeError('can\'t write empty bucket')
112 these methods are passed a :class:`~jinja2.bccache.Bucket`.
123 def load_bytecode(self, bucket):
124 filename = path.join(self.directory, bucket.key)
127 bucket.load_bytecode(f)
129 def dump_bytecode(self, bucket):
130 filename = path.join(self.directory, bucket.key)
132 bucket.write_bytecode(f
[all...] |
