| /ndk/sources/cxx-stl/llvm-libc++/test/utilities/time/time.traits/time.traits.duration_values/ |
| min.pass.cpp | 23 std::numeric_limits<int>::lowest());
25 std::numeric_limits<double>::lowest());
27 std::numeric_limits<Rep>::lowest());
30 std::numeric_limits<int>::lowest(), "");
32 std::numeric_limits<double>::lowest(), "");
34 std::numeric_limits<Rep>::lowest(), "");
|
| /frameworks/ex/variablespeed/jni/ |
| macros.h | 32 ForwardIterator lowest = first; local
35 if (*first < *lowest)
36 lowest = first;
37 return lowest;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/language.support/support.limits/limits/numeric.limits.members/ |
| lowest.pass.cpp | 12 // lowest()
24 assert(std::numeric_limits<T>::lowest() == expected);
26 assert(std::numeric_limits<const T>::lowest() == expected);
28 assert(std::numeric_limits<volatile T>::lowest() == expected);
30 assert(std::numeric_limits<const volatile T>::lowest() == expected);
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
| toy.ml | 7 * 1 is the lowest precedence. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
| toy.ml | 9 * 1 is the lowest precedence. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
| toy.ml | 14 * 1 is the lowest precedence. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| toy.ml | 14 * 1 is the lowest precedence. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| toy.ml | 14 * 1 is the lowest precedence. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| toy.ml | 14 * 1 is the lowest precedence. *)
|
| /external/eigen/unsupported/test/ |
| mpreal_support.cpp | 20 std::cerr << "lowest = " << NumTraits<mpreal>::lowest() << "\n";
|
| /external/eigen/Eigen/src/Core/ |
| NumTraits.h | 48 * \li highest() and lowest() functions returning the highest and lowest possible values respectively.
78 static inline T lowest() { return IsInteger ? (std::numeric_limits<T>::min)() : (-(std::numeric_limits<T>::max)()); }
|
| MathFunctions.h | 835 return x<NumTraits<T>::highest() && x>NumTraits<T>::lowest();
|
| /ndk/sources/cxx-stl/llvm-libc++/test/language.support/support.limits/limits/numeric.limits/ |
| default.pass.cpp | 32 assert(std::numeric_limits<A>::lowest() == A());
|
| /frameworks/ex/widget/java/com/android/ex/widget/ |
| StaggeredGridView.java | 793 int lowest = childTop; local
796 if (bottom > lowest) {
797 lowest = bottom;
800 childTop = lowest;
1068 int lowest = mItemBottoms[nextCol]; local
[all...] |
| /external/libvpx/libvpx/vp8/common/arm/neon/ |
| idct_dequant_full_2x_neon.asm | 72 ; compensate for this. in the case of sinpi8sqrt2, the lowest bit is 0,
75 ; for cospi8sqrt2minus1 the lowest bit is 1, so we lose precision if we
193 ; because the lowest bit in 0x8a8c is 0, we can pre-shift this
|
| /external/openssl/crypto/modes/asm/ |
| ghash-armv4.S | 332 vdup.8 d4,d28[0] @ broadcast lowest byte
362 vdup.8 d4,d28[0] @ broadcast lowest byte
371 vdup.8 d4,d28[0] @ broadcast lowest byte
|
| ghash-armv4.pl | 344 vdup.8 $xi,`&Dlo("$IN")`[0] @ broadcast lowest byte
374 vdup.8 $xi,`&Dlo("$IN")`[0] @ broadcast lowest byte
383 vdup.8 $xi,`&Dlo("$IN")`[0] @ broadcast lowest byte
|
| /external/libvorbis/doc/ |
| 09-helper.tex | 91 the lowest value scalar element for which \varname{n} is less than
|
| 03-codebook.tex | 206 lowest valued unused binary Huffman codeword possible. Assume the
220 Assigning codewords in order (lowest possible value of the appropriate
239 When determining 'lowest possible value' in the assignment definition
|
| 02-bitpacking.tex | 56 which the lowest value byte comes first) and less commonly 3-1-2-0 and
|
| /external/eigen/Eigen/src/Geometry/ |
| AlignedBox.h | 97 m_max.setConstant( ScalarTraits::lowest() );
|
| /external/qemu/ |
| cpu-all.h | 150 uint32_t lowest; member in struct:__anon13183::__anon13184
158 uint32_t lowest; member in struct:__anon13183::__anon13186
|
| /external/yaffs2/yaffs2/ |
| yaffs_guts.c | 1489 int lowest = 999999; local
3177 int lowest = -99; \/* Stop compiler whining. *\/ local
[all...] |
| /external/guava/guava/src/com/google/common/primitives/ |
| generate.sh | 180 * <p>More formally, returns the lowest index {@code i} such that {@code
|
| /external/ceres-solver/docs/ |
| solving.tex | 384 lowest numbered elimination group are eliminated first, and then the
385 parameter blocks in the next lowest numbered elimination group and so
414 specify an ordering, it must have one important property. The lowest
[all...] |
