File size: 14,065 Bytes
18a519f | 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 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 | using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
////REVIEW: what about ignoring 'firstValue' entirely in case length > 1 and putting everything into an array in that case
namespace UnityEngine.InputSystem.Utilities
{
/// <summary>
/// Helper to avoid array allocations if there's only a single value in the array.
/// </summary>
/// <remarks>
/// Also, once more than one entry is necessary, allows treating the extra array as having capacity.
/// This means that, for example, 5 or 10 entries can be allocated in batch rather than growing an
/// array one by one.
/// </remarks>
/// <typeparam name="TValue">Element type for the array.</typeparam>
internal struct InlinedArray<TValue> : IEnumerable<TValue>
{
// We inline the first value so if there's only one, there's
// no additional allocation. If more are added, we allocate an array.
public int length;
public TValue firstValue;
public TValue[] additionalValues;
public int Capacity => additionalValues?.Length + 1 ?? 1;
public InlinedArray(TValue value)
{
length = 1;
firstValue = value;
additionalValues = null;
}
public InlinedArray(TValue firstValue, params TValue[] additionalValues)
{
length = 1 + additionalValues.Length;
this.firstValue = firstValue;
this.additionalValues = additionalValues;
}
public InlinedArray(IEnumerable<TValue> values)
: this()
{
length = values.Count();
if (length > 1)
additionalValues = new TValue[length - 1];
else
additionalValues = null;
var index = 0;
foreach (var value in values)
{
if (index == 0)
firstValue = value;
else
additionalValues[index - 1] = value;
++index;
}
}
public TValue this[int index]
{
get
{
if (index < 0 || index >= length)
throw new ArgumentOutOfRangeException(nameof(index));
if (index == 0)
return firstValue;
return additionalValues[index - 1];
}
set
{
if (index < 0 || index >= length)
throw new ArgumentOutOfRangeException(nameof(index));
if (index == 0)
firstValue = value;
else
additionalValues[index - 1] = value;
}
}
public void Clear()
{
length = 0;
firstValue = default;
additionalValues = null;
}
public void ClearWithCapacity()
{
firstValue = default;
for (var i = 0; i < length - 1; ++i)
additionalValues[i] = default;
length = 0;
}
////REVIEW: This is inconsistent with ArrayHelpers.Clone() which also clones elements
public InlinedArray<TValue> Clone()
{
return new InlinedArray<TValue>
{
length = length,
firstValue = firstValue,
additionalValues = additionalValues != null ? ArrayHelpers.Copy(additionalValues) : null
};
}
public void SetLength(int size)
{
// Null out everything we're cutting off.
if (size < length)
{
for (var i = size; i < length; ++i)
this[i] = default;
}
length = size;
if (size > 1 && (additionalValues == null || additionalValues.Length < size - 1))
Array.Resize(ref additionalValues, size - 1);
}
public TValue[] ToArray()
{
return ArrayHelpers.Join(firstValue, additionalValues);
}
public TOther[] ToArray<TOther>(Func<TValue, TOther> mapFunction)
{
if (length == 0)
return null;
var result = new TOther[length];
for (var i = 0; i < length; ++i)
result[i] = mapFunction(this[i]);
return result;
}
public int IndexOf(TValue value)
{
var comparer = EqualityComparer<TValue>.Default;
if (length > 0)
{
if (comparer.Equals(firstValue, value))
return 0;
if (additionalValues != null)
{
for (var i = 0; i < length - 1; ++i)
if (comparer.Equals(additionalValues[i], value))
return i + 1;
}
}
return -1;
}
public int Append(TValue value)
{
if (length == 0)
{
firstValue = value;
}
else if (additionalValues == null)
{
additionalValues = new TValue[1];
additionalValues[0] = value;
}
else
{
Array.Resize(ref additionalValues, length);
additionalValues[length - 1] = value;
}
var index = length;
++length;
return index;
}
public int AppendWithCapacity(TValue value, int capacityIncrement = 10)
{
if (length == 0)
{
firstValue = value;
}
else
{
var numAdditionalValues = length - 1;
ArrayHelpers.AppendWithCapacity(ref additionalValues, ref numAdditionalValues, value, capacityIncrement: capacityIncrement);
}
var index = length;
++length;
return index;
}
public void AssignWithCapacity(InlinedArray<TValue> values)
{
if (Capacity < values.length && values.length > 1)
additionalValues = new TValue[values.length - 1];
length = values.length;
if (length > 0)
firstValue = values.firstValue;
if (length > 1)
Array.Copy(values.additionalValues, additionalValues, length - 1);
}
public void Append(IEnumerable<TValue> values)
{
foreach (var value in values)
Append(value);
}
public void Remove(TValue value)
{
if (length < 1)
return;
if (EqualityComparer<TValue>.Default.Equals(firstValue, value))
{
RemoveAt(0);
}
else if (additionalValues != null)
{
for (var i = 0; i < length - 1; ++i)
{
if (EqualityComparer<TValue>.Default.Equals(additionalValues[i], value))
{
RemoveAt(i + 1);
break;
}
}
}
}
public void RemoveAtWithCapacity(int index)
{
if (index < 0 || index >= length)
throw new ArgumentOutOfRangeException(nameof(index));
if (index == 0)
{
if (length == 1)
{
firstValue = default;
}
else if (length == 2)
{
firstValue = additionalValues[0];
additionalValues[0] = default;
}
else
{
Debug.Assert(length > 2);
firstValue = additionalValues[0];
var numAdditional = length - 1;
ArrayHelpers.EraseAtWithCapacity(additionalValues, ref numAdditional, 0);
}
}
else
{
var numAdditional = length - 1;
ArrayHelpers.EraseAtWithCapacity(additionalValues, ref numAdditional, index - 1);
}
--length;
}
public void RemoveAt(int index)
{
if (index < 0 || index >= length)
throw new ArgumentOutOfRangeException(nameof(index));
if (index == 0)
{
if (additionalValues != null)
{
firstValue = additionalValues[0];
if (additionalValues.Length == 1)
additionalValues = null;
else
{
Array.Copy(additionalValues, 1, additionalValues, 0, additionalValues.Length - 1);
Array.Resize(ref additionalValues, additionalValues.Length - 1);
}
}
else
{
firstValue = default;
}
}
else
{
Debug.Assert(additionalValues != null);
var numAdditionalValues = length - 1;
if (numAdditionalValues == 1)
{
// Remove only entry in array.
additionalValues = null;
}
else if (index == length - 1)
{
// Remove entry at end.
Array.Resize(ref additionalValues, numAdditionalValues - 1);
}
else
{
// Remove entry at beginning or in middle by pasting together
// into a new array.
var newAdditionalValues = new TValue[numAdditionalValues - 1];
if (index >= 2)
{
// Copy elements before entry.
Array.Copy(additionalValues, 0, newAdditionalValues, 0, index - 1);
}
// Copy elements after entry. We already know that we're not removing
// the last entry so there have to be entries.
Array.Copy(additionalValues, index + 1 - 1, newAdditionalValues, index - 1,
length - index - 1);
additionalValues = newAdditionalValues;
}
}
--length;
}
public void RemoveAtByMovingTailWithCapacity(int index)
{
if (index < 0 || index >= length)
throw new ArgumentOutOfRangeException(nameof(index));
var numAdditionalValues = length - 1;
if (index == 0)
{
if (length > 1)
{
firstValue = additionalValues[numAdditionalValues - 1];
additionalValues[numAdditionalValues - 1] = default;
}
else
{
firstValue = default;
}
}
else
{
Debug.Assert(additionalValues != null);
ArrayHelpers.EraseAtByMovingTail(additionalValues, ref numAdditionalValues, index - 1);
}
--length;
}
public bool RemoveByMovingTailWithCapacity(TValue value)
{
var index = IndexOf(value);
if (index == -1)
return false;
RemoveAtByMovingTailWithCapacity(index);
return true;
}
public bool Contains(TValue value, IEqualityComparer<TValue> comparer)
{
for (var n = 0; n < length; ++n)
if (comparer.Equals(this[n], value))
return true;
return false;
}
public void Merge(InlinedArray<TValue> other)
{
var comparer = EqualityComparer<TValue>.Default;
for (var i = 0; i < other.length; ++i)
{
var value = other[i];
if (Contains(value, comparer))
continue;
////FIXME: this is ugly as it repeatedly copies
Append(value);
}
}
public IEnumerator<TValue> GetEnumerator()
{
return new Enumerator { array = this, index = -1 };
}
IEnumerator IEnumerable.GetEnumerator()
{
return GetEnumerator();
}
private struct Enumerator : IEnumerator<TValue>
{
public InlinedArray<TValue> array;
public int index;
public bool MoveNext()
{
if (index >= array.length)
return false;
++index;
return index < array.length;
}
public void Reset()
{
index = -1;
}
public TValue Current => array[index];
object IEnumerator.Current => Current;
public void Dispose()
{
}
}
}
internal static class InputArrayExtensions
{
public static int IndexOfReference<TValue>(this InlinedArray<TValue> array, TValue value)
where TValue : class
{
for (var i = 0; i < array.length; ++i)
if (ReferenceEquals(array[i], value))
return i;
return -1;
}
public static bool Contains<TValue>(this InlinedArray<TValue> array, TValue value)
{
for (var i = 0; i < array.length; ++i)
if (array[i].Equals(value))
return true;
return false;
}
public static bool ContainsReference<TValue>(this InlinedArray<TValue> array, TValue value)
where TValue : class
{
return IndexOfReference(array, value) != -1;
}
}
}
|