-
Notifications
You must be signed in to change notification settings - Fork 3
/
VdfTable.cs
282 lines (247 loc) · 7.28 KB
/
VdfTable.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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
using System.Collections.Generic;
using System.Linq;
using System;
namespace NeXt.Vdf
{
/// <summary>
/// A VdfValue that represents a table containing other VdfValues
/// </summary>
public sealed class VdfTable : VdfValue, IList<VdfValue>
{
public VdfTable(string name) : base(name) { }
public VdfTable(string name, IEnumerable<VdfValue> values) : this(name)
{
if (values == null)
{
throw new ArgumentNullException("values");
}
foreach(var val in values)
{
Add(val);
}
}
private List<VdfValue> values = new List<VdfValue>();
private Dictionary<string, VdfValue> valuelookup = new Dictionary<string,VdfValue>();
public int IndexOf(VdfValue item)
{
return values.IndexOf(item);
}
public void Insert(int index, VdfValue item)
{
if(item == null)
{
throw new ArgumentNullException("item");
}
if(index < 0 || index >= values.Count)
{
throw new ArgumentOutOfRangeException("index");
}
if(string.IsNullOrEmpty(item.Name))
{
throw new ArgumentException("item name cannot be empty or null");
}
if (ContainsName(item.Name))
{
throw new ArgumentException("a value with name " + item.Name + " already exists in the table");
}
item.Parent = this;
values.Insert(index, item);
valuelookup.Add(item.Name, item);
}
public void InsertAfter(VdfValue item, VdfValue newitem)
{
if(!Contains(item))
{
throw new ArgumentException("item needs to exist in this table", "item");
}
if (string.IsNullOrEmpty(newitem.Name))
{
throw new ArgumentException("newitem name cannot be empty or null");
}
if (ContainsName(newitem.Name))
{
throw new ArgumentException("a value with name " + newitem.Name + " already exists in the table");
}
int i = -1;
for(i = 0; i < values.Count; i++)
{
if(values[i] == item)
{
break;
}
}
if(i >= 0 && i < values.Count)
{
if(i == values.Count -1)
{
Add(newitem);
}
else
{
Insert(i + 1, newitem);
}
}
}
public void RemoveAt(int index)
{
var val = values[index];
values.RemoveAt(index);
valuelookup.Remove(val.Name);
}
public VdfValue this[int index]
{
get
{
return values[index];
}
set
{
if(values[index].Name != value.Name)
{
valuelookup.Remove(values[index].Name);
valuelookup.Add(value.Name, value);
}
else
{
valuelookup[value.Name] = value;
}
values[index] = value;
}
}
public VdfValue this[string name]
{
get
{
return valuelookup[name];
}
}
public void Add(VdfValue item)
{
if (item == null)
{
throw new ArgumentNullException("item");
}
if (string.IsNullOrEmpty(item.Name))
{
throw new ArgumentException("item name cannot be empty or null");
}
if (ContainsName(item.Name))
{
throw new ArgumentException("a value with name " + item.Name + " already exists in the table");
}
item.Parent = this;
values.Add(item);
valuelookup.Add(item.Name, item);
}
public void Clear()
{
values.Clear();
valuelookup.Clear();
}
public bool Contains(VdfValue item)
{
if (item == null)
{
throw new ArgumentNullException("item");
}
if (string.IsNullOrEmpty(item.Name))
{
throw new ArgumentException("item name cannot be empty or null");
}
return valuelookup.ContainsKey(item.Name) && (valuelookup[item.Name] == item);
}
public bool ContainsName(string name)
{
if (name == null)
{
throw new ArgumentNullException("name");
}
if (string.IsNullOrEmpty(name))
{
throw new ArgumentException("name cannot be empty");
}
return valuelookup.ContainsKey(name);
}
public VdfValue GetByName(string name)
{
if(ContainsName(name))
{
return valuelookup[name];
}
return null;
}
public void CopyTo(VdfValue[] array, int arrayIndex)
{
values.CopyTo(array, arrayIndex);
}
public int Count
{
get { return values.Count; }
}
public bool Remove(VdfValue item)
{
if (item == null)
{
throw new ArgumentNullException("item");
}
if (string.IsNullOrEmpty(item.Name))
{
throw new ArgumentException("item name cannot be empty or null");
}
if(Contains(item))
{
valuelookup.Remove(item.Name);
values.Remove(item);
return true;
}
return false;
}
public IEnumerator<VdfValue> GetEnumerator()
{
return values.GetEnumerator();
}
System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
{
return values.GetEnumerator();
}
bool ICollection<VdfValue>.IsReadOnly
{
get { return false; }
}
public void Traverse(Func<VdfValue, bool> call)
{
if (call == null)
{
throw new ArgumentNullException("call");
}
foreach (var value in values)
{
if (!call(value))
{
break;
}
}
}
public void TraverseRecursive(Func<VdfValue, bool> call)
{
if (call == null)
{
throw new ArgumentNullException("call");
}
foreach (var value in values)
{
if (value is VdfTable)
{
((VdfTable)value).TraverseRecursive(call);
}
else
{
if (!call(value))
{
break;
}
}
}
}
}
}