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

Side by Side Diff: test/dart_codegen/expect/collection/splay_tree.dart

Issue 1048863003: Handle for-in loops (Closed) Base URL: https://github.com/dart-lang/dev_compiler.git@master
Patch Set: Rebase Created 5 years, 8 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
« no previous file with comments | « test/dart_codegen/expect/collection/queue.dart ('k') | no next file » | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 part of dart.collection; 1 part of dart.collection;
2 typedef bool _Predicate<T>(T value); 2 typedef bool _Predicate<T>(T value);
3 class _SplayTreeNode<K> {final K key; 3 class _SplayTreeNode<K> {final K key;
4 _SplayTreeNode<K> left; 4 _SplayTreeNode<K> left;
5 _SplayTreeNode<K> right; 5 _SplayTreeNode<K> right;
6 _SplayTreeNode(K this.key); 6 _SplayTreeNode(K this.key);
7 } 7 }
8 class _SplayTreeMapNode<K, V> extends _SplayTreeNode<K> {V value; 8 class _SplayTreeMapNode<K, V> extends _SplayTreeNode<K> {V value;
9 _SplayTreeMapNode(K key, V this.value) : super(key); 9 _SplayTreeMapNode(K key, V this.value) : super(key);
10 } 10 }
(...skipping 415 matching lines...) Expand 10 before | Expand all | Expand 10 after
426 } 426 }
427 ), DEVC$RT.type((_SplayTreeNode<K> _) { 427 ), DEVC$RT.type((_SplayTreeNode<K> _) {
428 } 428 }
429 ), "CompositeCast", """line 644, column 55 of dart:collection/splay_tree.dart: " "", node is _SplayTreeNode<K>, false); 429 ), "CompositeCast", """line 644, column 55 of dart:collection/splay_tree.dart: " "", node is _SplayTreeNode<K>, false);
430 } 430 }
431 class SplayTreeSet<E> extends _SplayTree<E> with IterableMixin<E>, SetMixin<E> {Comparator _comparator; 431 class SplayTreeSet<E> extends _SplayTree<E> with IterableMixin<E>, SetMixin<E> {Comparator _comparator;
432 _Predicate _validKey; 432 _Predicate _validKey;
433 SplayTreeSet([int compare(E key1, E key2), bool isValidKey(potentialKey)]) : _c omparator = ((__x36) => DEVC$RT.cast(__x36, dynamic, __t33, "CompositeCast", """ line 693, column 23 of dart:collection/splay_tree.dart: """, __x36 is __t33, fal se))((compare == null) ? Comparable.compare : compare), _validKey = ((__x37) => DEVC$RT.cast(__x37, dynamic, __t24, "CompositeCast", """line 694, column 21 of d art:collection/splay_tree.dart: """, __x37 is __t24, false))((isValidKey != null ) ? isValidKey : ((v) => v is E)); 433 SplayTreeSet([int compare(E key1, E key2), bool isValidKey(potentialKey)]) : _c omparator = ((__x36) => DEVC$RT.cast(__x36, dynamic, __t33, "CompositeCast", """ line 693, column 23 of dart:collection/splay_tree.dart: """, __x36 is __t33, fal se))((compare == null) ? Comparable.compare : compare), _validKey = ((__x37) => DEVC$RT.cast(__x37, dynamic, __t24, "CompositeCast", """line 694, column 21 of d art:collection/splay_tree.dart: """, __x37 is __t24, false))((isValidKey != null ) ? isValidKey : ((v) => v is E));
434 factory SplayTreeSet.from(Iterable elements, [int compare(E key1, E key2), bool isValidKey(potentialKey)]) { 434 factory SplayTreeSet.from(Iterable elements, [int compare(E key1, E key2), bool isValidKey(potentialKey)]) {
435 SplayTreeSet<E> result = new SplayTreeSet<E>(compare, isValidKey); 435 SplayTreeSet<E> result = new SplayTreeSet<E>(compare, isValidKey);
436 for (final E element in elements) { 436 for (final E element in DEVC$RT.cast(elements, DEVC$RT.type((Iterable<dynamic> _) {
437 }
438 ), DEVC$RT.type((Iterable<E> _) {
439 }
440 ), "CompositeCast", """line 707, column 29 of dart:collection/splay_tree.dart: " "", elements is Iterable<E>, false)) {
437 result.add(element); 441 result.add(element);
438 } 442 }
439 return result; 443 return result;
440 } 444 }
441 int _compare(E e1, E e2) => _comparator(e1, e2); 445 int _compare(E e1, E e2) => _comparator(e1, e2);
442 Iterator<E> get iterator => new _SplayTreeKeyIterator<E>(this); 446 Iterator<E> get iterator => new _SplayTreeKeyIterator<E>(this);
443 int get length => _count; 447 int get length => _count;
444 bool get isEmpty => _root == null; 448 bool get isEmpty => _root == null;
445 bool get isNotEmpty => _root != null; 449 bool get isNotEmpty => _root != null;
446 E get first { 450 E get first {
(...skipping 119 matching lines...) Expand 10 before | Expand all | Expand 10 after
566 _clear(); 570 _clear();
567 } 571 }
568 Set<E> toSet() => _clone(); 572 Set<E> toSet() => _clone();
569 String toString() => IterableBase.iterableToFullString(this, '{', '}'); 573 String toString() => IterableBase.iterableToFullString(this, '{', '}');
570 } 574 }
571 typedef int __t20<K>(K __u21, K __u22); 575 typedef int __t20<K>(K __u21, K __u22);
572 typedef bool __t24(dynamic __u25); 576 typedef bool __t24(dynamic __u25);
573 typedef int __t30<K>(K __u31, K __u32); 577 typedef int __t30<K>(K __u31, K __u32);
574 typedef int __t33(dynamic __u34, dynamic __u35); 578 typedef int __t33(dynamic __u34, dynamic __u35);
575 typedef int __t42<E>(E __u43, E __u44); 579 typedef int __t42<E>(E __u43, E __u44);
OLDNEW
« no previous file with comments | « test/dart_codegen/expect/collection/queue.dart ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698