| /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...] |
| /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);
|
| /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_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...] |
| /external/emma/core/java12/com/vladium/util/ |
| IntObjectMap.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)
112 final Entry [] buckets = m_buckets; local
113 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
164 Entry [] buckets = m_buckets; local
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
189 buckets = m_buckets
248 final Entry [] buckets = m_buckets; local
[all...] |
| 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...] |
| IntSet.java | 46 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
85 final Entry [] buckets = m_buckets; local
86 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
145 Entry [] buckets = m_buckets; local
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
161 buckets = m_buckets;
162 bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
163 final Entry bucketListHead = buckets [bucketIndex];
165 buckets [bucketIndex] = newEntry
220 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...] |
| SoftValueMap.java | 61 * @param initialCapacity initial number of hash buckets in the table
163 final SoftEntry [] buckets = m_buckets; local
164 final int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
234 SoftEntry [] buckets = m_buckets; local
235 int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
281 buckets = m_buckets;
282 bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
283 final SoftEntry bucketListHead = buckets [bucketIndex]
301 final SoftEntry [] buckets = m_buckets; local
345 final SoftEntry [] buckets = m_buckets; local
476 final SoftEntry [] buckets = m_buckets; local
[all...] |
| /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/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...] |
| /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/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/libdrm/ |
| xf86drmHash.h | 44 HashBucketPtr buckets[HASH_SIZE]; member in struct:HashTable
|
| xf86drmHash.c | 120 for (i = 0; i < HASH_SIZE; i++) table->buckets[i] = NULL;
134 for (bucket = table->buckets[i]; bucket;) {
156 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
161 bucket->next = table->buckets[hash];
162 table->buckets[hash] = bucket;
202 bucket->next = table->buckets[hash];
203 table->buckets[hash] = bucket;
222 table->buckets[hash] = bucket->next;
238 table->p1 = table->buckets[table->p0];
251 table->p1 = table->buckets[0]
[all...] |
| /external/mesa3d/src/mesa/program/ |
| hash_table.c | 45 struct node buckets[1]; member in struct:hash_table
69 * sizeof(ht->buckets[0])));
76 make_empty_list(& ht->buckets[i]);
101 foreach_s(node, temp, & ht->buckets[i]) {
106 assert(is_empty_list(& ht->buckets[i]));
118 foreach(node, & ht->buckets[bucket]) {
149 insert_at_head(& ht->buckets[bucket], & node->link);
160 foreach(node, & ht->buckets[bucket]) {
174 insert_at_head(& ht->buckets[bucket], & hn->link);
200 foreach_s(node, temp, &ht->buckets[bucket])
[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/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...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/ |
| MtpDeviceIndex.java | 18 * Index of MTP media objects organized into "buckets," or groupings, based on the date
21 * When the index is created, the buckets are sorted in their natural
22 * order, and the items within the buckets sorted by the date they are taken.
249 DateBucket bucket = results.buckets[results.unifiedLookupIndex[position]];
258 DateBucket bucket = results.buckets[results.unifiedLookupIndex[zeroIndex]];
293 /* Although this is O(log(number of buckets)), and thus should not be used
306 int iMax = results.buckets.length - 1;
309 if (results.buckets[iMid].itemsStartIndex + results.buckets[iMid].numItems
312 } else if (results.buckets[iMid].itemsStartIndex > position)
[all...] |
| 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...] |
| /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...] |
| /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...] |
| /external/boringssl/src/crypto/lhash/ |
| lhash.c | 68 /* kMinNumBuckets is the minimum size of the buckets array in an |_LHASH|. */
84 ret->buckets = OPENSSL_malloc(sizeof(LHASH_ITEM *) * ret->num_buckets);
85 if (ret->buckets == NULL) {
89 OPENSSL_memset(ret->buckets, 0, sizeof(LHASH_ITEM *) * ret->num_buckets);
103 for (LHASH_ITEM *n = lh->buckets[i]; n != NULL; n = next) {
109 OPENSSL_free(lh->buckets);
118 * element of |lh->buckets|, otherwise it returns a pointer to the |next|
131 ret = &lh->buckets[hash % lh->num_buckets];
155 * redistributes the existing items into it before making it |lh->buckets| and
173 for (cur = lh->buckets[i]; cur != NULL; cur = next)
[all...] |
| /external/libdrm/amdgpu/ |
| util_hash.c | 85 struct util_node **buckets; member in struct:util_hash_data
144 struct util_node **oldBuckets = hash->buckets;
150 hash->buckets = malloc(sizeof(struct util_node*) * hash->numBuckets);
152 hash->buckets[i] = e;
166 beforeFirstNode = &hash->buckets[h % hash->numBuckets];
196 struct util_node **bucket = hash->buckets;
211 node = (struct util_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]);
254 hash->data.d->buckets = 0;
267 struct util_node **bucket = (struct util_node **)(hash->data.d->buckets);
277 free(hash->data.d->buckets);
[all...] |
