| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/numeric/conversion/detail/ |
| bounds.hpp | 27 static N highest () { return limits::max BOOST_PREVENT_MACRO_SUBSTITUTION (); } function in class:boost::numeric::boundsdetail::Integral
39 static N highest () { return limits::max BOOST_PREVENT_MACRO_SUBSTITUTION (); } function in class:boost::numeric::boundsdetail::Float
|
| converter.hpp | 155 // s > Highest(T) ? cPosOverflow : cInRange
166 return s > static_cast<S>(bounds<T>::highest())
182 return s >= static_cast<S>(bounds<T>::highest()) + static_cast<S>(1.0)
198 return s >= static_cast<S>(bounds<T>::highest()) + static_cast<S>(0.5)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
| toy.ml | 11 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
| /external/libppp/src/ |
| link.c | 97 struct mqueue *queue, *highest; local
101 highest = LINK_HIGHQ(l);
102 for (queue = l->Queue; queue < highest; queue++)
104 m_enqueue(highest, m_dequeue(queue));
110 struct mqueue *queue, *highest; local
112 highest = LINK_HIGHQ(l);
113 for (queue = l->Queue; queue <= highest; queue++)
153 struct mqueue *queue, *highest; local
159 * everything that's not in the highest priority queue, we must be able to
168 highest = LINK_HIGHQ(l)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| IntArray.java | 45 // First byte is 0 to enforce highest (=sign) bit is zero.
142 int highest = m_ints[last]; local
146 if ((highest & 0xffff0000) != 0)
148 if ((highest & 0xff000000) != 0)
151 highest >>>= 24;
156 highest >>>= 16;
159 else if (highest > 0x000000ff)
162 highest >>>= 8;
165 while (highest != 1)
168 highest >>>= 1
[all...] |
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
| toy.ml | 13 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
| /external/chromium-trace/trace-viewer/src/ui/ |
| value_bar.css | 30 .value-bar .highest-value-control {
69 .value-bar[orient='vertical'] .highest-value-control {
106 .value-bar[orient='horizontal'] .highest-value-control {
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
| toy.ml | 18 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| toy.ml | 18 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| toy.ml | 18 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| toy.ml | 19 Hashtbl.add Parser.binop_precedence '*' 40; (* highest. *)
|
| /external/eigen/unsupported/test/ |
| mpreal_support.cpp | 19 std::cerr << "highest = " << NumTraits<mpreal>::highest() << "\n";
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| ContainerNode.h | 247 Node* highest = node; local
249 highest = node;
250 return highest;
|
| /external/eigen/Eigen/src/Core/ |
| NumTraits.h | 48 * \li highest() and lowest() functions returning the highest and lowest possible values respectively.
77 static inline T highest() { return (std::numeric_limits<T>::max)(); }
|
| /external/llvm/test/MC/PowerPC/ |
| ppc64-fixup-apply.s | 42 addis 1, 1, target7@highest
|
| ppc64-fixups.s | 73 # CHECK: lis 3, target@highest # encoding: [0x3c,0x60,A,A]
74 # CHECK-NEXT: # fixup A - offset: 2, value: target@highest, kind: fixup_ppc_half16
76 lis 3, target@highest
230 # CHECK: addis 3, 2, target@tprel@highest # encoding: [0x3c,0x62,A,A]
231 # CHECK-NEXT: # fixup A - offset: 2, value: target@tprel@highest, kind: fixup_ppc_half16
233 addis 3, 2, target@tprel@highest
280 # CHECK: addis 3, 2, target@dtprel@highest # encoding: [0x3c,0x62,A,A]
281 # CHECK-NEXT: # fixup A - offset: 2, value: target@dtprel@highest, kind: fixup_ppc_half16
283 addis 3, 2, target@dtprel@highest
|
| /ndk/sources/host-tools/nawk-20071023/ |
| README | 94 awk's speed, perhaps by 1/3 for highest levels.
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.equinox.launcher.jar | |
| org.eclipse.equinox.launcher_1.1.0.v20100507.jar | |
| /external/chromium_org/chrome/browser/resources/image_loader/ |
| worker.js | 9 * synchronously, taking into account priorities. The highest priority is 0.
|
| /external/chromium_org/v8/test/mjsunit/ |
| toint32.js | 117 // bignum is (2^53 - 1) * 2^31 - highest number with bit 31 set.
|
| /external/libvorbis/doc/ |
| 09-helper.tex | 17 The "ilog(x)" function returns the position number (1 through n) of the highest set bit in the two's complement integer value
|
| /external/v8/test/mjsunit/ |
| toint32.js | 117 // bignum is (2^53 - 1) * 2^31 - highest number with bit 31 set.
|
| /external/eigen/Eigen/src/Geometry/ |
| AlignedBox.h | 96 m_min.setConstant( ScalarTraits::highest() );
|
| /frameworks/ex/widget/java/com/android/ex/widget/ |
| StaggeredGridView.java | 954 int highest = mItemTops[nextCol]; local
[all...] |
