| /development/tools/idegen/src/ |
| Eclipse.java | 61 List<Bucket> buckets = new ArrayList<Bucket>(patterns.size()); local
63 buckets.add(new Bucket(pattern));
66 // Put source roots in respective buckets.
71 for (Bucket bucket : buckets) {
80 for (Bucket bucket : buckets) {
|
| /external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
| CollectionUtils.java | 29 Map buckets = new HashMap(); local
33 List bucket = (List)buckets.get(key);
35 buckets.put(key, bucket = new LinkedList());
39 return buckets;
|
| /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_org/components/omnibox/ |
| omnibox_field_trial_unittest.cc | 353 ASSERT_EQ(3u, scoring_params.typed_count_buckets.buckets().size());
355 scoring_params.typed_count_buckets.buckets()[0]);
357 scoring_params.typed_count_buckets.buckets()[1]);
359 scoring_params.typed_count_buckets.buckets()[2]);
362 ASSERT_EQ(2u, scoring_params.visited_count_buckets.buckets().size());
364 scoring_params.visited_count_buckets.buckets()[0]);
366 scoring_params.visited_count_buckets.buckets()[1]);
370 HUPScoringParams::ScoreBuckets buckets; local
373 EXPECT_EQ(1.0, buckets.HalfLifeTimeDecay(base::TimeDelta::FromDays(7)));
375 buckets.set_half_life_days(7)
[all...] |
| omnibox_field_trial.h | 47 std::vector<CountMaxRelevance>& buckets() { return buckets_; } function in class:HUPScoringParams::ScoreBuckets
48 const std::vector<CountMaxRelevance>& buckets() const { return buckets_; } function in class:HUPScoringParams::ScoreBuckets
|
| /frameworks/ex/common/tools/ |
| make-iana-tld-pattern.py | 101 def getBucket(buckets, line):
103 bucket = buckets.get(letter)
107 buckets[letter] = bucket
111 def makePattern(prefix, suffix, buckets, isWebUrl=False):
114 output += getBucket(buckets, 'a').dump(isFirst=True, isWebUrl=isWebUrl)
117 output += getBucket(buckets, chr(letter)).dump(isWebUrl=isWebUrl)
119 output += getBucket(buckets, 'z').dump(isLast=True, isWebUrl=isWebUrl)
135 buckets = {} variable
141 getBucket(buckets, domain[0]).add(domain.strip())
147 getBucket(buckets, 'xn--').add(result[2:-1]
[all...] |
| /external/smack/src/org/jivesoftware/smack/util/ |
| DNSUtil.java | 165 // create the priority buckets
166 SortedMap<Integer, List<SRVRecord>> buckets = new TreeMap<Integer, List<SRVRecord>>(); local
169 List<SRVRecord> bucket = buckets.get(priority);
173 buckets.put(priority, bucket);
180 for (Integer priority : buckets.keySet()) {
181 List<SRVRecord> bucket = buckets.get(priority);
|
| /external/chromium_org/third_party/boringssl/src/include/openssl/ |
| lhash.h | 132 /* buckets is an array of |num_buckets| pointers. Each points to the head of
135 LHASH_ITEM **buckets; member in struct:lhash_st
136 /* num_buckets contains the length of |buckets|. This value is always >=
140 * calls. If non-zero then this suppresses resizing of the |buckets| array,
|
| /external/chromium_org/extensions/browser/ |
| quota_service.cc | 112 BucketList* buckets) {
113 buckets->push_back(&bucket_);
125 BucketList buckets; local
126 bucket_mapper_->GetBucketsForArgs(args, &buckets);
127 for (BucketList::iterator i = buckets.begin(); i != buckets.end(); ++i) {
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| BucketHelper.java | 98 ContentResolver resolver, Uri tableUri, HashMap<Integer, BucketEntry> buckets) {
109 BucketEntry entry = buckets.get(bucketId);
112 buckets.put(bucketId, entry);
125 HashMap<Integer, BucketEntry> buckets = new HashMap<Integer, BucketEntry>(64); local
128 jc, resolver, Images.Media.EXTERNAL_CONTENT_URI, buckets);
132 jc, resolver, Video.Media.EXTERNAL_CONTENT_URI, buckets);
134 BucketEntry[] entries = buckets.values().toArray(new BucketEntry[buckets.size()]);
|
| /external/chromium_org/chrome/browser/extensions/api/metrics_private/ |
| metrics_apitest.cc | 35 size_t buckets; member in struct:__anon8396::RecordedHistogram
63 Bucket buckets[10]; member in struct:__anon8396::SparseHistogram
128 const Bucket& bucket = sparse_histogram.buckets[j];
160 histogram->HasConstructionArguments(r.min, r.max, r.buckets));
|
| /external/chromium_org/chrome/browser/metrics/ |
| extensions_metrics_provider.cc | 32 // The number of hash buckets into which extension IDs are mapped. This sets
224 std::set<int> buckets; local
228 buckets.insert(HashExtension((*it)->id(), client_key));
231 for (std::set<int>::const_iterator it = buckets.begin(); it != buckets.end();
|
| /external/chromium_org/third_party/libvpx/source/libvpx/ |
| rate_hist.c | 123 int buckets = *num_buckets; local
126 /* Find the extrema for this list of buckets */
128 for (i = 0; i < buckets; i++) {
135 /* If we have too many buckets, merge the smallest with an adjacent
138 while (buckets > max_buckets) {
139 int last_bucket = buckets - 1;
152 assert(small_bucket < buckets);
153 assert(big_bucket < buckets);
154 assert(merge_bucket < buckets);
167 buckets--
249 int buckets = 0; local
271 int buckets = 0; local
[all...] |
| /external/chromium_org/third_party/mesa/src/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_org/third_party/npapi/npspy/extern/nspr/ |
| plhash.h | 85 PLHashEntry **buckets; /* vector of hash buckets */ member in struct:PLHashTable
|
| /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...] |
| 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...] |
| 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...] |
| /external/libunwind/include/tdep-ia64/ |
| script.h | 76 struct ia64_script buckets[IA64_UNW_CACHE_SIZE]; member in struct:ia64_script_cache
|
| /external/libvpx/libvpx/ |
| rate_hist.c | 123 int buckets = *num_buckets; local
126 /* Find the extrema for this list of buckets */
128 for (i = 0; i < buckets; i++) {
135 /* If we have too many buckets, merge the smallest with an adjacent
138 while (buckets > max_buckets) {
139 int last_bucket = buckets - 1;
152 assert(small_bucket < buckets);
153 assert(big_bucket < buckets);
154 assert(merge_bucket < buckets);
167 buckets--
249 int buckets = 0; local
271 int buckets = 0; local
[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...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/ |
| rate_hist.c | 123 int buckets = *num_buckets; local
126 /* Find the extrema for this list of buckets */
128 for (i = 0; i < buckets; i++) {
135 /* If we have too many buckets, merge the smallest with an adjacent
138 while (buckets > max_buckets) {
139 int last_bucket = buckets - 1;
152 assert(small_bucket < buckets);
153 assert(big_bucket < buckets);
154 assert(merge_bucket < buckets);
167 buckets--
249 int buckets = 0; local
271 int buckets = 0; local
[all...] |
| /system/core/libutils/ |
| BasicHashtable.cpp | 248 LOG_ALWAYS_FATAL_IF(!sb, "Could not allocate %u bytes for hashtable with %u buckets.",
250 void* buckets = sb->data(); local
252 Bucket& bucket = bucketAt(buckets, i);
255 return buckets;
258 void BasicHashtableImpl::releaseBuckets(void* __restrict__ buckets, size_t count) const {
259 SharedBuffer* sb = SharedBuffer::bufferFromData(buckets);
261 destroyBuckets(buckets, count);
266 void BasicHashtableImpl::destroyBuckets(void* __restrict__ buckets, size_t count) const {
269 Bucket& bucket = bucketAt(buckets, i);
335 LOG_ALWAYS_FATAL_IF(!count, "Could not determine required number of buckets for
[all...] |
| /bootable/recovery/applypatch/ |
| bsdiff.c | 123 off_t buckets[256]; local
126 for(i=0;i<256;i++) buckets[i]=0;
127 for(i=0;i<oldsize;i++) buckets[old[i]]++;
128 for(i=1;i<256;i++) buckets[i]+=buckets[i-1];
129 for(i=255;i>0;i--) buckets[i]=buckets[i-1];
130 buckets[0]=0;
132 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
134 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]
[all...] |
