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

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

Issue 1070453002: Refactor reifier to make it less dart_codegen specific. (Closed) Base URL: git@github.com:dart-lang/dart-dev-compiler.git@master
Patch Set: 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
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 129 matching lines...) Expand 10 before | Expand all | Expand 10 after
140 void _clear() { 140 void _clear() {
141 _root = null; 141 _root = null;
142 _count = 0; 142 _count = 0;
143 _modificationCount++; 143 _modificationCount++;
144 } 144 }
145 } 145 }
146 class _TypeTest<T> {bool test(v) => v is T; 146 class _TypeTest<T> {bool test(v) => v is T;
147 } 147 }
148 class SplayTreeMap<K, V> extends _SplayTree<K> implements Map<K, V> {Comparator <K> _comparator; 148 class SplayTreeMap<K, V> extends _SplayTree<K> implements Map<K, V> {Comparator <K> _comparator;
149 _Predicate _validKey; 149 _Predicate _validKey;
150 SplayTreeMap([int compare(K key1, K key2), bool isValidKey(potentialKey)]) : _c omparator = ((__x15) => DEVC$RT.cast(__x15, dynamic, DEVC$RT.type((__t12<K> _) { 150 SplayTreeMap([int compare(K key1, K key2), bool isValidKey(potentialKey)]) : _c omparator = ((__x12) => DEVC$RT.cast(__x12, dynamic, DEVC$RT.type((Comparator<K> _) {
151 } 151 }
152 ), "CompositeCast", """line 268, column 23 of dart:collection/splay_tree.dart: " "", __x15 is __t12<K>, false))((compare == null) ? Comparable.compare : compare) , _validKey = ((__x18) => DEVC$RT.cast(__x18, dynamic, __t16, "CompositeCast", " ""line 269, column 21 of dart:collection/splay_tree.dart: """, __x18 is __t16, f alse))((isValidKey != null) ? isValidKey : ((v) => v is K)); 152 ), "CompositeCast", """line 268, column 23 of dart:collection/splay_tree.dart: " "", __x12 is Comparator<K>, false))((compare == null) ? Comparable.compare : com pare), _validKey = ((__x13) => DEVC$RT.cast(__x13, dynamic, DEVC$RT.type((_Predi cate<dynamic> _) {
153 }
154 ), "CompositeCast", """line 269, column 21 of dart:collection/splay_tree.dart: " "", __x13 is _Predicate<dynamic>, false))((isValidKey != null) ? isValidKey : (( v) => v is K));
153 factory SplayTreeMap.from(Map other, [int compare(K key1, K key2), bool isValid Key(potentialKey)]) { 155 factory SplayTreeMap.from(Map other, [int compare(K key1, K key2), bool isValid Key(potentialKey)]) {
154 SplayTreeMap<K, V> result = new SplayTreeMap<K, V>(); 156 SplayTreeMap<K, V> result = new SplayTreeMap<K, V>();
155 other.forEach((k, v) { 157 other.forEach((k, v) {
156 result[k] = DEVC$RT.cast(v, dynamic, V, "CompositeCast", """line 278, column 40 of dart:collection/splay_tree.dart: """, v is V, false); 158 result[k] = DEVC$RT.cast(v, dynamic, V, "CompositeCast", """line 278, column 40 of dart:collection/splay_tree.dart: """, v is V, false);
157 } 159 }
158 ); 160 );
159 return result; 161 return result;
160 } 162 }
161 factory SplayTreeMap.fromIterable(Iterable iterable, { 163 factory SplayTreeMap.fromIterable(Iterable iterable, {
162 K key(element), V value(element), int compare(K key1, K key2), bool isValidKey(p otentialKey)} 164 K key(element), V value(element), int compare(K key1, K key2), bool isValidKey(p otentialKey)}
(...skipping 20 matching lines...) Expand all
183 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) { 185 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) {
184 } 186 }
185 ), "AssignmentCast", """line 333, column 37 of dart:collection/splay_tree.dart: """, _root is _SplayTreeMapNode<dynamic, dynamic>, true); 187 ), "AssignmentCast", """line 333, column 37 of dart:collection/splay_tree.dart: """, _root is _SplayTreeMapNode<dynamic, dynamic>, true);
186 return DEVC$RT.cast(mapRoot.value, dynamic, V, "CompositeCast", """line 334, co lumn 16 of dart:collection/splay_tree.dart: """, mapRoot.value is V, false); 188 return DEVC$RT.cast(mapRoot.value, dynamic, V, "CompositeCast", """line 334, co lumn 16 of dart:collection/splay_tree.dart: """, mapRoot.value is V, false);
187 } 189 }
188 } 190 }
189 return null; 191 return null;
190 } 192 }
191 V remove(Object key) { 193 V remove(Object key) {
192 if (!_validKey(key)) return null; 194 if (!_validKey(key)) return null;
193 _SplayTreeMapNode mapRoot = ((__x19) => DEVC$RT.cast(__x19, DEVC$RT.type((_Spla yTreeNode<dynamic> _) { 195 _SplayTreeMapNode mapRoot = ((__x14) => DEVC$RT.cast(__x14, DEVC$RT.type((_Spla yTreeNode<dynamic> _) {
194 } 196 }
195 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) { 197 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) {
196 } 198 }
197 ), "AssignmentCast", """line 342, column 33 of dart:collection/splay_tree.dart: """, __x19 is _SplayTreeMapNode<dynamic, dynamic>, true))(_remove(DEVC$RT.cast(k ey, Object, K, "CompositeCast", """line 342, column 41 of dart:collection/splay_ tree.dart: """, key is K, false))); 199 ), "AssignmentCast", """line 342, column 33 of dart:collection/splay_tree.dart: """, __x14 is _SplayTreeMapNode<dynamic, dynamic>, true))(_remove(DEVC$RT.cast(k ey, Object, K, "CompositeCast", """line 342, column 41 of dart:collection/splay_ tree.dart: """, key is K, false)));
198 if (mapRoot != null) return DEVC$RT.cast(mapRoot.value, dynamic, V, "CompositeC ast", """line 343, column 33 of dart:collection/splay_tree.dart: """, mapRoot.va lue is V, false); 200 if (mapRoot != null) return DEVC$RT.cast(mapRoot.value, dynamic, V, "CompositeC ast", """line 343, column 33 of dart:collection/splay_tree.dart: """, mapRoot.va lue is V, false);
199 return null; 201 return null;
200 } 202 }
201 void operator []=(K key, V value) { 203 void operator []=(K key, V value) {
202 if (key == null) throw new ArgumentError(key); 204 if (key == null) throw new ArgumentError(key);
203 int comp = _splay(key); 205 int comp = _splay(key);
204 if (comp == 0) { 206 if (comp == 0) {
205 _SplayTreeMapNode mapRoot = DEVC$RT.cast(_root, DEVC$RT.type((_SplayTreeNode<K> _) { 207 _SplayTreeMapNode mapRoot = DEVC$RT.cast(_root, DEVC$RT.type((_SplayTreeNode<K> _) {
206 } 208 }
207 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) { 209 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) {
(...skipping 177 matching lines...) Expand 10 before | Expand all | Expand 10 after
385 } 387 }
386 T _getValue(_SplayTreeNode node); 388 T _getValue(_SplayTreeNode node);
387 } 389 }
388 class _SplayTreeKeyIterable<K> extends IterableBase<K> implements EfficientLeng th {_SplayTree<K> _tree; 390 class _SplayTreeKeyIterable<K> extends IterableBase<K> implements EfficientLeng th {_SplayTree<K> _tree;
389 _SplayTreeKeyIterable(this._tree); 391 _SplayTreeKeyIterable(this._tree);
390 int get length => _tree._count; 392 int get length => _tree._count;
391 bool get isEmpty => _tree._count == 0; 393 bool get isEmpty => _tree._count == 0;
392 Iterator<K> get iterator => new _SplayTreeKeyIterator<K>(_tree); 394 Iterator<K> get iterator => new _SplayTreeKeyIterator<K>(_tree);
393 Set<K> toSet() { 395 Set<K> toSet() {
394 var setOrMap = _tree; 396 var setOrMap = _tree;
395 SplayTreeSet<K> set = new SplayTreeSet<K>(DEVC$RT.cast(setOrMap._comparator, dy namic, DEVC$RT.type((__t20<K> _) { 397 SplayTreeSet<K> set = new SplayTreeSet<K>(DEVC$RT.cast(setOrMap._comparator, dy namic, DEVC$RT.type((__t15<K> _) {
396 } 398 }
397 ), "CompositeCast", """line 613, column 29 of dart:collection/splay_tree.dart: " "", setOrMap._comparator is __t20<K>, false), DEVC$RT.cast(setOrMap._validKey, d ynamic, __t16, "CompositeCast", """line 613, column 51 of dart:collection/splay_ tree.dart: """, setOrMap._validKey is __t16, false)); 399 ), "CompositeCast", """line 613, column 29 of dart:collection/splay_tree.dart: " "", setOrMap._comparator is __t15<K>, false), DEVC$RT.cast(setOrMap._validKey, d ynamic, __t18, "CompositeCast", """line 613, column 51 of dart:collection/splay_ tree.dart: """, setOrMap._validKey is __t18, false));
398 set._count = _tree._count; 400 set._count = _tree._count;
399 set._root = set._copyNode(_tree._root); 401 set._root = set._copyNode(_tree._root);
400 return set; 402 return set;
401 } 403 }
402 } 404 }
403 class _SplayTreeValueIterable<K, V> extends IterableBase<V> implements Efficien tLength {SplayTreeMap<K, V> _map; 405 class _SplayTreeValueIterable<K, V> extends IterableBase<V> implements Efficien tLength {SplayTreeMap<K, V> _map;
404 _SplayTreeValueIterable(this._map); 406 _SplayTreeValueIterable(this._map);
405 int get length => _map._count; 407 int get length => _map._count;
406 bool get isEmpty => _map._count == 0; 408 bool get isEmpty => _map._count == 0;
407 Iterator<V> get iterator => new _SplayTreeValueIterator<K, V>(_map); 409 Iterator<V> get iterator => new _SplayTreeValueIterator<K, V>(_map);
408 } 410 }
409 class _SplayTreeKeyIterator<K> extends _SplayTreeIterator<K> {_SplayTreeKeyIter ator(_SplayTree<K> map) : super(map); 411 class _SplayTreeKeyIterator<K> extends _SplayTreeIterator<K> {_SplayTreeKeyIter ator(_SplayTree<K> map) : super(map);
410 K _getValue(_SplayTreeNode node) => DEVC$RT.cast(node.key, dynamic, K, "Composi teCast", """line 631, column 39 of dart:collection/splay_tree.dart: """, node.ke y is K, false); 412 K _getValue(_SplayTreeNode node) => DEVC$RT.cast(node.key, dynamic, K, "Composi teCast", """line 631, column 39 of dart:collection/splay_tree.dart: """, node.ke y is K, false);
411 } 413 }
412 class _SplayTreeValueIterator<K, V> extends _SplayTreeIterator<V> {_SplayTreeVa lueIterator(SplayTreeMap<K, V> map) : super(map); 414 class _SplayTreeValueIterator<K, V> extends _SplayTreeIterator<V> {_SplayTreeVa lueIterator(SplayTreeMap<K, V> map) : super(map);
413 V _getValue(_SplayTreeMapNode node) => DEVC$RT.cast(node.value, dynamic, V, "Co mpositeCast", """line 636, column 42 of dart:collection/splay_tree.dart: """, no de.value is V, false); 415 V _getValue(_SplayTreeMapNode node) => DEVC$RT.cast(node.value, dynamic, V, "Co mpositeCast", """line 636, column 42 of dart:collection/splay_tree.dart: """, no de.value is V, false);
414 } 416 }
415 class _SplayTreeNodeIterator<K> extends _SplayTreeIterator<_SplayTreeNode<K>> { _SplayTreeNodeIterator(_SplayTree<K> tree) : super(tree); 417 class _SplayTreeNodeIterator<K> extends _SplayTreeIterator<_SplayTreeNode<K>> { _SplayTreeNodeIterator(_SplayTree<K> tree) : super(tree);
416 _SplayTreeNodeIterator.startAt(_SplayTree<K> tree, var startKey) : super.startA t(tree, startKey); 418 _SplayTreeNodeIterator.startAt(_SplayTree<K> tree, var startKey) : super.startA t(tree, startKey);
417 _SplayTreeNode<K> _getValue(_SplayTreeNode node) => DEVC$RT.cast(node, DEVC$RT. type((_SplayTreeNode<dynamic> _) { 419 _SplayTreeNode<K> _getValue(_SplayTreeNode node) => DEVC$RT.cast(node, DEVC$RT. type((_SplayTreeNode<dynamic> _) {
418 } 420 }
419 ), DEVC$RT.type((_SplayTreeNode<K> _) { 421 ), DEVC$RT.type((_SplayTreeNode<K> _) {
420 } 422 }
421 ), "CompositeCast", """line 644, column 55 of dart:collection/splay_tree.dart: " "", node is _SplayTreeNode<K>, false); 423 ), "CompositeCast", """line 644, column 55 of dart:collection/splay_tree.dart: " "", node is _SplayTreeNode<K>, false);
422 } 424 }
423 class SplayTreeSet<E> extends _SplayTree<E> with IterableMixin<E>, SetMixin<E> {Comparator _comparator; 425 class SplayTreeSet<E> extends _SplayTree<E> with IterableMixin<E>, SetMixin<E> {Comparator _comparator;
424 _Predicate _validKey; 426 _Predicate _validKey;
425 SplayTreeSet([int compare(E key1, E key2), bool isValidKey(potentialKey)]) : _c omparator = ((__x26) => DEVC$RT.cast(__x26, dynamic, __t23, "CompositeCast", """ line 693, column 23 of dart:collection/splay_tree.dart: """, __x26 is __t23, fal se))((compare == null) ? Comparable.compare : compare), _validKey = ((__x27) => DEVC$RT.cast(__x27, dynamic, __t16, "CompositeCast", """line 694, column 21 of d art:collection/splay_tree.dart: """, __x27 is __t16, false))((isValidKey != null ) ? isValidKey : ((v) => v is E)); 427 SplayTreeSet([int compare(E key1, E key2), bool isValidKey(potentialKey)]) : _c omparator = ((__x20) => DEVC$RT.cast(__x20, dynamic, DEVC$RT.type((Comparator<dy namic> _) {
428 }
429 ), "CompositeCast", """line 693, column 23 of dart:collection/splay_tree.dart: " "", __x20 is Comparator<dynamic>, false))((compare == null) ? Comparable.compare : compare), _validKey = ((__x21) => DEVC$RT.cast(__x21, dynamic, DEVC$RT.type(( _Predicate<dynamic> _) {
430 }
431 ), "CompositeCast", """line 694, column 21 of dart:collection/splay_tree.dart: " "", __x21 is _Predicate<dynamic>, false))((isValidKey != null) ? isValidKey : (( v) => v is E));
426 factory SplayTreeSet.from(Iterable elements, [int compare(E key1, E key2), bool isValidKey(potentialKey)]) { 432 factory SplayTreeSet.from(Iterable elements, [int compare(E key1, E key2), bool isValidKey(potentialKey)]) {
427 SplayTreeSet<E> result = new SplayTreeSet<E>(compare, isValidKey); 433 SplayTreeSet<E> result = new SplayTreeSet<E>(compare, isValidKey);
428 for (final E element in DEVC$RT.cast(elements, DEVC$RT.type((Iterable<dynamic> _) { 434 for (final E element in DEVC$RT.cast(elements, DEVC$RT.type((Iterable<dynamic> _) {
429 } 435 }
430 ), DEVC$RT.type((Iterable<E> _) { 436 ), DEVC$RT.type((Iterable<E> _) {
431 } 437 }
432 ), "CompositeCast", """line 707, column 29 of dart:collection/splay_tree.dart: " "", elements is Iterable<E>, false)) { 438 ), "CompositeCast", """line 707, column 29 of dart:collection/splay_tree.dart: " "", elements is Iterable<E>, false)) {
433 result.add(element); 439 result.add(element);
434 } 440 }
435 return result; 441 return result;
(...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after
472 _addNewRoot(new _SplayTreeNode<E>(element), compare); 478 _addNewRoot(new _SplayTreeNode<E>(element), compare);
473 } 479 }
474 } 480 }
475 } 481 }
476 void removeAll(Iterable<Object> elements) { 482 void removeAll(Iterable<Object> elements) {
477 for (Object element in elements) { 483 for (Object element in elements) {
478 if (_validKey(element)) _remove(DEVC$RT.cast(element, Object, E, "CompositeCast" , """line 767, column 39 of dart:collection/splay_tree.dart: """, element is E, false)); 484 if (_validKey(element)) _remove(DEVC$RT.cast(element, Object, E, "CompositeCast" , """line 767, column 39 of dart:collection/splay_tree.dart: """, element is E, false));
479 } 485 }
480 } 486 }
481 void retainAll(Iterable<Object> elements) { 487 void retainAll(Iterable<Object> elements) {
482 SplayTreeSet<E> retainSet = new SplayTreeSet<E>(DEVC$RT.cast(_comparator, __t23, DEVC$RT.type((__t28<E> _) { 488 SplayTreeSet<E> retainSet = new SplayTreeSet<E>(DEVC$RT.cast(_comparator, DEVC$R T.type((Comparator<dynamic> _) {
483 } 489 }
484 ), "CompositeCast", """line 773, column 53 of dart:collection/splay_tree.dart: " "", _comparator is __t28<E>, false), _validKey); 490 ), DEVC$RT.type((__t22<E> _) {
491 }
492 ), "CompositeCast", """line 773, column 53 of dart:collection/splay_tree.dart: " "", _comparator is __t22<E>, false), _validKey);
485 int modificationCount = _modificationCount; 493 int modificationCount = _modificationCount;
486 for (Object object in elements) { 494 for (Object object in elements) {
487 if (modificationCount != _modificationCount) { 495 if (modificationCount != _modificationCount) {
488 throw new ConcurrentModificationError(this); 496 throw new ConcurrentModificationError(this);
489 } 497 }
490 if (_validKey(object) && _splay(DEVC$RT.cast(object, Object, E, "CompositeCast" , """line 781, column 39 of dart:collection/splay_tree.dart: """, object is E, f alse)) == 0) retainSet.add(_root.key); 498 if (_validKey(object) && _splay(DEVC$RT.cast(object, Object, E, "CompositeCast" , """line 781, column 39 of dart:collection/splay_tree.dart: """, object is E, f alse)) == 0) retainSet.add(_root.key);
491 } 499 }
492 if (retainSet._count != _count) { 500 if (retainSet._count != _count) {
493 _root = retainSet._root; 501 _root = retainSet._root;
494 _count = retainSet._count; 502 _count = retainSet._count;
495 _modificationCount++; 503 _modificationCount++;
496 } 504 }
497 } 505 }
498 E lookup(Object object) { 506 E lookup(Object object) {
499 if (!_validKey(object)) return null; 507 if (!_validKey(object)) return null;
500 int comp = _splay(DEVC$RT.cast(object, Object, E, "CompositeCast", """line 793, column 23 of dart:collection/splay_tree.dart: """, object is E, false)); 508 int comp = _splay(DEVC$RT.cast(object, Object, E, "CompositeCast", """line 793, column 23 of dart:collection/splay_tree.dart: """, object is E, false));
501 if (comp != 0) return null; 509 if (comp != 0) return null;
502 return _root.key; 510 return _root.key;
503 } 511 }
504 Set<E> intersection(Set<E> other) { 512 Set<E> intersection(Set<E> other) {
505 Set<E> result = new SplayTreeSet<E>(DEVC$RT.cast(_comparator, __t23, DEVC$RT.typ e((__t28<E> _) { 513 Set<E> result = new SplayTreeSet<E>(DEVC$RT.cast(_comparator, DEVC$RT.type((Comp arator<dynamic> _) {
506 } 514 }
507 ), "CompositeCast", """line 799, column 41 of dart:collection/splay_tree.dart: " "", _comparator is __t28<E>, false), _validKey); 515 ), DEVC$RT.type((__t22<E> _) {
516 }
517 ), "CompositeCast", """line 799, column 41 of dart:collection/splay_tree.dart: " "", _comparator is __t22<E>, false), _validKey);
508 for (E element in this) { 518 for (E element in this) {
509 if (other.contains(element)) result.add(element); 519 if (other.contains(element)) result.add(element);
510 } 520 }
511 return result; 521 return result;
512 } 522 }
513 Set<E> difference(Set<E> other) { 523 Set<E> difference(Set<E> other) {
514 Set<E> result = new SplayTreeSet<E>(DEVC$RT.cast(_comparator, __t23, DEVC$RT.typ e((__t28<E> _) { 524 Set<E> result = new SplayTreeSet<E>(DEVC$RT.cast(_comparator, DEVC$RT.type((Comp arator<dynamic> _) {
515 } 525 }
516 ), "CompositeCast", """line 807, column 41 of dart:collection/splay_tree.dart: " "", _comparator is __t28<E>, false), _validKey); 526 ), DEVC$RT.type((__t22<E> _) {
527 }
528 ), "CompositeCast", """line 807, column 41 of dart:collection/splay_tree.dart: " "", _comparator is __t22<E>, false), _validKey);
517 for (E element in this) { 529 for (E element in this) {
518 if (!other.contains(element)) result.add(element); 530 if (!other.contains(element)) result.add(element);
519 } 531 }
520 return result; 532 return result;
521 } 533 }
522 Set<E> union(Set<E> other) { 534 Set<E> union(Set<E> other) {
523 return _clone()..addAll(other); 535 return _clone()..addAll(other);
524 } 536 }
525 SplayTreeSet<E> _clone() { 537 SplayTreeSet<E> _clone() {
526 var set = new SplayTreeSet<E>(DEVC$RT.cast(_comparator, __t23, DEVC$RT.type((__t 28<E> _) { 538 var set = new SplayTreeSet<E>(DEVC$RT.cast(_comparator, DEVC$RT.type((Comparator <dynamic> _) {
527 } 539 }
528 ), "CompositeCast", """line 819, column 35 of dart:collection/splay_tree.dart: " "", _comparator is __t28<E>, false), _validKey); 540 ), DEVC$RT.type((__t22<E> _) {
541 }
542 ), "CompositeCast", """line 819, column 35 of dart:collection/splay_tree.dart: " "", _comparator is __t22<E>, false), _validKey);
529 set._count = _count; 543 set._count = _count;
530 set._root = _copyNode(_root); 544 set._root = _copyNode(_root);
531 return set; 545 return set;
532 } 546 }
533 _SplayTreeNode<E> _copyNode(_SplayTreeNode<E> node) { 547 _SplayTreeNode<E> _copyNode(_SplayTreeNode<E> node) {
534 if (node == null) return null; 548 if (node == null) return null;
535 return new _SplayTreeNode<E>(node.key)..left = _copyNode(node.left)..right = _c opyNode(node.right); 549 return new _SplayTreeNode<E>(node.key)..left = _copyNode(node.left)..right = _c opyNode(node.right);
536 } 550 }
537 void clear() { 551 void clear() {
538 _clear(); 552 _clear();
539 } 553 }
540 Set<E> toSet() => _clone(); 554 Set<E> toSet() => _clone();
541 String toString() => IterableBase.iterableToFullString(this, '{', '}'); 555 String toString() => IterableBase.iterableToFullString(this, '{', '}');
542 } 556 }
543 typedef int __t12<K>(K __u13, K __u14); 557 typedef int __t15<K>(K __u16, K __u17);
544 typedef bool __t16(dynamic __u17); 558 typedef bool __t18(dynamic __u19);
545 typedef int __t20<K>(K __u21, K __u22); 559 typedef int __t22<E>(E __u23, E __u24);
546 typedef int __t23(dynamic __u24, dynamic __u25);
547 typedef int __t28<E>(E __u29, E __u30);
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698