Home Explore Help
Sign In
c
/
mono
mirror of https://github.com/mono/mono.git
2
0
Fork 0
Files Issues 0 Wiki
Tree: ad42775d82
Branches Tags
mono
/
mcs
/
class
/
System.Core
/
System.Collections.Generic
/
ChangeLog

ChangeLog 2.0 KB
History Raw

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970 
  1. 2010-04-16  Sebastien Pouliot  <[email protected]>
    2. 

  2. 

  3. 	* HashSet.cs: Implement ISet<T> in MOONLIGHT too
    4. 

  4. 

  5. 2010-02-13 Gonzalo Paniagua Javier <[email protected]>
    6. 

  6. 

  7. 	* HashSet.cs: fix and test for bug #579791.  Patch from Tiaan
    8. 

  8. 	Geldenhuys.
    9. 

  9. 

  10. 2009-11-13  Marek Safar  <[email protected]>
    11. 

  11. 

  12. 	* HasSet.cs: Add ISet, debugger view.
    13. 

  13. 

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

  15. 

  16. 	* HashSet.cs (Enumerator.CheckCurrent): Inline into ...
    17. 

  17. 	(Enumerator.IEnumerator.Current): ... this.
    18. 

  18. 	(Enumerator.IEnumerator.Reset): Check invariants.
    19. 

  19. 

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

  21. 

  22. 	* HashSet.cs (Enumerator.next): Rename from Enumerator.current and
    23. 

  23. 	change meaning to be the index of the slot to start searching on
    24. 

  24. 	the next iteration.
    25. 

  25. 	(Enumerator.current): New.  Contains the current element.
    26. 

  26. 	(Enumerator.MoveNext): Update.  Avoid an out-of-bounds access.
    27. 

  27. 	(Enumerator.Current): Don't check any invariants.
    28. 

  28. 

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

  30. 

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

  32. 	when adding duplicates.
    33. 

  33. 

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

  35. 

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

  37. 	when possible.
    38. 

  38. 

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

  40. 

  41. 	* HashSet.cs (CopyTo): fix logic.
    42. 

  42. 

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

  44. 

  45. 	* HashSet.cs (.ctor (IEnumerable<T>,*)): only get the count of the
    46. 

  46. 	enumerable if the source collection implements ICollection<T>, so that
    47. 

  47. 	we only iterate once over the source collection.
    48. 

  48. 

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

  50. 

  51. 	* HashSet.cs: clear empty slots to allow the GC to collect
    52. 

  52. 	their values.
    53. 

  53. 

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

  55. 

  56. 	* HashSet.cs: corcompare love.
    57. 

  57. 

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

  59. 

  60. 	* HashSet.cs: do the ArgumentNullException dance.
    61. 

  61. 

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

  63. 

  64. 	* HashSet.cs: start implementation of HashSet<T>, actually
    65. 

  65. 	implemented as a reduction of Dictionary<K, V>. Contains
    66. 

  66. 	basic set operations (that requires optimization though).
    67. 

  67. 

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

  69. 

  70.     * Initial commit
    71.