| /external/clang/test/SemaCXX/ |
| 2008-01-11-BadWarning.cpp | 4 void** f(void **Buckets, unsigned NumBuckets) {
5 return Buckets + NumBuckets;
|
| /frameworks/data-binding/compiler/src/main/java/android/databinding/tool/writer/ |
| FlagSet.java | 28 public final long[] buckets; field in class:FlagSet
33 buckets = new long[bucketCount];
36 buckets[i / sBucketSize] |= 1L << (i % sBucketSize);
41 public FlagSet(long[] buckets) {
42 this.buckets = new long[buckets.length];
43 System.arraycopy(buckets, 0, this.buckets, 0, buckets.length);
47 public FlagSet(long[] buckets, int minBucketCount)
[all...] |
| /frameworks/data-binding/compiler/src/test/java/android/databinding/tool/writer/ |
| FlagSetTest.java | 31 assertEquals(3, flagSet.buckets.length);
32 assertEquals(1 << 7, flagSet.buckets[0]);
33 assertEquals(0, flagSet.buckets[1]);
34 assertEquals(0, flagSet.buckets[2]);
42 assertEquals(3, flagSet.buckets.length);
43 assertEquals(0, flagSet.buckets[0]);
44 assertEquals(1 << 2, flagSet.buckets[1]);
45 assertEquals(0, flagSet.buckets[2]);
55 assertEquals(3, flagSet.buckets.length);
56 assertEquals(1 << 5, flagSet.buckets[0])
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/value/ |
| histogram_util_unittest.py | 12 baseline_histogram = """{"count": 3, "buckets": [
16 later_histogram = """{"count": 14, "buckets": [
24 for b in new_histogram['buckets']:
33 histograms.append("""{"count": 3, "buckets": [
37 histograms.append("""{"count": 20, "buckets": [
41 histograms.append("""{"count": 15, "buckets": [
48 for b in new_histogram['buckets']:
56 raw_value = {'buckets': [
61 buckets = histogram_util.GetHistogramBucketsFromRawValue(raw_value)
66 buckets)
[all...] |
| histogram_unittest.py | 34 raw_value_json='{"buckets": [{"low": 1, "high": 2, "count": 1}]}',
38 'raw_json_string={"buckets": [{"low": 1, "high": 2, "count": '
48 raw_value_json='{"buckets": [{"low": 1, "high": 2, "count": 1}]}',
51 ['{"buckets": [{"low": 1, "high": 2, "count": 1}]}'],
56 ['{"buckets": [{"low": 1, "high": 2, "count": 1}]}'],
80 raw_value_json='{"buckets": [{"low": 1, "high": 2, "count": 1}]}',
84 self.assertEquals(['buckets'], d.keys())
85 self.assertTrue(isinstance(d['buckets'], list))
86 self.assertEquals(len(d['buckets']), 1)
93 'buckets': [{'low': 1, 'high': 2, 'count': 1}]
[all...] |
| histogram_util.py | 26 buckets = raw_value.get('buckets', [])
27 if buckets:
32 buckets[-1].setdefault('high', buckets[-1]['low'])
33 return buckets
75 histogram['buckets'] = new_buckets
91 buckets = collections.defaultdict(int)
95 buckets[key] += b['count']
97 buckets = [{'low': key[0], 'high': key[1], 'count': value
[all...] |
| histogram.py | 44 self.buckets = []
46 self.buckets.append(HistogramValueBucket(
51 self.buckets = []
89 return '{"buckets": [%s]}' % (
90 ', '.join([b.ToJSONString() for b in self.buckets]))
106 d['buckets'] = [b.AsDict() for b in self.buckets]
|
| /development/tools/axl/ |
| chewperf.py | 62 buckets = {}
66 if bucket in buckets:
67 buckets[bucket] += bytes
69 buckets[bucket] = bytes
71 top = max(buckets.keys())
73 if x not in buckets.keys():
74 buckets[x] = 0
79 for x in range(len(buckets.items())):
80 window[x % len(window)] = buckets.items()[x][1]
81 print "%s\t%s" % (buckets.items()[x][0], sum(window) / len(window)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| DenseMap.h | 42 BucketT *Buckets;
68 for (BucketT *P = Buckets, *E = Buckets+NumBuckets; P != E; ++P) {
76 memset((void*)Buckets, 0x5a, sizeof(BucketT)*NumBuckets);
78 operator delete(Buckets);
86 return empty() ? end() : iterator(Buckets, Buckets+NumBuckets);
89 return iterator(Buckets+NumBuckets, Buckets+NumBuckets);
92 return empty() ? end() : const_iterator(Buckets, Buckets+NumBuckets)
[all...] |
| /external/chromium-trace/catapult/telemetry/ |
| cloud_storage | 20 BUCKETS = {bucket: easy_bucket_name for easy_bucket_name, bucket
36 """Returns a dict of all files and which buckets they're in."""
37 # Preprocessing: get the contents of all buckets.
39 for bucket in BUCKETS:
59 for bucket in BUCKETS:
103 for file_path, buckets in sorted(files.iteritems()):
104 if buckets:
105 buckets = [BUCKETS[bucket] for bucket in buckets]
[all...] |
| /external/skia/infra/project-config/ |
| cr-buildbucket.cfg | 1 # Defines buckets on cr-buildbucket.appspot.com, used to schedule builds
2 # on buildbot. In particular, CQ uses some of these buckets to schedule tryjobs.
9 buckets {
29 buckets {
49 buckets {
69 buckets {
|
| /external/ltp/utils/ffsb-6.0-rc2/ |
| ffsb_stats.c | 42 fsc->buckets = NULL;
52 temp = ffsb_realloc(fsc->buckets, sizeof(struct stat_bucket) *
55 fsc->buckets = temp;
58 fsc->buckets[fsc->num_buckets - 1].min = min;
59 fsc->buckets[fsc->num_buckets - 1].max = max;
64 free(fsc->buckets);
90 fsd->buckets[i] = ffsb_malloc(sizeof(uint32_t) *
92 assert(fsd->buckets[i] != NULL);
94 memset(fsd->buckets[i], 0, sizeof(uint32_t) * fsc->num_buckets);
103 free(fsd->buckets[i])
[all...] |
| /external/libchrome/base/trace_event/ |
| heap_profiler_heap_dump_writer.cc | 34 // broken down into smaller buckets. Each bucket keeps track of whether further
71 // Comparison operator to order buckets by their size.
76 // Groups the allocations in the bucket by |break_by|. The buckets in the
121 std::vector<Bucket> buckets; local
122 buckets.reserve(breakdown.size());
124 buckets.push_back(key_bucket.second);
126 return buckets;
129 // Breaks down the bucket by |break_by|. Returns only buckets that contribute
134 std::vector<Bucket> buckets = GetSubbuckets(bucket, break_by); local
136 // Ensure that |buckets| is a max-heap (the data structure, not memory heap)
[all...] |
| /external/webrtc/webrtc/modules/remote_bitrate_estimator/ |
| rate_statistics.h | 34 // Counters are kept in buckets (circular buffer), with one bucket
39 // Total count recorded in buckets.
42 // Oldest time recorded in buckets.
45 // Bucket index of oldest counter recorded in buckets.
|
| /external/libvpx/libvpx/ |
| rate_hist.c | 129 int buckets; local
135 buckets = *num_buckets;
137 /* Find the extrema for this list of buckets */
139 for (i = 0; i < buckets; i++) {
144 /* If we have too many buckets, merge the smallest with an adjacent
147 while (buckets > max_buckets) {
148 int last_bucket = buckets - 1;
161 assert(small_bucket < buckets);
162 assert(big_bucket < buckets);
163 assert(merge_bucket < buckets);
255 int buckets = 0; local
277 int buckets = 0; local
[all...] |
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
87 final Entry [] buckets = m_buckets; local
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
111 final Entry [] buckets = m_buckets; local
112 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
130 final Entry [] buckets = m_buckets; local
131 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next
178 Entry [] buckets = m_buckets; local
221 Entry [] buckets = m_buckets; local
290 final Entry [] buckets = m_buckets; local
[all...] |
| ObjectIntMap.java | 50 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
91 final Entry [] buckets = m_buckets; local
93 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length;
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
119 final Entry [] buckets = m_buckets; local
121 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length;
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
171 Entry [] buckets = m_buckets; local
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
193 buckets = m_buckets
217 Entry [] buckets = m_buckets; local
286 final Entry [] buckets = m_buckets; local
[all...] |
| /external/skia/infra/ |
| README.md | 4 project-wide configuration (e.g. list of buckets for cr-buildbucket service and
|
| /frameworks/compile/slang/tests/P_reduce_general_examples_explicit/ |
| reduce_general_examples_explicit.rs | 58 #define BUCKETS 256
59 typedef uint32_t Histogram[BUCKETS];
62 for (int i = 0; i < BUCKETS; ++i)
69 for (int i = 0; i < BUCKETS; ++i)
|
| /frameworks/ex/common/tools/ |
| make-iana-tld-pattern.py | 124 def getBucket(buckets, line):
126 bucket = buckets.get(letter)
130 buckets[letter] = bucket
134 def makePattern(prefix, suffix, buckets, isWebUrl=False):
137 output += getBucket(buckets, 'a').dump(isFirst=True, isWebUrl=isWebUrl)
140 output += getBucket(buckets, chr(letter)).dump(isWebUrl=isWebUrl)
142 output += getBucket(buckets, 'z').dump(isLast=True, isWebUrl=isWebUrl)
158 buckets = {} variable
164 getBucket(buckets, domain[0]).add(domain.strip())
170 getBucket(buckets, 'xn--').add(result[2:-1]
[all...] |
| /external/webrtc/webrtc/base/ |
| random_unittest.cc | 33 // Sample a number of random integers of type T. Divide them into buckets
38 std::vector<int> buckets(bucket_count, 0);
51 // the number of buckets. If we are unlucky and hit one of the excluded
52 // numbers we just resample. Note that if the number of buckets is a
56 buckets[fdiv_remainder(sample, bucket_count)]++;
61 EXPECT_NEAR(buckets[i], samples / bucket_count,
117 std::vector<unsigned int> buckets(bucket_count, 0);
137 buckets[static_cast<uint32_t>(sample - low) / numbers_per_bucket]++;
144 EXPECT_NEAR(buckets[i], mean, sigma_level * sqrt(mean));
157 std::vector<unsigned int> buckets(bucket_count, 0)
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.cpp | 87 // Figure out how many buckets we need, then compute the bucket
95 Buckets.resize(Header.bucket_count);
98 Buckets[bucket].push_back(Data[i]);
102 // Sort the contents of the buckets by hash value so that hash
105 for (size_t i = 0; i < Buckets.size(); ++i)
106 std::stable_sort(Buckets[i].begin(), Buckets[i].end(),
139 // Walk through and emit the buckets for the table. Each index is
143 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
145 if (Buckets[i].size() != 0
[all...] |
| /system/core/libcutils/ |
| hashmap.c | 35 Entry** buckets; member in struct:Hashmap
61 map->buckets = calloc(map->bucketCount, sizeof(Entry*));
62 if (map->buckets == NULL) {
118 Entry* entry = map->buckets[i];
129 free(map->buckets);
130 map->buckets = newBuckets;
146 Entry* entry = map->buckets[i];
153 free(map->buckets);
200 Entry** p = &(map->buckets[index]);
232 Entry* entry = map->buckets[index]
[all...] |
| /art/test/102-concurrent-gc/src/ |
| Main.java | 20 private static final int buckets = 16 * 1024; field in class:Main
28 ByteContainer[] l = new ByteContainer[buckets];
30 for (int i = 0; i < buckets; ++i) {
35 for (int i = 0; i < buckets / 256; ++i) {
36 int index = rnd.nextInt(buckets);
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/ |
| MtpDeviceIndexRunnable.java | 54 final DateBucket[] buckets; field in class:MtpDeviceIndexRunnable.Results
58 int[] unifiedLookupIndex, IngestObjectInfo[] mtpObjects, DateBucket[] buckets) {
61 this.buckets = buckets;
62 this.reversedBuckets = new DateBucket[buckets.length];
63 for (int i = 0; i < buckets.length; i++) {
64 this.reversedBuckets[i] = buckets[buckets.length - 1 - i];
106 DateBucket[] buckets = new DateBucket[numBuckets]; local
130 buckets[i] = new DateBucket(bucketTemp.getKey(), unifiedStartIndex, unifiedEndIndex
[all...] |
