languages/dart-sdk
languages/dart-sdk
1
0
Fork 0
mirror of https://github.com/dart-lang/sdk synced 2024-10-06 15:50:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Improve document for HashSet.

Browse source 
See #28083 (http://dartbug.com/28083)

R=lrn@google.com

Review-Url: https://codereview.chromium.org/2567393002 .
This commit is contained in:
Florian Loitsch 2016-12-13 15:08:58 +01:00
parent cc2b071743
commit 7ee023d2ed
1 changed files with 10 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
sdk/lib/collection/hash_set.dart
View file

@ -45,9 +45,14 @@ abstract class _HashSetBase<E> extends SetBase<E> {
*
* The set allows `null` as an element.
*
* Most simple operations on `HashSet` are done in (potentially amorteized)
* Most simple operations on `HashSet` are done in (potentially amortized)
* constant time: [add], [contains], [remove], and [length], provided the hash
* codes of objects are well distributed.
*
* The iteration order of the set is not specified and depends on
* the hashcodes of the provided elements. However, the order is stable:
* multiple iterations over the same set produce the same order, as long as
* the set is not modified.
*/
abstract class HashSet<E> implements Set<E> {
/**
@ -108,8 +113,10 @@ abstract class HashSet<E> implements Set<E> {
/**
* Create a hash set containing all [elements].
*
* Creates a hash set as by `new HashSet<E>()` and adds each element of
* `elements` to this set in the order they are iterated.
* Creates a hash set as by `new HashSet<E>()` and adds all given [elements]
* to the set. The elements are added in order. If [elements] contains
* two entries that are equal, but not identical, then the first one is
* the one in the resulting set.
*
* All the [elements] should be assignable to [E].
* The `elements` iterable itself may have any element type, so this