-
Notifications
You must be signed in to change notification settings - Fork 16
/
Dictionary_U.cs
201 lines (184 loc) · 5.76 KB
/
Dictionary_U.cs
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
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
namespace mapf;
/// <summary>
/// This class represents a union of Dictionaries, which each map <typeparamref name="K"/>
/// to a List of <typeparamref name="V"/>.
/// It is similar to Python's collections.ChainMap, but 1) read-only, 2) a combined list of V
/// elements is returned instead of just the first match.
/// </summary>
[DebuggerDisplay("count = {Count}")]
[Serializable]
public class Dictionary_U<K, V> : IReadOnlyDictionary<K, List<V>>
{
List<IReadOnlyDictionary<K, List<V>>> Data;
public Dictionary_U()
{
this.Data = new List<IReadOnlyDictionary<K, List<V>>>();
}
IEnumerator IEnumerable.GetEnumerator()
{
foreach (IReadOnlyDictionary<K, List<V>> dict in Data)
{
foreach (KeyValuePair<K, List<V>> item in dict)
{
yield return item;
}
}
// FIXME: This can yield the same key multiple times
}
public IEnumerator<KeyValuePair<K, List<V>>> GetEnumerator()
{
foreach (IReadOnlyDictionary<K, List<V>> dict in Data)
{
foreach (KeyValuePair<K, List<V>> item in dict)
{
yield return item;
}
}
// FIXME: This can yield the same key multiple times
}
/// <summary>
/// Gets an enumerable collection that contains the keys in the read-only dictionary.
/// Warning: May contain duplicates if multiple inner dicts have the same key.
/// </summary>
/// <returns>An enumerable collection that contains the keys in the read-only dictionary.</returns>
public IEnumerable<K> Keys
{
get
{
foreach (IReadOnlyDictionary<K, List<V>> dict in Data)
{
foreach (KeyValuePair<K, List<V>> item in dict)
{
yield return item.Key;
}
}
}
// FIXME: This can yield the same key multiple times
}
/// <summary>
/// Gets an enumerable collection that contains the values in the read-only dictionary.
/// </summary>
/// <returns>
/// An enumerable collection that contains the values in the read-only dictionary.
/// </returns>
public IEnumerable<List<V>> Values
{
get
{
foreach (IReadOnlyDictionary<K, List<V>> dict in Data)
{
foreach (KeyValuePair<K, List<V>> item in dict)
{
yield return item.Value;
}
}
}
}
/// <summary>
/// Gets a combined list of the values mapped to the specified key in the combined dictionaries.
/// </summary>
/// <param name="key">The key to locate.</param>
/// <returns>A combined list of the values mapped to the specified key in the combined dictionaries.</returns>
/// <exception cref="System.ArgumentNullException">key is null.</exception>
/// <exception cref="System.Collections.Generic.KeyNotFoundException">key is not found.</exception>
public List<V> this[K key]
{
get
{
var ret = new List<V>();
foreach (IReadOnlyDictionary<K, List<V>> dict in Data)
{
if (dict.ContainsKey(key))
ret.AddRange(dict[key]);
}
if (ret.Count == 0)
throw new KeyNotFoundException();
return ret;
}
}
/// <summary>
/// Gets a combined list of values mapped to the specified key in the combined dictionaries, or null if none
/// are found.
/// </summary>
/// <param name="key"></param>
/// <param name="value"></param>
/// <returns></returns>
public bool TryGetValue(K key, out List<V> value)
{
if (this.ContainsKey(key))
{
value = this[key];
return true;
}
else
{
value = null;
return false;
}
}
/// <summary>
/// Returns whether the specified key exists in any of the combined dictionaries
/// </summary>
/// <param name="key">The key to look for</param>
/// <returns></returns>
public bool ContainsKey(K key)
{
foreach (IReadOnlyDictionary<K, List<V>> item in Data)
{
if (item.ContainsKey(key))
return true;
}
return false;
}
/// <summary>
/// Remove all dictionaries from the union. Does not clear them.
/// </summary>
public void Clear()
{
Data.Clear();
}
/// <summary>
/// Add a dictionary to the union
/// </summary>
/// <param name="other">the dictionary to add</param>
public void Join(IReadOnlyDictionary<K, List<V>> other)
{
Data.Add(other);
}
/// <summary>
/// Remove a dictionary from the union
/// </summary>
/// <param name="other">the dictionary to add</param>
public void Separate(IReadOnlyDictionary<K, List<V>> other)
{
Data.Remove(other);
}
/// <summary>
/// Not used.
/// </summary>
public void Print()
{
foreach (IReadOnlyDictionary<K, List<V>> dict in Data)
{
foreach (KeyValuePair<K, List<V>> item in dict)
{
Console.WriteLine(item);
}
}
}
/// <summary>
/// Gets the number of keys in the Dictionary.
/// </summary>
public int Count
{
get
{
return this.Data.Sum<IReadOnlyDictionary<K, List<V>>>(dict => dict.Count);
}
}
}