Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(535)

Side by Side Diff: pkg/analyzer_experimental/lib/src/generated/ast.dart

Issue 19590006: New analyzer_experimental snapshot. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Created 7 years, 5 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // This code was auto-generated, is not intended to be edited, and is subject to 1 // This code was auto-generated, is not intended to be edited, and is subject to
2 // significant change. Please see the README file for more information. 2 // significant change. Please see the README file for more information.
3 library engine.ast; 3 library engine.ast;
4 import 'dart:collection'; 4 import 'dart:collection';
5 import 'java_core.dart'; 5 import 'java_core.dart';
6 import 'java_engine.dart'; 6 import 'java_engine.dart';
7 import 'error.dart'; 7 import 'error.dart';
8 import 'source.dart' show LineInfo; 8 import 'source.dart' show LineInfo;
9 import 'scanner.dart'; 9 import 'scanner.dart';
10 import 'engine.dart' show AnalysisEngine; 10 import 'engine.dart' show AnalysisEngine;
(...skipping 15479 matching lines...) Expand 10 before | Expand all | Expand 10 after
15490 ASTNode get foundNode => _foundNode; 15490 ASTNode get foundNode => _foundNode;
15491 15491
15492 /** 15492 /**
15493 * Search within the given AST node for an identifier representing a [DartElem ent] in the specified source range. Return the element that was found, or `null` if 15493 * Search within the given AST node for an identifier representing a [DartElem ent] in the specified source range. Return the element that was found, or `null` if
15494 * no element was found. 15494 * no element was found.
15495 * 15495 *
15496 * @param node the AST node within which to search 15496 * @param node the AST node within which to search
15497 * @return the element that was found 15497 * @return the element that was found
15498 */ 15498 */
15499 ASTNode searchWithin(ASTNode node) { 15499 ASTNode searchWithin(ASTNode node) {
15500 if (node == null) {
15501 return null;
15502 }
15500 try { 15503 try {
15501 node.accept(this); 15504 node.accept(this);
15502 } on NodeLocator_NodeFoundException catch (exception) { 15505 } on NodeLocator_NodeFoundException catch (exception) {
15503 } catch (exception) { 15506 } catch (exception) {
15504 AnalysisEngine.instance.logger.logInformation2("Unable to locate element a t offset (${_startOffset} - ${_endOffset})", exception); 15507 AnalysisEngine.instance.logger.logInformation2("Unable to locate element a t offset (${_startOffset} - ${_endOffset})", exception);
15505 return null; 15508 return null;
15506 } 15509 }
15507 return _foundNode; 15510 return _foundNode;
15508 } 15511 }
15509 Object visitNode(ASTNode node) { 15512 Object visitNode(ASTNode node) {
(...skipping 1429 matching lines...) Expand 10 before | Expand all | Expand 10 after
16939 AsExpression visitAsExpression(AsExpression node) => new AsExpression.full(clo ne2(node.expression), node.asOperator, clone2(node.type)); 16942 AsExpression visitAsExpression(AsExpression node) => new AsExpression.full(clo ne2(node.expression), node.asOperator, clone2(node.type));
16940 ASTNode visitAssertStatement(AssertStatement node) => new AssertStatement.full (node.keyword, node.leftParenthesis, clone2(node.condition), node.rightParenthes is, node.semicolon); 16943 ASTNode visitAssertStatement(AssertStatement node) => new AssertStatement.full (node.keyword, node.leftParenthesis, clone2(node.condition), node.rightParenthes is, node.semicolon);
16941 AssignmentExpression visitAssignmentExpression(AssignmentExpression node) => n ew AssignmentExpression.full(clone2(node.leftHandSide), node.operator, clone2(no de.rightHandSide)); 16944 AssignmentExpression visitAssignmentExpression(AssignmentExpression node) => n ew AssignmentExpression.full(clone2(node.leftHandSide), node.operator, clone2(no de.rightHandSide));
16942 BinaryExpression visitBinaryExpression(BinaryExpression node) => new BinaryExp ression.full(clone2(node.leftOperand), node.operator, clone2(node.rightOperand)) ; 16945 BinaryExpression visitBinaryExpression(BinaryExpression node) => new BinaryExp ression.full(clone2(node.leftOperand), node.operator, clone2(node.rightOperand)) ;
16943 Block visitBlock(Block node) => new Block.full(node.leftBracket, clone3(node.s tatements), node.rightBracket); 16946 Block visitBlock(Block node) => new Block.full(node.leftBracket, clone3(node.s tatements), node.rightBracket);
16944 BlockFunctionBody visitBlockFunctionBody(BlockFunctionBody node) => new BlockF unctionBody.full(clone2(node.block)); 16947 BlockFunctionBody visitBlockFunctionBody(BlockFunctionBody node) => new BlockF unctionBody.full(clone2(node.block));
16945 BooleanLiteral visitBooleanLiteral(BooleanLiteral node) => new BooleanLiteral. full(node.literal, node.value); 16948 BooleanLiteral visitBooleanLiteral(BooleanLiteral node) => new BooleanLiteral. full(node.literal, node.value);
16946 BreakStatement visitBreakStatement(BreakStatement node) => new BreakStatement. full(node.keyword, clone2(node.label), node.semicolon); 16949 BreakStatement visitBreakStatement(BreakStatement node) => new BreakStatement. full(node.keyword, clone2(node.label), node.semicolon);
16947 CascadeExpression visitCascadeExpression(CascadeExpression node) => new Cascad eExpression.full(clone2(node.target), clone3(node.cascadeSections)); 16950 CascadeExpression visitCascadeExpression(CascadeExpression node) => new Cascad eExpression.full(clone2(node.target), clone3(node.cascadeSections));
16948 CatchClause visitCatchClause(CatchClause node) => new CatchClause.full(node.on Keyword, clone2(node.exceptionType), node.catchKeyword, node.leftParenthesis, cl one2(node.exceptionParameter), node.comma, clone2(node.stackTraceParameter), nod e.rightParenthesis, clone2(node.body)); 16951 CatchClause visitCatchClause(CatchClause node) => new CatchClause.full(node.on Keyword, clone2(node.exceptionType), node.catchKeyword, node.leftParenthesis, cl one2(node.exceptionParameter), node.comma, clone2(node.stackTraceParameter), nod e.rightParenthesis, clone2(node.body));
16949 ClassDeclaration visitClassDeclaration(ClassDeclaration node) => new ClassDecl aration.full(clone2(node.documentationComment), clone3(node.metadata), node.abst ractKeyword, node.classKeyword, clone2(node.name), clone2(node.typeParameters), clone2(node.extendsClause), clone2(node.withClause), clone2(node.implementsClaus e), node.leftBracket, clone3(node.members), node.rightBracket); 16952 ClassDeclaration visitClassDeclaration(ClassDeclaration node) {
16953 ClassDeclaration copy = new ClassDeclaration.full(clone2(node.documentationC omment), clone3(node.metadata), node.abstractKeyword, node.classKeyword, clone2( node.name), clone2(node.typeParameters), clone2(node.extendsClause), clone2(node .withClause), clone2(node.implementsClause), node.leftBracket, clone3(node.membe rs), node.rightBracket);
16954 copy.nativeClause = clone2(node.nativeClause);
16955 return copy;
16956 }
16950 ClassTypeAlias visitClassTypeAlias(ClassTypeAlias node) => new ClassTypeAlias. full(clone2(node.documentationComment), clone3(node.metadata), node.keyword, clo ne2(node.name), clone2(node.typeParameters), node.equals, node.abstractKeyword, clone2(node.superclass), clone2(node.withClause), clone2(node.implementsClause), node.semicolon); 16957 ClassTypeAlias visitClassTypeAlias(ClassTypeAlias node) => new ClassTypeAlias. full(clone2(node.documentationComment), clone3(node.metadata), node.keyword, clo ne2(node.name), clone2(node.typeParameters), node.equals, node.abstractKeyword, clone2(node.superclass), clone2(node.withClause), clone2(node.implementsClause), node.semicolon);
16951 Comment visitComment(Comment node) { 16958 Comment visitComment(Comment node) {
16952 if (node.isDocumentation) { 16959 if (node.isDocumentation) {
16953 return Comment.createDocumentationComment2(node.tokens, clone3(node.refere nces)); 16960 return Comment.createDocumentationComment2(node.tokens, clone3(node.refere nces));
16954 } else if (node.isBlock) { 16961 } else if (node.isBlock) {
16955 return Comment.createBlockComment(node.tokens); 16962 return Comment.createBlockComment(node.tokens);
16956 } 16963 }
16957 return Comment.createEndOfLineComment(node.tokens); 16964 return Comment.createEndOfLineComment(node.tokens);
16958 } 16965 }
16959 CommentReference visitCommentReference(CommentReference node) => new CommentRe ference.full(node.newKeyword, clone2(node.identifier)); 16966 CommentReference visitCommentReference(CommentReference node) => new CommentRe ference.full(node.newKeyword, clone2(node.identifier));
(...skipping 310 matching lines...) Expand 10 before | Expand all | Expand 10 after
17270 return elements[elements.length - 1].endToken; 17277 return elements[elements.length - 1].endToken;
17271 } 17278 }
17272 /** 17279 /**
17273 * Return the node that is the parent of each of the elements in the list. 17280 * Return the node that is the parent of each of the elements in the list.
17274 * @return the node that is the parent of each of the elements in the list 17281 * @return the node that is the parent of each of the elements in the list
17275 */ 17282 */
17276 ASTNode getOwner() { 17283 ASTNode getOwner() {
17277 return owner; 17284 return owner;
17278 } 17285 }
17279 } 17286 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698