| /external/antlr/src/org/antlr/runtime/ |
| CharStream.java | 45 public int LT(int i);
|
| Parser.java | 54 return ((TokenStream)input).LT(1);
66 Token current = ((TokenStream)input).LT(1);
68 current = ((TokenStream)input).LT(-1);
92 super.traceIn(ruleName, ruleIndex, input.LT(1));
96 super.traceOut(ruleName, ruleIndex, input.LT(1));
|
| TokenStream.java | 36 * two tokens ago. LT(0) is undefined. For i>=n, return Token.EOFToken.
37 * Return null for LT(0) and any index that results in an absolute address
40 public Token LT(int k);
|
| RecognitionException.java | 106 this.token = ((TokenStream)input).LT(1);
125 this.node = nodes.LT(1);
133 Object priorNode = nodes.LT(i);
144 priorNode = nodes.LT(i);
|
| UnbufferedTokenStream.java | 43 * You can only look backwards 1 token: LT(-1).
75 public int LA(int i) { return LT(i).getType(); }
|
| /external/antlr/src/org/antlr/runtime/debug/ |
| DebugTokenStream.java | 47 input.LT(1);
59 Token t = input.LT(1);
80 public Token LT(int i) {
84 dbg.LT(i, input.LT(i));
85 return input.LT(i);
92 dbg.LT(i, input.LT(i));
|
| DebugTreeNodeStream.java | 65 Object node = input.LT(1);
74 public Object LT(int i) {
75 Object node = input.LT(i);
79 dbg.LT(i, node);
84 Object node = input.LT(i);
88 dbg.LT(i, node);
|
| DebugEventRepeater.java | 59 public void LT(int i, Token t) { listener.LT(i, t); }
75 public void LT(int i, Object t) { listener.LT(i, t); }
|
| BlankDebugEventListener.java | 48 public void LT(int i, Token t) {}
64 public void LT(int i, Object t) {}
|
| DebugEventListener.java | 78 * so that a GUI can easily track what LT/consume events are
99 * triggered by both LA and LT calls. The debugger will want to know
102 * ahead into a file it doesn't have so LT events must pass the token
105 public void LT(int i, Token t);
156 * caused the problem was the last object referenced by LT. The
157 * immediately preceding LT event should hold the unexpected Token or
170 * LT(1)
174 * LT(1)
178 * LT(1)
183 * LT(1
[all...] |
| Tracer.java | 59 return ((TokenStream)input).LT(k);
|
| /external/skia/gpu/include/ |
| GrTBSearch.h | 33 if (LT(array[index], target)) {
46 if (LT(array[high], target)) {
|
| /external/llvm/lib/Target/X86/ |
| X86VZeroUpper.cpp | 75 GlobalValue::LinkageTypes LT = GV->getLinkage();
76 if (GV->isInternalLinkage(LT) || GV->isPrivateLinkage(LT) ||
77 (GV->isExternalLinkage(LT) && !GV->isDeclaration()))
|
| /external/antlr/src/org/antlr/runtime/tree/ |
| TreeParser.java | 82 return ((TreeNodeStream)input).LT(1);
103 Object look = input.LT(1);
114 look = input.LT(1);
163 super.traceIn(ruleName, ruleIndex, input.LT(1));
167 super.traceOut(ruleName, ruleIndex, input.LT(1));
|
| TreeNodeStream.java | 42 * i<0 indicates nodes in the past. So LT(-1) is previous node, but
44 * LT(0) is undefined. For i>=n, return null.
45 * Return null for LT(0) and any index that results in an absolute address
48 * This is analogus to the LT() method of the TokenStream, but this
52 public Object LT(int k);
|
| CommonTreeNodeStream.java | 120 public int LA(int i) { return adaptor.getType(LT(i)); }
160 Object o = LT(1);
166 o = LT(1);
|
| /external/opencv/cxcore/include/ |
| cxmisc.h | 365 comparison and exchange. The macro takes less_than (or LT) argument - a macro or function
421 #define CV_IMPLEMENT_QSORT_EX( func_name, T, LT, user_data_type ) \
459 for( ptr2 = ptr; ptr2 > left && LT(ptr2[0],ptr2[-1]); ptr2--) \
484 left = LT(*a, *b) ? (LT(*b, *c) ? b : (LT(*a, *c) ? c : a)) \
485 : (LT(*c, *b) ? b : (LT(*a, *c) ? a : c)); \
488 pivot = LT(*a, *b) ? (LT(*b, *c) ? b : (LT(*a, *c) ? c : a))
[all...] |
| /dalvik/dx/src/com/android/dx/gen/ |
| Comparison.java | 29 LT() {
|
| /external/llvm/lib/Target/MBlaze/ |
| MBlazeISelLowering.h | 31 LT,
42 case LT: return GE;
43 case GE: return LT;
54 case LT: return "lt";
|
| /external/skia/gpu/src/ |
| GrTextStrike_impl.h | 29 static bool LT(const GrTextStrike& strike, const Key& key) {
92 static bool LT(const GrGlyph& glyph, const Key& key) {
|
| /frameworks/base/include/media/stagefright/foundation/ |
| ADebug.h | 55 MAKE_COMPARATOR(LT,<)
74 #define CHECK_LT(x,y) CHECK_OP(x,y,LT,<)
|
| /external/v8/src/ |
| token.h | 114 T(LT, "<", 10) \
191 // (e.g. "LT" for the token LT).
215 return op == LT || op == LTE || op == GT || op == GTE;
224 case LT: return GTE;
227 case GTE: return LT;
239 case LT: return GT;
240 case GT: return LT;
265 // (.e., "<" for the token LT) or NULL if the token doesn't
|
| /external/dropbear/libtomcrypt/src/ciphers/safer/ |
| saferp.c | 122 * Each round of LT starts in 'b' and ends in 'b2'.
124 #define LT(b, b2) \
151 LT(b, b2);
165 #undef LT
166 #define LT(b, b2) _lt(b, b2)
347 ROUND(b, 0); LT(b, ct);
348 ROUND(ct, 2); LT(ct, b);
349 ROUND(b, 4); LT(b, ct);
350 ROUND(ct, 6); LT(ct, b);
351 ROUND(b, 8); LT(b, ct)
[all...] |
| /external/webkit/Source/JavaScriptCore/assembler/ |
| MacroAssemblerSH4.cpp | 38 const Condition MacroAssemblerSH4::LessThan = SH4Assembler::LT;
55 const Condition MacroAssemblerSH4::DoubleLessThan = SH4Assembler::LT;
|
| /external/antlr/src/org/antlr/runtime/misc/ |
| LookaheadStream.java | 43 * read via LT(1). Goes from 0 to numtokens.
50 * Return it later when they ask for LT passed end of input.
116 public T LT(int k) {
121 //System.out.print("LT(p="+p+","+k+")=");
|
