Jb Evain
d439169d83
2009-01-27 Jb Evain <[email protected] >
...
* HashSet.cs: use Paolo's trick to return items in insertion order
when possible.
svn path=/trunk/mcs/; revision=124656
2009-01-27 13:29:58 +00:00
Jb Evain
09be3088ea
fix properly
...
svn path=/trunk/mcs/; revision=121704
2008-12-17 16:31:59 +00:00
Jb Evain
b61f0a3393
2008-12-17 Jb Evain <[email protected] >
...
* HashSet.cs (CopyTo): fix logic.
svn path=/trunk/mcs/; revision=121700
2008-12-17 16:11:39 +00:00
Jb Evain
3a847b4c67
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.
svn path=/trunk/mcs/; revision=112897
2008-09-12 18:34:13 +00:00
Jb Evain
b1a3a203ab
2008-04-29 Jb Evain <[email protected] >
...
* HashSet.cs: clear empty slots to allow the GC to collect
their values.
svn path=/trunk/mcs/; revision=102115
2008-04-29 13:10:03 +00:00
Jb Evain
f825831e51
2007-11-30 Jb Evain <[email protected] >
...
* HashSet.cs: corcompare love.
svn path=/trunk/mcs/; revision=90460
2007-11-30 00:03:28 +00:00
Jb Evain
8c4195f800
null dance
...
svn path=/trunk/mcs/; revision=90410
2007-11-28 21:29:12 +00:00
Jb Evain
6e33ffc7f1
2007-11-28 Jb Evain <[email protected] >
...
* HashSet.cs: do the ArgumentNullException dance.
svn path=/trunk/mcs/; revision=90409
2007-11-28 21:11:30 +00:00
Jb Evain
9b338fbc35
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).
svn path=/trunk/mcs/; revision=90406
2007-11-28 20:53:38 +00:00
Marek Safar
396d29e163
Added 2 empty stubs
...
svn path=/trunk/mcs/; revision=87446
2007-10-13 18:27:48 +00:00
Marek Safar
53a08c5ed3
A few Beta2 Updates
...
svn path=/trunk/mcs/; revision=83910
2007-08-12 15:46:25 +00:00