-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathFastList.cs
More file actions
223 lines (192 loc) · 4.59 KB
/
Copy pathFastList.cs
File metadata and controls
223 lines (192 loc) · 4.59 KB
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
//=======================================================================
// Copyright (c) 2015 John Pan
// Distributed under the MIT License.
// (See accompanying file LICENSE or copy at
// http://opensource.org/licenses/MIT)
//=======================================================================
using System.Collections;
using System.Collections.Generic;
using System;
namespace FastCollections
{
public class FastList<T> : FastEnumerable<T>, IEnumerable<T>
{
private const int DefaultCapacity = 8;
public T[] innerArray;
public int Count {get; private set;} //Also the index of the next element to be added
public int Capacity = DefaultCapacity;
public bool IsValueType { get; private set;}
public FastList (FastList<T> CopyList)
{
innerArray = (T[])CopyList.innerArray.Clone ();
Count = innerArray.Length;
Capacity = innerArray.Length;
}
public FastList (T[] StartArray)
{
innerArray = StartArray;
Count = innerArray.Length;
Capacity = innerArray.Length;
}
public FastList (int StartCapacity)
{
Capacity = StartCapacity;
innerArray = new T[Capacity];
Initialize ();
}
public FastList ()
{
innerArray = new T[Capacity];
Initialize ();
}
private void Initialize ()
{
Count = 0;
this.IsValueType = typeof(T).IsValueType;
}
public void Add (T item)
{
EnsureCapacity (Count + 1);
innerArray [Count++] = item;
}
public void AddRange (FastList<T> items)
{
int arrayLength = items.Count;
EnsureCapacity (Count + arrayLength + 1);
for (int i = 0; i < arrayLength; i++)
{
innerArray[Count++] = items[i];
}
}
public void AddRange (T[] items)
{
int arrayLength = items.Length;
EnsureCapacity (Count + arrayLength + 1);
for (int i = 0; i < arrayLength; i++)
{
innerArray[Count++] = items[i];
}
}
public void AddRange (T[] items, int startIndex, int count)
{
EnsureCapacity (Count + count + 1);
for (int i = 0; i < count; i++)
{
innerArray[Count++] = items[i + startIndex];
}
}
public bool Remove (T item)
{
int index = Array.IndexOf (innerArray, item, 0, Count);
if (index >= 0) {
RemoveAt (index);
return true;
}
return false;
}
public void RemoveAt (int index)
{
Count--;
innerArray [index] = default(T);
Array.Copy (innerArray, index + 1, innerArray, index, Count - index);
}
public T[] ToArray ()
{
T[] retArray = new T[Count];
Array.Copy (innerArray,0,retArray,0,Count);
return retArray;
}
public bool Contains (T item)
{
return Array.IndexOf (innerArray,item,0,Count) != -1;
}
public void Reverse ()
{
//Array.Reverse (innerArray,0,Count);
int highCount = Count / 2;
int reverseCount = Count - 1;
for (int i = 0; i < highCount; i++)
{
T swapItem = innerArray[i];
innerArray[i] = innerArray[reverseCount];
innerArray[reverseCount] = swapItem;
reverseCount--;
}
}
public void EnsureCapacity (int min)
{
if (Capacity < min)
{
Capacity *= 2;
if (Capacity < min) {
Capacity = min;
}
Array.Resize (ref innerArray, Capacity);
}
}
public T this [int index] {
get {
return innerArray [index];
}
set {
innerArray [index] = value;
}
}
public void Clear ()
{
if (this.IsValueType) {
FastClear();
} else {
for (int i = 0; i < Capacity; i++) {
innerArray[i] = default(T);
}
}
Count = 0;
}
/// <summary>
/// Marks elements for overwriting. Note: this list will still keep references to objects.
/// </summary>
public void FastClear ()
{
Count = 0;
}
public void CopyTo (FastList<T> target)
{
Array.Copy (innerArray,0,target.innerArray,0,Count);
target.Count = Count;
target.Capacity = Capacity;
}
public T[] TrimmedArray {
get {
T[] ret = new T[Count];
Array.Copy (innerArray, ret, Count);
return ret;
}
}
public override string ToString ()
{
if (Count <= 0)
return base.ToString ();
string output = string.Empty;
for (int i = 0; i < Count - 1; i++)
output += innerArray [i] + ", ";
return base.ToString () + ": " + output + innerArray [Count - 1];
}
public IEnumerator<T> GetEnumerator ()
{
for (int i = 0; i < this.Count; i++) {
yield return this.innerArray[i];
}
}
IEnumerator IEnumerable.GetEnumerator ()
{
for (int i = 0; i < this.Count; i++) {
yield return this.innerArray[i];
}
}
public void Enumerate (FastList<T> output) {
output.FastClear ();
output.AddRange (this);
}
}
}