HomeSort by relevance Sort by last modified time
    Searched full:bucket (Results 376 - 400 of 1575) sorted by null

<<11121314151617181920>>

  /external/clang/lib/ASTMatchers/
ASTMatchFinder.cpp 491 TimeBucketRegion() : Bucket(nullptr) {}
496 /// If there was a bucket already set, it will finish the timing for that
497 /// other bucket.
500 /// If \p NewBucket is the same as the currently timed bucket, this call
503 if (Bucket != NewBucket) {
505 if (Bucket)
506 *Bucket += Now;
509 Bucket = NewBucket;
514 llvm::TimeRecord *Bucket;
729 /// \brief Bucket to record map
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
hash.c 189 fprintf(stderr, "Bucket len %d == %d (%f %% of recs)\n",
193 fprintf(stderr, "Avg bucket length %f\n", avg);
  /external/blktrace/
stats.h 116 static inline void histlog2_account(__u32 *bucket, __u32 val,
120 bucket[index]++;
  /external/chromium-trace/catapult/telemetry/telemetry/internal/image_processing/
video.py 28 def UploadToCloudStorage(self, bucket, target_path):
34 cloud_storage.Insert(bucket, target_path, self._video_file_obj.name)
  /external/chromium-trace/catapult/telemetry/telemetry/value/
histogram_unittest.py 68 bucket = histogram_module.HistogramValueBucket(33, 45, 78)
69 d = bucket.AsDict()
histogram_util.py 29 # the highest bucket will have a 'low': maxvalue entry in the dict but no
31 # and uses it to get bucket mean. So default it to the same value as low.
trace.py 140 def UploadToCloud(self, bucket):
154 bucket, remote_path, fh.GetAbsPath())
  /external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/
LruBitmapPool.java 16 * {@link com.bumptech.glide.load.engine.bitmap_recycle.LruPoolStrategy} to bucket {@link Bitmap}s and then uses an LRU
17 * eviction policy to evict {@link android.graphics.Bitmap}s from the least recently used bucket in order to keep
  /external/iproute2/man/man8/
ss.8 165 .B bucket
171 .B bucket
tc-htb.8 3 HTB \- Hierarchy Token Bucket
42 Unlike CBQ, HTB shapes traffic based on the Token Bucket Filter algorithm
  /external/jdiff/src/jdiff/
HTMLStatistics.java 203 int bucket = (int)(pkg.pdiff); local
204 hist[bucket]++;
206 if (bucket != 0)
207 h_.writeText(" <TD ALIGN=\"center\">" + bucket + "</TD>");
290 int bucket = (int)(classDiff.pdiff); local
291 hist[bucket]++;
293 if (bucket != 0)
294 h_.writeText(" <TD ALIGN=\"center\">" + bucket + "</TD>");
  /external/libdrm/freedreno/
freedreno_priv.h 146 struct list_head list; /* bucket-list entry */
147 time_t free_time; /* time when added to bucket-list */
  /external/ltp/testcases/kernel/controllers/io-throttle/
run_io_throttle_test.sh 83 echo "(leaky-bucket i/o throttling)"
85 echo "(token-bucket i/o throttling)"
  /external/v8/src/compiler/
value-numbering-reducer.cc 118 // of a bucket.
133 // end of a bucket.
  /packages/apps/Gallery2/src/com/android/gallery3d/gadget/
LocalPhotoSource.java 191 * Builds the bucket ID for the public external storage Downloads directory
192 * @return the bucket ID
  /packages/apps/Settings/src/com/android/settings/datausage/
ChartDataUsagePreference.java 85 // increment by current bucket total
109 // increment by current bucket total
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/
hashtable_policy.h 86 // Local iterators, used to iterate within a bucket but not between
236 // This loop requires the bucket array to have a non-null sentinel.
379 // Default value for rehash policy. Bucket size is (usually) the
390 // Return a bucket size no smaller than n.
394 // Return a bucket count appropriate for n elements
398 // __n_bkt is current bucket count, __n_elt is current element count,
400 // increase bucket count? If so, return make_pair(true, n), where n
401 // is the new bucket count. If not, return make_pair(false, 0).
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/
hashtable_policy.h 86 // Local iterators, used to iterate within a bucket but not between
236 // This loop requires the bucket array to have a non-null sentinel.
379 // Default value for rehash policy. Bucket size is (usually) the
390 // Return a bucket size no smaller than n.
394 // Return a bucket count appropriate for n elements
398 // __n_bkt is current bucket count, __n_elt is current element count,
400 // increase bucket count? If so, return make_pair(true, n), where n
401 // is the new bucket count. If not, return make_pair(false, 0).
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/
hashtable_policy.h 86 // Local iterators, used to iterate within a bucket but not between
236 // This loop requires the bucket array to have a non-null sentinel.
379 // Default value for rehash policy. Bucket size is (usually) the
390 // Return a bucket size no smaller than n.
394 // Return a bucket count appropriate for n elements
398 // __n_bkt is current bucket count, __n_elt is current element count,
400 // increase bucket count? If so, return make_pair(true, n), where n
401 // is the new bucket count. If not, return make_pair(false, 0).
  /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/
hashtable_policy.h 86 // Local iterators, used to iterate within a bucket but not between
236 // This loop requires the bucket array to have a non-null sentinel.
379 // Default value for rehash policy. Bucket size is (usually) the
390 // Return a bucket size no smaller than n.
394 // Return a bucket count appropriate for n elements
398 // __n_bkt is current bucket count, __n_elt is current element count,
400 // increase bucket count? If so, return make_pair(true, n), where n
401 // is the new bucket count. If not, return make_pair(false, 0).
  /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/
hashtable_policy.h 86 // Local iterators, used to iterate within a bucket but not between
236 // This loop requires the bucket array to have a non-null sentinel.
379 // Default value for rehash policy. Bucket size is (usually) the
390 // Return a bucket size no smaller than n.
394 // Return a bucket count appropriate for n elements
398 // __n_bkt is current bucket count, __n_elt is current element count,
400 // increase bucket count? If so, return make_pair(true, n), where n
401 // is the new bucket count. If not, return make_pair(false, 0).
  /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/
hashtable_policy.h 86 // Local iterators, used to iterate within a bucket but not between
236 // This loop requires the bucket array to have a non-null sentinel.
379 // Default value for rehash policy. Bucket size is (usually) the
390 // Return a bucket size no smaller than n.
394 // Return a bucket count appropriate for n elements
398 // __n_bkt is current bucket count, __n_elt is current element count,
400 // increase bucket count? If so, return make_pair(true, n), where n
401 // is the new bucket count. If not, return make_pair(false, 0).
  /external/guava/guava/src/com/google/common/collect/
HashBiMap.java 121 * Finds and removes {@code entry} from the bucket linked lists in both the
290 for (int bucket = 0; bucket < oldKToV.length; bucket++) {
291 BiEntry<K, V> entry = oldKToV[bucket];
  /frameworks/base/core/java/com/android/internal/widget/
ChildHelper.java 44 final Bucket mBucket;
50 mBucket = new Bucket();
395 static class Bucket {
403 Bucket mNext;
416 mNext = new Bucket();
  /frameworks/base/packages/SystemUI/src/com/android/systemui/power/
PowerNotificationWarnings.java 129 public void update(int batteryLevel, int bucket, long screenOffTime) {
131 if (bucket >= 0) {
133 } else if (bucket < mBucket) {
136 mBucket = bucket;
179 // Bump the notification when the bucket dropped.

Completed in 1748 milliseconds

<<11121314151617181920>>