| /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/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. *)
|
| /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 | |
| org.eclipse.ant.core_3.2.200.v20100427.jar | |
| /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
|
| 04-codec.tex | 226 \item if the value is greater than the highest numbered submap (\varname{[vorbis_mapping_submaps]} - 1), this in an error condition rendering the stream undecodable
233 \item verify the floor number is not greater than the highest number floor configured for the bitstream. If it is, the bitstream is undecodable
235 \item verify the residue number is not greater than the highest number residue configured for the bitstream. If it is, the bitstream is undecodable
259 and \varname{[vorbis_mode_transformtype]}. \varname{[vorbis_mode_mapping]} must not be greater than the highest number mapping in use. Any illegal values render the stream undecodable.
|
| 02-bitpacking.tex | 54 'most significant byte first' in which the highest-valued byte comes
|
| 06-floor0.tex | 62 5) if ( [booknumber] is greater than the highest number decode codebook ) then packet is undecodable
|
| 07-floor1.tex | 162 highest numbered codebook configured in this stream is an error
|
| 03-codebook.tex | 221 length to highest) results in the following codeword list:
|
| /external/v8/test/mjsunit/ |
| toint32.js | 117 // bignum is (2^53 - 1) * 2^31 - highest number with bit 31 set.
|
| /frameworks/ex/widget/java/com/android/ex/widget/ |
| StaggeredGridView.java | 954 int highest = mItemTops[nextCol]; local
[all...] |
| /external/webkit/Source/WebCore/editing/ |
| htmlediting.cpp | 222 // Since enclosingNodeOfType won't search beyond the highest root editable node,
582 // Create new range with the highest editable node contained within the range
640 Node* highest = 0; local
646 highest = n;
651 return highest;
[all...] |
| /external/chromium/chrome/browser/resources/net_internals/ |
| eventsview.js | 150 // The one that ended most recently (Highest end time) should be sorted
180 * appear right after the SourceEntry with the highest source ID received
196 // highest ID should be sorted first.
|
| /external/webkit/Source/WebCore/rendering/ |
| RenderBlock.h | 603 void markLinesDirtyInBlockRange(int logicalTop, int logicalBottom, RootInlineBox* highest = 0);
[all...] |
| /cts/suite/pts/hostTests/browser/browserlauncher/assets/octane/ |
| richards.js | 343 * with the highest priority).
|
| /external/v8/benchmarks/ |
| richards.js | 343 * with the highest priority).
|
