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