| /external/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 41 SmallVector<FreeList*, 8> Bucket;
43 // Remove an entry from the free list in Bucket[Idx] and return it.
46 if (Idx >= Bucket.size())
48 FreeList *Entry = Bucket[Idx];
51 Bucket[Idx] = Entry->Next;
55 // Add an entry to the free list at Bucket[Idx].
59 if (Idx >= Bucket.size())
60 Bucket.resize(size_t(Idx) + 1);
61 Entry->Next = Bucket[Idx];
62 Bucket[Idx] = Entry
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/file/ |
| connection.py | 24 from boto.file.bucket import Bucket
33 return Bucket(bucket_name, self.file_storage_uri.object_name)
|
| __init__.py | 26 from boto.file.bucket import Bucket
28 __all__ = ['Connection', 'Key', 'Bucket']
|
| /system/core/metricsd/uploader/proto/ |
| histogram_event.proto | 38 // The per-bucket data.
39 message Bucket {
40 // Each bucket's range is bounded by min <= x < max.
41 // It is valid to omit one of these two fields in a bucket, but not both.
44 // bucket's min value (possibly computed per above). The last bucket in a
49 // The bucket's index in the list of buckets, sorted in ascending order.
55 // The number of entries in this bucket.
58 repeated Bucket bucket = 3
[all...] |
| /external/llvm/lib/Support/ |
| FoldingSet.cpp | 185 /// GetNextPtr - In order to save space, each bucket is a
189 /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null:
192 // The low bit is set if this is the pointer back to the bucket.
203 assert((Ptr & 1) && "Not a bucket pointer");
207 /// GetBucketFor - Hash the specified node ID and return the hash bucket for
215 /// AllocateBuckets - Allocated initialized bucket memory.
218 // Set the very last bucket to be a non-null "pointer".
259 // Set all but the last bucket to null pointers.
262 // Set the very last bucket to be a non-null "pointer".
290 // Insert the node into the new bucket, after recomputing the hash
[all...] |
| SmallPtrSet.cpp | 64 // Okay, we know we have space. Find a hash bucket.
65 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr));
66 if (*Bucket == Ptr)
67 return std::make_pair(Bucket, false); // Already inserted, good.
70 if (*Bucket == getTombstoneMarker())
72 *Bucket = Ptr;
74 return std::make_pair(Bucket, true);
93 // Okay, we know we have space. Find a hash bucket.
94 void **Bucket = const_cast<void**>(FindBucketFor(Ptr));
95 if (*Bucket != Ptr) return false; // Not in the set
[all...] |
| StringMap.cpp | 47 // Allocate one extra bucket, set it to look filled so the iterators stop at
53 /// LookupBucketFor - Look up the bucket that the specified string should end
55 /// specified bucket will be non-null. Otherwise, it will be null. In either
56 /// case, the FullHashValue field of the bucket will be set to the hash value
72 // If we found an empty bucket, this key isn't in the table yet, return it.
75 // empty bucket. This reduces probing.
103 // Okay, we didn't find the item. Probe to the next bucket.
113 /// FindKey - Look up the bucket that contains the specified key. If it exists
114 /// in the map, return the bucket number of the key. Otherwise return -1.
126 // If we found an empty bucket, this key isn't in the table yet, return
[all...] |
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/scanner/ |
| BackgroundScanScheduler.java | 49 * where each bucket represents a set of channels and an interval to scan at. This
52 * <p>Each new request is placed in the best predefined bucket. Once all requests have been added
53 * the last buckets (lower priority) are placed in the next best bucket until the number of buckets
67 // Max channels that can be specified per bucket
91 * the next smallest bucket with the smallest bucket having a period of PERIOD_MIN_GCD_MS.
104 * scan will be placed in the 20s bucket.
106 * If there are special scan requests such as exponential back off, we always dedicate a bucket
129 * collection to be scanned by the bucket as settings are added to it.
131 private class Bucket {
277 Bucket bucket = mBuckets[index]; local
[all...] |
| /external/llvm/include/llvm/ADT/ |
| StringMap.h | 71 /// LookupBucketFor - Look up the bucket that the specified string should end
73 /// specified bucket will be non-null. Otherwise, it will be null. In either
74 /// case, the FullHashValue field of the bucket will be set to the hash value
78 /// FindKey - Look up the bucket that contains the specified key. If it exists
79 /// in the map, return the bucket number of the key. Otherwise return -1.
278 int Bucket = FindKey(Key);
279 if (Bucket == -1) return end();
280 return iterator(TheTable+Bucket, true);
284 int Bucket = FindKey(Key);
285 if (Bucket == -1) return end()
[all...] |
| SmallPtrSet.h | 151 const void *const *Bucket;
156 : Bucket(BP), End(E) {
161 return Bucket == RHS.Bucket;
164 return Bucket != RHS.Bucket;
168 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket
169 /// that is. This is guaranteed to stop because the end() bucket is marked
172 assert(Bucket <= End)
[all...] |
| /frameworks/base/core/java/android/app/usage/ |
| NetworkStats.java | 130 public static class Bucket {
179 * <p>Any cellular usage in this bucket was incurred while the device was connected to a
190 * <p>Any cellular usage in this bucket as incurred while the device was roaming on another
244 public Bucket() {
248 * Key of the bucket. Usually an app uid or one of the following special values:<p />
254 * @return Bucket key.
261 * Tag of the bucket.<p />
262 * @return Bucket tag.
294 * Start timestamp of the bucket's time interval. Defined in terms of "Unix time", see
303 * End timestamp of the bucket's time interval. Defined in terms of "Unix time", se
521 Bucket bucket = new Bucket(); local
[all...] |
| NetworkStatsManager.java | 22 import android.app.usage.NetworkStats.Bucket;
41 * discrete bins of time called 'Buckets'. See {@link NetworkStats.Bucket} for details.
54 * bucket for a particular key and state and roaming combination. In case of the user-wide and
55 * device-wide summaries a single bucket containing the totalised network usage is returned.
62 * can be multiple buckets for a particular key but all Bucket's state is going to be
63 * {@link NetworkStats.Bucket#STATE_ALL} and all Bucket's roaming is going to be
64 * {@link NetworkStats.Bucket#ROAMING_ALL}.
106 * device. Result is a single Bucket aggregated over time, state, uid, tag and roaming. This
107 * means the bucket's start and end timestamp are going to be the same as the 'startTime' an
133 Bucket bucket = null; local
[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/chromium-trace/catapult/third_party/gsutil/third_party/boto/tests/unit/s3/ |
| test_key.py | 30 from boto.s3.bucket import Bucket
50 b = Bucket(self.service_connection, 'mybucket')
59 b = Bucket(self.service_connection, 'mybucket')
70 b = Bucket(self.service_connection, 'mybucket')
77 b = Bucket(self.service_connection, 'mybucket')
83 b = Bucket(self.service_connection, 'mybucket')
86 # Mock out the bucket object - we really only care about calls
88 k.bucket = mock.MagicMock()
92 k.bucket.list.assert_not_called(
[all...] |
| test_tagging.py | 4 from boto.s3.bucket import Bucket
29 b = Bucket(self.service_connection, 'mybucket')
|
| test_lifecycle.py | 25 from boto.s3.bucket import Bucket
61 bucket = Bucket(self.service_connection, 'mybucket')
62 response = bucket.get_lifecycle_config()
|
| test_bucket.py | 10 from boto.s3.bucket import Bucket
25 bucket = self.service_connection.create_bucket('mybucket_create')
26 self.assertEqual(bucket.name, 'mybucket_create')
30 bucket = Bucket(self.service_connection, 'mybucket_constructor')
31 self.assertEqual(bucket.name, 'mybucket_constructor')
35 bucket = self.service_connection.create_bucket('mybucket')
36 self.assertEqual(bucket.__repr__(), '<Bucket: mybucket>'
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| AlphabeticIndex.java | 18 import android.icu.text.AlphabeticIndex.Bucket;
19 import android.icu.text.AlphabeticIndex.Bucket.LabelType;
42 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
43 * the target list, where everything in the bucket is greater than or equal to the character
45 * they will be in sorted order in the right bucket.
50 * into an inflow bucket between the other two scripts.
71 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
72 * if (showAll || bucket.size() != 0)
776 Bucket<V> bucket = currentBucket; local
1005 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); local
1072 Bucket<V> bucket = bucketList.get(i); local
1118 Bucket<V> bucket = bucketList.get(i); local
1126 Bucket<V> bucket = bucketList.get(start); local
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| AlphabeticIndex.java | 17 import com.ibm.icu.text.AlphabeticIndex.Bucket;
18 import com.ibm.icu.text.AlphabeticIndex.Bucket.LabelType;
41 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
42 * the target list, where everything in the bucket is greater than or equal to the character
44 * they will be in sorted order in the right bucket.
49 * into an inflow bucket between the other two scripts.
70 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
71 * if (showAll || bucket.size() != 0)
804 Bucket<V> bucket = currentBucket; local
1051 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); local
1118 Bucket<V> bucket = bucketList.get(i); local
1164 Bucket<V> bucket = bucketList.get(i); local
1172 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...] |
| /external/icu/icu4c/source/i18n/unicode/ |
| alphaindex.h | 35 * in the bucket with this label.
41 * Undeflow Label. The bucket with this label contains names
42 * in scripts that sort before any of the bucket labels in this index.
48 * Inflow Label. The bucket with this label contains names
49 * in scripts that sort between two of the bucket labels in this index.
58 * Overflow Label. Te bucket with this label contains names in scripts
59 * that sort after all of the bucket labels in this index.
99 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
100 * the target list, where everything in the bucket is greater than or equal to the characte
[all...] |
| /external/icu/android_icu4j/cts-coverage/src/main/tests/android/icu/cts/coverage/text/ |
| AlphabeticIndexTest.java | 70 AlphabeticIndex.Bucket<?> underflowBucket = null;
71 AlphabeticIndex.Bucket<?> overflowBucket = null;
72 AlphabeticIndex.Bucket<?> inflowBucket = null;
73 for (AlphabeticIndex.Bucket<?> bucket : index) {
74 switch (bucket.getLabelType()) {
77 underflowBucket = bucket;
81 overflowBucket = bucket;
85 inflowBucket = bucket;
|
| /external/llvm/lib/DebugInfo/DWARF/ |
| DWARFAcceleratorTable.cpp | 54 << "Bucket count = " << Hdr.NumBuckets << '\n'
82 for (unsigned Bucket = 0; Bucket < Hdr.NumBuckets; ++Bucket) {
85 OS << format("Bucket[%d]\n", Bucket);
96 if (Hash % Hdr.NumBuckets != Bucket)
|
| /cts/tests/tests/app.usage/src/android/app/usage/cts/ |
| NetworkUsageStatsTest.java | 303 NetworkStats.Bucket bucket = null; local
305 bucket = mNsm.querySummaryForDevice(
311 assertNotNull(bucket);
312 assertTimestamps(bucket);
313 assertEquals(bucket.getState(), NetworkStats.Bucket.STATE_ALL);
314 assertEquals(bucket.getUid(), NetworkStats.Bucket.UID_ALL);
317 bucket = mNsm.querySummaryForDevice
335 NetworkStats.Bucket bucket = null; local
373 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
427 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
482 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
[all...] |
| /external/clang/lib/Lex/ |
| HeaderMap.cpp | 131 /// getBucket - Return the specified hash table bucket from the header map,
132 /// bswap'ing its fields as appropriate. If the bucket number is not valid,
133 /// this return a bucket with an empty key (0).
149 // Otherwise, the bucket is valid. Load the values, bswapping as needed.
220 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) {
221 HMapBucket B = getBucket(Bucket & (NumBuckets-1));
|
