| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 192 auto *Bucket = FindBucketFor(Ptr);
193 if (*Bucket == Ptr)
194 return Bucket;
228 const void *const *Bucket;
233 : Bucket(BP), End(E) {
244 return Bucket == RHS.Bucket;
247 return Bucket != RHS.Bucket;
251 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucke
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 192 auto *Bucket = FindBucketFor(Ptr);
193 if (*Bucket == Ptr)
194 return Bucket;
228 const void *const *Bucket;
233 : Bucket(BP), End(E) {
244 return Bucket == RHS.Bucket;
247 return Bucket != RHS.Bucket;
251 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucke
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 192 auto *Bucket = FindBucketFor(Ptr);
193 if (*Bucket == Ptr)
194 return Bucket;
228 const void *const *Bucket;
233 : Bucket(BP), End(E) {
244 return Bucket == RHS.Bucket;
247 return Bucket != RHS.Bucket;
251 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucke
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 192 auto *Bucket = FindBucketFor(Ptr);
193 if (*Bucket == Ptr)
194 return Bucket;
228 const void *const *Bucket;
233 : Bucket(BP), End(E) {
244 return Bucket == RHS.Bucket;
247 return Bucket != RHS.Bucket;
251 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucke
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 192 auto *Bucket = FindBucketFor(Ptr);
193 if (*Bucket == Ptr)
194 return Bucket;
228 const void *const *Bucket;
233 : Bucket(BP), End(E) {
244 return Bucket == RHS.Bucket;
247 return Bucket != RHS.Bucket;
251 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucke
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 192 auto *Bucket = FindBucketFor(Ptr);
193 if (*Bucket == Ptr)
194 return Bucket;
228 const void *const *Bucket;
233 : Bucket(BP), End(E) {
244 return Bucket == RHS.Bucket;
247 return Bucket != RHS.Bucket;
251 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucke
[all...] |
| /external/libchrome/base/trace_event/ |
| heap_profiler_heap_dump_writer.cc | 30 // The pairs are grouped into |Bucket|s. A bucket is a group of (context, size)
33 // bucket that represents the entire heap. Then this bucket is recursively
34 // broken down into smaller buckets. Each bucket keeps track of whether further
46 struct Bucket {
47 Bucket()
63 // elements in this bucket, the stack frames 0 up to (but not including) the
67 // When true, the type name for all elements in this bucket must be equal.
72 bool operator<(const Bucket& lhs, const Bucket& rhs)
[all...] |
| heap_profiler_heap_dump_writer.h | 37 struct Bucket;
83 // Inserts an |Entry| for |Bucket| into |entries_|. Returns false if the
85 bool AddEntryForBucket(const Bucket& bucket);
87 // Recursively breaks down a bucket into smaller buckets and adds entries for
89 void BreakDown(const Bucket& bucket);
102 // Minimum size of an allocation for which an allocation bucket will be
|
| /frameworks/support/room/compiler/src/main/kotlin/android/arch/persistence/room/processor/cache/ |
| Cache.kt | 38 val entities: Bucket<EntityKey, Entity> = Bucket(parent?.entities)
39 val pojos: Bucket<PojoKey, Pojo> = Bucket(parent?.pojos)
41 inner class Bucket<K, T>(source: Bucket<K, T>?) {
|
| /external/llvm/lib/Support/ |
| SmallPtrSet.cpp | 49 // Okay, we know we have space. Find a hash bucket.
50 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr));
51 if (*Bucket == Ptr)
52 return std::make_pair(Bucket, false); // Already inserted, good.
55 if (*Bucket == getTombstoneMarker())
59 *Bucket = Ptr;
60 return std::make_pair(Bucket, true);
78 // Okay, we know we have space. Find a hash bucket.
79 void **Bucket = const_cast<void**>(FindBucketFor(Ptr));
80 if (*Bucket != Ptr) return false; // Not in the set
[all...] |
| StringMap.cpp | 61 // Allocate one extra bucket, set it to look filled so the iterators stop at
67 /// LookupBucketFor - Look up the bucket that the specified string should end
69 /// specified bucket will be non-null. Otherwise, it will be null. In either
70 /// case, the FullHashValue field of the bucket will be set to the hash value
86 // If we found an empty bucket, this key isn't in the table yet, return it.
89 // empty bucket. This reduces probing.
117 // Okay, we didn't find the item. Probe to the next bucket.
127 /// FindKey - Look up the bucket that contains the specified key. If it exists
128 /// in the map, return the bucket number of the key. Otherwise return -1.
140 // If we found an empty bucket, this key isn't in the table yet, return
[all...] |
| /external/swiftshader/third_party/llvm-subzero/lib/Support/ |
| SmallPtrSet.cpp | 50 // Okay, we know we have space. Find a hash bucket.
51 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr));
52 if (*Bucket == Ptr)
53 return std::make_pair(Bucket, false); // Already inserted, good.
56 if (*Bucket == getTombstoneMarker())
60 *Bucket = Ptr;
61 return std::make_pair(Bucket, true);
79 // Okay, we know we have space. Find a hash bucket.
80 void **Bucket = const_cast<void**>(FindBucketFor(Ptr));
81 if (*Bucket != Ptr) return false; // Not in the set
[all...] |
| StringMap.cpp | 63 // Allocate one extra bucket, set it to look filled so the iterators stop at
68 /// LookupBucketFor - Look up the bucket that the specified string should end
70 /// specified bucket will be non-null. Otherwise, it will be null. In either
71 /// case, the FullHashValue field of the bucket will be set to the hash value
87 // If we found an empty bucket, this key isn't in the table yet, return it.
90 // empty bucket. This reduces probing.
118 // Okay, we didn't find the item. Probe to the next bucket.
127 /// FindKey - Look up the bucket that contains the specified key. If it exists
128 /// in the map, return the bucket number of the key. Otherwise return -1.
140 // If we found an empty bucket, this key isn't in the table yet, return
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SmallPtrSet.h | 147 const void *const *Bucket;
149 explicit SmallPtrSetIteratorImpl(const void *const *BP) : Bucket(BP) {
154 return Bucket == RHS.Bucket;
157 return Bucket != RHS.Bucket;
161 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket
162 /// that is. This is guaranteed to stop because the end() bucket is marked
165 while (*Bucket == SmallPtrSetImpl::getEmptyMarker() |
[all...] |
| StringMap.h | 83 /// LookupBucketFor - Look up the bucket that the specified string should end
85 /// specified bucket will be non-null. Otherwise, it will be null. In either
86 /// case, the FullHashValue field of the bucket will be set to the hash value
90 /// FindKey - Look up the bucket that contains the specified key. If it exists
91 /// in the map, return the bucket number of the key. Otherwise return -1.
153 // Okay, the item doesn't already exist, and 'Bucket' is the bucket to fill
290 int Bucket = FindKey(Key);
291 if (Bucket == -1) return end();
292 return iterator(TheTable+Bucket);
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| StringMap.cpp | 44 // Allocate one extra bucket, set it to look filled so the iterators stop at
50 /// LookupBucketFor - Look up the bucket that the specified string should end
52 /// specified bucket will be non-null. Otherwise, it will be null. In either
53 /// case, the FullHashValue field of the bucket will be set to the hash value
67 ItemBucket &Bucket = TheTable[BucketNo];
68 StringMapEntryBase *BucketItem = Bucket.Item;
69 // If we found an empty bucket, this key isn't in the table yet, return it.
72 // empty bucket. This reduces probing.
78 Bucket.FullHashValue = FullHashValue;
85 } else if (Bucket.FullHashValue == FullHashValue)
[all...] |
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/scanner/ |
| BackgroundScanScheduler.java | 48 * where each bucket represents a set of channels and an interval to scan at. This
51 * <p>Each new request is placed in the best predefined bucket. Once all requests have been added
52 * the last buckets (lower priority) are placed in the next best bucket until the number of buckets
66 // Max channels that can be specified per bucket
90 * the next smallest bucket with the smallest bucket having a period of PERIOD_MIN_GCD_MS.
103 * scan will be placed in the 20s bucket.
105 * If there are special scan requests such as exponential back off, we always dedicate a bucket
128 * collection to be scanned by the bucket as settings are added to it.
130 private class Bucket {
276 Bucket bucket = mBuckets[index]; local
[all...] |
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| SmallPtrSet.h | 211 const void *const *Bucket;
216 : Bucket(BP), End(E) {
227 return Bucket == RHS.Bucket;
230 return Bucket != RHS.Bucket;
234 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket
235 /// that is. This is guaranteed to stop because the end() bucket is marked
238 assert(Bucket <= End)
[all...] |
| /frameworks/base/core/java/android/app/usage/ |
| NetworkStats.java | 130 public static class Bucket {
202 * <p>Any cellular usage in this bucket was incurred while the device was connected to a
213 * <p>Any cellular usage in this bucket as incurred while the device was roaming on another
277 public Bucket() {
281 * Key of the bucket. Usually an app uid or one of the following special values:<p />
287 * @return Bucket key.
294 * Tag of the bucket.<p />
295 * @return Bucket tag.
342 * Start timestamp of the bucket's time interval. Defined in terms of "Unix time", see
351 * End timestamp of the bucket's time interval. Defined in terms of "Unix time", se
570 Bucket bucket = new Bucket(); local
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 201 const void *const *Bucket;
206 : Bucket(BP), End(E) {
211 return Bucket == RHS.Bucket;
214 return Bucket != RHS.Bucket;
218 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket
219 /// that is. This is guaranteed to stop because the end() bucket is marked
222 assert(Bucket <= End)
[all...] |
| /frameworks/support/v7/recyclerview/tests/src/android/support/v7/widget/ |
| BucketTest.java | 39 ChildHelper.Bucket mBucket;
49 mBucket = new ChildHelper.Bucket();
53 mArr.add(i * (ChildHelper.Bucket.BITS_PER_WORD - 1));
54 mArr.add(i * (ChildHelper.Bucket.BITS_PER_WORD));
55 mArr.add(i * (ChildHelper.Bucket.BITS_PER_WORD + 1));
56 mArr.add(i * ChildHelper.Bucket.BITS_PER_WORD - 1);
57 mArr.add(i * ChildHelper.Bucket.BITS_PER_WORD);
58 mArr.add(i * ChildHelper.Bucket.BITS_PER_WORD + 1);
|
| /external/llvm/test/tools/dsymutil/Inputs/scattered-reloc/ |
| 1.s | 115 .long 1 @ Header Bucket Count
122 .long 0 @ Bucket 0
123 .long 193487034 @ Hash in Bucket 0
124 .long LNames0-Lnames_begin @ Offset in Bucket 0
135 .long 1 @ Header Bucket Count
142 .long -1 @ Bucket 0
148 .long 1 @ Header Bucket Count
155 .long -1 @ Bucket 0
161 .long 1 @ Header Bucket Count
172 .long 0 @ Bucket
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| AlphabeticIndex.java | 20 import android.icu.text.AlphabeticIndex.Bucket;
21 import android.icu.text.AlphabeticIndex.Bucket.LabelType;
44 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
45 * the target list, where everything in the bucket is greater than or equal to the character
47 * they will be in sorted order in the right bucket.
52 * into an inflow bucket between the other two scripts.
73 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
74 * if (showAll || bucket.size() != 0)
781 Bucket<V> bucket = currentBucket; local
1012 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); local
1079 Bucket<V> bucket = bucketList.get(i); local
1125 Bucket<V> bucket = bucketList.get(i); local
1133 Bucket<V> bucket = bucketList.get(start); local
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| AlphabeticIndex.java | 19 import com.ibm.icu.text.AlphabeticIndex.Bucket;
20 import com.ibm.icu.text.AlphabeticIndex.Bucket.LabelType;
43 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
44 * the target list, where everything in the bucket is greater than or equal to the character
46 * they will be in sorted order in the right bucket.
51 * into an inflow bucket between the other two scripts.
72 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
73 * if (showAll || bucket.size() != 0)
809 Bucket<V> bucket = currentBucket; local
1058 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); local
1125 Bucket<V> bucket = bucketList.get(i); local
1171 Bucket<V> bucket = bucketList.get(i); local
1179 Bucket<V> bucket = bucketList.get(start); local
[all...] |
| /development/tools/idegen/src/ |
| Eclipse.java | 61 List<Bucket> buckets = new ArrayList<Bucket>(patterns.size());
63 buckets.add(new Bucket(pattern));
71 for (Bucket bucket : buckets) {
72 if (bucket.matches(path)) {
73 bucket.sourceRoots.add(sourceRoot);
80 for (Bucket bucket : buckets) {
81 for (File sourceRoot : bucket.sourceRoots)
[all...] |
