1 2009-07-30 Raja R Harinath <harinath@hurrynot.org>
3 * HashSet.cs (Enumerator.CheckCurrent): Inline into ...
4 (Enumerator.IEnumerator.Current): ... this.
5 (Enumerator.IEnumerator.Reset): Check invariants.
7 2009-07-30 Raja R Harinath <harinath@hurrynot.org>
9 * HashSet.cs (Enumerator.next): Rename from Enumerator.current and
10 change meaning to be the index of the slot to start searching on
12 (Enumerator.current): New. Contains the current element.
13 (Enumerator.MoveNext): Update. Avoid an out-of-bounds access.
14 (Enumerator.Current): Don't check any invariants.
16 2009-07-09 Jb Evain <jbevain@novell.com>
18 * HashSet.cs (ICollection<T>.Add): fix for bug #520760. Do not throw
19 when adding duplicates.
21 2009-01-27 Jb Evain <jbevain@novell.com>
23 * HashSet.cs: use Paolo's trick to return items in insertion order
26 2008-12-17 Jb Evain <jbevain@novell.com>
28 * HashSet.cs (CopyTo): fix logic.
30 2008-09-12 Jb Evain <jbevain@novell.com>
32 * HashSet.cs (.ctor (IEnumerable<T>,*)): only get the count of the
33 enumerable if the source collection implements ICollection<T>, so that
34 we only iterate once over the source collection.
36 2008-04-29 Jb Evain <jbevain@novell.com>
38 * HashSet.cs: clear empty slots to allow the GC to collect
41 2007-11-30 Jb Evain <jbevain@novell.com>
43 * HashSet.cs: corcompare love.
45 2007-11-28 Jb Evain <jbevain@novell.com>
47 * HashSet.cs: do the ArgumentNullException dance.
49 2007-11-28 Jb Evain <jbevain@novell.com>
51 * HashSet.cs: start implementation of HashSet<T>, actually
52 implemented as a reduction of Dictionary<K, V>. Contains
53 basic set operations (that requires optimization though).
55 2007-08-12 Marek Safar <marek.safar@gmail.com>