sdk/lib/html/templates/html/impl/impl_Node.darttemplate - Issue 11348313: Revert "Creating a common library for all DOM types."

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: sdk/lib/html/templates/html/impl/impl_Node.darttemplate

Issue 11348313: Revert "Creating a common library for all DOM types." (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart

Patch Set: Oddities with upload. Created 8 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 side-by-side diff with in-line comments

Download patch

« no previous file with comments | « sdk/lib/html/templates/html/dartium/html_dartium.darttemplate ('k') | sdk/lib/html/templates/immutable_list_mixin.darttemplate » ('j') | no next file with comments »
Expand Comments ('e') | Collapse Comments ('c') | Hide Comments ('s')

Index: sdk/lib/html/templates/html/impl/impl_Node.darttemplate

diff --git a/sdk/lib/html/templates/html/impl/impl_Node.darttemplate b/sdk/lib/html/templates/html/impl/impl_Node.darttemplate

index 603d24538ea4b13112228a98916945d0911e4f37..a2f4e0ac0808dcb65764463a9ae95107e11260cc 100644

--- a/sdk/lib/html/templates/html/impl/impl_Node.darttemplate

+++ b/sdk/lib/html/templates/html/impl/impl_Node.darttemplate

@@ -58,18 +58,18 @@ $endif

// TODO(jacobr): We can implement these methods much more efficiently by

// looking up the nodeList only once instead of once per iteration.

- bool contains(Node element) => Collections.contains(this, element);

+ bool contains(Node element) => _Collections.contains(this, element);

- void forEach(void f(Node element)) => Collections.forEach(this, f);

+ void forEach(void f(Node element)) => _Collections.forEach(this, f);

- Collection map(f(Node element)) => Collections.map(this, [], f);

+ Collection map(f(Node element)) => _Collections.map(this, [], f);

Collection<Node> filter(bool f(Node element)) =>

- Collections.filter(this, <Node>[], f);

+ _Collections.filter(this, <Node>[], f);

- bool every(bool f(Node element)) => Collections.every(this, f);

+ bool every(bool f(Node element)) => _Collections.every(this, f);

- bool some(bool f(Node element)) => Collections.some(this, f);

+ bool some(bool f(Node element)) => _Collections.some(this, f);

bool get isEmpty => this.length == 0;