| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _unordered_set.h | 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_set
315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_multiset
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.cpp | 65 // Then compute the bucket size, minimum of 1 bucket.
93 // Figure out how many buckets we need, then compute the bucket
100 // Compute bucket contents and final ordering.
103 uint32_t bucket = Data[i]->HashValue % Header.bucket_count; local
104 Buckets[bucket].push_back(Data[i]);
117 Asm->OutStreamer.AddComment("Header Bucket Count");
141 Asm->OutStreamer.AddComment("Bucket " + Twine(i));
151 // bucket.
156 Asm->OutStreamer.AddComment("Hash in Bucket " + Twine(i))
[all...] |
| /external/mdnsresponder/mDNSShared/ |
| dnsextd.c | 809 int i, bucket, newnbuckets = d->nbuckets * 2; local
821 bucket = ptr->rr.resrec.namehash % newnbuckets;
824 tmp->next = new[bucket];
825 new[bucket] = tmp;
1377 int i, allocsize, bucket; local
1672 int bucket = DomainNameHashValue(&e->qname) % LLQ_TABLESIZE; local
2060 int bucket = DomainNameHashValue(&e->qname) % LLQ_TABLESIZE; local
2087 int bucket = DomainNameHashValue(qname) % LLQ_TABLESIZE; local
2286 int bucket = bucket = DomainNameHashValue(qname) % LLQ_TABLESIZE; local
[all...] |
| /frameworks/compile/mclinker/lib/Target/Mips/ |
| MipsLDBackend.cpp | 556 uint32_t* bucket = (word_array + 2); local
557 uint32_t* chain = (bucket + nbucket);
559 // initialize bucket
560 bzero((void*)bucket, nbucket);
567 chain[sym_idx] = bucket[bucket_pos];
568 bucket[bucket_pos] = sym_idx;
[all...] |
| /frameworks/compile/mclinker/lib/Target/ |
| GNULDBackend.cpp | 1174 uint32_t* bucket = (word_array + 2); local
1213 uint32_t* bucket = NULL; local
[all...] |
| /external/libppp/src/ |
| mbuf.c | 63 } *bucket[(M_MAXLEN + sizeof(struct mbuf)) / BUCKET_HASH]; variable in typeref:struct:mbucket
66 #define M_BUCKET(sz) (bucket + M_BINDEX(sz))
|
| /external/stlport/stlport/stl/debug/ |
| _hashtable.h | 186 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
191 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
199 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
204 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } function in class:hashtable
|
| /external/v8/src/ |
| string-search.h | 495 int bucket = (sizeof(PatternChar) == 1) ? c : c % AlphabetSize(); local
496 bad_char_occurrence[bucket] = i;
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 186 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
191 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
199 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
204 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } function in class:hashtable
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 186 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
191 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
199 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
204 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } function in class:hashtable
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 186 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
191 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
199 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
204 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } function in class:hashtable
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 186 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
191 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
199 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
204 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } function in class:hashtable
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 186 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
191 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
199 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
204 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators
322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } function in class:hashtable
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 56 /** Internal structure representing an element in a hash bucket.
78 /** Pointer to the next entry in this bucket if there
79 * is one. Sometimes different keys will hash to the same bucket (especially
87 /** Internal structure of a hash table bucket, which tracks
88 * all keys that hash to the same bucket.
92 /** Pointer to the first entry in the bucket (if any, it
153 * structure does not change in the hash bucket that is currently being
155 * bucket series.
163 /* Bucket we are currently enumerating (if NULL then we are done)
165 ANTLR3_UINT32 bucket; member in struct:ANTLR3_HASH_ENUM_struct
[all...] |
| /external/ceres-solver/internal/ceres/ |
| solver_impl.cc | 1000 int bucket = min_position_per_residual[i]; local
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.equinox.event_1.2.0.v20100503.jar | |
| /packages/apps/Gallery/src/com/android/camera/ |
| ImageGallery.java | 191 String bucket = thisUri.getQueryParameter("bucketId");
192 if (bucket != null) {
194 .appendQueryParameter("bucketId", bucket)
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| HashTable.h | 387 static void initializeBucket(ValueType& bucket) { new (&bucket) ValueType(Traits::emptyValue()); }
388 static void deleteBucket(ValueType& bucket) { bucket.~ValueType(); Traits::constructDeletedValue(bucket); }
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tools.pas | 769 gap, index, hc, bucket: Integer;
786 // but being careful not to move items if their bucket is between
787 // our gap and our index (so that they'd be moved before their bucket).
806 bucket := hc and (Length(FItems) - 1);
807 if not InCircularRange(gap, bucket, index) then
|
| /external/yaffs2/yaffs2/ |
| yaffs_guts.c | 1404 int bucket; local
1522 int bucket = yaffs_FindNiceObjectBucket(dev); local
1556 int bucket = yaffs_HashFunction(in->objectId); local
1566 int bucket = yaffs_HashFunction(number); local
[all...] |
| /packages/experimental/NotificationShowcase/src/com/android/example/notificationshowcase/ |
| NotificationShowcaseActivity.java | 219 .setLargeIcon(getBitmap(context, R.drawable.bucket))
|
| /external/chromium/chrome/browser/ui/ |
| browser_init.cc | 424 int bucket = (mode == LM_TO_BE_DECIDED) ? GetLaunchShortcutKind() : mode; local
425 UMA_HISTOGRAM_COUNTS_100("Launch.Modes", bucket);
[all...] |
| /external/guava/guava/lib/ |
| jdiff.jar | |
| /external/stlport/stlport/stl/ |
| _hashtable.h | 197 //Returns the bucket size next to a required size
200 // Returns the bucket range containing sorted list of prime numbers <= __hint.
389 //The number of buckets is size() - 1 because the last bucket always contains
397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); } function in class:hashtable
588 //__n is set to the first bucket that has to be modified if any
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 197 //Returns the bucket size next to a required size
200 // Returns the bucket range containing sorted list of prime numbers <= __hint.
389 //The number of buckets is size() - 1 because the last bucket always contains
397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); } function in class:hashtable
588 //__n is set to the first bucket that has to be modified if any
|
