samples/third_party/dromaeo/tests/dom-traverse-dom.dart - Issue 10909035: Revert 11715.

Side by Side Diff

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Keyboard Shortcuts

	File
u :	up to issue
j / k :	jump to file after / before current file
J / K :	jump to next file with a comment after / before current file
	Side-by-side diff
i :	toggle intra-line diffs
e :	expand all comments
c :	collapse all comments
s :	toggle showing all comments
n / p :	next / previous diff chunk or comment
N / P :	next / previous comment
<Up> / <Down> :	next / previous line

	Issue
u :	up to list of issues
j / k :	jump to patch after / before current patch
o / <Enter> :	open current patch in side-by-side view
i :	open current patch in unified diff view

	Issue List
j / k :	jump to issue after / before current issue
o / <Enter> :	open current issue

Side by Side Diff: samples/third_party/dromaeo/tests/dom-traverse-dom.dart

Issue 10909035: Revert 11715. (Closed) Base URL: http://dart.googlecode.com/svn/branches/bleeding_edge/dart/

Patch Set: Created 8 years, 3 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:

OLD	NEW
1 #library("dom_traverse");	1 #library("dom_traverse");

2 #import("dart:dom_deprecated");	2 #import("dart:dom_deprecated");

3 #import('../common/common.dart');	3 #import('../common/common.dart');

4 #import("dart:math", prefix: "Math");	4 #import("dart:math", prefix: "Math");

5 #source("Common.dart");	5 #source("Common.dart");

6 #source("RunnerSuite.dart");	6 #source("RunnerSuite.dart");

7	7

8	8

9 void main() {	9 void main() {

10 final int num = 40;	10 final int num = 40;

(...skipping 69 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
80 .test('childNodes', () {	80 .test('childNodes', () {

81 for (int i = 0; i < num; i++) {	81 for (int i = 0; i < num; i++) {

82 final nodes = document.body.childNodes;	82 final nodes = document.body.childNodes;

83 for (int j = 0; j < nodes.length; j++) {	83 for (int j = 0; j < nodes.length; j++) {

84 ret = nodes[j];	84 ret = nodes[j];

85 }	85 }

86 }	86 }

87 })	87 })

88 .end();	88 .end();

89 }	89 }

OLD	NEW