| | | 1 | | //======================================================================= |
| | | 2 | | // QueryKeyIndexMap.cs |
| | | 3 | | //======================================================================= |
| | | 4 | | // MIT License, Copyright (c) 2024–present David Oravsky (mrdav30) |
| | | 5 | | // See LICENSE file in the project root for full license information. |
| | | 6 | | //======================================================================= |
| | | 7 | | |
| | | 8 | | using System; |
| | | 9 | | using System.Collections.Generic; |
| | | 10 | | using System.Runtime.CompilerServices; |
| | | 11 | | using SwiftCollections.Utility; |
| | | 12 | | |
| | | 13 | | namespace SwiftCollections.Query; |
| | | 14 | | |
| | | 15 | | internal sealed class QueryKeyIndexMap<TKey> where TKey : notnull |
| | | 16 | | { |
| | | 17 | | private readonly IEqualityComparer<TKey> _comparer; |
| | | 18 | | private readonly Func<int, TKey, bool> _isMatch; |
| | | 19 | | private readonly Func<int, bool> _canRehash; |
| | | 20 | | private readonly Func<int, TKey> _getKey; |
| | | 21 | | private int[] _buckets; |
| | | 22 | | private int _bucketMask; |
| | | 23 | | |
| | 91 | 24 | | public QueryKeyIndexMap( |
| | 91 | 25 | | int capacity, |
| | 91 | 26 | | Func<int, TKey, bool> isMatch, |
| | 91 | 27 | | Func<int, bool> canRehash, |
| | 91 | 28 | | Func<int, TKey> getKey) |
| | | 29 | | { |
| | 91 | 30 | | _comparer = SwiftHashTools.GetDeterministicEqualityComparer<TKey>(); |
| | 91 | 31 | | _isMatch = isMatch; |
| | 91 | 32 | | _canRehash = canRehash; |
| | 91 | 33 | | _getKey = getKey; |
| | 91 | 34 | | capacity = NormalizeBucketCapacity(capacity); |
| | 91 | 35 | | _buckets = new int[capacity].Populate(() => -1); |
| | 91 | 36 | | _bucketMask = capacity - 1; |
| | 91 | 37 | | } |
| | | 38 | | |
| | | 39 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 40 | | public void Insert(TKey key, int index) |
| | | 41 | | { |
| | 36107 | 42 | | int bucketIndex = GetStartBucket(key); |
| | | 43 | | |
| | 36366 | 44 | | while (_buckets[bucketIndex] != -1) |
| | 259 | 45 | | bucketIndex = (bucketIndex + 1) & _bucketMask; |
| | | 46 | | |
| | 36107 | 47 | | _buckets[bucketIndex] = index; |
| | 36107 | 48 | | } |
| | | 49 | | |
| | | 50 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 51 | | public int Find(TKey key) |
| | | 52 | | { |
| | 314 | 53 | | int bucketIndex = GetStartBucket(key); |
| | | 54 | | |
| | 342 | 55 | | while (_buckets[bucketIndex] != -1) |
| | | 56 | | { |
| | 200 | 57 | | int candidate = _buckets[bucketIndex]; |
| | 200 | 58 | | if (_isMatch(candidate, key)) |
| | 172 | 59 | | return candidate; |
| | | 60 | | |
| | 28 | 61 | | bucketIndex = (bucketIndex + 1) & _bucketMask; |
| | | 62 | | } |
| | | 63 | | |
| | 142 | 64 | | return -1; |
| | | 65 | | } |
| | | 66 | | |
| | | 67 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 68 | | public bool Remove(TKey key) |
| | | 69 | | { |
| | 269 | 70 | | int bucketIndex = GetStartBucket(key); |
| | | 71 | | |
| | 271 | 72 | | while (_buckets[bucketIndex] != -1) |
| | | 73 | | { |
| | 270 | 74 | | int candidate = _buckets[bucketIndex]; |
| | 270 | 75 | | if (_isMatch(candidate, key)) |
| | | 76 | | { |
| | 268 | 77 | | _buckets[bucketIndex] = -1; |
| | 268 | 78 | | RehashBucketCluster((bucketIndex + 1) & _bucketMask); |
| | 268 | 79 | | return true; |
| | | 80 | | } |
| | | 81 | | |
| | 2 | 82 | | bucketIndex = (bucketIndex + 1) & _bucketMask; |
| | | 83 | | } |
| | | 84 | | |
| | 1 | 85 | | return false; |
| | | 86 | | } |
| | | 87 | | |
| | | 88 | | public void ResizeAndRehash(int capacity, int entryCount) |
| | | 89 | | { |
| | 37 | 90 | | capacity = NormalizeBucketCapacity(capacity); |
| | 37 | 91 | | _buckets = new int[capacity].Populate(() => -1); |
| | 37 | 92 | | _bucketMask = capacity - 1; |
| | | 93 | | |
| | 70448 | 94 | | for (int i = 0; i < entryCount; i++) |
| | | 95 | | { |
| | 35187 | 96 | | if (!_canRehash(i)) |
| | | 97 | | continue; |
| | | 98 | | |
| | 17633 | 99 | | Insert(_getKey(i), i); |
| | | 100 | | } |
| | 37 | 101 | | } |
| | | 102 | | |
| | | 103 | | public void Clear() |
| | | 104 | | { |
| | 674 | 105 | | for (int i = 0; i < _buckets.Length; i++) |
| | 332 | 106 | | _buckets[i] = -1; |
| | 5 | 107 | | } |
| | | 108 | | |
| | | 109 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 110 | | private int GetStartBucket(TKey key) |
| | | 111 | | { |
| | 36690 | 112 | | int hash = _comparer.GetHashCode(key) & 0x7FFFFFFF; |
| | 36690 | 113 | | return hash & _bucketMask; |
| | | 114 | | } |
| | | 115 | | |
| | | 116 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 117 | | private static int NormalizeBucketCapacity(int capacity) |
| | | 118 | | { |
| | 128 | 119 | | capacity = SwiftHashTools.NextPowerOfTwo(capacity); |
| | 128 | 120 | | return capacity <= 1 ? 2 : capacity * 2; |
| | | 121 | | } |
| | | 122 | | |
| | | 123 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 124 | | private void RehashBucketCluster(int startIndex) |
| | | 125 | | { |
| | 268 | 126 | | int bucketIndex = startIndex; |
| | | 127 | | |
| | 5252 | 128 | | while (_buckets[bucketIndex] != -1) |
| | | 129 | | { |
| | 4984 | 130 | | int candidate = _buckets[bucketIndex]; |
| | 4984 | 131 | | _buckets[bucketIndex] = -1; |
| | | 132 | | |
| | 4984 | 133 | | Insert(_getKey(candidate), candidate); |
| | | 134 | | |
| | 4984 | 135 | | bucketIndex = (bucketIndex + 1) & _bucketMask; |
| | | 136 | | } |
| | 268 | 137 | | } |
| | | 138 | | } |