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.helpers; | 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). |
(...skipping 112 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
123 Set<E> toSet() { | 123 Set<E> toSet() { |
124 var result = new ExpensiveSet<E>(_sets.length); | 124 var result = new ExpensiveSet<E>(_sets.length); |
125 for (int i = 0; i < _sets.length; i++) { | 125 for (int i = 0; i < _sets.length; i++) { |
126 result._sets[i] = _sets[i].toSet(); | 126 result._sets[i] = _sets[i].toSet(); |
127 } | 127 } |
128 return result; | 128 return result; |
129 } | 129 } |
130 | 130 |
131 String toString() => "expensive(${_sets[0]}x${_sets.length})"; | 131 String toString() => "expensive(${_sets[0]}x${_sets.length})"; |
132 } | 132 } |
OLD | NEW |