| | | 1 | | //======================================================================= |
| | | 2 | | // SparseVoxelBlock.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.Buffers; |
| | | 10 | | using System.Runtime.CompilerServices; |
| | | 11 | | using GridForge.Spatial; |
| | | 12 | | using SwiftCollections; |
| | | 13 | | |
| | | 14 | | namespace GridForge.Grids.Storage; |
| | | 15 | | |
| | | 16 | | internal sealed class SparseVoxelBlock |
| | | 17 | | { |
| | | 18 | | public int CellKey { get; private set; } = -1; |
| | | 19 | | |
| | | 20 | | public ScanCell? ScanCell { get; private set; } |
| | | 21 | | |
| | 16 | 22 | | public int Count => _count; |
| | | 23 | | |
| | | 24 | | private Voxel[]? _voxels; |
| | | 25 | | private int _count; |
| | | 26 | | |
| | | 27 | | public void Initialize(VoxelGrid grid, int cellKey, int capacity) |
| | | 28 | | { |
| | 90 | 29 | | CellKey = cellKey; |
| | 90 | 30 | | ScanCell = Pools.ScanCellPool.Rent(); |
| | 90 | 31 | | ScanCell.Initialize(grid, cellKey); |
| | 90 | 32 | | _voxels = capacity > 0 |
| | 90 | 33 | | ? ArrayPool<Voxel>.Shared.Rent(capacity) |
| | 90 | 34 | | : null; |
| | 90 | 35 | | _count = 0; |
| | 90 | 36 | | } |
| | | 37 | | |
| | | 38 | | public Voxel AddPreparedVoxel(VoxelGrid grid, VoxelIndex index) |
| | | 39 | | { |
| | | 40 | | // GridWorld validates prepared sparse input as sorted and deduplicated before storage initialization. |
| | 104 | 41 | | EnsureCapacity(_count + 1); |
| | 104 | 42 | | Voxel voxel = CreateVoxel(grid, index); |
| | 104 | 43 | | _voxels![_count++] = voxel; |
| | 104 | 44 | | return voxel; |
| | | 45 | | } |
| | | 46 | | |
| | | 47 | | public bool TryAddVoxel(VoxelGrid grid, VoxelIndex index, out Voxel? voxel) |
| | | 48 | | { |
| | 40 | 49 | | voxel = null; |
| | 40 | 50 | | if (TryFindVoxelArrayIndex(index, out int insertIndex)) |
| | 2 | 51 | | return false; |
| | | 52 | | |
| | 38 | 53 | | EnsureCapacity(_count + 1); |
| | 38 | 54 | | voxel = CreateVoxel(grid, index); |
| | | 55 | | |
| | 38 | 56 | | if (insertIndex < _count) |
| | 10 | 57 | | Array.Copy(_voxels!, insertIndex, _voxels!, insertIndex + 1, _count - insertIndex); |
| | | 58 | | |
| | 38 | 59 | | _voxels![insertIndex] = voxel; |
| | 38 | 60 | | _count++; |
| | 38 | 61 | | return true; |
| | | 62 | | } |
| | | 63 | | |
| | | 64 | | public bool TryRemoveVoxel(VoxelGrid grid, VoxelIndex index, out Voxel? voxel) |
| | | 65 | | { |
| | 17 | 66 | | voxel = null; |
| | 17 | 67 | | if (!TryFindVoxelArrayIndex(index, out int voxelArrayIndex)) |
| | 3 | 68 | | return false; |
| | | 69 | | |
| | 14 | 70 | | voxel = _voxels![voxelArrayIndex]; |
| | 14 | 71 | | int moveCount = _count - voxelArrayIndex - 1; |
| | 14 | 72 | | if (moveCount > 0) |
| | 2 | 73 | | Array.Copy(_voxels, voxelArrayIndex + 1, _voxels, voxelArrayIndex, moveCount); |
| | | 74 | | |
| | 14 | 75 | | _voxels[--_count] = null!; |
| | 14 | 76 | | voxel.Reset(grid); |
| | 14 | 77 | | Pools.VoxelPool.Release(voxel); |
| | 14 | 78 | | return true; |
| | | 79 | | } |
| | | 80 | | |
| | | 81 | | public bool TryGetVoxel(VoxelIndex index, out Voxel? result) |
| | | 82 | | { |
| | 193 | 83 | | result = null; |
| | 193 | 84 | | if (!TryFindVoxelArrayIndex(index, out int voxelArrayIndex)) |
| | 60 | 85 | | return false; |
| | | 86 | | |
| | 133 | 87 | | result = _voxels![voxelArrayIndex]; |
| | 133 | 88 | | return result.IsAllocated; |
| | | 89 | | } |
| | | 90 | | |
| | | 91 | | private bool TryFindVoxelArrayIndex(VoxelIndex index, out int voxelArrayIndex) |
| | | 92 | | { |
| | 250 | 93 | | voxelArrayIndex = 0; |
| | 250 | 94 | | if (_voxels == null) |
| | 3 | 95 | | return false; |
| | | 96 | | |
| | 247 | 97 | | int min = 0; |
| | 247 | 98 | | int max = _count - 1; |
| | 444 | 99 | | while (min <= max) |
| | | 100 | | { |
| | 346 | 101 | | int mid = min + ((max - min) >> 1); |
| | 346 | 102 | | Voxel voxel = _voxels[mid]; |
| | 346 | 103 | | int compare = voxel.Index.CompareTo(index); |
| | | 104 | | |
| | 346 | 105 | | if (compare == 0) |
| | | 106 | | { |
| | 149 | 107 | | voxelArrayIndex = mid; |
| | 149 | 108 | | return true; |
| | | 109 | | } |
| | | 110 | | |
| | 197 | 111 | | if (compare < 0) |
| | 146 | 112 | | min = mid + 1; |
| | | 113 | | else |
| | 51 | 114 | | max = mid - 1; |
| | | 115 | | } |
| | | 116 | | |
| | 98 | 117 | | voxelArrayIndex = min; |
| | 98 | 118 | | return false; |
| | | 119 | | } |
| | | 120 | | |
| | | 121 | | private void EnsureCapacity(int minCapacity) |
| | | 122 | | { |
| | 142 | 123 | | if (_voxels != null && _voxels.Length >= minCapacity) |
| | 140 | 124 | | return; |
| | | 125 | | |
| | 2 | 126 | | int capacity = _voxels == null |
| | 2 | 127 | | ? minCapacity |
| | 2 | 128 | | : Math.Max(minCapacity, _voxels.Length << 1); |
| | 2 | 129 | | Voxel[] replacement = ArrayPool<Voxel>.Shared.Rent(capacity); |
| | | 130 | | |
| | 2 | 131 | | if (_voxels != null) |
| | | 132 | | { |
| | 1 | 133 | | Array.Copy(_voxels, replacement, _count); |
| | 1 | 134 | | ArrayPool<Voxel>.Shared.Return(_voxels, clearArray: true); |
| | | 135 | | } |
| | | 136 | | |
| | 2 | 137 | | _voxels = replacement; |
| | 2 | 138 | | } |
| | | 139 | | |
| | | 140 | | private Voxel CreateVoxel(VoxelGrid grid, VoxelIndex index) |
| | | 141 | | { |
| | 142 | 142 | | Voxel voxel = Pools.VoxelPool.Rent(); |
| | 142 | 143 | | voxel.Initialize( |
| | 142 | 144 | | new WorldVoxelIndex(grid.World!.SpawnToken, grid.GridIndex, grid.SpawnToken, index), |
| | 142 | 145 | | grid.GetWorldPosition(index), |
| | 142 | 146 | | CellKey, |
| | 142 | 147 | | grid.IsOnBoundary(index), |
| | 142 | 148 | | grid.Version); |
| | | 149 | | |
| | 142 | 150 | | return voxel; |
| | | 151 | | } |
| | | 152 | | |
| | | 153 | | public void AddVoxelsInIndexRange( |
| | | 154 | | VoxelIndex min, |
| | | 155 | | VoxelIndex max, |
| | | 156 | | SwiftList<Voxel> results, |
| | | 157 | | SwiftHashSet<Voxel> redundancy) |
| | | 158 | | { |
| | 44 | 159 | | if (_voxels == null) |
| | 1 | 160 | | return; |
| | | 161 | | |
| | 188 | 162 | | for (int i = 0; i < _count; i++) |
| | | 163 | | { |
| | 51 | 164 | | Voxel voxel = _voxels[i]; |
| | 51 | 165 | | VoxelIndex index = voxel.Index; |
| | 51 | 166 | | if (IsIndexInRange(index, min, max) && redundancy.Add(voxel)) |
| | 43 | 167 | | results.Add(voxel); |
| | | 168 | | } |
| | 43 | 169 | | } |
| | | 170 | | |
| | | 171 | | public void Reset(VoxelGrid grid) |
| | | 172 | | { |
| | 91 | 173 | | if (_voxels != null) |
| | | 174 | | { |
| | 436 | 175 | | for (int i = 0; i < _count; i++) |
| | | 176 | | { |
| | 128 | 177 | | Voxel voxel = _voxels[i]; |
| | 128 | 178 | | voxel.Reset(grid); |
| | 128 | 179 | | Pools.VoxelPool.Release(voxel); |
| | | 180 | | } |
| | | 181 | | |
| | 90 | 182 | | ArrayPool<Voxel>.Shared.Return(_voxels, clearArray: true); |
| | | 183 | | } |
| | | 184 | | |
| | 91 | 185 | | if (ScanCell != null) |
| | 90 | 186 | | Pools.ScanCellPool.Release(ScanCell); |
| | | 187 | | |
| | 91 | 188 | | Clear(); |
| | 91 | 189 | | } |
| | | 190 | | |
| | | 191 | | public void Clear() |
| | | 192 | | { |
| | 180 | 193 | | CellKey = -1; |
| | 180 | 194 | | ScanCell = null; |
| | 180 | 195 | | _voxels = null; |
| | 180 | 196 | | _count = 0; |
| | 180 | 197 | | } |
| | | 198 | | |
| | | 199 | | [MethodImpl(MethodImplOptions.AggressiveInlining)] |
| | | 200 | | private static bool IsIndexInRange(VoxelIndex index, VoxelIndex min, VoxelIndex max) => |
| | 51 | 201 | | index.x >= min.x && index.x <= max.x |
| | 51 | 202 | | && index.y >= min.y && index.y <= max.y |
| | 51 | 203 | | && index.z >= min.z && index.z <= max.z; |
| | | 204 | | } |