1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
#if NET_2_0
/*
Copyright (c) 2003-2004 Niels Kokholm <kokholm@itu.dk> and Peter Sestoft <sestoft@dina.kvl.dk>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
using System;
using MSG = System.Collections.Generic;
namespace C5
{
/// <summary>
/// A sorted generic dictionary based on a red-black tree set.
/// </summary>
public class TreeDictionary<K,V>: DictionaryBase<K,V>, IDictionary<K,V>, ISortedDictionary<K,V>
{
#region Fields
private TreeSet<KeyValuePair<K,V>> sortedpairs;
#endregion
#region Constructors
/// <summary>
/// Create a red-black tree dictionary using the natural comparer for keys.
/// <exception cref="ArgumentException"/> if the key type K is not comparable.
/// </summary>
public TreeDictionary() : this(ComparerBuilder.FromComparable<K>.Examine()) { }
/// <summary>
/// Create a red-black tree dictionary using an external comparer for keys.
/// </summary>
/// <param name="c">The external comparer</param>
public TreeDictionary(IComparer<K> c)
{
pairs = sortedpairs = new TreeSet<KeyValuePair<K,V>>(new KeyValuePairComparer<K,V>(c));
}
#endregion
#region ISortedDictionary<K,V> Members
/// <summary>
/// Get the entry in the dictionary whose key is the
/// predecessor of a specified key.
/// </summary>
/// <param name="key">The key</param>
/// <returns>The entry</returns>
[Tested]
public KeyValuePair<K,V> Predecessor(K key)
{
KeyValuePair<K,V> p = new KeyValuePair<K,V>(key);
return sortedpairs.Predecessor(p);
}
/// <summary>
/// Get the entry in the dictionary whose key is the
/// weak predecessor of a specified key.
/// </summary>
/// <param name="key">The key</param>
/// <returns>The entry</returns>
[Tested]
public KeyValuePair<K,V> WeakPredecessor(K key)
{
KeyValuePair<K,V> p = new KeyValuePair<K,V>(key);
return sortedpairs.WeakPredecessor(p);
}
/// <summary>
/// Get the entry in the dictionary whose key is the
/// successor of a specified key.
/// </summary>
/// <param name="key">The key</param>
/// <returns>The entry</returns>
[Tested]
public KeyValuePair<K,V> Successor(K key)
{
KeyValuePair<K,V> p = new KeyValuePair<K,V>(key);
return sortedpairs.Successor(p);
}
/// <summary>
/// Get the entry in the dictionary whose key is the
/// weak successor of a specified key.
/// </summary>
/// <param name="key">The key</param>
/// <returns>The entry</returns>
[Tested]
public KeyValuePair<K,V> WeakSuccessor(K key)
{
KeyValuePair<K,V> p = new KeyValuePair<K,V>(key);
return sortedpairs.WeakSuccessor(p);
}
#endregion
//TODO: put in interface
/// <summary>
/// Make a snapshot of the current state of this dictionary
/// </summary>
/// <returns>The snapshot</returns>
[Tested]
public MSG.IEnumerable<KeyValuePair<K,V>> Snapshot()
{
TreeDictionary<K,V> res = (TreeDictionary<K,V>)MemberwiseClone();
res.pairs = (TreeSet<KeyValuePair<K,V>>)sortedpairs.Snapshot();
return res;
}
}
}
#endif
|