| /packages/inputmethods/LatinIME/native/jni/src/ |
| bloom_filter.h | 28 const uint32_t bucket = static_cast<uint32_t>(position % BIGRAM_FILTER_MODULO); local
29 filter[bucket >> 3] |= static_cast<uint8_t>(1 << (bucket & 0x7));
34 const uint32_t bucket = static_cast<uint32_t>(position % BIGRAM_FILTER_MODULO); local
35 return filter[bucket >> 3] & static_cast<uint8_t>(1 << (bucket & 0x7));
|
| /frameworks/compile/mclinker/lib/Support/ |
| HandleToArea.cpp | 22 Bucket bucket;
23 bucket.hash_value = HashFunction()(
27 bucket.handle = pHandle;
28 bucket.area = pArea;
29 m_AreaMap.push_back(bucket);
47 HandleToAreaMap::iterator bucket, bEnd = m_AreaMap.end(); local
48 for (bucket = m_AreaMap.begin(); bucket != bEnd; ++bucket) {
64 HandleToAreaMap::iterator bucket, bEnd = m_AreaMap.end(); local
82 HandleToAreaMap::const_iterator bucket, bEnd = m_AreaMap.end(); local
[all...] |
| /external/bison/lib/ |
| hash.c | 54 /* The array of buckets starts at BUCKET and extends to BUCKET_LIMIT-1,
57 struct hash_entry *bucket; member in struct:hash_table
93 slot. A bucket is the collection of all entries hashing to the same slot.
96 In the ideal case, the length of each bucket is roughly the number of
99 entry is linear in time with the size of the bucket. Consequently, a
119 /* If a deletion empties a bucket and causes the ratio of used buckets to
171 /* Return the length of the longest chain (bucket). */
176 struct hash_entry const *bucket; local
179 for (bucket = table->bucket; bucket < table->bucket_limit; bucket++
203 struct hash_entry const *bucket; local
263 struct hash_entry const *bucket = safe_hasher (table, entry); local
290 struct hash_entry const *bucket; local
309 struct hash_entry const *bucket = safe_hasher (table, entry); local
340 struct hash_entry const *bucket; local
372 struct hash_entry const *bucket; local
655 struct hash_entry *bucket; local
698 struct hash_entry *bucket; local
793 struct hash_entry *bucket = safe_hasher (table, entry); local
862 struct hash_entry *bucket; local
1042 struct hash_entry *bucket; local
1151 struct hash_entry *bucket; local
1214 struct hash_entry *bucket = (struct hash_entry *) table->bucket; local
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ingest/ |
| MtpDeviceIndex.java | 40 * The index enables the access of items and bucket labels as one unified list.
42 * [Bucket A]: [photo 1], [photo 2]
43 * [Bucket B]: [photo 3]
46 * [Bucket A], [photo 1], [photo 2], [Bucket B], [photo 3]
50 * bucket labels need to always be at the beginning:
51 * [Bucket B], [photo 3], [Bucket A], [photo 2], [photo 1]
56 * - size: get the total number of items (bucket labels and MTP objects)
179 * @return the bucket label or MtpObjectInfo at the specified position an
185 DateBucket bucket = mBuckets[mUnifiedLookupIndex[position]]; local
194 DateBucket bucket = mBuckets[mUnifiedLookupIndex[zeroIndex]]; local
258 DateBucket bucket = mBuckets[mUnifiedLookupIndex[position]]; local
263 DateBucket bucket = mBuckets[mUnifiedLookupIndex[zeroIndex]]; local
321 SimpleDate bucket; field in class:MtpDeviceIndex.DateBucket
440 DateBucket bucket = mBuckets[i]; local
545 DateBucket bucket = mBucketsTemp.get(mDateInstance); local
[all...] |
| /external/chromium/net/base/ |
| ssl_false_start_blacklist.cc | 14 const unsigned bucket = Hash(last_two_labels) & (kBuckets - 1); local
15 const uint32 start = kHashTable[bucket];
16 const uint32 end = kHashTable[bucket + 1];
|
| /external/qemu/distrib/sdl-1.2.15/src/video/dga/ |
| SDL_dgavideo.c | 599 vidmem_bucket *bucket; local
604 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
605 printf("Bucket: %p, %d (%s)\n", bucket->base, bucket->size, bucket->used ? "used" : "free");
606 if ( bucket->prev )
627 vidmem_bucket *bucket; local
659 vidmem_bucket *bucket, *freeable; local
682 vidmem_bucket *bucket; local
695 vidmem_bucket *bucket; local
776 vidmem_bucket *bucket, *freeable; local
[all...] |
| /frameworks/native/libs/utils/ |
| BasicHashtable.cpp | 29 mBucketSize(entrySize + sizeof(Bucket)), mHasTrivialDestructor(hasTrivialDestructor),
84 Bucket& bucket = bucketAt(mBuckets, i); local
85 bucket.cookie = 0;
100 const Bucket& bucket = bucketAt(mBuckets, index); local
101 if (bucket.cookie & Bucket::PRESENT) {
119 const Bucket& bucket = bucketAt(mBuckets, size_t(index)) local
135 const Bucket& bucket = bucketAt(mBuckets, size_t(index)); local
158 Bucket* bucket = &bucketAt(mBuckets, size_t(index)); local
187 Bucket& bucket = bucketAt(mBuckets, index); local
248 Bucket& bucket = bucketAt(buckets, i); local
265 Bucket& bucket = bucketAt(buckets, i); local
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/renderer/queue/ |
| RenderQueue.java | 71 * The render queue <code>Bucket</code> specifies the bucket
75 * bucket the spatial is placed. A spatial's queue bucket can be set
76 * via {@link Spatial#setQueueBucket(com.jme3.renderer.queue.RenderQueue.Bucket) }.
78 public enum Bucket {
100 * spatials in this bucket will appear behind everything, the downside
101 * to this bucket is that 3D objects will not be rendered correctly
165 * Sets a different geometry comparator for the specified bucket, one
171 * bucket since there is no correct way to sort the transparent bucke
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multiset/ |
| local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0);
48 b = c.bucket(1);
57 b = c.bucket(2);
65 b = c.bucket(3);
71 b = c.bucket(4);
77 b = c.bucket(5);
82 b = c.bucket(6);
102 C::size_type b = c.bucket(0);
107 b = c.bucket(1);
115 b = c.bucket(2)
[all...] |
| local_iterators.pass.cpp | 43 C::size_type b = c.bucket(0);
48 b = c.bucket(1);
56 b = c.bucket(2);
64 b = c.bucket(3);
70 b = c.bucket(4);
76 b = c.bucket(5);
81 b = c.bucket(6);
101 C::size_type b = c.bucket(0);
106 b = c.bucket(1);
114 b = c.bucket(2)
[all...] |
| bucket.pass.cpp | 16 // size_type bucket(const key_type& __k) const;
39 assert(c.bucket(i) == i % bc);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.set/ |
| local_iterators.fail.cpp | 43 C::size_type b = c.bucket(0);
48 b = c.bucket(1);
57 b = c.bucket(2);
65 b = c.bucket(3);
71 b = c.bucket(4);
77 b = c.bucket(5);
82 b = c.bucket(6);
102 C::size_type b = c.bucket(0);
107 b = c.bucket(1);
115 b = c.bucket(2)
[all...] |
| local_iterators.pass.cpp | 43 C::size_type b = c.bucket(0);
48 b = c.bucket(1);
54 b = c.bucket(2);
60 b = c.bucket(3);
66 b = c.bucket(4);
87 C::size_type b = c.bucket(0);
92 b = c.bucket(1);
98 b = c.bucket(2);
104 b = c.bucket(3);
110 b = c.bucket(4)
[all...] |
| bucket.pass.cpp | 16 // size_type bucket(const key_type& __k) const;
39 assert(c.bucket(i) == i % bc);
|
| /external/chromium/chrome/browser/extensions/ |
| extensions_quota_service.cc | 51 // Apply heuristic to each item (bucket).
80 void QuotaLimitHeuristic::Bucket::Reset(const Config& config,
98 if ((*i)->expiration().is_null()) // A brand new bucket.
114 bool ExtensionsQuotaService::TimedLimit::Apply(Bucket* bucket,
116 if (event_time > bucket->expiration())
117 bucket->Reset(config(), event_time);
119 return bucket->DeductToken();
122 bool ExtensionsQuotaService::SustainedLimit::Apply(Bucket* bucket,
[all...] |
| /external/smack/src/org/jivesoftware/smack/util/ |
| DNSUtil.java | 169 List<SRVRecord> bucket = buckets.get(priority); local
171 if (bucket == null) {
172 bucket = new LinkedList<SRVRecord>();
173 buckets.put(priority, bucket);
175 bucket.add(r);
181 List<SRVRecord> bucket = buckets.get(priority); local
183 while ((bucketSize = bucket.size()) > 0) {
184 int[] totals = new int[bucket.size()];
189 for (SRVRecord r : bucket) {
194 for (SRVRecord r : bucket) {
[all...] |
| /frameworks/native/include/utils/ |
| BasicHashtable.h | 30 struct Bucket {
31 // The collision flag indicates that the bucket is part of a collision chain
32 // such that at least two entries both hash to this bucket. When true, we
36 // The present flag indicates that the bucket contains an initialized entry value.
39 // Mask for 30 bits worth of the hash code that are stored within the bucket to
73 const size_t mBucketSize; // number of bytes per bucket including the entry
82 inline const Bucket& bucketAt(const void* __restrict__ buckets, size_t index) const {
83 return *reinterpret_cast<const Bucket*>(
87 inline Bucket& bucketAt(void* __restrict__ buckets, size_t index) const {
88 return *reinterpret_cast<Bucket*>(static_cast<uint8_t*>(buckets) + index * mBucketSize)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.multimap/ |
| local_iterators.fail.cpp | 44 C::size_type b = c.bucket(0);
49 b = c.bucket(1);
60 b = c.bucket(2);
70 b = c.bucket(3);
77 b = c.bucket(4);
84 b = c.bucket(5);
89 b = c.bucket(6);
109 C::size_type b = c.bucket(0);
114 b = c.bucket(1);
124 b = c.bucket(2)
[all...] |
| local_iterators.pass.cpp | 44 C::size_type b = c.bucket(0);
49 b = c.bucket(1);
59 b = c.bucket(2);
69 b = c.bucket(3);
76 b = c.bucket(4);
83 b = c.bucket(5);
88 b = c.bucket(6);
108 C::size_type b = c.bucket(0);
113 b = c.bucket(1);
123 b = c.bucket(2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/unord/unord.map/ |
| local_iterators.pass.cpp | 44 C::size_type b = c.bucket(0);
49 b = c.bucket(1);
56 b = c.bucket(2);
63 b = c.bucket(3);
70 b = c.bucket(4);
92 C::size_type b = c.bucket(0);
97 b = c.bucket(1);
104 b = c.bucket(2);
111 b = c.bucket(3);
118 b = c.bucket(4)
[all...] |
| bucket.pass.cpp | 16 // size_type bucket(const key_type& __k) const;
40 assert(c.bucket(i) == i % bc);
|
| /external/qemu/distrib/sdl-1.2.15/src/video/fbcon/ |
| SDL_fbvideo.c | 1192 vidmem_bucket *bucket; local
1220 vidmem_bucket *bucket; local
1252 vidmem_bucket *bucket, *freeable; local
1265 vidmem_bucket *bucket; local
1340 vidmem_bucket *bucket, *freeable; local
[all...] |
| SDL_fbvideo.h | 179 vidmem_bucket *bucket; local
185 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
186 bucket->dirty = 0;
|
| /external/qemu/ |
| qdict.c | 110 const char *key, unsigned int bucket)
114 QLIST_FOREACH(entry, &qdict->table[bucket], next)
134 unsigned int bucket; local
137 bucket = tdb_hash(key) % QDICT_BUCKET_MAX;
138 entry = qdict_find(qdict, key, bucket);
146 QLIST_INSERT_HEAD(&qdict->table[bucket], entry, next);
172 unsigned int bucket = tdb_hash(key) % QDICT_BUCKET_MAX; local
173 return (qdict_find(qdict, key, bucket) == NULL ? 0 : 1);
396 unsigned int bucket = tdb_hash(entry->key) % QDICT_BUCKET_MAX; local
397 ret = qdict_next_entry(qdict, bucket + 1)
[all...] |
| /development/tools/axl/ |
| chewperf.py | 64 bucket = x[0] / 1000
66 if bucket in buckets:
67 buckets[bucket] += bytes
69 buckets[bucket] = bytes
|
