| OLD | NEW |
| 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 Loading... |
| 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 = ((__x21) => DEVC$RT.cast(__x21, dynamic, DEVC$RT.type((__t18<K> _) { | 150 SplayTreeMap([int compare(K key1, K key2), bool isValidKey(potentialKey)]) : _c
omparator = ((__x15) => DEVC$RT.cast(__x15, dynamic, DEVC$RT.type((__t12<K> _) { |
| 151 } | 151 } |
| 152 ), "CompositeCast", """line 268, column 23 of dart:collection/splay_tree.dart: "
"", __x21 is __t18<K>, false))((compare == null) ? Comparable.compare : compare)
, _validKey = ((__x24) => DEVC$RT.cast(__x24, dynamic, __t22, "CompositeCast", "
""line 269, column 21 of dart:collection/splay_tree.dart: """, __x24 is __t22, f
alse))((isValidKey != null) ? isValidKey : ((v) => v is K)); | 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)); |
| 153 factory SplayTreeMap.from(Map other, [int compare(K key1, K key2), bool isValid
Key(potentialKey)]) { | 153 factory SplayTreeMap.from(Map other, [int compare(K key1, K key2), bool isValid
Key(potentialKey)]) { |
| 154 SplayTreeMap<K, V> result = new SplayTreeMap<K, V>(); | 154 SplayTreeMap<K, V> result = new SplayTreeMap<K, V>(); |
| 155 other.forEach((k, v) { | 155 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); | 156 result[k] = DEVC$RT.cast(v, dynamic, V, "CompositeCast", """line 278, column 40
of dart:collection/splay_tree.dart: """, v is V, false); |
| 157 } | 157 } |
| 158 ); | 158 ); |
| 159 return result; | 159 return result; |
| 160 } | 160 } |
| 161 factory SplayTreeMap.fromIterable(Iterable iterable, { | 161 factory SplayTreeMap.fromIterable(Iterable iterable, { |
| 162 K key(element), V value(element), int compare(K key1, K key2), bool isValidKey(p
otentialKey)} | 162 K key(element), V value(element), int compare(K key1, K key2), bool isValidKey(p
otentialKey)} |
| (...skipping 20 matching lines...) Expand all Loading... |
| 183 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) { | 183 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) { |
| 184 } | 184 } |
| 185 ), "AssignmentCast", """line 333, column 37 of dart:collection/splay_tree.dart:
""", _root is _SplayTreeMapNode<dynamic, dynamic>, true); | 185 ), "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); | 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); |
| 187 } | 187 } |
| 188 } | 188 } |
| 189 return null; | 189 return null; |
| 190 } | 190 } |
| 191 V remove(Object key) { | 191 V remove(Object key) { |
| 192 if (!_validKey(key)) return null; | 192 if (!_validKey(key)) return null; |
| 193 _SplayTreeMapNode mapRoot = ((__x25) => DEVC$RT.cast(__x25, DEVC$RT.type((_Spla
yTreeNode<dynamic> _) { | 193 _SplayTreeMapNode mapRoot = ((__x19) => DEVC$RT.cast(__x19, DEVC$RT.type((_Spla
yTreeNode<dynamic> _) { |
| 194 } | 194 } |
| 195 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) { | 195 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) { |
| 196 } | 196 } |
| 197 ), "AssignmentCast", """line 342, column 33 of dart:collection/splay_tree.dart:
""", __x25 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))); | 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))); |
| 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); | 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); |
| 199 return null; | 199 return null; |
| 200 } | 200 } |
| 201 void operator []=(K key, V value) { | 201 void operator []=(K key, V value) { |
| 202 if (key == null) throw new ArgumentError(key); | 202 if (key == null) throw new ArgumentError(key); |
| 203 int comp = _splay(key); | 203 int comp = _splay(key); |
| 204 if (comp == 0) { | 204 if (comp == 0) { |
| 205 _SplayTreeMapNode mapRoot = DEVC$RT.cast(_root, DEVC$RT.type((_SplayTreeNode<K>
_) { | 205 _SplayTreeMapNode mapRoot = DEVC$RT.cast(_root, DEVC$RT.type((_SplayTreeNode<K>
_) { |
| 206 } | 206 } |
| 207 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) { | 207 ), DEVC$RT.type((_SplayTreeMapNode<dynamic, dynamic> _) { |
| (...skipping 177 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 385 } | 385 } |
| 386 T _getValue(_SplayTreeNode node); | 386 T _getValue(_SplayTreeNode node); |
| 387 } | 387 } |
| 388 class _SplayTreeKeyIterable<K> extends IterableBase<K> implements EfficientLeng
th {_SplayTree<K> _tree; | 388 class _SplayTreeKeyIterable<K> extends IterableBase<K> implements EfficientLeng
th {_SplayTree<K> _tree; |
| 389 _SplayTreeKeyIterable(this._tree); | 389 _SplayTreeKeyIterable(this._tree); |
| 390 int get length => _tree._count; | 390 int get length => _tree._count; |
| 391 bool get isEmpty => _tree._count == 0; | 391 bool get isEmpty => _tree._count == 0; |
| 392 Iterator<K> get iterator => new _SplayTreeKeyIterator<K>(_tree); | 392 Iterator<K> get iterator => new _SplayTreeKeyIterator<K>(_tree); |
| 393 Set<K> toSet() { | 393 Set<K> toSet() { |
| 394 var setOrMap = _tree; | 394 var setOrMap = _tree; |
| 395 SplayTreeSet<K> set = new SplayTreeSet<K>(DEVC$RT.cast(setOrMap._comparator, dy
namic, DEVC$RT.type((__t26<K> _) { | 395 SplayTreeSet<K> set = new SplayTreeSet<K>(DEVC$RT.cast(setOrMap._comparator, dy
namic, DEVC$RT.type((__t20<K> _) { |
| 396 } | 396 } |
| 397 ), "CompositeCast", """line 613, column 29 of dart:collection/splay_tree.dart: "
"", setOrMap._comparator is __t26<K>, false), DEVC$RT.cast(setOrMap._validKey, d
ynamic, __t22, "CompositeCast", """line 613, column 51 of dart:collection/splay_
tree.dart: """, setOrMap._validKey is __t22, false)); | 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)); |
| 398 set._count = _tree._count; | 398 set._count = _tree._count; |
| 399 set._root = set._copyNode(_tree._root); | 399 set._root = set._copyNode(_tree._root); |
| 400 return set; | 400 return set; |
| 401 } | 401 } |
| 402 } | 402 } |
| 403 class _SplayTreeValueIterable<K, V> extends IterableBase<V> implements Efficien
tLength {SplayTreeMap<K, V> _map; | 403 class _SplayTreeValueIterable<K, V> extends IterableBase<V> implements Efficien
tLength {SplayTreeMap<K, V> _map; |
| 404 _SplayTreeValueIterable(this._map); | 404 _SplayTreeValueIterable(this._map); |
| 405 int get length => _map._count; | 405 int get length => _map._count; |
| 406 bool get isEmpty => _map._count == 0; | 406 bool get isEmpty => _map._count == 0; |
| 407 Iterator<V> get iterator => new _SplayTreeValueIterator<K, V>(_map); | 407 Iterator<V> get iterator => new _SplayTreeValueIterator<K, V>(_map); |
| 408 } | 408 } |
| 409 class _SplayTreeKeyIterator<K> extends _SplayTreeIterator<K> {_SplayTreeKeyIter
ator(_SplayTree<K> map) : super(map); | 409 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); | 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); |
| 411 } | 411 } |
| 412 class _SplayTreeValueIterator<K, V> extends _SplayTreeIterator<V> {_SplayTreeVa
lueIterator(SplayTreeMap<K, V> map) : super(map); | 412 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); | 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); |
| 414 } | 414 } |
| 415 class _SplayTreeNodeIterator<K> extends _SplayTreeIterator<_SplayTreeNode<K>> {
_SplayTreeNodeIterator(_SplayTree<K> tree) : super(tree); | 415 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); | 416 _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> _) { | 417 _SplayTreeNode<K> _getValue(_SplayTreeNode node) => DEVC$RT.cast(node, DEVC$RT.
type((_SplayTreeNode<dynamic> _) { |
| 418 } | 418 } |
| 419 ), DEVC$RT.type((_SplayTreeNode<K> _) { | 419 ), DEVC$RT.type((_SplayTreeNode<K> _) { |
| 420 } | 420 } |
| 421 ), "CompositeCast", """line 644, column 55 of dart:collection/splay_tree.dart: "
"", node is _SplayTreeNode<K>, false); | 421 ), "CompositeCast", """line 644, column 55 of dart:collection/splay_tree.dart: "
"", node is _SplayTreeNode<K>, false); |
| 422 } | 422 } |
| 423 class SplayTreeSet<E> extends _SplayTree<E> with IterableMixin<E>, SetMixin<E>
{Comparator _comparator; | 423 class SplayTreeSet<E> extends _SplayTree<E> with IterableMixin<E>, SetMixin<E>
{Comparator _comparator; |
| 424 _Predicate _validKey; | 424 _Predicate _validKey; |
| 425 SplayTreeSet([int compare(E key1, E key2), bool isValidKey(potentialKey)]) : _c
omparator = ((__x32) => DEVC$RT.cast(__x32, dynamic, __t29, "CompositeCast", """
line 693, column 23 of dart:collection/splay_tree.dart: """, __x32 is __t29, fal
se))((compare == null) ? Comparable.compare : compare), _validKey = ((__x33) =>
DEVC$RT.cast(__x33, dynamic, __t22, "CompositeCast", """line 694, column 21 of d
art:collection/splay_tree.dart: """, __x33 is __t22, false))((isValidKey != null
) ? isValidKey : ((v) => v is E)); | 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)); |
| 426 factory SplayTreeSet.from(Iterable elements, [int compare(E key1, E key2), bool
isValidKey(potentialKey)]) { | 426 factory SplayTreeSet.from(Iterable elements, [int compare(E key1, E key2), bool
isValidKey(potentialKey)]) { |
| 427 SplayTreeSet<E> result = new SplayTreeSet<E>(compare, isValidKey); | 427 SplayTreeSet<E> result = new SplayTreeSet<E>(compare, isValidKey); |
| 428 for (final E element in DEVC$RT.cast(elements, DEVC$RT.type((Iterable<dynamic>
_) { | 428 for (final E element in DEVC$RT.cast(elements, DEVC$RT.type((Iterable<dynamic>
_) { |
| 429 } | 429 } |
| 430 ), DEVC$RT.type((Iterable<E> _) { | 430 ), DEVC$RT.type((Iterable<E> _) { |
| 431 } | 431 } |
| 432 ), "CompositeCast", """line 707, column 29 of dart:collection/splay_tree.dart: "
"", elements is Iterable<E>, false)) { | 432 ), "CompositeCast", """line 707, column 29 of dart:collection/splay_tree.dart: "
"", elements is Iterable<E>, false)) { |
| 433 result.add(element); | 433 result.add(element); |
| 434 } | 434 } |
| 435 return result; | 435 return result; |
| (...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 472 _addNewRoot(new _SplayTreeNode<E>(element), compare); | 472 _addNewRoot(new _SplayTreeNode<E>(element), compare); |
| 473 } | 473 } |
| 474 } | 474 } |
| 475 } | 475 } |
| 476 void removeAll(Iterable<Object> elements) { | 476 void removeAll(Iterable<Object> elements) { |
| 477 for (Object element in elements) { | 477 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)); | 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)); |
| 479 } | 479 } |
| 480 } | 480 } |
| 481 void retainAll(Iterable<Object> elements) { | 481 void retainAll(Iterable<Object> elements) { |
| 482 SplayTreeSet<E> retainSet = new SplayTreeSet<E>(DEVC$RT.wrap((int f(dynamic __u3
4, dynamic __u35)) { | 482 SplayTreeSet<E> retainSet = new SplayTreeSet<E>(DEVC$RT.wrap((int f(dynamic __u2
8, dynamic __u29)) { |
| 483 int c(dynamic x0, dynamic x1) => f(x0, x1); | 483 int c(dynamic x0, dynamic x1) => f(x0, x1); |
| 484 return f == null ? null : c; | 484 return f == null ? null : c; |
| 485 } | 485 } |
| 486 , _comparator, __t29, DEVC$RT.type((__t36<E> _) { | 486 , _comparator, __t23, DEVC$RT.type((__t30<E> _) { |
| 487 } | 487 } |
| 488 ), "Wrap", """line 773, column 53 of dart:collection/splay_tree.dart: """, _comp
arator is __t36<E>), _validKey); | 488 ), "Wrap", """line 773, column 53 of dart:collection/splay_tree.dart: """, _comp
arator is __t30<E>), _validKey); |
| 489 int modificationCount = _modificationCount; | 489 int modificationCount = _modificationCount; |
| 490 for (Object object in elements) { | 490 for (Object object in elements) { |
| 491 if (modificationCount != _modificationCount) { | 491 if (modificationCount != _modificationCount) { |
| 492 throw new ConcurrentModificationError(this); | 492 throw new ConcurrentModificationError(this); |
| 493 } | 493 } |
| 494 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); | 494 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); |
| 495 } | 495 } |
| 496 if (retainSet._count != _count) { | 496 if (retainSet._count != _count) { |
| 497 _root = retainSet._root; | 497 _root = retainSet._root; |
| 498 _count = retainSet._count; | 498 _count = retainSet._count; |
| 499 _modificationCount++; | 499 _modificationCount++; |
| 500 } | 500 } |
| 501 } | 501 } |
| 502 E lookup(Object object) { | 502 E lookup(Object object) { |
| 503 if (!_validKey(object)) return null; | 503 if (!_validKey(object)) return null; |
| 504 int comp = _splay(DEVC$RT.cast(object, Object, E, "CompositeCast", """line 793,
column 23 of dart:collection/splay_tree.dart: """, object is E, false)); | 504 int comp = _splay(DEVC$RT.cast(object, Object, E, "CompositeCast", """line 793,
column 23 of dart:collection/splay_tree.dart: """, object is E, false)); |
| 505 if (comp != 0) return null; | 505 if (comp != 0) return null; |
| 506 return _root.key; | 506 return _root.key; |
| 507 } | 507 } |
| 508 Set<E> intersection(Set<E> other) { | 508 Set<E> intersection(Set<E> other) { |
| 509 Set<E> result = new SplayTreeSet<E>(DEVC$RT.wrap((int f(dynamic __u39, dynamic _
_u40)) { | 509 Set<E> result = new SplayTreeSet<E>(DEVC$RT.wrap((int f(dynamic __u33, dynamic _
_u34)) { |
| 510 int c(dynamic x0, dynamic x1) => f(x0, x1); | 510 int c(dynamic x0, dynamic x1) => f(x0, x1); |
| 511 return f == null ? null : c; | 511 return f == null ? null : c; |
| 512 } | 512 } |
| 513 , _comparator, __t29, DEVC$RT.type((__t36<E> _) { | 513 , _comparator, __t23, DEVC$RT.type((__t30<E> _) { |
| 514 } | 514 } |
| 515 ), "Wrap", """line 799, column 41 of dart:collection/splay_tree.dart: """, _comp
arator is __t36<E>), _validKey); | 515 ), "Wrap", """line 799, column 41 of dart:collection/splay_tree.dart: """, _comp
arator is __t30<E>), _validKey); |
| 516 for (E element in this) { | 516 for (E element in this) { |
| 517 if (other.contains(element)) result.add(element); | 517 if (other.contains(element)) result.add(element); |
| 518 } | 518 } |
| 519 return result; | 519 return result; |
| 520 } | 520 } |
| 521 Set<E> difference(Set<E> other) { | 521 Set<E> difference(Set<E> other) { |
| 522 Set<E> result = new SplayTreeSet<E>(DEVC$RT.wrap((int f(dynamic __u41, dynamic _
_u42)) { | 522 Set<E> result = new SplayTreeSet<E>(DEVC$RT.wrap((int f(dynamic __u35, dynamic _
_u36)) { |
| 523 int c(dynamic x0, dynamic x1) => f(x0, x1); | 523 int c(dynamic x0, dynamic x1) => f(x0, x1); |
| 524 return f == null ? null : c; | 524 return f == null ? null : c; |
| 525 } | 525 } |
| 526 , _comparator, __t29, DEVC$RT.type((__t36<E> _) { | 526 , _comparator, __t23, DEVC$RT.type((__t30<E> _) { |
| 527 } | 527 } |
| 528 ), "Wrap", """line 807, column 41 of dart:collection/splay_tree.dart: """, _comp
arator is __t36<E>), _validKey); | 528 ), "Wrap", """line 807, column 41 of dart:collection/splay_tree.dart: """, _comp
arator is __t30<E>), _validKey); |
| 529 for (E element in this) { | 529 for (E element in this) { |
| 530 if (!other.contains(element)) result.add(element); | 530 if (!other.contains(element)) result.add(element); |
| 531 } | 531 } |
| 532 return result; | 532 return result; |
| 533 } | 533 } |
| 534 Set<E> union(Set<E> other) { | 534 Set<E> union(Set<E> other) { |
| 535 return _clone()..addAll(other); | 535 return _clone()..addAll(other); |
| 536 } | 536 } |
| 537 SplayTreeSet<E> _clone() { | 537 SplayTreeSet<E> _clone() { |
| 538 var set = new SplayTreeSet<E>(DEVC$RT.wrap((int f(dynamic __u43, dynamic __u44))
{ | 538 var set = new SplayTreeSet<E>(DEVC$RT.wrap((int f(dynamic __u37, dynamic __u38))
{ |
| 539 int c(dynamic x0, dynamic x1) => f(x0, x1); | 539 int c(dynamic x0, dynamic x1) => f(x0, x1); |
| 540 return f == null ? null : c; | 540 return f == null ? null : c; |
| 541 } | 541 } |
| 542 , _comparator, __t29, DEVC$RT.type((__t36<E> _) { | 542 , _comparator, __t23, DEVC$RT.type((__t30<E> _) { |
| 543 } | 543 } |
| 544 ), "Wrap", """line 819, column 35 of dart:collection/splay_tree.dart: """, _comp
arator is __t36<E>), _validKey); | 544 ), "Wrap", """line 819, column 35 of dart:collection/splay_tree.dart: """, _comp
arator is __t30<E>), _validKey); |
| 545 set._count = _count; | 545 set._count = _count; |
| 546 set._root = _copyNode(_root); | 546 set._root = _copyNode(_root); |
| 547 return set; | 547 return set; |
| 548 } | 548 } |
| 549 _SplayTreeNode<E> _copyNode(_SplayTreeNode<E> node) { | 549 _SplayTreeNode<E> _copyNode(_SplayTreeNode<E> node) { |
| 550 if (node == null) return null; | 550 if (node == null) return null; |
| 551 return new _SplayTreeNode<E>(node.key)..left = _copyNode(node.left)..right = _c
opyNode(node.right); | 551 return new _SplayTreeNode<E>(node.key)..left = _copyNode(node.left)..right = _c
opyNode(node.right); |
| 552 } | 552 } |
| 553 void clear() { | 553 void clear() { |
| 554 _clear(); | 554 _clear(); |
| 555 } | 555 } |
| 556 Set<E> toSet() => _clone(); | 556 Set<E> toSet() => _clone(); |
| 557 String toString() => IterableBase.iterableToFullString(this, '{', '}'); | 557 String toString() => IterableBase.iterableToFullString(this, '{', '}'); |
| 558 } | 558 } |
| 559 typedef int __t18<K>(K __u19, K __u20); | 559 typedef int __t12<K>(K __u13, K __u14); |
| 560 typedef bool __t22(dynamic __u23); | 560 typedef bool __t16(dynamic __u17); |
| 561 typedef int __t26<K>(K __u27, K __u28); | 561 typedef int __t20<K>(K __u21, K __u22); |
| 562 typedef int __t29(dynamic __u30, dynamic __u31); | 562 typedef int __t23(dynamic __u24, dynamic __u25); |
| 563 typedef int __t36<E>(E __u37, E __u38); | 563 typedef int __t30<E>(E __u31, E __u32); |
| OLD | NEW |