mono/mcs/class/System.Core/System.Collections.Generic/ChangeLog

2009-07-30  Raja R Harinath  <[email protected]>

	* HashSet.cs (Enumerator.CheckCurrent): Inline into ...
	(Enumerator.IEnumerator.Current): ... this.
	(Enumerator.IEnumerator.Reset): Check invariants.

2009-07-30  Raja R Harinath  <[email protected]>

	* HashSet.cs (Enumerator.next): Rename from Enumerator.current and
	change meaning to be the index of the slot to start searching on
	the next iteration.
	(Enumerator.current): New.  Contains the current element.
	(Enumerator.MoveNext): Update.  Avoid an out-of-bounds access.
	(Enumerator.Current): Don't check any invariants.

2009-07-09  Jb Evain  <[email protected]>

	* HashSet.cs (ICollection<T>.Add): fix for bug #520760. Do not throw
	when adding duplicates.

2009-01-27  Jb Evain  <[email protected]>

	* HashSet.cs: use Paolo's trick to return items in insertion order
	when possible.

2008-12-17  Jb Evain  <[email protected]>

	* HashSet.cs (CopyTo): fix logic.

2008-09-12  Jb Evain  <[email protected]>

	* HashSet.cs (.ctor (IEnumerable<T>,*)): only get the count of the
	enumerable if the source collection implements ICollection<T>, so that
	we only iterate once over the source collection.

2008-04-29  Jb Evain  <[email protected]>

	* HashSet.cs: clear empty slots to allow the GC to collect
	their values.

2007-11-30  Jb Evain  <[email protected]>

	* HashSet.cs: corcompare love.

2007-11-28  Jb Evain  <[email protected]>

	* HashSet.cs: do the ArgumentNullException dance.

2007-11-28  Jb Evain  <[email protected]>

	* HashSet.cs: start implementation of HashSet<T>, actually
	implemented as a reduction of Dictionary<K, V>. Contains
	basic set operations (that requires optimization though).

2007-08-12  Marek Safar  <[email protected]>

    * Initial commit