HomeSort by relevance Sort by last modified time
    Searched refs:UP (Results 51 - 75 of 205) sorted by null

1 23 4 5 6 7 8 9

  /external/antlr/antlr-3.4/runtime/Ruby/test/unit/
test-trees.rb 71 expecting = "<UNKNOWN: 101> <DOWN> <UNKNOWN: 102> <DOWN> <UNKNOWN: 103> <UP> <UNKNOWN: 104> <UP>"
94 expecting = "<UNKNOWN: 101> <DOWN> <UNKNOWN: 102> <DOWN> <UNKNOWN: 103> <UP> <UNKNOWN: 104> <UP> <UNKNOWN: 105>"
142 expecting = '<UNKNOWN: 101> <DOWN> <UNKNOWN: 102> <UP>'
155 [101, DOWN, 102, DOWN, 103, UP, 104, UP, EOF].each_with_index do |type, index|
178 stream.look(-1).type.should == UP
184 stream.look(-1).type.should == UP
207 [107, UP, UP, 104].each do |val
    [all...]
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
Antlr.Runtime.Tree.Tests.pas 630 if (TokenType <> TToken.DOWN) and (TokenType <> TToken.UP) then
705 Buf2.Append(TToken.UP);
831 CheckEquals((Stream.LT(6) as ITree).TokenType,TToken.UP);
833 CheckEquals((Stream.LT(8) as ITree).TokenType,TToken.UP);
847 // Sequence of types: 101 DN 102 DN 103 106 DN 107 UP UP 104 105 UP EOF
867 CheckEquals((Stream.LT(-1) as ITree).TokenType,TToken.UP);
877 CheckEquals((Stream.LT(-1) as ITree).TokenType,TToken.UP);
888 // Sequence of types: 101 DN 102 DN 103 106 DN 107 UP UP 104 105 UP EO
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreeParser.cs 46 public const int UP = TokenTypes.Up;
107 * corresponding UP node.
116 // skip to corresponding UP. must count nesting level to get right UP
126 case UP:
140 * We have DOWN/UP nodes in the stream that have no line info; override.
169 if (e.Token == null) { // could be an UP/DOWN node
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
TreeParser.cs 48 public const int UP = TokenTypes.Up;
117 * corresponding UP node.
127 // skip to corresponding UP. must count nesting level to get right UP
140 case UP:
154 * We have DOWN/UP nodes in the stream that have no line info; override.
188 { // could be an UP/DOWN node
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
Label.java 108 public static final int UP = org.antlr.runtime.Token.UP;
  /external/eigen/blas/
common.h 30 #define UP 0
47 #define UPLO(X) ( ((X)=='U' || (X)=='u') ? UP \
  /packages/apps/Calculator/src/com/android/calculator2/
CalculatorDisplay.java 44 enum Scroll { UP, DOWN, NONE }
133 if (dir == Scroll.UP) {
Logic.java 130 text, scroll ? CalculatorDisplay.Scroll.UP : CalculatorDisplay.Scroll.NONE);
137 mDisplay.setText("", scroll ? CalculatorDisplay.Scroll.UP : CalculatorDisplay.Scroll.NONE);
174 evaluateAndShowResult(getText(), CalculatorDisplay.Scroll.UP);
211 mDisplay.setText(mHistory.getText(), CalculatorDisplay.Scroll.UP);
  /sdk/emulator/opengl/tests/emulator_test_renderer/
main.cpp 209 EE(UP,UP)
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
SimpleCTP.m 231 [ANTLRBaseRecognizer setTokenNames:[[AMutableArray arrayWithObjects:@"<invalid>", @"<EOR>", @"<DOWN>", @"<UP>",
407 [self match:input TokenType:UP Follow:nil];
434 [self match:input TokenType:UP Follow:nil];
489 [self match:input TokenType:UP Follow:nil];
606 [self match:input TokenType:UP Follow:nil];
659 [self match:input TokenType:UP Follow:nil];
797 [self match:input TokenType:UP Follow:nil];
    [all...]
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
CommonTreeNodeStream.as 39 * includes pointers to DOWN and UP and EOF nodes.
58 protected var up:Object;
62 * This buffer includes pointers to DOWN, UP, and EOF nodes.
81 /** Reuse same DOWN, UP navigation nodes unless this is true */
105 up = this.adaptor.createFromType(TokenConstants.UP, "UP");
120 stream.up = parent.up;
126 * Don't do DOWN, UP nodes if its a list (t is isNil)
    [all...]
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
BufferedTreeNodeStream.java 40 * includes pointers to DOWN and UP and EOF nodes.
51 * This is the old CommonTreeNodeStream that buffered up entire node stream.
85 protected Object up; field in class:BufferedTreeNodeStream
89 * This buffer includes pointers to DOWN, UP, and EOF nodes.
108 /** Reuse same DOWN, UP navigation nodes unless this is true */
135 up = adaptor.create(Token.UP, "UP");
140 * Don't do DOWN, UP nodes if its a list (t is isNil).
163 // add UP node if t has childre
    [all...]
TreeIterator.java 39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
48 public Object up; field in class:TreeIterator
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
67 up = adaptor.create(Token.UP, "UP");
94 // if any queued up, use those first
108 // while we're out of siblings, keep popping back up towards root
112 nodes.add(up); // we're moving back up
    [all...]
  /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
CommonTreeNodeStream.js 6 * includes pointers to DOWN and UP and EOF nodes.
30 /** Reuse same DOWN, UP navigation nodes unless this is true */
43 this.up = this.adaptor.create(Token.UP, "UP");
81 * Don't do DOWN, UP nodes if its a list (t is isNil).
105 // add UP node if t has children
107 this.addNavigationNode(org.antlr.runtime.Token.UP);
129 /** As we flatten the tree, we use UP, DOWN nodes to represent
145 navNode = this.adaptor.create(org.antlr.runtime.Token.UP, "UP")
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/
LangParser.h 20 UP,
  /external/chromium_org/chrome/test/base/
interactive_test_utils_gtk.cc 58 ui_controls::DOWN | ui_controls::UP,
  /external/jmonkeyengine/engine/src/core/com/jme3/input/event/
TouchEvent.java 51 * Touch up event, fields: posX, posY, pressure
53 UP,
59 * Virtual keyboard or hardware key event up, fields: keyCode, characters
85 * The user has performed a down MotionEvent and not performed a move or up yet. This event is commonly used to provide visual feedback to the user to let them know that their action has been recognized i.e. highlight an element.
  /external/chromium/chrome/browser/automation/
ui_controls_linux.cc 222 if (state & UP)
234 if (state & UP) {
249 return SendMouseEvents(type, UP | DOWN);
  /external/chromium_org/ui/aura/test/
ui_controls_factory_aurax11.cc 34 using ui_controls::UP;
199 if (state & UP) {
208 return SendMouseEvents(type, UP | DOWN);
  /external/chromium_org/ui/base/test/
ui_controls_gtk.cc 227 if (state & UP)
242 if (state & UP) {
258 return SendMouseEvents(type, UP | DOWN);
  /external/chromium_org/chrome/browser/ui/views/tabs/
tab_drag_controller_interactive_uitest_win.cc 61 ui_controls::LEFT, ui_controls::UP));
104 ui_controls::LEFT, ui_controls::UP));
127 ui_controls::LEFT, ui_controls::UP));
248 ui_controls::LEFT, ui_controls::UP));
304 ui_controls::LEFT, ui_controls::UP));
  /external/antlr/antlr-3.4/runtime/Python/unittests/
testtree.py 9 from antlr3 import CommonToken, UP, DOWN, EOF
168 self.failUnlessEqual(UP, stream.LT(6).getType())
170 self.failUnlessEqual(UP, stream.LT(8).getType())
179 # Sequence of types: 101 DN 102 DN 103 106 DN 107 UP UP 104 105 UP EOF
197 self.failUnlessEqual(UP, stream.LT(-1).getType()) #TODO: remove?
206 self.failUnlessEqual(UP, stream.LT(-1).getType()) #TODO: remove?
212 # Sequence of types: 101 DN 102 DN 103 106 DN 107 UP UP 104 105 UP EO
    [all...]
  /external/chromium_org/ui/views/test/
ui_controls_factory_desktop_aurax11.cc 34 using ui_controls::UP;
230 if (state & UP) {
239 return SendMouseEvents(type, UP | DOWN);
  /external/guava/guava/src/com/google/common/math/
BigIntegerMath.java 77 case UP:
159 case UP:
195 case UP:
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3commontreenodestream.h 90 /// As we flatten the tree, we use UP, DOWN nodes to represent
117 /// Release up any and all space the the interface allocate, including for this structure.
122 /// If you don't want to buffer up nodes, then this method makes no
167 /// Dummy tree node that indicates a descent up to a parent
170 ANTLR3_COMMON_TREE UP;
183 /// This buffer includes pointers to DOWN, UP, and EOF nodes.
196 /// If set to ANTLR3_TRUE then the navigation nodes UP, DOWN are
315 * class wraps up the current state of the CommonTreeNodeStream.

Completed in 554 milliseconds

1 23 4 5 6 7 8 9