1 2010-04-05 Raja R Harinath <harinath@hurrynot.org>
3 * SortedSet.cs (IsProperSubsetOf, IsSubsetOf): Implement using ...
4 (is_subset_of): ... new helper.
5 (IsProperSupersetOf, IsSupersetOf): Implement using ...
6 (is_superset_of): ... new helper.
7 (covers, nodups, overlaps): New helpers.
8 (SetEquals): Implement.
9 (Overlaps): Implement using overlaps().
10 (SymmetricExceptWith): Use nodups() helper.
12 2010-04-04 Raja R Harinath <harinath@hurrynot.org>
14 * SortedSet.cs (CheckArgumentNotNull): New helper.
15 (IntersectWith, UnionWith): Implement.
16 (ExceptWith, SymmetricExceptWith): Likewise.
17 (SortedSubSet.IntersectWith): Implement override.
19 * RBTree.cs (do_remove): Ensure the node returned is suitable for
22 2010-04-02 Jb Evain <jbevain@novell.com>
24 * SortedSet.cs: implement Mix and Max for subsets.
26 2010-04-02 Jb Evain <jbevain@novell.com>
28 * SortedSet.cs: implement GetViewBetween.
30 2010-04-02 Jb Evain <jbevain@novell.com>
32 * SortedSet.cs: optimize Reverse. Add a virtual TryAdd and TryRemove
33 to override in sub trees.
35 2010-04-02 Jb Evain <jbevain@novell.com>
37 * SortedSet.cs: implement Min and Max.
39 2010-04-02 Jb Evain <jbevain@novell.com>
41 * SortedSet.cs: implement RemoveWhere.
43 2010-04-02 Jb Evain <jbevain@novell.com>
45 * SortedSet.cs: implement Reverse.
47 2010-04-01 Jb Evain <jbevain@novell.com>
49 * SortedSet.cs: fix API.
51 2010-04-01 Jb Evain <jbevain@novell.com>
53 * SortedSet.cs: add new SortedSet type in .net 4.0
55 2010-03-03 Miguel de Icaza <miguel@novell.com>
57 * RBTree.cs: Make these serializable, should fix the serialization
58 across appdomains of SortedDictionaries
60 2010-03-11 Sebastien Pouliot <sebastien@ximian.com>
62 * ISet.cs: Add NET_2_1 since this is part of SL4
64 2009-12-01 Jb Evain <jbevain@novell.com>
66 * Stack.cs (Enumerator.Dispose): tag the enumerator as finished
69 2009-11-26 Marek Safar <marek.safar@gmail.com>
71 * LinkedList.cs: Allocate less.
73 2009-11-25 Jb Evain <jbevain@novell.com>
75 * Queue.cs (Enqueue): deal with the case where the tail
76 is off the array when deciding to enlarge the capacity.
78 2009-11-25 Jb Evain <jbevain@novell.com>
80 * Queue.cs (ICollection.CopyTo): fix typo, remove code duplication.
82 2009-11-02 Miguel de Icaza <miguel@novell.com>
84 * ISet.cs: Added new interface.
86 2009-10-20 Marek Safar <marek.safar@gmail.com>
88 * SortedList.cs, LinkedList.cs, Queue.cs, Stack.cs,
89 SortedDictionary.cs: Improve debugging experience.
91 2009-07-31 Raja R Harinath <harinath@hurrynot.org>
93 * RBTree.cs (NodeEnumerator.check_current): New helper.
94 (NodeEnumerator.Current): Don't check invariants.
95 * SortedDictionary.cs (Enumerator.Current): Likewise.
96 (ValueCollection.Enumerator.Current): Likewise.
97 (KeyCollection.Enumerator.Current): Likewise.
99 2009-07-26 Miguel de Icaza <miguel@novell.com>
101 * Stack.cs: Check arguments.
103 2009-07-14 Gonzalo Paniagua Javier <gonzalo@novell.com>
105 * SortedList.cs: the IComparar.Compare arguments were reversed.
106 Fixes bug #521750. Patch by Kevin Fitzgerald.
108 2009-05-10 Andy Hume <andyhume32@yahoo.co.uk>
110 * LinkedList.cs: Add null check. Fixes #481621.
112 2009-03-11 Zoltan Varga <vargaz@gmail.com>
114 * SortedList.cs: Add version checking to the Key/Value enumerators +
115 implement support for Reset (). Fixes #483985.
117 2009-05-06 Pia Eriksson <pe@hallerud.se>
119 * SortedList.cs: Handle Count == 0 in CopyTo correcly
120 * SortedDictionary.cs: Handle Count == 0 in CopyTo correcly
122 2007-11-15 Roei Erez <roeie@mainsoft.com>
124 * Stack.cs: Performance improvement in the case where the stack is popped
125 until empty. Changed the condition for resizing the array, and instead of
126 check for zero size, check if the inner array is null.
128 2007-11-15 Jb Evain <jbevain@novell.com>
130 * LinkedList.cs: ifdef out manually the Serialization part of the
131 LinkedList.Enumerator. As it is a struct, the field SerializationInfo
132 have to be assigned in the default constructor, and the tuner cannot
133 remove that. Fixes #341938 for real.
135 2007-10-09 Raja R Harinath <rharinath@novell.com>
137 * RBTree.cs (get_Item, do_remove): Remove redundant code.
139 2007-08-20 Jb Evain <jbevain@novell.com>
141 * SortedList.cs: don't crash in ListKeys and ListValues
142 when CopyTo targets an empty array, and that the
143 sorted list is empty. Fixes #82492.
145 2007-05-08 Raja R Harinath <rharinath@novell.com>
147 Avoid unnecessary allocation on indexer access
148 * SortedDictionary.cs (NodeHelper): Rename from NodeComparer.
149 (NodeHelper.CreateNode): New.
150 (Item.set): Move responsibility of creating new nodes to
152 * RBTree.cs (INodeHelper): Rename from INodeComparer.
153 (INodeHelper.CreateNode): New.
154 (Intern): Use it to create a new node if no node is passed in.
156 2007-05-08 Igor Zelmanovich <igorz@mainsoft.com>
158 * RBTree.cs: for TARGET_JVM used Thread Local Storage
159 istead Thread-Relative Static Fields
161 2007-05-02 Raja R Harinath <rharinath@novell.com>
163 * RBTree.cs (Enumerator.Current): Remove nullref.
165 * SortedDictionary.cs (ICollection.Contains): Use EqualityComparer
166 for comparing the value field.
168 * RBTree.cs (do_remove): Remove some redundant assignments/checks.
169 (NodeEnumerator): Simplify. Keep track of a list of
170 right-pennants that need to be traversed next, rather than
171 comparing parent pointers.
173 2007-05-02 Raja R Harinath <harinath@gmail.com>
175 Make add and remove operations O(log n).
176 * SortedDictionary.cs: Rewrite to use the red-black tree
177 implementation from RBTree.cs.
178 * RBTree.cs: Some more refactoring. Rename Insert() to Intern(),
179 and modify semantics slightly. Replace Contains() with Lookup().
181 2007-04-30 Raja R Harinath <rharinath@novell.com>
183 * RBTree.cs: Refactor to reduce generics code.
185 2007-04-30 Raja R Harinath <harinath@gmail.com>
187 * RBTree.cs: New red-black tree implementation for use with
190 2007-04-19 Gert Driesen <drieseng@users.sourceforge.net>
192 * Queue.cs: Fixed binary serialization, based on patch provided by
193 Lionel Cuir. Fixes TrimExcess to use SetCapacity, before it was not
194 updating _head which could lead to IndexOutOfRangeException.
195 * Stack.cs: Fixed binary serialization, based on patch provided by
196 Lionel Cuir. In Pop, clear entry from array to help GC.
198 2007-03-27 Alan McGovern <alan.mcgovern@gmail.com>
200 * Queue.cs: Removed wrong call to version++
201 * Stack.cs: Removed wrong call to version++
203 2006-09-30 Gert Driesen <drieseng@users.sourceforge.net>
205 * SortedList.cs: Count property, indexer and Clear method should not
206 be virtual. Removed unnecessary explicit interface implementation of
207 Add (TKey, TValue) and Remove (TKey, TValue).
208 * Queue.cs: Marked Enumerator as Serializable.
209 * Stack.cs: Marked Stack <T> and Enumerator as serializable.
211 2006-09-28 Andrew Skiba <andrews@mainsoft.com>
213 * Stack.cs: TARGET_JVM
215 2006-04-05 Atsushi Enomoto <atsushi@ximian.com>
217 * SortedDictionary.cs : new file. The original code is mostly
220 2006-03-11 Miguel de Icaza <miguel@novell.com>
222 * Queue.cs: Flag as serializable.
224 * LinkedList.cs (OnDeserialization): Fix signature.
226 * SortedList.cs: Implement explicitly a few methods that were
227 flagged by corcompare.
229 2005-11-10 Zoltan Varga <vargaz@gmail.com>
231 * SortedList.cs Queue.cs Stack.cs: Implement TrimExcess methods.
233 * SortedList.cs: Fix build.
235 * Stack.cs SortedList.cs LinkedList.cs: Update to net 2.0 RTM.
237 2005-11-09 Zoltan Varga <vargaz@gmail.com>
239 * SortedList.cs: New file.
241 2005-09-04 David Waite <mass@akuma.org>
243 * LinkedList.cs, LinkedListNode.cs: added implementation of LinkedList<T>
245 2005-08-08 Kamil Skalski <nazgul@nemerle.org>
247 * Queue.cs, Stack.cs: remove implementation of ICollection<T>,
248 since it is no longer in b2 API
250 2005-06-20 David Waite <mass@akuma.org>
252 * Collection.cs, ReadOnlyCollection.cs: removed as they are no longer in the b2 API
254 2005-05-13 Atsushi Enomoto <atsushi@ximian.com>
256 * Queue.cs, Stack.cs: moved from mscorlib.dll
258 2005-02-35 Carlos Alberto Cortez <calberto.cortez@gmail.com>
260 * Collections.cs: Changed the code inside IndexOf, for
261 the use of Array.IndexOf<>, to keep clean the code.
263 2004-11-17 Carlos Alberto Cortez Guevara <carlos@unixmexico.org>
265 * Collections.cs: Avoid the call to Array.Clear () in RemoveItem (),
266 now we only assign the last element (the deleted one) to its default
269 2004-09-20 Gert Driesen <drieseng@users.sourceforge.net>
271 * ReadOnlyCollection.cs: Moved over from corlib
272 * Collection.cs: Moved over from corlib