| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/impl/ |
| profiler_container_size.h | 141 std::size_t _M_max; // range of # buckets
|
| /prebuilts/ndk/r11/sources/cxx-stl/stlport/src/ |
| dll_main.cpp | 105 //Export of the types used to represent buckets in the hashtable implementation.
|
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/impl/ |
| profiler_container_size.h | 141 std::size_t _M_max; // range of # buckets
|
| /prebuilts/ndk/r13/sources/cxx-stl/stlport/src/ |
| dll_main.cpp | 105 //Export of the types used to represent buckets in the hashtable implementation.
|
| /system/update_engine/common/ |
| constants.h | 141 // The default number of UMA buckets for metrics.
|
| error_code.h | 94 // buckets, even when new enums are added above this line in future. See
|
| /toolchain/binutils/binutils-2.25/gprof/ |
| gmon.h | 96 * Fraction of text space to allocate for from hash buckets. The
|
| /device/google/contexthub/firmware/os/algos/calibration/accelerometer/ |
| accel_cal.c | 38 #define TEMP_CUT 30 // Separation point for temperature buckets 30 degree C.
59 // Sorting the data in the different buckets
157 // Accel cal algo init (ready for temp buckets).
300 // Sorting the data in the different buckets and accum
352 // Checking if all buckets are full.
391 // If any of the buckets has a bigger number as specified, reset and start
504 // Two temp buckets.
|
| /external/protobuf/src/google/protobuf/ |
| map.h | 683 // additional feature that some buckets can be converted to use an ordered
693 // 2. The number of buckets is a power of two.
694 // 3. Buckets are converted to trees in pairs: if we convert bucket b then
695 // buckets b and b^1 will share a tree. Invariant: buckets b and b^1 have
803 // Advance through buckets, looking for the first that isn't empty.
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| hashtable.h | 119 * - std::vector<std::forward_list<_Node>::iterator> representing the buckets
121 * The non-empty buckets contain the node before the first node in the
126 * std::forward_list::before_begin. Empty buckets contain
127 * nullptr. Note that one of the non-empty buckets contains
139 * how many empty buckets there are in the container.
362 // Gets bucket begin, deals with the fact that non-empty buckets contain
693 // Set number of buckets to be appropriate for container of n element.
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| hashtable.h | 119 * - std::vector<std::forward_list<_Node>::iterator> representing the buckets
121 * The non-empty buckets contain the node before the first node in the
126 * std::forward_list::before_begin. Empty buckets contain
127 * nullptr. Note that one of the non-empty buckets contains
139 * how many empty buckets there are in the container.
362 // Gets bucket begin, deals with the fact that non-empty buckets contain
693 // Set number of buckets to be appropriate for container of n element.
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| hashtable.h | 119 * - std::vector<std::forward_list<_Node>::iterator> representing the buckets
121 * The non-empty buckets contain the node before the first node in the
126 * std::forward_list::before_begin. Empty buckets contain
127 * nullptr. Note that one of the non-empty buckets contains
139 * how many empty buckets there are in the container.
362 // Gets bucket begin, deals with the fact that non-empty buckets contain
693 // Set number of buckets to be appropriate for container of n element.
[all...] |
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/ |
| map.h | 686 // additional feature that some buckets can be converted to use an ordered
696 // 2. The number of buckets is a power of two.
697 // 3. Buckets are converted to trees in pairs: if we convert bucket b then
698 // buckets b and b^1 will share a tree. Invariant: buckets b and b^1 have
806 // Advance through buckets, looking for the first that isn't empty.
[all...] |
| /toolchain/binutils/binutils-2.25/gold/ |
| dynobj.cc | 853 // Given a vector of hash codes, compute the number of hash buckets to
862 // Array used to determine the number of hash table buckets to use
865 // buckets, fewer than 37 we use 17 buckets, and so forth. We never
866 // use more than 262147 buckets. This is straight from the old GNU
868 static const unsigned int buckets[] = local
873 const int buckets_count = sizeof buckets / sizeof buckets[0];
881 if (symcount < buckets[i] * full_fraction)
883 ret = buckets[i]
[all...] |
| /external/autotest/frontend/tko/ |
| graphing_utils.py | 155 interval: interval for each bucket. E.g., 10 means that buckets should
714 buckets = [(bin, min(bin + interval, 100)) for bin in bins[:-1]]
720 ['%d%% - <%d%%' % bucket for bucket in buckets] +
736 for bucket, y_val in zip(buckets, y)]
743 for bucket in buckets]
|
| /prebuilts/gcc/darwin-x86/aarch64/aarch64-linux-android-4.9/lib/gcc/aarch64-linux-android/4.9.x/gcov-src/ |
| gcov-io.c | 933 sized buckets is divided into 4 linear sub-buckets for better
934 focus in the higher buckets. */
966 four buckets. */
973 of the four linear sub-buckets to select. */
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.9/lib/gcc/arm-linux-androideabi/4.9.x/gcov-src/ |
| gcov-io.c | 933 sized buckets is divided into 4 linear sub-buckets for better
934 focus in the higher buckets. */
966 four buckets. */
973 of the four linear sub-buckets to select. */
[all...] |
| /prebuilts/gcc/darwin-x86/mips/mips64el-linux-android-4.9/lib/gcc/mips64el-linux-android/4.9.x/gcov-src/ |
| gcov-io.c | 933 sized buckets is divided into 4 linear sub-buckets for better
934 focus in the higher buckets. */
966 four buckets. */
973 of the four linear sub-buckets to select. */
[all...] |
| /prebuilts/gcc/darwin-x86/x86/x86_64-linux-android-4.9/lib/gcc/x86_64-linux-android/4.9.x/gcov-src/ |
| gcov-io.c | 933 sized buckets is divided into 4 linear sub-buckets for better
934 focus in the higher buckets. */
966 four buckets. */
973 of the four linear sub-buckets to select. */
[all...] |
| /prebuilts/gcc/linux-x86/aarch64/aarch64-linux-android-4.9/lib/gcc/aarch64-linux-android/4.9.x/gcov-src/ |
| gcov-io.c | 933 sized buckets is divided into 4 linear sub-buckets for better
934 focus in the higher buckets. */
966 four buckets. */
973 of the four linear sub-buckets to select. */
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.9/lib/gcc/arm-linux-androideabi/4.9.x/gcov-src/ |
| gcov-io.c | 933 sized buckets is divided into 4 linear sub-buckets for better
934 focus in the higher buckets. */
966 four buckets. */
973 of the four linear sub-buckets to select. */
[all...] |
| /prebuilts/gcc/linux-x86/mips/mips64el-linux-android-4.9/lib/gcc/mips64el-linux-android/4.9.x/gcov-src/ |
| gcov-io.c | 933 sized buckets is divided into 4 linear sub-buckets for better
934 focus in the higher buckets. */
966 four buckets. */
973 of the four linear sub-buckets to select. */
[all...] |
| /prebuilts/gcc/linux-x86/x86/x86_64-linux-android-4.9/lib/gcc/x86_64-linux-android/4.9.x/gcov-src/ |
| gcov-io.c | 933 sized buckets is divided into 4 linear sub-buckets for better
934 focus in the higher buckets. */
966 four buckets. */
973 of the four linear sub-buckets to select. */
[all...] |
| /external/bzip2/ |
| blocksort.c | 248 Inductively refine the buckets. Kind-of an
871 Process big buckets, starting with the least full.
873 mainQSort3 to sort the small buckets [ss, j], but
881 any unsorted small buckets [ss, j], for j != ss.
883 completed many of the small buckets [ss, j], so
914 sorted order for small buckets [t, ss] for all t,
|
| /frameworks/base/core/java/android/service/notification/ |
| ZenModeConfig.java | 310 final int[] buckets = new int[maxHrs + 3]; local
311 buckets[0] = 15;
312 buckets[1] = 30;
313 buckets[2] = 45;
315 buckets[2 + i] = 60 * i;
317 return buckets;
[all...] |
