/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/libdrm/ |
xf86drmHash.h | 44 HashBucketPtr buckets[HASH_SIZE]; member in struct:HashTable
|
/external/boringssl/src/include/openssl/ |
lhash.h | 130 /* buckets is an array of |num_buckets| pointers. Each points to the head of 133 LHASH_ITEM **buckets; member in struct:lhash_st 134 /* num_buckets contains the length of |buckets|. This value is always >= 138 * calls. If non-zero then this suppresses resizing of the |buckets| array,
|
/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...] |
/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-trace/catapult/third_party/gsutil/third_party/protorpc/demos/quotas/backend/quotas/ |
services_test.py | 30 buckets=[ variable 49 buckets = dict((bucket.name, bucket) for bucket in SIMPLE_CONFIG.buckets) 50 return services.QuotaState(state, buckets)
|
services.py | 31 buckets = [ QuotaBucket('DISK', 1000000), 40 Individual quota buckets can be specified to refresh to their original amounts 63 can be used to credit quota buckets. 138 if some buckets had no tokens, this will be SOME. If all tokens were 142 buckets had adequate tokens. 145 buckets indicated in the request. 161 buckets: Individual bucket configurations. Bucket configurations are 180 buckets = messages.MessageField(Bucket, 1, repeated=True) variable in class:QuotaConfig 184 """Request state of all quota buckets for a single user. 186 Used for determining how many tokens remain in all the users quota buckets [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...] |
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/iproute2/tc/ |
q_fq.c | 56 fprintf(stderr, " [ maxrate RATE ] [ buckets NUMBER ]\n"); 80 unsigned int buckets = 0; local 111 } else if (strcmp(*argv, "buckets") == 0) { 113 if (get_unsigned(&buckets, *argv, 0)) { 114 fprintf(stderr, "Illegal \"buckets\"\n"); 176 if (buckets) { 177 unsigned int log = ilog2(buckets); 241 fprintf(f, "buckets %u ", 1U << buckets_log);
|
/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 | 126 int buckets = *num_buckets; local 129 /* Find the extrema for this list of buckets */ 131 for (i = 0; i < buckets; i++) { 138 /* If we have too many buckets, merge the smallest with an adjacent 141 while (buckets > max_buckets) { 142 int last_bucket = buckets - 1; 155 assert(small_bucket < buckets); 156 assert(big_bucket < buckets); 157 assert(merge_bucket < buckets); 170 buckets-- 252 int buckets = 0; local 274 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...] |
/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...] |
/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...] |
/art/test/099-vmdebug/src/ |
Main.java | 147 String[] buckets = s.split(","); local 149 for (int i = 0; i < buckets.length; ++i) { 150 String bucket = buckets[i];
|
/bootable/recovery/applypatch/ |
bsdiff.cpp | 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...] |
/external/freetype/src/cache/ |
ftccache.h | 77 ( ( cache )->buckets + \ 148 FTC_Node* buckets; member in struct:FTC_CacheRec_
|
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cache/ |
ftccache.h | 77 ( ( cache )->buckets + \ 148 FTC_Node* buckets; member in struct:FTC_CacheRec_
|
/external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
pb_bufmgr_slab.c | 162 struct pb_manager **buckets; member in struct:pb_slab_range_manager 498 return mgr->buckets[i]->create_buffer(mgr->buckets[i], size, desc); 527 mgr->buckets[i]->destroy(mgr->buckets[i]); 528 FREE(mgr->buckets); 567 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets)); 568 if (!mgr->buckets) 573 mgr->buckets[i] = pb_slab_manager_create(provider, bufSize, slabSize, desc) [all...] |
/external/mesa3d/src/glx/ |
glxhash.c | 121 __glxHashBucketPtr buckets[HASH_SIZE]; member in struct:__glxHashTable 171 table->buckets[i] = NULL; 187 for (bucket = table->buckets[i]; bucket;) { 210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { 215 bucket->next = table->buckets[hash]; 216 table->buckets[hash] = bucket; 264 bucket->next = table->buckets[hash]; 265 table->buckets[hash] = bucket; 287 table->buckets[hash] = bucket->next; 304 table->p1 = table->buckets[table->p0] [all...] |