Added FisheryLib.Collections.FishTable and Mono.Cecil extension methods
A bit of refactoring has been done too
This commit is contained in:
bbradson
@@ -0,0 +1,862 @@
|
||||
// Copyright (c) 2023 bradson
|
||||
// This Source Code Form is subject to the terms of the Mozilla Public
|
||||
// License, v. 2.0. If a copy of the MPL was not distributed with this
|
||||
// file, You can obtain one at https://mozilla.org/MPL/2.0/.
|
||||
//
|
||||
// Loosely based on https://github.com/matthewcrews/FastDictionaryTest/tree/main
|
||||
// which itself is based on
|
||||
// https://probablydance.com/2018/05/28/a-new-fast-hash-table-in-response-to-googles-new-fast-hash-table/
|
||||
|
||||
using System.Collections;
|
||||
using System.Diagnostics.CodeAnalysis;
|
||||
using System.Runtime.CompilerServices;
|
||||
using System.Runtime.InteropServices;
|
||||
using FisheryLib.FunctionPointers;
|
||||
using FisheryLib.Utility;
|
||||
using JetBrains.Annotations;
|
||||
|
||||
namespace FisheryLib.Collections;
|
||||
|
||||
#pragma warning disable CS8766, CS8767
|
||||
[PublicAPI]
|
||||
[StructLayout(LayoutKind.Sequential)]
|
||||
public class FishSet<T> : ISet<T>, IReadOnlyCollection<T>, ICollection
|
||||
{
|
||||
private const int FIBONACCI_HASH = -1640531527; // unchecked((int)(uint)Math.Round(uint.MaxValue / FishMath.PHI));
|
||||
|
||||
internal T?[] _buckets;
|
||||
|
||||
private unsafe delegate*<T?, int> _hashCodeGetter = GetHashCode<T?>.Default;
|
||||
private unsafe delegate*<T?, T?, bool> _equalityComparer = Equals<T?>.Default;
|
||||
|
||||
private int
|
||||
_bucketBitShift,
|
||||
_count;
|
||||
|
||||
internal Tails _tails;
|
||||
|
||||
private int
|
||||
_wrapAroundMask,
|
||||
_version;
|
||||
|
||||
private float _maxLoadFactor = 0.5f;
|
||||
|
||||
public int Version
|
||||
{
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
get => _version;
|
||||
set
|
||||
{
|
||||
Guard.IsGreaterThan(value, _version);
|
||||
_version = value;
|
||||
}
|
||||
}
|
||||
|
||||
public int Count
|
||||
{
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
get => _count;
|
||||
}
|
||||
|
||||
public object SyncRoot => throw new NotImplementedException();
|
||||
|
||||
public bool IsSynchronized => throw new NotImplementedException();
|
||||
|
||||
public bool IsReadOnly => false;
|
||||
|
||||
public event Action<T>?
|
||||
EntryAdded,
|
||||
EntryRemoved;
|
||||
|
||||
public float MaxLoadFactor
|
||||
{
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
get => _maxLoadFactor;
|
||||
set
|
||||
{
|
||||
Guard.IsInRange(value, 0f, 1f);
|
||||
_maxLoadFactor = value;
|
||||
}
|
||||
}
|
||||
|
||||
private static T AssertKeyType(object key)
|
||||
{
|
||||
if (key is T tKey)
|
||||
return tKey;
|
||||
else if (key != null!)
|
||||
ThrowHelper.ThrowWrongKeyTypeArgumentException(key);
|
||||
|
||||
return default!;
|
||||
}
|
||||
|
||||
public bool this[T key]
|
||||
{
|
||||
[CollectionAccess(CollectionAccessType.Read)]
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
get => Contains(key);
|
||||
|
||||
[CollectionAccess(CollectionAccessType.UpdatedContent)]
|
||||
set => InsertEntry(key, value);
|
||||
}
|
||||
|
||||
public FishSet() : this(0)
|
||||
{
|
||||
}
|
||||
|
||||
public FishSet(int minimumCapacity) => Initialize(minimumCapacity);
|
||||
|
||||
[MemberNotNull(nameof(_buckets))]
|
||||
[MemberNotNull(nameof(_tails))]
|
||||
private void Initialize(int minimumCapacity = 0)
|
||||
{
|
||||
minimumCapacity = minimumCapacity <= 4 ? 4 : FishMath.NextPowerOfTwo(minimumCapacity);
|
||||
// Mathf.NextPowerOfTwo(minimumCapacity);
|
||||
|
||||
_buckets = new T?[minimumCapacity];
|
||||
_tails = new((uint)minimumCapacity);
|
||||
_bucketBitShift = 32 - FishMath.TrailingZeroCount((uint)_buckets.Length);
|
||||
_wrapAroundMask = _buckets.Length - 1;
|
||||
}
|
||||
|
||||
public FishSet(IEnumerable<T> entries) : this(0)
|
||||
{
|
||||
foreach (var entry in entries)
|
||||
InsertEntry(entry, false);
|
||||
}
|
||||
|
||||
private int GetTailIndex(int entryIndex) => GetIndexForTail(entryIndex, _tails[(uint)entryIndex]);
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private int GetIndexForTail(int entryIndex, uint tail) => (entryIndex + GetJumpDistance(tail)) & _wrapAroundMask;
|
||||
|
||||
#region Junk
|
||||
|
||||
// private static long GetJumpDistanceLong(byte index)
|
||||
// => index switch
|
||||
// {
|
||||
// 0 => 0, 1 => 1, 2 => 2, 3 => 3, 4 => 4, 5 => 5, 6 => 6, 7 => 7,
|
||||
// 8 => 8, 9 => 9, 10 => 10, 11 => 11, 12 => 12, 13 => 13, 14 => 14,
|
||||
// 15 => 15, 16 => 21, 17 => 28, 18 => 36, 19 => 45, 20 => 55, 21 => 66,
|
||||
// 22 => 78, 23 => 91, 24 => 105, 25 => 120, 26 => 136, 27 => 153,
|
||||
// 28 => 171, 29 => 190, 30 => 210, 31 => 231, 32 => 253, 33 => 276,
|
||||
// 34 => 300, 35 => 325, 36 => 351, 37 => 378, 38 => 406, 39 => 435,
|
||||
// 40 => 465, 41 => 496, 42 => 528, 43 => 561, 44 => 595, 45 => 630,
|
||||
// 46 => 666, 47 => 703, 48 => 741, 49 => 780, 50 => 820, 51 => 861,
|
||||
// 52 => 903, 53 => 946, 54 => 990, 55 => 1035, 56 => 1081, 57 => 1128,
|
||||
// 58 => 1176, 59 => 1225, 60 => 1275, 61 => 1326, 62 => 1378, 63 => 1431,
|
||||
// 64 => 1485, 65 => 1540, 66 => 1596, 67 => 1653, 68 => 1711, 69 => 1770,
|
||||
// 70 => 1830, 71 => 1891, 72 => 1953, 73 => 2016, 74 => 2080, 75 => 2145,
|
||||
// 76 => 2211, 77 => 2278, 78 => 2346, 79 => 2415, 80 => 2485, 81 => 2556,
|
||||
// 82 => 3741, 83 => 8385, 84 => 18915, 85 => 42486, 86 => 95703, 87 => 215496,
|
||||
// 88 => 485605, 89 => 1091503, 90 => 2456436, 91 => 5529475, 92 => 12437578,
|
||||
// 93 => 27986421, 94 => 62972253, 95 => 141700195, 96 => 318819126, 97 => 717314626,
|
||||
// 98 => 1614000520, 99 => 3631437253, 100 => 8170829695, 101 => 18384318876, 102 => 41364501751,
|
||||
// 103 => 93070021080, 104 => 209407709220, 105 => 471167588430, 106 => 1060127437995, 107 => 2385287281530,
|
||||
// 108 => 5366895564381, 109 => 12075513791265, 110 => 27169907873235, 111 => 61132301007778,
|
||||
// 112 => 137547673121001, 113 => 309482258302503, 114 => 696335090510256, 115 => 1566753939653640,
|
||||
// 116 => 3525196427195653, 117 => 7931691866727775, 118 => 17846306747368716,
|
||||
// 119 => 40154190394120111, 120 => 90346928493040500, 121 => 203280588949935750,
|
||||
// 122 => 457381324898247375, 123 => 1029107980662394500, 124 => 2315492957028380766,
|
||||
// 125 => 5209859150892887590, > 125 => throw new()
|
||||
// };
|
||||
|
||||
// private static int GetJumpDistance(byte index)
|
||||
// => index switch
|
||||
// {
|
||||
// 0 => 0, 1 => 1, 2 => 2, 3 => 3, 4 => 4, 5 => 5, 6 => 6, 7 => 7, 8 => 8, 9 => 9, 10 => 10, 11 => 11,
|
||||
// 12 => 12, 13 => 13, 14 => 14, 15 => 15, 16 => 21, 17 => 28, 18 => 36, 19 => 45, 20 => 55, 21 => 66,
|
||||
// 22 => 78, 23 => 91, 24 => 105, 25 => 120, 26 => 136, 27 => 153, 28 => 171, 29 => 190, 30 => 210, 31 => 231,
|
||||
// 32 => 253, 33 => 276, 34 => 300, 35 => 325, 36 => 351, 37 => 378, 38 => 406, 39 => 435, 40 => 465,
|
||||
// 41 => 496, 42 => 528, 43 => 561, 44 => 595, 45 => 630, 46 => 666, 47 => 703, 48 => 741, 49 => 780,
|
||||
// 50 => 820, 51 => 861, 52 => 903, 53 => 946, 54 => 990, 55 => 1035, 56 => 1081, 57 => 1128, 58 => 1176,
|
||||
// 59 => 1225, 60 => 1275, 61 => 1326, 62 => 1378, 63 => 1431, 64 => 1485, 65 => 1540, 66 => 1596, 67 => 1653,
|
||||
// 68 => 1711, 69 => 1770, 70 => 1830, 71 => 1891, 72 => 1953, 73 => 2016, 74 => 2080, 75 => 2145, 76 => 2211,
|
||||
// 77 => 2278, 78 => 2346, 79 => 2415, 80 => 2485, 81 => 2556, 82 => 3741, 83 => 8385, 84 => 18915,
|
||||
// 85 => 42486, 86 => 95703, 87 => 215496, 88 => 485605, 89 => 1091503, 90 => 2456436, 91 => 5529475,
|
||||
// 92 => 12437578, 93 => 27986421, 94 => 62972253, 95 => 141700195, 96 => 318819126, 97 => 717314626,
|
||||
// 98 => 1614000520, 255 => int.MaxValue, > 98 => ThrowForInvalidIndex(index)
|
||||
// };
|
||||
|
||||
#endregion
|
||||
|
||||
private static int GetJumpDistance(uint index)
|
||||
=> index switch
|
||||
{
|
||||
2 => 1, 3 => 2, 4 => 3, 5 => 4, 6 => 5, 7 => 8, 8 => 13, 9 => 21, 10 => 34, 11 => 55, 12 => 89, 13 => 144,
|
||||
14 => 233, 15 => 377, _ => MultiplyWithPhi(index)
|
||||
};
|
||||
|
||||
[MethodImpl(MethodImplOptions.NoInlining)]
|
||||
[DoesNotReturn]
|
||||
private static int MultiplyWithPhi(uint index)
|
||||
=> throw new NotImplementedException(); // (int)(uint)Math.Round(index * FishMath.PHI);
|
||||
|
||||
// private static int ThrowForInvalidIndex(byte index)
|
||||
// => throw new($"Jump distance index for FishTable too large. Should be < 99, got {index} instead.");
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private bool IsTail(int bucketIndex)
|
||||
=> bucketIndex != GetBucketIndexForKeyAt(bucketIndex);
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private bool IsTail(T entry, int bucketIndex)
|
||||
=> bucketIndex != GetBucketIndex(entry);
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private bool HasTail(int entryIndex) => !_tails.IsSoloOrEmpty(entryIndex);
|
||||
|
||||
private void SetEntryWithoutTail(int bucketIndex, T entry)
|
||||
{
|
||||
_buckets[bucketIndex] = entry;
|
||||
_tails.SetSolo(bucketIndex);
|
||||
}
|
||||
|
||||
private void SetEntryAsTail(int bucketIndex, T entry, int parentIndex, uint offset)
|
||||
{
|
||||
SetEntryWithoutTail(bucketIndex, entry);
|
||||
_tails[(uint)parentIndex] = offset;
|
||||
}
|
||||
|
||||
private void SetParentTail(int entryIndex, uint newTail)
|
||||
=> _tails[(uint)GetParentBucketIndex(entryIndex)] = newTail;
|
||||
|
||||
private bool InsertEntry(T entry, bool allowReplace = true, bool shifting = false)
|
||||
{
|
||||
var addedNewEntry = InsertEntryInternal(entry, allowReplace);
|
||||
|
||||
if (shifting)
|
||||
return addedNewEntry;
|
||||
|
||||
_version++;
|
||||
|
||||
if (!addedNewEntry)
|
||||
return false;
|
||||
|
||||
OnEntryAdded(entry);
|
||||
return true;
|
||||
}
|
||||
|
||||
private void OnEntryAdded(T entry)
|
||||
{
|
||||
// _version++; handled separately
|
||||
_count++;
|
||||
EntryAdded?.Invoke(entry);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Returns true when adding a new entry, false for replacing an existing entry. AllowReplace: false causes throwing
|
||||
/// instead. Does not adjust Count, Version or invoke EntryAdded.
|
||||
/// </summary>
|
||||
private bool InsertEntryInternal(T entry, bool allowReplace = true)
|
||||
{
|
||||
StartOfMethod:
|
||||
var bucketIndex = GetBucketIndex(entry);
|
||||
|
||||
ref var bucket = ref _buckets[bucketIndex];
|
||||
if (IsBucketEmpty(bucketIndex))
|
||||
{
|
||||
SetEntryWithoutTail(bucketIndex, entry);
|
||||
return true;
|
||||
}
|
||||
|
||||
if (TryReplaceValueOfMatchingKey(entry, allowReplace, ref bucket!))
|
||||
return false;
|
||||
|
||||
if (CheckResize())
|
||||
goto StartOfMethod;
|
||||
|
||||
if (IsTail(bucket, bucketIndex))
|
||||
{
|
||||
var previousEntry = bucket;
|
||||
var hasTail = !_tails.IsSolo(bucketIndex);
|
||||
var tailingEntries = hasTail ? new T[GetTailCount(bucketIndex)] : null;
|
||||
|
||||
if (hasTail)
|
||||
{
|
||||
var i = 0;
|
||||
var tailIndex = GetTailIndex(bucketIndex);
|
||||
|
||||
while (true)
|
||||
{
|
||||
ref var tailingBucket = ref _buckets[tailIndex];
|
||||
tailingEntries![i++] = tailingBucket!;
|
||||
tailingBucket = default;
|
||||
|
||||
if (!_tails.IsSoloOrEmpty(tailIndex))
|
||||
{
|
||||
var nextTailIndex = GetTailIndex(tailIndex);
|
||||
_tails.SetEmpty(tailIndex);
|
||||
tailIndex = nextTailIndex;
|
||||
}
|
||||
else
|
||||
{
|
||||
_tails.SetEmpty(tailIndex);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
SetParentTail(bucketIndex, Tails.SOLO);
|
||||
SetEntryWithoutTail(bucketIndex, entry);
|
||||
|
||||
InsertEntry(previousEntry, shifting: true);
|
||||
if (hasTail)
|
||||
{
|
||||
for (var i = 0; i < tailingEntries!.Length; i++)
|
||||
InsertEntry(tailingEntries[i], shifting: true);
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
else
|
||||
{
|
||||
return !TryFindTailIndexAndReplace(entry, ref bucketIndex, allowReplace)
|
||||
&& InsertAsTail(entry, bucketIndex);
|
||||
}
|
||||
}
|
||||
|
||||
private int GetTailCount(int index)
|
||||
{
|
||||
var tailCount = 0;
|
||||
|
||||
while (HasTail(index))
|
||||
{
|
||||
tailCount++;
|
||||
index = GetTailIndex(index);
|
||||
}
|
||||
|
||||
return tailCount;
|
||||
}
|
||||
|
||||
private bool IsBucketEmpty(int bucketIndex) => IsBucketEmpty(bucketIndex, _tails, _buckets);
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private bool IsBucketEmpty(int bucketIndex, Tails tails, T?[] buckets) => tails.IsEmpty(bucketIndex);
|
||||
|
||||
private bool TryFindTailIndexAndReplace(T entry, ref int bucketIndex, bool allowReplace)
|
||||
{
|
||||
while (true)
|
||||
{
|
||||
if (!TryContinueWithTail(ref bucketIndex))
|
||||
return false;
|
||||
|
||||
if (TryReplaceValueOfMatchingKey(entry, allowReplace, ref _buckets[bucketIndex]!))
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
private unsafe bool TryReplaceValueOfMatchingKey(T entry, bool allowReplace, ref T bucket)
|
||||
{
|
||||
if (!_equalityComparer(bucket, entry))
|
||||
return false;
|
||||
|
||||
if (!allowReplace)
|
||||
ThrowHelper.ThrowAddingDuplicateWithKeyArgumentException(entry);
|
||||
|
||||
bucket = entry;
|
||||
return true;
|
||||
}
|
||||
|
||||
private bool InsertAsTail(T entry, int bucketIndex)
|
||||
{
|
||||
var parentIndex = bucketIndex;
|
||||
var offset = 2u;
|
||||
|
||||
while (true)
|
||||
{
|
||||
bucketIndex = GetIndexForTail(parentIndex, offset);
|
||||
|
||||
if (IsBucketEmpty(bucketIndex))
|
||||
{
|
||||
SetEntryAsTail(bucketIndex, entry, parentIndex, offset);
|
||||
return true;
|
||||
}
|
||||
|
||||
if (IsTail(bucketIndex) && offset < _tails[(uint)GetParentBucketIndex(bucketIndex)])
|
||||
break;
|
||||
|
||||
if (++offset <= 15u)
|
||||
continue;
|
||||
|
||||
if (_buckets.Length > Count * 5)
|
||||
WarnForPossiblyExcessiveResizing(entry);
|
||||
|
||||
Resize();
|
||||
InsertEntry(entry, false, true);
|
||||
return true;
|
||||
}
|
||||
|
||||
var previousEntry = _buckets[bucketIndex];
|
||||
var hasTail = !_tails.IsSolo(bucketIndex);
|
||||
|
||||
var tailingEntries = hasTail ? new T?[GetTailCount(bucketIndex)] : null;
|
||||
|
||||
if (hasTail)
|
||||
{
|
||||
var k = 0;
|
||||
var tailIndex = GetTailIndex(bucketIndex);
|
||||
|
||||
while (true)
|
||||
{
|
||||
ref var tailingBucket = ref _buckets[tailIndex];
|
||||
tailingEntries![k] = tailingBucket;
|
||||
|
||||
k++;
|
||||
tailingBucket = default;
|
||||
|
||||
if (!_tails.IsSoloOrEmpty(tailIndex))
|
||||
{
|
||||
var nextTailIndex = GetTailIndex(tailIndex);
|
||||
_tails.SetEmpty(tailIndex);
|
||||
tailIndex = nextTailIndex;
|
||||
}
|
||||
else
|
||||
{
|
||||
_tails.SetEmpty(tailIndex);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
SetParentTail(bucketIndex, Tails.SOLO);
|
||||
SetEntryAsTail(bucketIndex, entry, parentIndex, offset);
|
||||
|
||||
InsertEntry(previousEntry!, shifting: true);
|
||||
|
||||
if (hasTail)
|
||||
{
|
||||
for (var k = 0; k < tailingEntries!.Length; k++)
|
||||
InsertEntry(tailingEntries[k]!, shifting: true);
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
[MethodImpl(MethodImplOptions.NoInlining)]
|
||||
private void WarnForPossiblyExcessiveResizing(T entry)
|
||||
=> Log.Warning($"FishTable is resizing from a large number of clashing hashCodes. Last inserted key: '{
|
||||
entry}', count: '{_count}', bucket array length: '{
|
||||
_buckets.Length}', tailing entries: '{GetTailingEntriesCount()}'");
|
||||
|
||||
private int GetTailingEntriesCount()
|
||||
{
|
||||
var count = 0;
|
||||
for (var i = _buckets.Length; i-- > 0;)
|
||||
{
|
||||
if (!IsBucketEmpty(i) && IsTail(i))
|
||||
count++;
|
||||
}
|
||||
|
||||
return count;
|
||||
}
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private bool CheckResize()
|
||||
{
|
||||
if (_count <= (int)(_buckets.Length * _maxLoadFactor))
|
||||
return false;
|
||||
|
||||
Resize();
|
||||
return true;
|
||||
}
|
||||
|
||||
private void Resize()
|
||||
{
|
||||
var oldBuckets = _buckets;
|
||||
var oldTails = _tails;
|
||||
|
||||
_tails = new((uint)_buckets.Length << 1);
|
||||
_buckets = new T?[_buckets.Length << 1];
|
||||
|
||||
_bucketBitShift = 32 - FishMath.TrailingZeroCount((uint)_buckets.Length);
|
||||
_wrapAroundMask = _buckets.Length - 1;
|
||||
|
||||
for (var i = 0; i < oldBuckets.Length; i++)
|
||||
{
|
||||
if (!IsBucketEmpty(i, oldTails, oldBuckets))
|
||||
InsertEntry(oldBuckets[i]!, false, true);
|
||||
}
|
||||
}
|
||||
|
||||
[CollectionAccess(CollectionAccessType.Read)]
|
||||
public unsafe bool Contains(T key)
|
||||
{
|
||||
var bucketIndex = GetBucketIndex(key);
|
||||
|
||||
while (true)
|
||||
{
|
||||
if (_equalityComparer(key, _buckets[bucketIndex]))
|
||||
return true;
|
||||
|
||||
if (!TryContinueWithTail(ref bucketIndex))
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
#region GetBucketIndexMethods
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private unsafe int GetBucketIndex(T key) => GetBucketIndex(_hashCodeGetter(key));
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private int GetBucketIndex(int hashCode) => (hashCode * FIBONACCI_HASH) >>> _bucketBitShift;
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private int GetBucketIndexForKeyAt(int index) => GetBucketIndex(_buckets[index]!);
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
private int GetParentBucketIndex(int childBucketIndex)
|
||||
{
|
||||
var ancestorIndex = GetBucketIndexForKeyAt(childBucketIndex);
|
||||
|
||||
var i = 0;
|
||||
|
||||
while (true)
|
||||
{
|
||||
if (i++ > 32)
|
||||
ThrowHelper.ThrowFailedToFindParentInvalidOperationException(this, childBucketIndex);
|
||||
|
||||
var nextIndex = GetTailIndex(ancestorIndex);
|
||||
if (nextIndex == childBucketIndex)
|
||||
break;
|
||||
|
||||
ancestorIndex = nextIndex;
|
||||
}
|
||||
|
||||
return ancestorIndex;
|
||||
}
|
||||
|
||||
#endregion
|
||||
|
||||
/// <summary>
|
||||
/// Returns false for solo or empty, otherwise sets the index to the tail index and returns true
|
||||
/// </summary>
|
||||
[MethodImpl(MethodImplOptions.NoInlining)]
|
||||
private bool TryContinueWithTail(ref int entryIndex)
|
||||
{
|
||||
if (!HasTail(entryIndex))
|
||||
return false;
|
||||
|
||||
entryIndex = GetTailIndex(entryIndex);
|
||||
return true;
|
||||
}
|
||||
|
||||
[CollectionAccess(CollectionAccessType.UpdatedContent)]
|
||||
public bool Add(T key)
|
||||
{
|
||||
Guard.IsNotNull(key);
|
||||
return InsertEntry(key, false);
|
||||
}
|
||||
|
||||
public void UnionWith(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
public void IntersectWith(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
public void ExceptWith(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
public void SymmetricExceptWith(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
public bool IsSubsetOf(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
public bool IsSupersetOf(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
public bool IsProperSupersetOf(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
public bool IsProperSubsetOf(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
public bool Overlaps(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
public bool SetEquals(IEnumerable<T> other) => throw new NotImplementedException();
|
||||
|
||||
[CollectionAccess(CollectionAccessType.ModifyExistingContent)]
|
||||
public bool Remove(T key)
|
||||
{
|
||||
if (!RemoveInternal(key))
|
||||
return false;
|
||||
|
||||
OnEntryRemoved(key);
|
||||
return true;
|
||||
}
|
||||
|
||||
private void EmplaceWithTails(int entryIndex)
|
||||
{
|
||||
ref var bucket = ref _buckets[entryIndex];
|
||||
var entry = bucket;
|
||||
|
||||
Span<int> tailIndices = stackalloc int[GetTailCount(entryIndex)];
|
||||
|
||||
if (HasTail(entryIndex))
|
||||
{
|
||||
tailIndices[0] = GetTailIndex(entryIndex);
|
||||
for (var i = 1; i < tailIndices.Length; i++)
|
||||
tailIndices[i] = GetTailIndex(tailIndices[i - 1]);
|
||||
}
|
||||
|
||||
if (IsTail(entry!, entryIndex))
|
||||
SetParentTail(entryIndex, Tails.SOLO);
|
||||
|
||||
bucket = default;
|
||||
_tails.SetEmpty(entryIndex);
|
||||
InsertEntry(entry!, shifting: true);
|
||||
|
||||
for (var i = 1; i < tailIndices.Length; i++)
|
||||
{
|
||||
var tailIndex = tailIndices[i];
|
||||
ref var tailBucket = ref _buckets[tailIndex];
|
||||
var tailEntry = tailBucket;
|
||||
|
||||
tailBucket = default;
|
||||
_tails.SetEmpty(tailIndex);
|
||||
InsertEntry(tailEntry!, shifting: true);
|
||||
}
|
||||
}
|
||||
|
||||
private unsafe bool RemoveInternal(T key)
|
||||
{
|
||||
var bucketIndex = GetBucketIndex(key);
|
||||
|
||||
while (true)
|
||||
{
|
||||
ref var entry = ref _buckets[bucketIndex];
|
||||
|
||||
if (_equalityComparer(key, entry))
|
||||
{
|
||||
var tailIndex = -1;
|
||||
if (IsTail(entry!, bucketIndex))
|
||||
{
|
||||
if (HasTail(bucketIndex))
|
||||
tailIndex = GetTailIndex(bucketIndex);
|
||||
else
|
||||
SetParentTail(bucketIndex, Tails.SOLO);
|
||||
}
|
||||
|
||||
entry = default;
|
||||
_tails.SetEmpty(bucketIndex);
|
||||
|
||||
if (tailIndex != -1)
|
||||
EmplaceWithTails(tailIndex);
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
if (TryContinueWithTail(ref bucketIndex))
|
||||
continue;
|
||||
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
void ICollection<T>.Add(T item) => Add(item);
|
||||
|
||||
[CollectionAccess(CollectionAccessType.ModifyExistingContent)]
|
||||
public void Clear()
|
||||
{
|
||||
// ReSharper disable once ConditionIsAlwaysTrueOrFalseAccordingToNullableAPIContract
|
||||
if (_buckets is null)
|
||||
Initialize();
|
||||
|
||||
Array.Clear(_buckets, 0, _buckets.Length);
|
||||
_tails.Reset();
|
||||
|
||||
_count = 0;
|
||||
_version++;
|
||||
}
|
||||
|
||||
[CollectionAccess(CollectionAccessType.Read)]
|
||||
public void CopyTo(T[] array, int arrayIndex)
|
||||
{
|
||||
var length = _buckets.Length;
|
||||
for (var i = 0; i < length; i++)
|
||||
{
|
||||
if (IsBucketEmpty(i))
|
||||
continue;
|
||||
|
||||
array[arrayIndex] = _buckets[i]!;
|
||||
arrayIndex++;
|
||||
}
|
||||
}
|
||||
|
||||
private void OnEntryRemoved(T entry)
|
||||
{
|
||||
_version++;
|
||||
_count--;
|
||||
EntryRemoved?.Invoke(entry);
|
||||
}
|
||||
|
||||
#region InterfaceMethods
|
||||
|
||||
[CollectionAccess(CollectionAccessType.Read)]
|
||||
public Enumerator GetEnumerator() => new(this, Enumerator.KEY_VALUE_PAIR);
|
||||
|
||||
IEnumerator<T> IEnumerable<T>.GetEnumerator()
|
||||
=> new Enumerator(this, Enumerator.KEY_VALUE_PAIR);
|
||||
|
||||
IEnumerator IEnumerable.GetEnumerator() => new Enumerator(this, Enumerator.KEY_VALUE_PAIR);
|
||||
|
||||
void ICollection.CopyTo(Array array, int index)
|
||||
{
|
||||
if (array is T[] typedArray)
|
||||
{
|
||||
CopyTo(typedArray, index);
|
||||
return;
|
||||
}
|
||||
|
||||
var length = _buckets.Length;
|
||||
for (var i = 0; i < length; i++)
|
||||
{
|
||||
if (IsBucketEmpty(i))
|
||||
continue;
|
||||
|
||||
((IList)array)[index] = _buckets[i];
|
||||
index++;
|
||||
}
|
||||
}
|
||||
|
||||
#endregion
|
||||
|
||||
#region Structs
|
||||
|
||||
internal struct Tails
|
||||
{
|
||||
public const uint
|
||||
EMPTY = 0u,
|
||||
SOLO = 1u;
|
||||
|
||||
private NibbleArray _values;
|
||||
|
||||
public Tails(uint length) => _values = new(length);
|
||||
|
||||
public uint this[uint index]
|
||||
{
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
get => _values[index];
|
||||
|
||||
set => _values[index] = value;
|
||||
}
|
||||
|
||||
public void Reset() => _values.Clear(); //_values.Initialize(15u);
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
public bool IsEmpty(int index) => _values[(uint)index] == EMPTY;
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
public bool IsSolo(int index) => _values[(uint)index] == SOLO;
|
||||
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
public bool IsSoloOrEmpty(int index) => _values[(uint)index] <= 1u;
|
||||
|
||||
public void SetSolo(int index) => _values[(uint)index] = SOLO;
|
||||
|
||||
public void SetEmpty(int index) => _values[(uint)index] = EMPTY;
|
||||
}
|
||||
|
||||
public record struct Enumerator : IEnumerator<T>
|
||||
{
|
||||
private readonly FishSet<T> _dictionary;
|
||||
private readonly int _version;
|
||||
private uint _index;
|
||||
private T? _current;
|
||||
|
||||
internal const int DICT_ENTRY = 1;
|
||||
internal const int KEY_VALUE_PAIR = 2;
|
||||
|
||||
internal Enumerator(FishSet<T> dictionary, int getEnumeratorRetType)
|
||||
{
|
||||
_dictionary = dictionary;
|
||||
_version = dictionary._version;
|
||||
_index = 0u;
|
||||
_current = default;
|
||||
}
|
||||
|
||||
public bool MoveNext()
|
||||
{
|
||||
if (_version != _dictionary._version)
|
||||
ThrowHelper.ThrowInvalidOperationException_InvalidOperation_EnumFailedVersion();
|
||||
|
||||
while (_index < (uint)_dictionary._buckets.Length)
|
||||
{
|
||||
if (_dictionary.IsBucketEmpty((int)_index++))
|
||||
continue;
|
||||
|
||||
_current = _dictionary._buckets[_index - 1]!;
|
||||
return true;
|
||||
}
|
||||
|
||||
_index = (uint)_dictionary._buckets.Length + 1u;
|
||||
_current = default;
|
||||
return false;
|
||||
}
|
||||
|
||||
[CollectionAccess(CollectionAccessType.Read)]
|
||||
public T Current => _current!;
|
||||
|
||||
public void Dispose()
|
||||
{
|
||||
}
|
||||
|
||||
object IEnumerator.Current
|
||||
{
|
||||
get
|
||||
{
|
||||
if (_index == 0u || _index == (uint)_dictionary._buckets.Length + 1u)
|
||||
ThrowHelper.ThrowInvalidOperationException_InvalidOperation_EnumOpCantHappen();
|
||||
|
||||
return _current!;
|
||||
}
|
||||
}
|
||||
|
||||
void IEnumerator.Reset()
|
||||
{
|
||||
if (_version != _dictionary._version)
|
||||
ThrowHelper.ThrowInvalidOperationException_InvalidOperation_EnumFailedVersion();
|
||||
|
||||
_index = 0u;
|
||||
_current = default;
|
||||
}
|
||||
}
|
||||
|
||||
#endregion
|
||||
|
||||
private static class ThrowHelper
|
||||
{
|
||||
[DoesNotReturn]
|
||||
internal static void ThrowInvalidOperationException_InvalidOperation_EnumFailedVersion()
|
||||
=> throw new InvalidOperationException("Collection was modified; enumeration operation may not execute.");
|
||||
|
||||
[DoesNotReturn]
|
||||
internal static void ThrowInvalidOperationException_InvalidOperation_EnumOpCantHappen()
|
||||
=> throw new InvalidOperationException("Enumeration has either not started or has already finished.");
|
||||
|
||||
[DoesNotReturn]
|
||||
internal static void ThrowWrongKeyTypeArgumentException(object? key)
|
||||
{
|
||||
Guard.IsNotNull(key);
|
||||
throw new ArgumentException($"The value \"{key}\" is not of type \"{
|
||||
typeof(T)}\" and cannot be used in this generic collection.",
|
||||
nameof(key));
|
||||
}
|
||||
|
||||
[DoesNotReturn]
|
||||
internal static void ThrowAddingDuplicateWithKeyArgumentException(T key)
|
||||
{
|
||||
Guard.IsNotNull(key);
|
||||
ThrowAddingDuplicateWithKeyArgumentException((object)key);
|
||||
}
|
||||
|
||||
[DoesNotReturn]
|
||||
internal static unsafe void ThrowFailedToFindParentInvalidOperationException(FishSet<T> fishTable,
|
||||
int childBucketIndex)
|
||||
{
|
||||
var entry = fishTable._buckets[childBucketIndex];
|
||||
throw new InvalidOperationException($"Failed to find parent index in FishTable for key: '{
|
||||
entry}', hashCode: '{fishTable._hashCodeGetter(entry)}', count: '{
|
||||
fishTable._count}', bucket array length: '{fishTable._buckets.Length}', tailing entries: '{
|
||||
fishTable.GetTailingEntriesCount()}'");
|
||||
}
|
||||
|
||||
[DoesNotReturn]
|
||||
private static void ThrowAddingDuplicateWithKeyArgumentException(object key)
|
||||
=> throw new ArgumentException($"An item with the same key has already been added. Key: {key}");
|
||||
}
|
||||
}
|
||||
#pragma warning restore CS8766, CS8767
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,62 @@
|
||||
// Copyright (c) 2023 bradson
|
||||
// This Source Code Form is subject to the terms of the Mozilla Public
|
||||
// License, v. 2.0. If a copy of the MPL was not distributed with this
|
||||
// file, You can obtain one at https://mozilla.org/MPL/2.0/.
|
||||
|
||||
using System.Runtime.CompilerServices;
|
||||
using JetBrains.Annotations;
|
||||
|
||||
namespace FisheryLib.Collections;
|
||||
|
||||
[PublicAPI]
|
||||
public struct NibbleArray
|
||||
{
|
||||
private uint _length;
|
||||
private byte[] _data;
|
||||
|
||||
public uint this[uint index]
|
||||
{
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
get
|
||||
{
|
||||
Guard.IsLessThan(index, _length);
|
||||
|
||||
return (index & 1u) == 0u ? _data[index >> 1] & 0b0000_1111u : (uint)_data[index >> 1] >> 4;
|
||||
}
|
||||
set
|
||||
{
|
||||
Guard.IsLessThan(value, 16u);
|
||||
Guard.IsLessThan(index, _length);
|
||||
|
||||
_data[index >> 1] = (byte)((index & 1u) == 0u
|
||||
? (_data[index >> 1] & 0b1111_0000u) | value
|
||||
: (_data[index >> 1] & 0b0000_1111u) | (value << 4));
|
||||
}
|
||||
}
|
||||
|
||||
public uint Length
|
||||
{
|
||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||
get => _length;
|
||||
}
|
||||
|
||||
public NibbleArray(uint length)
|
||||
{
|
||||
_length = length;
|
||||
_data = new byte[(length + 1u) >> 1];
|
||||
}
|
||||
|
||||
public void Resize(uint newSize)
|
||||
{
|
||||
_length = newSize;
|
||||
Array.Resize(ref _data, (int)(newSize + 1u) >> 1);
|
||||
}
|
||||
|
||||
public void Clear() => _data.Clear();
|
||||
|
||||
public void Initialize(uint value)
|
||||
{
|
||||
Guard.IsLessThan(value, 16u);
|
||||
Unsafe.InitBlockUnaligned(ref _data[0u], (byte)(value | (value << 4)), (uint)_data.Length);
|
||||
}
|
||||
}
|
||||
File diff suppressed because it is too large
Load Diff
Reference in New Issue
Block a user