| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/ |
| reserve.pass.cpp | 39 size_t buckets = c.bucket_count(); local
43 assert(buckets == c.bucket_count());
|
| /external/boringssl/src/include/openssl/ |
| lhash.h | 131 /* buckets is an array of |num_buckets| pointers. Each points to the head of
134 LHASH_ITEM **buckets; member in struct:lhash_st
135 /* num_buckets contains the length of |buckets|. This value is always >=
139 * calls. If non-zero then this suppresses resizing of the |buckets| array,
|
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableMapEntry.java | 27 * hash buckets for the key and the value. This allows reuse in {@link RegularImmutableMap} and
|
| /external/libdrm/ |
| xf86drmHash.h | 44 HashBucketPtr buckets[HASH_SIZE]; member in struct:HashTable
|
| /external/webrtc/infra/config/ |
| cq.cfg | 27 buckets {
|
| /frameworks/base/telephony/java/android/telephony/ |
| TelephonyHistogram.java | 57 // Array storing endpoints of range buckets. Calculated based on values of minTime & maxTime
69 // Count of Histogram samples after which time buckets are created.
82 throw new IllegalArgumentException("Invalid number of buckets");
192 // totalTimeCount = RANGE_CALCULATION_COUNT, based on the min, max time & the number of buckets
|
| /external/chromium-trace/catapult/telemetry/telemetry/util/ |
| perf_tests_results_helper.py | 41 if not 'buckets' in histogram:
45 for bucket in histogram['buckets']:
59 for bucket in histogram['buckets']:
|
| /external/llvm/include/llvm/ADT/ |
| DenseSet.h | 24 // Use the empty base class trick so we can create a DenseMap where the buckets
43 "DenseMap buckets unexpectedly large!");
57 /// Grow the DenseSet so that it has at least Size buckets. Will not shrink
|
| /external/webrtc/webrtc/system_wrappers/include/ |
| metrics.h | 64 // Histogram for counters (exponentially spaced buckets).
105 // Histogram for percentage (evenly spaced buckets).
114 // Histogram for enumerators (evenly spaced buckets).
|
| /external/clang/lib/Serialization/ |
| MultiOnDiskHashTable.h | 53 storage_type Buckets, storage_type Payload, storage_type Base,
56 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {}
200 storage_type Buckets = Data + BucketOffset;
202 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
207 Buckets, Ptr, Data, std::move(InfoObj));
|
| /external/libmojo/base/android/java/src/org/chromium/base/metrics/ |
| RecordHistogram.java | 51 * buckets, corresponding to success (true) and failure (false). This is the Java equivalent of
116 * @param numBuckets the number of buckets
133 * @param numBuckets the number of buckets
206 * Records a sample in a histogram of times with custom buckets. This is the Java equivalent of
213 * @param numBuckets the number of buckets
|
| /external/v8/tools/sanitizers/ |
| sancov_merger.py | 95 Splits the sancov files into several buckets, so that each bucket can be
98 we might need to avoid splitting buckets of executables with few files.
108 # Chop files into buckets.
109 buckets = [files[i:i+n] for i in xrange(0, len(files), n)]
115 for i, b in enumerate(buckets)])
|
| /packages/apps/Camera2/src/com/android/camera/settings/ |
| ResolutionUtil.java | 131 List<ResolutionBucket> buckets = parseAvailableSizes(sizes, isBackCamera); local
136 sortedDesiredAspectRatios.add(buckets.get(0).aspectRatio.floatValue());
138 // Now go through the buckets from largest mp to smallest, adding
140 for (ResolutionBucket bucket : buckets) {
150 for (ResolutionBucket bucket : buckets) {
231 * This takes a bunch of supported sizes and buckets them by aspect ratio.
232 * The result is a list of buckets sorted by each bucket's largest area.
|
| /frameworks/base/core/java/android/app/usage/ |
| NetworkStatsManager.java | 43 * discrete bins of time called 'Buckets'. See {@link NetworkStats.Bucket} for details.
64 * Therefore there can be multiple buckets for a particular key but all Bucket's state is going to
186 * calling user. Result is aggregated over time, hence all buckets will have the same start and
187 * end timestamps. Not aggregated over state, uid, metered, or roaming. This means buckets'
234 * This means buckets' start and end timestamps are going to be between 'startTime' and
239 * <p>Only includes buckets that atomically occur in the inclusive time range. Doesn't
240 * interpolate across partial buckets. Since bucket length is in the order of hours, this
276 * metered, nor roaming. This means buckets' start and end timestamps are going to be between
282 * <p>Only includes buckets that atomically occur in the inclusive time range. Doesn't
283 * interpolate across partial buckets. Since bucket length is in the order of hours, thi
[all...] |
| /external/stressapptest/src/ |
| finelock_queue.cc | 163 uint64 buckets[32]; local
170 // Buckets for each log2 access counts.
172 buckets[b] = 0;
184 buckets[b]++;
189 if (buckets[b])
191 ((1 << b) >> 1), 1 << b, buckets[b]);
|
| /libcore/ojluni/src/main/java/sun/security/util/ |
| Cache.java | 61 * In its current implementation, the number of buckets (NOT entries) in
63 * maximum cache size to value that uses those buckets fully. For example,
65 * maximum size of 750 would be a good choice: try 1024 buckets, with a
67 * buckets / 4 * 3. As mentioned above, with a SoftReference cache, it is
272 int buckets = (int)(maxSize / LOAD_FACTOR) + 1; local
273 cacheMap = new LinkedHashMap<>(buckets, LOAD_FACTOR, true);
|
| /external/llvm/docs/ |
| SourceLevelDebugging.rst | 775 Typical hash tables have a header, buckets, and each bucket points to the
783 | BUCKETS |
788 The BUCKETS are an array of offsets to DATA for each hash:
793 | 0x00001000 | BUCKETS[0]
794 | 0x00002000 | BUCKETS[1]
795 | 0x00002200 | BUCKETS[2]
796 | 0x000034f0 | BUCKETS[3]
798 | 0xXXXXXXXX | BUCKETS[n_buckets]
[all...] |
| /art/runtime/base/ |
| histogram-inl.h | 69 // If we have reached the maximum number of buckets, merge buckets together.
72 // We double the width of each bucket to reduce the number of buckets by a factor of 2.
|
| /frameworks/base/core/java/android/net/ |
| RssiCurve.java | 34 * following buckets: {@code [-20, -10, 0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120]}.
169 * curve is split into two buckets in another. For the purpose of this method, these curves are
200 sb.append(",buckets=");
|
| /external/libchrome/base/metrics/ |
| histogram_base.h | 236 // Writes information about the current (non-empty) buckets and their sample
237 // counts to |buckets|, the total sample count to |count| and the total sum
241 ListValue* buckets) const = 0;
252 // Output is the count in the buckets, as well as the percentage.
|
| sample_vector.h | 90 // SampleVector uses predefined buckets, so iterator can return bucket index.
|
| /external/libchrome/base/trace_event/ |
| heap_profiler_allocation_register.h | 147 // Conceptually this is |prev| in a doubly linked list. However, buckets
154 // buckets / cells differently.
225 // The array of buckets (pointers into |cells_|). |buckets_[Hash(key)]| will
303 // Expect max 1.5M allocations. Number of buckets is 2^18 for optimal
|
| /external/libunwind/include/tdep-ia64/ |
| script.h | 76 struct ia64_script buckets[IA64_UNW_CACHE_SIZE]; member in struct:ia64_script_cache
|
| /external/llvm/lib/Support/ |
| SmallPtrSet.cpp | 27 // Reduce the number of buckets.
32 // Install the new array. Clear all the buckets to empty.
115 /// Grow - Allocate a larger backing store for the buckets and move it over.
122 // Install the new array. Clear all the buckets to empty.
|
| /external/llvm/test/DebugInfo/ |
| dwarfdump-accel.test | 36 Check that empty buckets are handled correctly.
|
