| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| unordered_set.h | 126 * @param __n Initial number of buckets.
143 * @param __n Minimal initial number of buckets.
170 * @param __n Minimal initial number of buckets.
557 /// Returns the number of buckets of the %unordered_set.
562 /// Returns the maximum number of buckets of the %unordered_set.
648 * @param __n The new number of buckets.
650 * Rehash will occur only if the new number of buckets respect the
731 * @param __n Initial number of buckets.
748 * @param __n Minimal initial number of buckets.
775 * @param __n Minimal initial number of buckets
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| unordered_map.h | 133 * @param __n Initial number of buckets.
150 * @param __n Minimal initial number of buckets.
206 * @param __n Minimal initial number of buckets.
653 /// Returns the number of buckets of the %unordered_map.
658 /// Returns the maximum number of buckets of the %unordered_map.
756 * @param __n The new number of buckets.
758 * Rehash will occur only if the new number of buckets respect the
845 * @param __n Initial number of buckets.
862 * @param __n Minimal initial number of buckets.
918 * @param __n Minimal initial number of buckets
[all...] |
| unordered_set.h | 126 * @param __n Initial number of buckets.
143 * @param __n Minimal initial number of buckets.
199 * @param __n Minimal initial number of buckets.
587 /// Returns the number of buckets of the %unordered_set.
592 /// Returns the maximum number of buckets of the %unordered_set.
678 * @param __n The new number of buckets.
680 * Rehash will occur only if the new number of buckets respect the
761 * @param __n Initial number of buckets.
778 * @param __n Minimal initial number of buckets.
805 * @param __n Minimal initial number of buckets
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| unordered_map.h | 133 * @param __n Initial number of buckets.
150 * @param __n Minimal initial number of buckets.
206 * @param __n Minimal initial number of buckets.
653 /// Returns the number of buckets of the %unordered_map.
658 /// Returns the maximum number of buckets of the %unordered_map.
756 * @param __n The new number of buckets.
758 * Rehash will occur only if the new number of buckets respect the
845 * @param __n Initial number of buckets.
862 * @param __n Minimal initial number of buckets.
918 * @param __n Minimal initial number of buckets
[all...] |
| unordered_set.h | 126 * @param __n Initial number of buckets.
143 * @param __n Minimal initial number of buckets.
199 * @param __n Minimal initial number of buckets.
587 /// Returns the number of buckets of the %unordered_set.
592 /// Returns the maximum number of buckets of the %unordered_set.
678 * @param __n The new number of buckets.
680 * Rehash will occur only if the new number of buckets respect the
761 * @param __n Initial number of buckets.
778 * @param __n Minimal initial number of buckets.
805 * @param __n Minimal initial number of buckets
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| unordered_map.h | 133 * @param __n Initial number of buckets.
150 * @param __n Minimal initial number of buckets.
206 * @param __n Minimal initial number of buckets.
653 /// Returns the number of buckets of the %unordered_map.
658 /// Returns the maximum number of buckets of the %unordered_map.
756 * @param __n The new number of buckets.
758 * Rehash will occur only if the new number of buckets respect the
845 * @param __n Initial number of buckets.
862 * @param __n Minimal initial number of buckets.
918 * @param __n Minimal initial number of buckets
[all...] |
| unordered_set.h | 126 * @param __n Initial number of buckets.
143 * @param __n Minimal initial number of buckets.
199 * @param __n Minimal initial number of buckets.
587 /// Returns the number of buckets of the %unordered_set.
592 /// Returns the maximum number of buckets of the %unordered_set.
678 * @param __n The new number of buckets.
680 * Rehash will occur only if the new number of buckets respect the
761 * @param __n Initial number of buckets.
778 * @param __n Minimal initial number of buckets.
805 * @param __n Minimal initial number of buckets
[all...] |
| /external/libchrome/base/metrics/ |
| histogram_macros.h | 114 // Most of these macros use 50 buckets, but check the definition for details.
127 // of times you want plotted, and the number of buckets you want used.
162 // problems down the line if you add additional buckets to the histogram. Note
204 // you want 100 buckets.
273 // which measures up to an hour, and uses 100 buckets. This is more expensive
|
| /external/llvm/utils/LLVMVisualizers/ |
| llvm.natvis | 161 <DisplayString Condition="NumEntries != 0">{{ size={NumEntries}, buckets={NumBuckets} }}</DisplayString>
164 <Item Name="[buckets]">NumBuckets</Item>
167 <ValuePointer>Buckets</ValuePointer>
173 <DisplayString>{{ size={NumItems}, buckets={NumBuckets} }}</DisplayString>
176 <Item Name="[buckets]">NumBuckets</Item>
|
| /hardware/interfaces/wifi/1.0/ |
| IWifiStaIface.hal | 38 * Background scan allow the host to send a number of buckets down to the
227 * When this is called all requested buckets must be scanned, starting the
231 * If there are two buckets specified
236 * - t=0 buckets 1, 2, and 3 are scanned
242 * - t=60 buckets 1, 2, and 3 are scanned
|
| /prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 66 //Export of the classes used to represent buckets in the hashtable implementation.
194 //Returns the maximum number of buckets handled by the hashtable implementation
262 * - limit code bloat, all hashtable instanciation use the same buckets representation.
265 * the number of iterators in the buckets rather than constant in time as the iterator
389 //The number of buckets is size() - 1 because the last bucket always contains
|
| /prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 66 //Export of the classes used to represent buckets in the hashtable implementation.
194 //Returns the maximum number of buckets handled by the hashtable implementation
262 * - limit code bloat, all hashtable instanciation use the same buckets representation.
265 * the number of iterators in the buckets rather than constant in time as the iterator
389 //The number of buckets is size() - 1 because the last bucket always contains
|
| /prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 66 //Export of the classes used to represent buckets in the hashtable implementation.
194 //Returns the maximum number of buckets handled by the hashtable implementation
262 * - limit code bloat, all hashtable instanciation use the same buckets representation.
265 * the number of iterators in the buckets rather than constant in time as the iterator
389 //The number of buckets is size() - 1 because the last bucket always contains
|
| /system/sepolicy/tools/fc_sort/ |
| fc_sort.c | 57 * A node used in a linked list of buckets that contain
205 * before it. This halves the number of buckets each pass.
206 * It will continue passing over the buckets (as described above)
223 /* This loop merges buckets two-by-two. */
496 /* Go until all the nodes have been put in individual buckets. */
|
| /external/icu/icu4c/source/i18n/ |
| alphaindex.cpp | 40 * Prefix string for Chinese index buckets.
167 /** All of the buckets, visible and invisible. */
169 /** Just the visible buckets. */
499 // Remember ASCII and Pinyin buckets for Pinyin redirects.
564 // Redirect Pinyin buckets.
587 // Merge inflow buckets that are visually adjacent.
594 continue; // skip invisible buckets
629 * Creates an index, and buckets and sorts the list of records into the index.
647 // However, if the user adds an item at a time and then gets the buckets, this isn't efficient, so
[all...] |
| /external/iproute2/misc/ |
| arpd.c | 245 static int buckets; local
251 buckets += diff;
253 buckets = broadcast_burst;
255 if (buckets > broadcast_burst)
256 buckets = broadcast_burst;
257 if (buckets >= broadcast_rate && !send_probe(ifindex, addr)) {
258 buckets -= broadcast_rate;
|
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| ContactLocaleUtils.java | 118 // Build the index buckets based on the current system locale set and
121 Log.d(TAG, "Building index buckets...");
141 // Create a list of locales that should be used to generate the index buckets.
198 * sorts strings into buckets numbered in order from 0 to N, where the
233 * buckets. b/19835686
249 * Returns the number of buckets in use (one more than AlphabeticIndex
360 * Returns the number of buckets in use (one more than the base class
|
| /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];
|
| /cts/tests/tests/os/src/android/os/cts/ |
| DebugTest.java | 235 String[] buckets = s.split(","); local
237 for (int i = 0; i < buckets.length; ++i) {
238 String bucket = buckets[i];
|
| /frameworks/data-binding/compiler/src/main/kotlin/android/databinding/tool/writer/ |
| LayoutBinderWriter.kt | 275 buckets.withIndex().forEach {
277 cb(getWordSuffix(it.index), buckets[it.index])
290 fun FlagSet.binaryCode(bucketIndex : Int) = longToBinary(buckets[bucketIndex])
296 val min = Math.min(buckets.size, other.buckets.size)
322 Arrays.fill(fs.buckets, -1)
649 for (i in (0..(mDirtyFlags.buckets.size - 1))) {
663 if (mDirtyFlags.buckets.size > 0) {
665 val flagCheck = 0.rangeTo(mDirtyFlags.buckets.size - 1).map {
[all...] |
| /toolchain/binutils/binutils-2.25/include/aout/ |
| sun4.h | 173 bucket. The ld_buckets field gives the number of buckets, say B.
185 the modulos of hash value and the number of buckets. Start at
204 /* The number of buckets in the hash table. */
|
| /cts/hostsidetests/theme/ |
| README | 50 For a list of devices and their DPI buckets, see Device Metrics:
|
| /cts/tests/tests/renderscript/src/android/renderscript/cts/ |
| reduce.rs | 386 #define BUCKETS 256
387 typedef uint32_t Histogram[BUCKETS];
392 for (int i = 0; i < BUCKETS; ++i)
402 for (int i = 1; i < BUCKETS; ++i)
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 129 // and allocate memory for the requested number of buckets.
133 ANTLR3_UINT32 bucket; // Used to traverse the buckets
143 // Allocate memory for the buckets
145 table->buckets = (pANTLR3_HASH_BUCKET) ANTLR3_MALLOC((size_t) (sizeof(ANTLR3_HASH_BUCKET) * sizeHint));
147 if (table->buckets == NULL)
159 /* Initialize the buckets to empty
163 table->buckets[bucket].entries = NULL;
197 ANTLR3_UINT32 bucket; /* Used to traverse the buckets */
203 /* Free the table, all buckets and all entries, and all the
210 thisBucket = &(table->buckets[bucket])
[all...] |
| /external/libevent/ |
| ratelim-internal.h | 47 /** Configuration info for a token bucket or set of token buckets. */
|
