blob: 7dcd060eb3213daeeca73003146fa3edb2d9e70d (
plain) (
blame)
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
|
using System;
using System.Collections;
using System.Collections.Generic;
namespace Google.Protobuf.Collections
{
public sealed class RepeatedField<T> : IList<T>, IEquatable<RepeatedField<T>>
{
private readonly List<T> list = new List<T>();
public void Add(T item)
{
if (item == null)
{
throw new ArgumentNullException("item");
}
list.Add(item);
}
public void Clear()
{
list.Clear();
}
public bool Contains(T item)
{
if (item == null)
{
throw new ArgumentNullException("item");
}
return list.Contains(item);
}
public void CopyTo(T[] array, int arrayIndex)
{
list.CopyTo(array);
}
public bool Remove(T item)
{
if (item == null)
{
throw new ArgumentNullException("item");
}
return list.Remove(item);
}
public int Count { get { return list.Count; } }
// TODO(jonskeet): If we implement freezing, make this reflect it.
public bool IsReadOnly { get { return false; } }
public void Add(RepeatedField<T> values)
{
if (values == null)
{
throw new ArgumentNullException("values");
}
// We know that all the values will be valid, because it's a RepeatedField.
list.AddRange(values);
}
public void Add(IEnumerable<T> values)
{
if (values == null)
{
throw new ArgumentNullException("values");
}
foreach (T item in values)
{
Add(item);
}
}
// TODO(jonskeet): Create our own mutable struct for this, rather than relying on List<T>.
public List<T>.Enumerator GetEnumerator()
{
return list.GetEnumerator();
}
IEnumerator<T> IEnumerable<T>.GetEnumerator()
{
return list.GetEnumerator();
}
public override bool Equals(object obj)
{
return Equals(obj as RepeatedField<T>);
}
public override int GetHashCode()
{
int hash = 23;
foreach (T item in this)
{
hash = hash * 31 + item.GetHashCode();
}
return hash;
}
IEnumerator IEnumerable.GetEnumerator()
{
return GetEnumerator();
}
public bool Equals(RepeatedField<T> other)
{
if (ReferenceEquals(other, null))
{
return false;
}
if (ReferenceEquals(other, this))
{
return true;
}
if (other.Count != this.Count)
{
return false;
}
// TODO(jonskeet): Does this box for enums?
EqualityComparer<T> comparer = EqualityComparer<T>.Default;
for (int i = 0; i < Count; i++)
{
if (!comparer.Equals(this[i], other[i]))
{
return false;
}
}
return true;
}
public int IndexOf(T item)
{
if (item == null)
{
throw new ArgumentNullException("item");
}
return list.IndexOf(item);
}
public void Insert(int index, T item)
{
if (item == null)
{
throw new ArgumentNullException("item");
}
list.Insert(index, item);
}
public void RemoveAt(int index)
{
list.RemoveAt(index);
}
public T this[int index]
{
get { return list[index]; }
set
{
if (value == null)
{
throw new ArgumentNullException("value");
}
list[index] = value;
}
}
}
}
|
