HomeSort by relevance Sort by last modified time
    Searched refs:lowest (Results 1 - 25 of 67) sorted by null

1 2 3

  /external/libcxx/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(), "");
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/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;
  /external/libcxx/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);
Android.mk 43 test_name := language.support/support.limits/limits/numeric.limits.members/lowest
44 test_src := lowest.pass.cpp
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/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);
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/numeric/conversion/detail/
bounds.hpp 26 static N lowest () { return limits::min BOOST_PREVENT_MACRO_SUBSTITUTION (); } function in class:boost::numeric::boundsdetail::Integral
38 static N lowest () { return static_cast<N>(-limits::max BOOST_PREVENT_MACRO_SUBSTITUTION ()) ; } function in class:boost::numeric::boundsdetail::Float
converter.hpp 94 // s < Lowest(T) ? cNegOverflow : cInRange
105 return s < static_cast<S>(bounds<T>::lowest()) ? cNegOverflow : cInRange ;
123 // s <= Lowest(T)-1 ? cNegOverflow : cInRange
134 return s <= static_cast<S>(bounds<T>::lowest()) - static_cast<S>(1.0)
139 // s < Lowest(T)-0.5 ? cNegOverflow : cInRange
150 return s < static_cast<S>(bounds<T>::lowest()) - static_cast<S>(0.5)
171 // s >= Lowest(T) + 1 ? cPosOverflow : cInRange
187 // s >= Lowest(T) + 0.5 ? cPosgOverflow : cInRange
  /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/chromium-trace/trace-viewer/src/ui/
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/chromium_org/tools/sheriffing/
buildinfo.js 76 var lowest = parseInt(json.sourceStamp.changes[0].revision, 10);
80 if (rev < lowest)
81 lowest = rev;
85 return [lowest, highest];
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/walkers/
abstract_node_walker.js 6 * @fileoverview A base class for walkers that have a concept of lowest-level
8 * what a lowest-level node is. Then this walker will use those nodes as the
107 * it is at the lowest valid level or lower for this granularity.
  /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 19 std::cerr << "lowest = " << NumTraits<mpreal>::lowest() << "\n";
  /external/libcxx/test/language.support/support.limits/limits/numeric.limits/
default.pass.cpp 32 assert(std::numeric_limits<A>::lowest() == A());
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/language.support/support.limits/limits/numeric.limits/
default.pass.cpp 32 assert(std::numeric_limits<A>::lowest() == A());
  /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)()); }
  /build/target/board/generic_arm64/
BoardConfig.mk 33 # platform builds. It is the lowest common denominator required
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/host/chrome/
braille_table.js 67 * contracted, table. If {@code table} is the lowest-grade table for its
  /external/qemu/include/qemu/
bswap.h 169 uint32_t lowest; member in struct:__anon33619::__anon33620
177 uint32_t lowest; member in struct:__anon33619::__anon33622
  /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...]

Completed in 528 milliseconds

1 2 3