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
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
|
using System;
using System.Collections;
namespace ProtoBuf.Meta
{
internal class BasicList : IEnumerable
{
public object this[int index]
{
get
{
return this.head[index];
}
}
public int Count
{
get
{
return this.head.Length;
}
}
private static readonly BasicList.Node nil = new BasicList.Node(null, 0);
protected BasicList.Node head = BasicList.nil;
public struct NodeEnumerator : IEnumerator
{
public object Current
{
get
{
return this.node[this.position];
}
}
private int position;
private readonly BasicList.Node node;
internal NodeEnumerator(BasicList.Node node)
{
this.position = -1;
this.node = node;
}
void IEnumerator.Reset()
{
this.position = -1;
}
public bool MoveNext()
{
int length = this.node.Length;
bool result;
if (this.position <= length)
{
int num = this.position + 1;
this.position = num;
result = (num < length);
}
else
{
result = false;
}
return result;
}
}
internal sealed class Node
{
public object this[int index]
{
get
{
bool flag = index >= 0 && index < this.length;
if (flag)
{
return this.data[index];
}
throw new ArgumentOutOfRangeException("index");
}
set
{
bool flag = index >= 0 && index < this.length;
if (flag)
{
this.data[index] = value;
return;
}
throw new ArgumentOutOfRangeException("index");
}
}
public int Length
{
get
{
return this.length;
}
}
private readonly object[] data;
private int length;
internal Node(object[] data, int length)
{
Helpers.DebugAssert((data == null && length == 0) || (data != null && length > 0 && length <= data.Length));
this.data = data;
this.length = length;
}
public void RemoveLastWithMutate()
{
bool flag = this.length == 0;
if (flag)
{
throw new InvalidOperationException();
}
this.length--;
}
public BasicList.Node Append(object value)
{
int num = this.length + 1;
bool flag = this.data == null;
object[] array;
if (flag)
{
array = new object[10];
}
else
{
bool flag2 = this.length == this.data.Length;
if (flag2)
{
array = new object[this.data.Length * 2];
Array.Copy(this.data, array, this.length);
}
else
{
array = this.data;
}
}
array[this.length] = value;
return new BasicList.Node(array, num);
}
public BasicList.Node Trim()
{
bool flag = this.length == 0 || this.length == this.data.Length;
BasicList.Node result;
if (flag)
{
result = this;
}
else
{
object[] destinationArray = new object[this.length];
Array.Copy(this.data, destinationArray, this.length);
result = new BasicList.Node(destinationArray, this.length);
}
return result;
}
internal int IndexOfString(string value)
{
for (int i = 0; i < this.length; i++)
{
bool flag = value == (string)this.data[i];
if (flag)
{
return i;
}
}
return -1;
}
internal int IndexOfReference(object instance)
{
for (int i = 0; i < this.length; i++)
{
bool flag = instance == this.data[i];
if (flag)
{
return i;
}
}
return -1;
}
internal int IndexOf(BasicList.MatchPredicate predicate, object ctx)
{
for (int i = 0; i < this.length; i++)
{
bool flag = predicate(this.data[i], ctx);
if (flag)
{
return i;
}
}
return -1;
}
internal void CopyTo(Array array, int offset)
{
bool flag = this.length > 0;
if (flag)
{
Array.Copy(this.data, 0, array, offset, this.length);
}
}
internal void Clear()
{
bool flag = this.data != null;
if (flag)
{
Array.Clear(this.data, 0, this.data.Length);
}
this.length = 0;
}
}
internal delegate bool MatchPredicate(object value, object ctx);
internal sealed class Group
{
public readonly int First;
public readonly BasicList Items;
public Group(int first)
{
this.First = first;
this.Items = new BasicList();
}
}
public void CopyTo(Array array, int offset)
{
this.head.CopyTo(array, offset);
}
public int Add(object value)
{
return (this.head = this.head.Append(value)).Length - 1;
}
public void Trim()
{
this.head = this.head.Trim();
}
IEnumerator IEnumerable.GetEnumerator()
{
return new BasicList.NodeEnumerator(this.head);
}
public BasicList.NodeEnumerator GetEnumerator()
{
return new BasicList.NodeEnumerator(this.head);
}
public void Clear()
{
this.head = BasicList.nil;
}
internal int IndexOf(BasicList.MatchPredicate predicate, object ctx)
{
return this.head.IndexOf(predicate, ctx);
}
internal int IndexOfString(string value)
{
return this.head.IndexOfString(value);
}
internal int IndexOfReference(object instance)
{
return this.head.IndexOfReference(instance);
}
internal bool Contains(object value)
{
foreach (object objA in this)
{
bool flag = object.Equals(objA, value);
if (flag)
{
return true;
}
}
return false;
}
internal static BasicList GetContiguousGroups(int[] keys, object[] values)
{
bool flag = keys == null;
if (flag)
{
throw new ArgumentNullException("keys");
}
bool flag2 = values == null;
if (flag2)
{
throw new ArgumentNullException("values");
}
bool flag3 = values.Length < keys.Length;
if (flag3)
{
throw new ArgumentException("Not all keys are covered by values", "values");
}
BasicList basicList = new BasicList();
BasicList.Group group = null;
for (int i = 0; i < keys.Length; i++)
{
bool flag4 = i == 0 || keys[i] != keys[i - 1];
if (flag4)
{
group = null;
}
bool flag5 = group == null;
if (flag5)
{
group = new BasicList.Group(keys[i]);
basicList.Add(group);
}
group.Items.Add(values[i]);
}
return basicList;
}
}
}
|