| /external/icu/icu4c/source/i18n/unicode/ |
| alphaindex.h | 37 * in the bucket with this label.
43 * Undeflow Label. The bucket with this label contains names
44 * in scripts that sort before any of the bucket labels in this index.
50 * Inflow Label. The bucket with this label contains names
51 * in scripts that sort between two of the bucket labels in this index.
60 * Overflow Label. Te bucket with this label contains names in scripts
61 * that sort after all of the bucket labels in this index.
101 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
102 * the target list, where everything in the bucket is greater than or equal to the characte
[all...] |
| /external/libevent/ |
| ratelim-internal.h | 35 /** A token bucket is an internal structure that tracks how many bytes we are
42 /** When was this bucket last updated? Measured in abstract 'ticks'
43 * relative to the token bucket configuration. */
47 /** Configuration info for a token bucket or set of token buckets. */
66 /** The current tick is 'current_tick': add bytes to 'bucket' as specified in
68 int ev_token_bucket_update(struct ev_token_bucket *bucket,
77 /** Adjust 'bucket' to respect 'cfg', and note that it was last updated in
79 * configuration of 'bucket'; otherwise, we are setting it up for the first
82 int ev_token_bucket_init(struct ev_token_bucket *bucket,
|
| /external/webrtc/webrtc/base/ |
| ratetracker.cc | 43 // has passed to a new bucket then we have to skip some of the oldest buckets.
47 // number of old buckets (i.e. after the current bucket in the ring buffer)
50 // Number of milliseconds of the first bucket that are not a portion of the
74 // Only count a portion of the first bucket according to how much of the
75 // first bucket is within the current interval.
111 // Advance the current bucket as needed for the current time, and reset
112 // bucket counts as we advance.
124 // Add all samples in the bucket that includes the current time.
138 // We only need to initialize the first bucket because we reset buckets when
|
| ratetracker.h | 20 // each bucket of a given size and calculating the instantaneous rate assuming
21 // that over each bucket the rate was constant.
46 // Reads the current time in order to determine the appropriate bucket for
47 // these samples, and increments the count for that bucket by sample_count.
|
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| local_iterators.pass.cpp | 46 C::size_type b = c.bucket(0);
51 b = c.bucket(1);
61 b = c.bucket(2);
71 b = c.bucket(3);
78 b = c.bucket(4);
85 b = c.bucket(5);
90 b = c.bucket(6);
110 C::size_type b = c.bucket(0);
115 b = c.bucket(1);
125 b = c.bucket(2)
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| local_iterators.pass.cpp | 46 C::size_type b = c.bucket(0);
51 b = c.bucket(1);
61 b = c.bucket(2);
71 b = c.bucket(3);
78 b = c.bucket(4);
85 b = c.bucket(5);
90 b = c.bucket(6);
110 C::size_type b = c.bucket(0);
115 b = c.bucket(1);
125 b = c.bucket(2)
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/ |
| local_iterators.pass.cpp | 46 C::size_type b = c.bucket(0);
51 b = c.bucket(1);
61 b = c.bucket(2);
71 b = c.bucket(3);
78 b = c.bucket(4);
85 b = c.bucket(5);
90 b = c.bucket(6);
110 C::size_type b = c.bucket(0);
115 b = c.bucket(1);
125 b = c.bucket(2)
[all...] |
| /external/autotest/server/cros/ |
| gsutil_wrapper.py | 11 def copy_private_bucket(host, bucket, filename, destination, timeout_s=30):
20 @param bucket: path to name of gs bucket.
21 @param filename: string, name of the file or dir in 'bucket' to copy.
27 assert (bucket.startswith('gs://'))
30 src = os.path.join(bucket, filename)
|
| /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...] |
| FoldingSet.cpp | 184 /// GetNextPtr - In order to save space, each bucket is a
188 /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null:
191 // The low bit is set if this is the pointer back to the bucket.
202 assert((Ptr & 1) && "Not a bucket pointer");
206 /// GetBucketFor - Hash the specified node ID and return the hash bucket for
214 /// AllocateBuckets - Allocated initialized bucket memory.
217 // Set the very last bucket to be a non-null "pointer".
236 // Set all but the last bucket to null pointers.
239 // Set the very last bucket to be a non-null "pointer".
267 // Insert the node into the new bucket, after recomputing the hash
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/wpr/ |
| archive_info.py | 20 def AssertValidCloudStorageBucket(bucket):
21 is_valid = bucket in (None,
26 raise ValueError("Cloud storage privacy bucket %s is invalid" % bucket)
30 def __init__(self, file_path, data, bucket):
31 AssertValidCloudStorageBucket(bucket)
35 self._bucket = bucket
48 def FromFile(cls, file_path, bucket):
53 return cls(file_path, data, bucket)
54 return cls(file_path, {'archives': {}, 'platform_specific': True}, bucket)
[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/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".
271 assert(isPowerOf2_32(NewBucketCount) && "Bad bucket count!")
[all...] |
| 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...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/ |
| MtpDeviceIndexRunnable.java | 22 * constant time and respecting the need to have bucket names always come before items
23 * in that bucket when accessing the list sequentially, both in ascending and descending
27 * [Bucket A]: [photo 1], [photo 2]
28 * [Bucket B]: [photo 3]
33 * Now, whether we access the list in ascending or descending order, we know which bucket
34 * to look in (0 corresponds to A and 1 to B), and can return the bucket label as the first
35 * item in a bucket as needed. The individual IndexBUckets have a startIndex and endIndex
37 * offset of the specific item we want from within a specific bucket.
145 List<IngestObjectInfo> bucket = bucketsTemp.get(mDateInstance); local
146 if (bucket == null)
[all...] |
| MtpDeviceIndex.java | 24 * The index enables the access of items and bucket labels as one unified list.
26 * [Bucket A]: [photo 1], [photo 2]
27 * [Bucket B]: [photo 3]
30 * [Bucket A], [photo 1], [photo 2], [Bucket B], [photo 3]
34 * bucket labels need to always be at the beginning:
35 * [Bucket B], [photo 3], [Bucket A], [photo 2], [photo 1]
40 * - size: get the total number of items (bucket labels and MTP objects)
240 * @return the bucket label or IngestObjectInfo at the specified position an
249 DateBucket bucket = results.buckets[results.unifiedLookupIndex[position]]; local
258 DateBucket bucket = results.buckets[results.unifiedLookupIndex[zeroIndex]]; local
340 DateBucket bucket = results.buckets[results.unifiedLookupIndex[position]]; local
347 DateBucket bucket = results.buckets[results.unifiedLookupIndex[zeroIndex]]; local
[all...] |
| /external/chromium-trace/catapult/dependency_manager/dependency_manager/ |
| uploader.py | 17 def __init__(self, bucket, remote_path, local_path, cs_backup_path=None):
18 if not bucket or not remote_path or not local_path:
20 'Attempted to partially initialize upload data with bucket %s, '
21 'remote_path %s, and local_path %s', bucket, remote_path, local_path)
26 self._cs_bucket = bucket
39 location in the same bucket in cloud storage if |force| is True.
64 logging.error('Failed to copy existing file %s in cloud storage bucket '
73 logging.error('Failed to upload %s to %s in cloud_storage bucket %s',
|
| exceptions.py | 44 def __init__(self, bucket, path):
46 'File location %s already exists in bucket %s' % (path, bucket))
|
| /external/libchrome/base/trace_event/ |
| 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/rs/ |
| rsMap.h | 40 for (size_t i = 0; i < MAP_NUM_BUCKET; i++) { bucket[i] = nullptr; }
45 LinkNode* p = bucket[i];
57 LinkNode* node = bucket[index];
72 bucket[index] = node;
92 next = map->bucket[bucket_index];
128 LinkNode* node = bucket[i];
145 LinkNode* node = bucket[index];
160 LinkNode* bucket[MAP_NUM_BUCKET]; member in class:android::renderscript::Map
|
| /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);
|
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| bug499.go | 7 // Gccgo got confused when a type was used both for a map bucket type
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| bug499.go | 7 // Gccgo got confused when a type was used both for a map bucket type
|
| /external/iproute2/man/man8/ |
| tc-tbf.8 | 3 tbf \- Token Bucket Filter
24 The Token Bucket Filter is a classful queueing discipline available for
47 in one go. Tokens arrive at a steady rate, until the bucket is full.
53 to limit the speed at which the bucket empties. This peakrate is implemented as a second TBF
54 with a very small bucket, so that it doesn't burst.
56 To achieve perfection, the second bucket may contain only a single packet, which leads to
73 bucket, the rate and possibly the peakrate (if set). These two parameters
78 Size of the bucket, in bytes. This is the maximum amount of bytes that tokens can be available for instantaneously.
82 If your buffer is too small, packets may be dropped because more tokens arrive per timer tick than fit in your bucket.
105 Maximum depletion rate of the bucket. The peakrate does no
[all...] |
