HomeSort by relevance Sort by last modified time
    Searched refs:DOWN (Results 26 - 50 of 152) sorted by null

12 3 4 5 6 7

  /libcore/luni/src/test/java/libcore/java/math/
OldBigDecimalCompareTest.java 38 mc = new MathContext(34, RoundingMode.DOWN);
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
SimpleCTP.m 231 [ANTLRBaseRecognizer setTokenNames:[[AMutableArray arrayWithObjects:@"<invalid>", @"<EOR>", @"<DOWN>", @"<UP>",
398 [self match:input TokenType:DOWN Follow:nil];
417 [self match:input TokenType:DOWN Follow:nil];
472 [self match:input TokenType:DOWN Follow:nil];
558 [self match:input TokenType:DOWN Follow:nil];
642 [self match:input TokenType:DOWN Follow:nil];
735 if ( [input LA:1] == DOWN ) {
736 [self match:input TokenType:DOWN Follow:nil];
934 [self match:input TokenType:DOWN Follow:nil];
    [all...]
  /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
TestTreeNodeStream.java 155 assertEquals(Token.DOWN, ((Tree)stream.LT(2)).getType());
157 assertEquals(Token.DOWN, ((Tree)stream.LT(4)).getType());
269 assertEquals(Token.DOWN, ((Tree)stream.LT(1)).getType());
275 assertEquals(Token.DOWN, ((Tree)stream.LT(1)).getType());
279 assertEquals(Token.DOWN, ((Tree)stream.LT(1)).getType());
366 if ( !(type==Token.DOWN||type==Token.UP) ) {
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
Label.java 107 public static final int DOWN = org.antlr.runtime.Token.DOWN;
  /packages/apps/Calculator/src/com/android/calculator2/
CalculatorDisplay.java 44 enum Scroll { UP, DOWN, NONE }
136 } else if (dir == Scroll.DOWN) {
  /sdk/emulator/opengl/tests/emulator_test_renderer/
main.cpp 208 EE(DOWN,DOWN)
  /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.
57 protected var down:Object;
62 * This buffer includes pointers to DOWN, UP, and EOF nodes.
67 * of interest for reverseIndexing. Slows us down a wee bit to
81 /** Reuse same DOWN, UP navigation nodes unless this is true */
104 down = this.adaptor.createFromType(TokenConstants.DOWN, "DOWN");
119 stream.down = parent.down;
    [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.
84 protected Object down; field in class:BufferedTreeNodeStream
89 * This buffer includes pointers to DOWN, UP, and EOF nodes.
94 * of interest for reverseIndexing. Slows us down a wee bit to
108 /** Reuse same DOWN, UP navigation nodes unless this is true */
134 down = adaptor.create(Token.DOWN, "DOWN");
140 * Don't do DOWN, UP nodes if its a list (t is isNil).
153 // add DOWN node if t has childre
    [all...]
TreeParser.java 40 public static final int DOWN = Token.DOWN;
116 if ( tokenType == DOWN ) {
126 /** We have DOWN/UP nodes in the stream that have no line info; override.
154 if ( e.token==null ) { // could be an UP/DOWN node
TreeIterator.java 39 * Emit navigation nodes (DOWN, UP, and EOF) to let show tree structure.
49 public Object down; field in class:TreeIterator
52 /** If we emit UP/DOWN nodes, we need to spit out multiple nodes per
66 down = adaptor.create(Token.DOWN, "DOWN");
103 nodes.add(tree); // real node is next after DOWN
104 return down;
  /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 */
42 this.down = this.adaptor.create(Token.DOWN, "DOWN");
81 * Don't do DOWN, UP nodes if its a list (t is isNil).
94 // add DOWN node if t has children
97 this.addNavigationNode(org.antlr.runtime.Token.DOWN);
129 /** As we flatten the tree, we use UP, DOWN nodes to represent
135 if ( ttype===org.antlr.runtime.Token.DOWN ) {
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treeparser/
LangParser.h 19 DOWN,
  /external/chromium/chrome/browser/ui/gtk/
fullscreen_exit_bubble_gtk.cc 64 SlideAnimatorGtk::DOWN, kSlideOutDurationMs, false, false, NULL));
  /external/jmonkeyengine/engine/src/core/com/jme3/input/event/
TouchEvent.java 43 * Touch down event, fields: posX, posY, pressure
45 DOWN,
55 * Virtual keyboard or hardware key event down, 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/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|
240 stream.look(1).type.should == DOWN
244 [101, DOWN, 102].each do |val|
248 stream.look(1).type.should == DOWN
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/
ASTTreeParser.stg 85 if ( input.LA(1)==TokenConstants.DOWN ) {
86 matchStream(input, TokenConstants.DOWN, null); <checkRuleBacktrackFailure()>
91 matchStream(input, TokenConstants.DOWN, null); <checkRuleBacktrackFailure()>
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Delphi/
ASTTreeParser.stg 95 if (Input.LA(1) = TToken.DOWN) then
97 Match(Input, TToken.DOWN, nil); <checkRuleBacktrackFailure()>
102 Match(Input, TToken.DOWN, nil); <checkRuleBacktrackFailure()>
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/
ASTTreeParser.stg 84 if ( input.LA(1)==Token.DOWN ) {
85 match(input, Token.DOWN, null); <checkRuleBacktrackFailure()>
90 match(input, Token.DOWN, null); <checkRuleBacktrackFailure()>
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/
ASTTreeParser.stg 57 if ( this.input.LA(1)==org.antlr.runtime.Token.DOWN ) {
58 this.match(this.input, org.antlr.runtime.Token.DOWN, null); <checkRuleBacktrackFailure()>
63 this.match(this.input, org.antlr.runtime.Token.DOWN, null); <checkRuleBacktrackFailure()>
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/
ASTTreeParser.stg 86 if ( input.LA(1)==Token.DOWN ) {
87 match(input, Token.DOWN, null); <checkRuleBacktrackFailure()>
92 match(input, Token.DOWN, null); <checkRuleBacktrackFailure()>
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/
ASTTreeParser.stg 95 if self.input.LA(1) == DOWN:
96 self.match(self.input, DOWN, None)
101 self.match(self.input, DOWN, None)
  /external/guava/guava/src/com/google/common/math/
BigIntegerMath.java 73 case DOWN:
155 case DOWN:
192 case DOWN:
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/state/
StateView.java 43 public static int DOWN = 2;
55 private int mDirection = DOWN;
160 if (mDirection == DOWN) {
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3commontreenodestream.h 90 /// As we flatten the tree, we use UP, DOWN nodes to represent
165 ANTLR3_COMMON_TREE DOWN;
183 /// This buffer includes pointers to DOWN, UP, and EOF nodes.
188 /// of interest for reverseIndexing. Slows us down a wee bit to
192 /// Must be freed when the tree node stream is torn down.
196 /// If set to ANTLR3_TRUE then the navigation nodes UP, DOWN are
210 /// As we walk down the nodes, we must track parent nodes so we know
  /external/chromium/chrome/browser/automation/
automation_provider_gtk.cc 134 next_task = new MouseEventTask(next_task, ui_controls::DOWN);

Completed in 281 milliseconds

12 3 4 5 6 7