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

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

Issue 702473002: Fix access semantics for foreach loops. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Created 6 years, 1 month 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
« no previous file with comments | « no previous file | pkg/analyzer2dart/test/identifier_semantics_test.dart » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file 1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file
2 // for details. All rights reserved. Use of this source code is governed by a 2 // for details. All rights reserved. Use of this source code is governed by a
3 // BSD-style license that can be found in the LICENSE file. 3 // BSD-style license that can be found in the LICENSE file.
4 4
5 // This code was auto-generated, is not intended to be edited, and is subject to 5 // This code was auto-generated, is not intended to be edited, and is subject to
6 // significant change. Please see the README file for more information. 6 // significant change. Please see the README file for more information.
7 7
8 library engine.ast; 8 library engine.ast;
9 9
10 import 'dart:collection'; 10 import 'dart:collection';
(...skipping 16336 matching lines...) Expand 10 before | Expand all | Expand 10 after
16347 if (parent is Label) { 16347 if (parent is Label) {
16348 return false; 16348 return false;
16349 } 16349 }
16350 // analyze usage 16350 // analyze usage
16351 if (parent is AssignmentExpression) { 16351 if (parent is AssignmentExpression) {
16352 AssignmentExpression expr = parent as AssignmentExpression; 16352 AssignmentExpression expr = parent as AssignmentExpression;
16353 if (identical(expr.leftHandSide, target) && expr.operator.type == TokenTyp e.EQ) { 16353 if (identical(expr.leftHandSide, target) && expr.operator.type == TokenTyp e.EQ) {
16354 return false; 16354 return false;
16355 } 16355 }
16356 } 16356 }
16357 if (parent is ForEachStatement) {
16358 ForEachStatement stmt = parent as ForEachStatement;
16359 if (identical(stmt.identifier, target)) {
16360 return false;
16361 }
16362 }
16357 return true; 16363 return true;
16358 } 16364 }
16359 16365
16360 /** 16366 /**
16361 * Return `true` if this expression is computing a left-hand value. 16367 * Return `true` if this expression is computing a left-hand value.
16362 * 16368 *
16363 * Note that [inGetterContext] and [inSetterContext] are not opposites, nor ar e 16369 * Note that [inGetterContext] and [inSetterContext] are not opposites, nor ar e
16364 * they mutually exclusive. In other words, it is possible for both methods to return `true` 16370 * they mutually exclusive. In other words, it is possible for both methods to return `true`
16365 * when invoked on the same node. 16371 * when invoked on the same node.
16366 * 16372 *
(...skipping 19 matching lines...) Expand all
16386 parent = access.parent; 16392 parent = access.parent;
16387 target = access; 16393 target = access;
16388 } 16394 }
16389 // analyze usage 16395 // analyze usage
16390 if (parent is PrefixExpression) { 16396 if (parent is PrefixExpression) {
16391 return (parent as PrefixExpression).operator.type.isIncrementOperator; 16397 return (parent as PrefixExpression).operator.type.isIncrementOperator;
16392 } else if (parent is PostfixExpression) { 16398 } else if (parent is PostfixExpression) {
16393 return true; 16399 return true;
16394 } else if (parent is AssignmentExpression) { 16400 } else if (parent is AssignmentExpression) {
16395 return identical((parent as AssignmentExpression).leftHandSide, target); 16401 return identical((parent as AssignmentExpression).leftHandSide, target);
16402 } else if (parent is ForEachStatement) {
16403 return identical((parent as ForEachStatement).identifier, target);
16396 } 16404 }
16397 return false; 16405 return false;
16398 } 16406 }
16399 16407
16400 /** 16408 /**
16401 * Returns `true` if this identifier is the "name" part of a prefixed identifi er or a method 16409 * Returns `true` if this identifier is the "name" part of a prefixed identifi er or a method
16402 * invocation. 16410 * invocation.
16403 * 16411 *
16404 * @return `true` if this identifier is the "name" part of a prefixed identifi er or a method 16412 * @return `true` if this identifier is the "name" part of a prefixed identifi er or a method
16405 * invocation 16413 * invocation
(...skipping 3847 matching lines...) Expand 10 before | Expand all | Expand 10 after
20253 _elements[index] = node; 20261 _elements[index] = node;
20254 } 20262 }
20255 void clear() { 20263 void clear() {
20256 _elements = <E> []; 20264 _elements = <E> [];
20257 } 20265 }
20258 int get length => _elements.length; 20266 int get length => _elements.length;
20259 void set length(int value) { 20267 void set length(int value) {
20260 throw new UnsupportedError("Cannot resize NodeList."); 20268 throw new UnsupportedError("Cannot resize NodeList.");
20261 } 20269 }
20262 } 20270 }
OLDNEW
« no previous file with comments | « no previous file | pkg/analyzer2dart/test/identifier_semantics_test.dart » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698