2 Copyright (c) 2003-2006 Niels Kokholm and Peter Sestoft
\r
3 Permission is hereby granted, free of charge, to any person obtaining a copy
\r
4 of this software and associated documentation files (the "Software"), to deal
\r
5 in the Software without restriction, including without limitation the rights
\r
6 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
\r
7 copies of the Software, and to permit persons to whom the Software is
\r
8 furnished to do so, subject to the following conditions:
\r
10 The above copyright notice and this permission notice shall be included in
\r
11 all copies or substantial portions of the Software.
\r
13 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
\r
14 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
\r
15 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
\r
16 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
\r
17 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
\r
18 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
\r
24 using NUnit.Framework;
\r
25 using SCG=System.Collections.Generic;
\r
28 namespace C5UnitTests.trees.RBDictionary
\r
30 static class Factory
\r
32 public static IDictionary<K,V> New<K,V>() { return new TreeDictionary<K,V>(); }
\r
37 public class Formatting
\r
39 IDictionary<int,int> coll;
\r
40 IFormatProvider rad16;
\r
42 public void Init() { coll = Factory.New<int,int>(); rad16 = new RadixFormatProvider(16); }
\r
44 public void Dispose() { coll = null; rad16 = null; }
\r
46 public void Format()
\r
48 Assert.AreEqual("[ ]", coll.ToString());
\r
49 coll.Add(23, 67); coll.Add(45, 89);
\r
50 Assert.AreEqual("[ 23 => 67, 45 => 89 ]", coll.ToString());
\r
51 Assert.AreEqual("[ 17 => 43, 2D => 59 ]", coll.ToString(null, rad16));
\r
52 Assert.AreEqual("[ 23 => 67, ... ]", coll.ToString("L14", null));
\r
53 Assert.AreEqual("[ 17 => 43, ... ]", coll.ToString("L14", rad16));
\r
60 private TreeDictionary<string,string> dict;
\r
64 public void Init() { dict = new TreeDictionary<string,string>(new SC()); }
\r
68 public void Dispose() { dict = null; }
\r
71 [ExpectedException(typeof(NullReferenceException))]
\r
72 public void NullEqualityComparerinConstructor1()
\r
74 new TreeDictionary<int,int>(null);
\r
78 public void Choose()
\r
80 dict.Add("YES","NO");
\r
81 Assert.AreEqual(new KeyValuePair<string,string>("YES","NO"), dict.Choose());
\r
85 [ExpectedException(typeof(NoSuchItemException))]
\r
86 public void BadChoose()
\r
97 Assert.AreEqual("1", dict.Predecessor("B").Value);
\r
98 Assert.AreEqual("1", dict.Predecessor("C").Value);
\r
99 Assert.AreEqual("1", dict.WeakPredecessor("B").Value);
\r
100 Assert.AreEqual("2", dict.WeakPredecessor("C").Value);
\r
101 Assert.AreEqual("2", dict.Successor("B").Value);
\r
102 Assert.AreEqual("3", dict.Successor("C").Value);
\r
103 Assert.AreEqual("2", dict.WeakSuccessor("B").Value);
\r
104 Assert.AreEqual("2", dict.WeakSuccessor("C").Value);
\r
109 public void Initial()
\r
112 Assert.IsFalse(dict.IsReadOnly);
\r
114 Assert.AreEqual(dict.Count, 0, "new dict should be empty");
\r
115 dict.Add("A", "B");
\r
116 Assert.AreEqual(dict.Count, 1, "bad count");
\r
117 Assert.AreEqual(dict["A"], "B", "Wrong value for dict[A]");
\r
118 dict.Add("C", "D");
\r
119 Assert.AreEqual(dict.Count, 2, "bad count");
\r
120 Assert.AreEqual(dict["A"], "B", "Wrong value");
\r
121 Assert.AreEqual(dict["C"], "D", "Wrong value");
\r
122 res = dict.Remove("A");
\r
123 Assert.IsTrue(res, "bad return value from Remove(A)");
\r
124 Assert.IsTrue(dict.Check());
\r
125 Assert.AreEqual(dict.Count, 1, "bad count");
\r
126 Assert.AreEqual(dict["C"], "D", "Wrong value of dict[C]");
\r
127 res = dict.Remove("Z");
\r
128 Assert.IsFalse(res, "bad return value from Remove(Z)");
\r
129 Assert.AreEqual(dict.Count, 1, "bad count");
\r
130 Assert.AreEqual(dict["C"], "D", "Wrong value of dict[C] (2)");
\r
132 Assert.AreEqual(dict.Count, 0, "dict should be empty");
\r
135 public void Contains()
\r
137 dict.Add("C", "D");
\r
138 Assert.IsTrue(dict.Contains("C"));
\r
139 Assert.IsFalse(dict.Contains("D"));
\r
144 [ExpectedException(typeof(DuplicateNotAllowedException), "Key being added: 'A'")]
\r
145 public void IllegalAdd()
\r
147 dict.Add("A", "B");
\r
148 dict.Add("A", "B");
\r
153 [ExpectedException(typeof(NoSuchItemException))]
\r
154 public void GettingNonExisting()
\r
156 Console.WriteLine(dict["R"]);
\r
161 public void Setter()
\r
163 dict["R"] = "UYGUY";
\r
164 Assert.AreEqual(dict["R"], "UYGUY");
\r
165 dict["R"] = "UIII";
\r
166 Assert.AreEqual(dict["R"], "UIII");
\r
168 Assert.AreEqual(dict["R"], "UIII");
\r
169 Assert.AreEqual(dict["S"], "VVV");
\r
175 public class Enumerators
\r
177 private TreeDictionary<string,string> dict;
\r
179 private SCG.IEnumerator<KeyValuePair<string,string>> dictenum;
\r
185 dict = new TreeDictionary<string,string>(new SC());
\r
189 dictenum = dict.GetEnumerator();
\r
194 public void Dispose()
\r
205 SCG.IEnumerator<string> keys = dict.Keys.GetEnumerator();
\r
206 Assert.AreEqual(3, dict.Keys.Count);
\r
207 Assert.IsTrue(keys.MoveNext());
\r
208 Assert.AreEqual("R",keys.Current);
\r
209 Assert.IsTrue(keys.MoveNext());
\r
210 Assert.AreEqual("S",keys.Current);
\r
211 Assert.IsTrue(keys.MoveNext());
\r
212 Assert.AreEqual("T",keys.Current);
\r
213 Assert.IsFalse(keys.MoveNext());
\r
217 public void Values()
\r
219 SCG.IEnumerator<string> values = dict.Values.GetEnumerator();
\r
220 Assert.AreEqual(3, dict.Values.Count);
\r
221 Assert.IsTrue(values.MoveNext());
\r
222 Assert.AreEqual("C",values.Current);
\r
223 Assert.IsTrue(values.MoveNext());
\r
224 Assert.AreEqual("A",values.Current);
\r
225 Assert.IsTrue(values.MoveNext());
\r
226 Assert.AreEqual("B",values.Current);
\r
227 Assert.IsFalse(values.MoveNext());
\r
233 Assert.AreEqual("B", dict.Fun("T"));
\r
238 public void NormalUse()
\r
240 Assert.IsTrue(dictenum.MoveNext());
\r
241 Assert.AreEqual(dictenum.Current, new KeyValuePair<string,string>("R", "C"));
\r
242 Assert.IsTrue(dictenum.MoveNext());
\r
243 Assert.AreEqual(dictenum.Current, new KeyValuePair<string,string>("S", "A"));
\r
244 Assert.IsTrue(dictenum.MoveNext());
\r
245 Assert.AreEqual(dictenum.Current, new KeyValuePair<string,string>("T", "B"));
\r
246 Assert.IsFalse(dictenum.MoveNext());
\r
253 namespace PathCopyPersistence
\r
256 public class Simple
\r
258 private TreeDictionary<string,string> dict;
\r
260 private TreeDictionary<string,string> snap;
\r
266 dict = new TreeDictionary<string,string>(new SC());
\r
271 snap = (TreeDictionary<string,string>)dict.Snapshot();
\r
279 Assert.AreEqual(5, dict.Count);
\r
280 Assert.AreEqual(4, snap.Count);
\r
282 Assert.AreEqual(5, dict.Count);
\r
283 Assert.AreEqual(4, snap.Count);
\r
284 Assert.AreEqual("B", snap["T"]);
\r
285 Assert.AreEqual("bb", dict["T"]);
\r
286 Assert.IsFalse(dict.IsReadOnly);
\r
287 Assert.IsTrue(snap.IsReadOnly);
\r
288 //Finally, update of root node:
\r
289 TreeDictionary<string,string> snap2 = (TreeDictionary<string,string>)dict.Snapshot();
\r
291 Assert.AreEqual("abe", dict["S"]);
\r
296 [ExpectedException(typeof(ReadOnlyCollectionException))]
\r
297 public void UpdateSnap()
\r
304 public void Dispose()
\r