| OLD | NEW |
| 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 part of dart2js.util; | 5 part of dart2js.helpers; |
| 6 | 6 |
| 7 /** | 7 /** |
| 8 * The expensive set is a data structure useful for tracking down | 8 * The expensive set is a data structure useful for tracking down |
| 9 * excessive memory usage due to large sets. It acts as an ordinary | 9 * excessive memory usage due to large sets. It acts as an ordinary |
| 10 * hash set, but it uses 10 times more memory (by default). | 10 * hash set, but it uses 10 times more memory (by default). |
| 11 */ | 11 */ |
| 12 class ExpensiveSet<E> extends IterableBase<E> implements Set<E> { | 12 class ExpensiveSet<E> extends IterableBase<E> implements Set<E> { |
| 13 | 13 |
| 14 final List _sets; | 14 final List _sets; |
| 15 | 15 |
| (...skipping 99 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 115 if (objectsToRetain is Set) { | 115 if (objectsToRetain is Set) { |
| 116 retainSet = objectsToRetain; | 116 retainSet = objectsToRetain; |
| 117 } else { | 117 } else { |
| 118 retainSet = objectsToRetain.toSet(); | 118 retainSet = objectsToRetain.toSet(); |
| 119 } | 119 } |
| 120 retainWhere(retainSet.contains); | 120 retainWhere(retainSet.contains); |
| 121 } | 121 } |
| 122 | 122 |
| 123 String toString() => "expensive(${_sets[0]}x${_sets.length})"; | 123 String toString() => "expensive(${_sets[0]}x${_sets.length})"; |
| 124 } | 124 } |
| OLD | NEW |