/external/libcxx/test/utilities/time/time.traits/time.traits.duration_values/ |
H A D | 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(), "");
|
/external/libcxx/test/language.support/support.limits/limits/numeric.limits.members/ |
H A D | 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);
|
H A D | Android.mk | 43 test_name := language.support/support.limits/limits/numeric.limits.members/lowest 44 test_src := lowest.pass.cpp
|
/external/chromium_org/tools/sheriffing/ |
H A D | buildinfo.js | 76 var lowest = parseInt(json.sourceStamp.changes[0].revision, 10); 80 if (rev < lowest) 81 lowest = rev; 85 return [lowest, highest];
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
H A D | toy.ml | 7 * 1 is the lowest precedence. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
H A D | toy.ml | 9 * 1 is the lowest precedence. *)
|
/external/chromium-trace/trace-viewer/src/ui/ |
H A D | value_bar.css | 25 .value-bar .lowest-value-control { 46 .value-bar[orient='vertical'] .lowest-value-control { 77 .value-bar[orient='horizontal'] .lowest-value-control {
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
H A D | toy.ml | 14 * 1 is the lowest precedence. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
H A D | toy.ml | 14 * 1 is the lowest precedence. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
H A D | toy.ml | 14 * 1 is the lowest precedence. *)
|
/external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
H A D | toy.ml | 14 * 1 is the lowest precedence. *)
|
/external/eigen/unsupported/test/ |
H A D | mpreal_support.cpp | 19 std::cerr << "lowest = " << NumTraits<mpreal>::lowest() << "\n";
|
/external/libcxx/test/language.support/support.limits/limits/numeric.limits/ |
H A D | default.pass.cpp | 32 assert(std::numeric_limits<A>::lowest() == A());
|
/external/eigen/Eigen/src/Core/ |
H A D | 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)()); }
|
/external/qemu/include/qemu/ |
H A D | bswap.h | 169 uint32_t lowest; member in struct:__anon29901::__anon29902 177 uint32_t lowest; member in struct:__anon29901::__anon29904
|
/external/libvpx/libvpx/vp8/common/arm/neon/ |
H A D | 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/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 536 double lowest = DBL_MAX; local 542 if (roots1Copy[index] < lowest) { 544 lowest = roots1Copy[index];
|
/external/skia/src/pathops/ |
H A D | SkDQuadIntersection.cpp | 536 double lowest = DBL_MAX; local 542 if (roots1Copy[index] < lowest) { 544 lowest = roots1Copy[index];
|
/external/libvorbis/doc/ |
H A D | 09-helper.tex | 91 the lowest value scalar element for which \varname{n} is less than
|
H A D | 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
|
/external/eigen/Eigen/src/Geometry/ |
H A D | AlignedBox.h | 97 m_max.setConstant( ScalarTraits::lowest() );
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticImplicit.cpp | 552 double lowest = DBL_MAX; 558 if (roots1Copy[index] < lowest) { 560 lowest = roots1Copy[index];
|
/external/skia/experimental/Intersection/ |
H A D | QuadraticImplicit.cpp | 552 double lowest = DBL_MAX; 558 if (roots1Copy[index] < lowest) { 560 lowest = roots1Copy[index];
|
/external/yaffs2/yaffs2/ |
H A D | yaffs_guts.c | 1489 int lowest = 999999; local 1493 for (i = 0; i < 10 && lowest > 0; i++) { 1496 if (dev->objectBucket[x].count < lowest) { 1497 lowest = dev->objectBucket[x].count; 1507 for (i = 0; i < 10 && lowest > 3; i++) { 1510 if (dev->objectBucket[x].count < lowest) { 1511 lowest = dev->objectBucket[x].count; 3177 int lowest = -99; /* Stop compiler whining. */ local 3187 /* Find the dirty cache for this object with the lowest chunk id. */ 3193 lowest) { [all...] |
/external/guava/guava/src/com/google/common/primitives/ |
H A D | generate.sh | 180 * <p>More formally, returns the lowest index {@code i} such that {@code
|