Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2011, 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 dart.core; | 5 part of dart.core; |
| 6 | 6 |
| 7 /** | 7 /** |
| 8 * A `Set` is a collection of elements where each element can occur only once. | 8 * A collection of objects in which each object can occur only once. |
| 9 * | 9 * |
| 10 * That is, for each object of the element type, the object is either considered | 10 * That is, for each object of the element type, the object is either considered |
| 11 * to be in the set, or it is not in the set. | 11 * to be in the set, or to _not_ be in the set. |
|
Lasse Reichstein Nielsen
2016/08/31 18:57:37
Trailing space, please remove.
| |
| 12 * | 12 * |
| 13 * Set implementations may consider some elements indistinguishable. These | 13 * Set implementations may consider some elements indistinguishable. These |
| 14 * objects will be treated as being the same for any operation on the set. | 14 * elements are treated as being the same for any operation on the set. |
| 15 * | 15 * |
| 16 * The default `Set` implementation, [HashSet], considers objects | 16 * The default `Set` implementation, [HashSet], considers objects |
| 17 * indistinguishable if they are equal with regard to [Object.operator==]. | 17 * indistinguishable if they are equal with regard to [Object.operator==]. |
| 18 * | 18 * |
| 19 * Sets may be either ordered or unordered. [HashSet] is unordered and doesn't | 19 * Sets may be either ordered or unordered. [HashSet] is unordered and doesn't |
| 20 * guarantee anything about the order that elements are accessed in by | 20 * guarantee anything about the order that elements are accessed in by |
| 21 * iteration. [LinkedHashSet] iterates in the insertion order of its elements. | 21 * iteration. [LinkedHashSet] iterates in the insertion order of its elements. |
| 22 */ | 22 */ |
| 23 abstract class Set<E> extends IterableBase<E> { | 23 abstract class Set<E> extends IterableBase<E> { |
| 24 /** | 24 /** |
| (...skipping 88 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 113 * That is, the returned set contains all the elements of this `Set` that | 113 * That is, the returned set contains all the elements of this `Set` that |
| 114 * are not elements of [other]. | 114 * are not elements of [other]. |
| 115 */ | 115 */ |
| 116 Set<E> difference(Set<E> other); | 116 Set<E> difference(Set<E> other); |
| 117 | 117 |
| 118 /** | 118 /** |
| 119 * Removes all elements in the set. | 119 * Removes all elements in the set. |
| 120 */ | 120 */ |
| 121 void clear(); | 121 void clear(); |
| 122 } | 122 } |
| OLD | NEW |