| OLD | NEW |
| 1 part of dart.collection; | 1 part of dart.collection; |
| 2 | 2 |
| 3 abstract class LinkedHashSet<E> implements HashSet<E> { | 3 abstract class LinkedHashSet<E> implements HashSet<E> { |
| 4 @patch factory LinkedHashSet({bool equals(E e1, E e2), int hashCode(E e), | 4 factory LinkedHashSet({bool equals(E e1, E e2), int hashCode(E e), |
| 5 bool isValidKey(potentialKey)}) { | 5 bool isValidKey(potentialKey)}) { |
| 6 if (isValidKey == null) { | 6 if (isValidKey == null) { |
| 7 if (hashCode == null) { | 7 if (hashCode == null) { |
| 8 if (equals == null) { | 8 if (equals == null) { |
| 9 return new _LinkedHashSet<E>(); | 9 return new _LinkedHashSet<E>(); |
| 10 } | 10 } |
| 11 hashCode = _defaultHashCode; | 11 hashCode = _defaultHashCode; |
| 12 } else { | 12 } else { |
| 13 if (identical(identityHashCode, hashCode) && | 13 if (identical(identityHashCode, hashCode) && |
| 14 identical(identical, equals)) { | 14 identical(identical, equals)) { |
| 15 return new _LinkedIdentityHashSet<E>(); | 15 return new _LinkedIdentityHashSet<E>(); |
| 16 } | 16 } |
| 17 if (equals == null) { | 17 if (equals == null) { |
| 18 equals = _defaultEquals; | 18 equals = _defaultEquals; |
| 19 } | 19 } |
| 20 } | 20 } |
| 21 } else { | 21 } else { |
| 22 if (hashCode == null) { | 22 if (hashCode == null) { |
| 23 hashCode = _defaultHashCode; | 23 hashCode = _defaultHashCode; |
| 24 } | 24 } |
| 25 if (equals == null) { | 25 if (equals == null) { |
| 26 equals = _defaultEquals; | 26 equals = _defaultEquals; |
| 27 } | 27 } |
| 28 } | 28 } |
| 29 return new _LinkedCustomHashSet<E>(equals, hashCode, isValidKey); | 29 return new _LinkedCustomHashSet<E>(equals, hashCode, isValidKey); |
| 30 } | 30 } |
| 31 @patch factory LinkedHashSet.identity() = _LinkedIdentityHashSet<E>; | 31 factory LinkedHashSet.identity() = _LinkedIdentityHashSet<E>; |
| 32 factory LinkedHashSet.from(Iterable<E> elements) { | 32 factory LinkedHashSet.from(Iterable<E> elements) { |
| 33 LinkedHashSet<E> result = new LinkedHashSet<E>(); | 33 LinkedHashSet<E> result = new LinkedHashSet<E>(); |
| 34 for (final E element in elements) { | 34 for (final E element in elements) { |
| 35 result.add(element); | 35 result.add(element); |
| 36 } | 36 } |
| 37 return result; | 37 return result; |
| 38 } | 38 } |
| 39 void forEach(void action(E element)); | 39 void forEach(void action(E element)); |
| 40 Iterator<E> get iterator; | 40 Iterator<E> get iterator; |
| 41 } | 41 } |
| OLD | NEW |