samples/third_party/dromaeo/tests/dom-traverse-htmlidiomatic.dart - Issue 11273041: Make first and last getters.

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

Unified Diff: samples/third_party/dromaeo/tests/dom-traverse-htmlidiomatic.dart

Issue 11273041: Make first and last getters. (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart

Patch Set: Update status files with co19 issue number. Created 8 years, 2 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:

Index: samples/third_party/dromaeo/tests/dom-traverse-htmlidiomatic.dart

diff --git a/samples/third_party/dromaeo/tests/dom-traverse-htmlidiomatic.dart b/samples/third_party/dromaeo/tests/dom-traverse-htmlidiomatic.dart

index 277001ef65725b29295937b02a343fea22f338c7..79f31de0a59cb9cc304c45112fee3bf9902d3c67 100644

--- a/samples/third_party/dromaeo/tests/dom-traverse-htmlidiomatic.dart

+++ b/samples/third_party/dromaeo/tests/dom-traverse-htmlidiomatic.dart

@@ -52,7 +52,7 @@ void main() {

for (int j = 0; j < nl; j++) {

Node cur = nodes[j];

while (cur !== null) {

- cur = cur.nodes.last();

+ cur = cur.nodes.last;

}

ret = cur;

}

@@ -69,7 +69,7 @@ void main() {

})

.test('previousSibling', () {

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

- Node cur = document.body.nodes.last();

+ Node cur = document.body.nodes.last;

while (cur !== null) {

cur = cur.previousNode;

}