Chromium Code Reviews| Index: sdk/lib/core/set.dart |
| diff --git a/sdk/lib/core/set.dart b/sdk/lib/core/set.dart |
| index aaab5ec465ecf0a14e9a370ba220c8f0030d694f..fe5a70b0f7c1ac692eef8129e359d1e96288dd2c 100644 |
| --- a/sdk/lib/core/set.dart |
| +++ b/sdk/lib/core/set.dart |
| @@ -5,13 +5,13 @@ |
| part of dart.core; |
| /** |
| - * A `Set` is a collection of elements where each element can occur only once. |
| + * A collection of objects in which each object can occur only once. |
| * |
| * That is, for each object of the element type, the object is either considered |
|
mem
2013/09/13 16:05:09
[Element] type?
Or delete "of the element type".
|
| - * to be in the set, or it is not in the set. |
| + * to be in the set, or to _not_ be in the set. |
| * |
| * Set implementations may consider some elements indistinguishable. These |
|
mem
2013/09/13 16:05:09
elements -> objects
|
| - * objects will be treated as being the same for any operation on the set. |
| + * objects are treated as being the same for any operation on the set. |
| * |
| * The default `Set` implementation, [HashSet], considers objects |
| * indistinguishable if they are equal with regard to [Object.operator==]. |