Storage Rewrite #6
|
@ -0,0 +1,106 @@
|
||||||
|
using System;
|
||||||
|
using System.Collections.Generic;
|
||||||
|
using System.Runtime.CompilerServices;
|
||||||
|
using System.Runtime.InteropServices;
|
||||||
|
|
||||||
|
namespace MoonTools.ECS.Collections;
|
||||||
|
|
||||||
|
public unsafe class IndexableSet<T> : IDisposable where T : unmanaged
|
||||||
|
{
|
||||||
|
private Dictionary<T, int> Indices;
|
||||||
|
private T* Array;
|
||||||
|
public int Count { get; private set; }
|
||||||
|
private int Capacity;
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public Span<T> AsSpan() => new Span<T>(Array, Count);
|
||||||
|
public ReverseSpanEnumerator<T> GetEnumerator() => new ReverseSpanEnumerator<T>(new Span<T>(Array, Count));
|
||||||
|
|
||||||
|
public IndexableSet(int capacity = 32)
|
||||||
|
{
|
||||||
|
this.Capacity = capacity;
|
||||||
|
Count = 0;
|
||||||
|
|
||||||
|
Indices = new Dictionary<T, int>(capacity);
|
||||||
|
Array = (T*) NativeMemory.Alloc((nuint) (capacity * Unsafe.SizeOf<T>()));
|
||||||
|
}
|
||||||
|
|
||||||
|
public T this[int i] => Array[i];
|
||||||
|
|
||||||
|
public bool Contains(T element)
|
||||||
|
{
|
||||||
|
return Indices.ContainsKey(element);
|
||||||
|
}
|
||||||
|
|
||||||
|
public bool Add(T element)
|
||||||
|
{
|
||||||
|
if (!Contains(element))
|
||||||
|
{
|
||||||
|
Indices.Add(element, Count);
|
||||||
|
|
||||||
|
if (Count >= Capacity)
|
||||||
|
{
|
||||||
|
Capacity *= 2;
|
||||||
|
Array = (T*) NativeMemory.Realloc(Array, (nuint) (Capacity * Unsafe.SizeOf<T>()));
|
||||||
|
}
|
||||||
|
|
||||||
|
Array[Count] = element;
|
||||||
|
Count += 1;
|
||||||
|
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
public bool Remove(T element)
|
||||||
|
{
|
||||||
|
if (!Contains(element))
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
var index = Indices[element];
|
||||||
|
|
||||||
|
for (var i = index; i < Count - 1; i += 1)
|
||||||
|
{
|
||||||
|
Array[i] = Array[i + 1];
|
||||||
|
Indices[Array[i]] = i;
|
||||||
|
}
|
||||||
|
|
||||||
|
Indices.Remove(element);
|
||||||
|
Count -= 1;
|
||||||
|
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Clear()
|
||||||
|
{
|
||||||
|
Indices.Clear();
|
||||||
|
Count = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
NativeMemory.Free(Array);
|
||||||
|
Array = null;
|
||||||
|
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
~IndexableSet()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: false);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
|
}
|
||||||
|
}
|
|
@ -0,0 +1,120 @@
|
||||||
|
using System;
|
||||||
|
using System.Runtime.CompilerServices;
|
||||||
|
using System.Runtime.InteropServices;
|
||||||
|
|
||||||
|
namespace MoonTools.ECS.Collections;
|
||||||
|
|
||||||
|
public unsafe class NativeArray<T> : IDisposable where T : unmanaged
|
||||||
|
{
|
||||||
|
private T* Elements;
|
||||||
|
public int Count { get; private set;}
|
||||||
|
private int Capacity;
|
||||||
|
private int ElementSize;
|
||||||
|
|
||||||
|
public Span<T> ToSpan() => new Span<T>(Elements, Count);
|
||||||
|
public Span<T>.Enumerator GetEnumerator() => new Span<T>(Elements, Count).GetEnumerator();
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public NativeArray(int capacity = 16)
|
||||||
|
{
|
||||||
|
this.Capacity = capacity;
|
||||||
|
ElementSize = Unsafe.SizeOf<T>();
|
||||||
|
Elements = (T*) NativeMemory.Alloc((nuint) (capacity * ElementSize));
|
||||||
|
Count = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
public ref T this[int i] => ref Elements[i];
|
||||||
|
|
||||||
|
public void Append(T item)
|
||||||
|
{
|
||||||
|
if (Count >= Capacity)
|
||||||
|
{
|
||||||
|
Capacity *= 2;
|
||||||
|
Elements = (T*) NativeMemory.Realloc(Elements, (nuint) (Capacity * Unsafe.SizeOf<T>()));
|
||||||
|
}
|
||||||
|
|
||||||
|
Elements[Count] = item;
|
||||||
|
Count += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void RemoveLastElement()
|
||||||
|
{
|
||||||
|
Count -= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
public bool TryPop(out T element)
|
||||||
|
{
|
||||||
|
if (Count > 0)
|
||||||
|
{
|
||||||
|
element = Elements[Count - 1];
|
||||||
|
Count -= 1;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
element = default;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Clear()
|
||||||
|
{
|
||||||
|
Count = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
private void ResizeTo(int size)
|
||||||
|
{
|
||||||
|
Capacity = size;
|
||||||
|
Elements = (T*) NativeMemory.Realloc((void*) Elements, (nuint) (ElementSize * Capacity));
|
||||||
|
}
|
||||||
|
|
||||||
|
// Fills gap by copying final element to the deleted index
|
||||||
|
public void Delete(int index)
|
||||||
|
{
|
||||||
|
if (index != Count - 1)
|
||||||
|
{
|
||||||
|
this[index] = this[Count - 1];
|
||||||
|
}
|
||||||
|
|
||||||
|
Count -= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void CopyTo(NativeArray<T> other)
|
||||||
|
{
|
||||||
|
if (Count >= other.Capacity)
|
||||||
|
{
|
||||||
|
other.ResizeTo(Count);
|
||||||
|
}
|
||||||
|
|
||||||
|
NativeMemory.Copy(
|
||||||
|
(void*) Elements,
|
||||||
|
(void*) other.Elements,
|
||||||
|
(nuint) (ElementSize * Count)
|
||||||
|
);
|
||||||
|
|
||||||
|
other.Count = Count;
|
||||||
|
}
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
NativeMemory.Free(Elements);
|
||||||
|
Elements = null;
|
||||||
|
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
~NativeArray()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: false);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
|
}
|
||||||
|
}
|
|
@ -0,0 +1,121 @@
|
||||||
|
using System;
|
||||||
|
using System.Runtime.CompilerServices;
|
||||||
|
using System.Runtime.InteropServices;
|
||||||
|
|
||||||
|
namespace MoonTools.ECS.Collections;
|
||||||
|
|
||||||
|
internal unsafe class NativeArray : IDisposable
|
||||||
|
{
|
||||||
|
private nint Elements;
|
||||||
|
public int Count { get; private set;}
|
||||||
|
private int Capacity;
|
||||||
|
public readonly int ElementSize;
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public NativeArray(int elementSize)
|
||||||
|
{
|
||||||
|
Capacity = 16;
|
||||||
|
Count = 0;
|
||||||
|
ElementSize = elementSize;
|
||||||
|
|
||||||
|
Elements = (nint) NativeMemory.Alloc((nuint) (ElementSize * Capacity));
|
||||||
|
}
|
||||||
|
|
||||||
|
public Span<T> ToSpan<T>()
|
||||||
|
{
|
||||||
|
return new Span<T>((void*) Elements, Count);
|
||||||
|
}
|
||||||
|
|
||||||
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||||
|
public ref T Get<T>(int i) where T : unmanaged
|
||||||
|
{
|
||||||
|
return ref ((T*) Elements)[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Set<T>(int i, in T element) where T : unmanaged
|
||||||
|
{
|
||||||
|
Unsafe.Write((void*) (Elements + ElementSize * i), element);
|
||||||
|
}
|
||||||
|
|
||||||
|
private void Resize()
|
||||||
|
{
|
||||||
|
Capacity *= 2;
|
||||||
|
Elements = (nint) NativeMemory.Realloc((void*) Elements, (nuint) (ElementSize * Capacity));
|
||||||
|
}
|
||||||
|
|
||||||
|
private void ResizeTo(int capacity)
|
||||||
|
{
|
||||||
|
Capacity = capacity;
|
||||||
|
Elements = (nint) NativeMemory.Realloc((void*) Elements, (nuint) (ElementSize * Capacity));
|
||||||
|
}
|
||||||
|
|
||||||
|
// Fills gap by copying final element to the deleted index
|
||||||
|
public void Delete(int index)
|
||||||
|
{
|
||||||
|
if (index != Count - 1)
|
||||||
|
{
|
||||||
|
NativeMemory.Copy(
|
||||||
|
(void*) (Elements + ((Count - 1) * ElementSize)),
|
||||||
|
(void*) (Elements + (index * ElementSize)),
|
||||||
|
(nuint) ElementSize
|
||||||
|
);
|
||||||
|
}
|
||||||
|
|
||||||
|
Count -= 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Append<T>(T component) where T : unmanaged
|
||||||
|
{
|
||||||
|
if (Count >= Capacity)
|
||||||
|
{
|
||||||
|
Resize();
|
||||||
|
}
|
||||||
|
|
||||||
|
((T*) Elements)[Count] = component;
|
||||||
|
Count += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void CopyAllTo(NativeArray other)
|
||||||
|
{
|
||||||
|
if (Count >= other.Capacity)
|
||||||
|
{
|
||||||
|
other.ResizeTo(Count);
|
||||||
|
}
|
||||||
|
|
||||||
|
NativeMemory.Copy(
|
||||||
|
(void*) Elements,
|
||||||
|
(void*) other.Elements,
|
||||||
|
(nuint) (ElementSize * Count)
|
||||||
|
);
|
||||||
|
|
||||||
|
other.Count = Count;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Clear()
|
||||||
|
{
|
||||||
|
Count = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
NativeMemory.Free((void*) Elements);
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
~NativeArray()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: false);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
|
}
|
||||||
|
}
|
|
@ -1,139 +0,0 @@
|
||||||
using System;
|
|
||||||
using System.Collections.Generic;
|
|
||||||
using System.Runtime.CompilerServices;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
|
||||||
{
|
|
||||||
internal class ComponentDepot
|
|
||||||
{
|
|
||||||
private TypeIndices ComponentTypeIndices;
|
|
||||||
|
|
||||||
private ComponentStorage[] storages = new ComponentStorage[256];
|
|
||||||
|
|
||||||
public ComponentDepot(TypeIndices componentTypeIndices)
|
|
||||||
{
|
|
||||||
ComponentTypeIndices = componentTypeIndices;
|
|
||||||
}
|
|
||||||
|
|
||||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
||||||
internal void Register<TComponent>(int index) where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
if (index >= storages.Length)
|
|
||||||
{
|
|
||||||
Array.Resize(ref storages, storages.Length * 2);
|
|
||||||
}
|
|
||||||
|
|
||||||
storages[index] = new ComponentStorage<TComponent>();
|
|
||||||
}
|
|
||||||
|
|
||||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
||||||
private ComponentStorage<TComponent> Lookup<TComponent>() where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
var storageIndex = ComponentTypeIndices.GetIndex<TComponent>();
|
|
||||||
// TODO: is there some way to avoid this null check?
|
|
||||||
if (storageIndex >= storages.Length || storages[storageIndex] == null)
|
|
||||||
{
|
|
||||||
Register<TComponent>(storageIndex);
|
|
||||||
}
|
|
||||||
return (ComponentStorage<TComponent>) storages[storageIndex];
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool Some<TComponent>() where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TComponent>().Any();
|
|
||||||
}
|
|
||||||
|
|
||||||
public ref readonly TComponent Get<TComponent>(int entityID) where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return ref Lookup<TComponent>().Get(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public ref readonly TComponent GetFirst<TComponent>() where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return ref Lookup<TComponent>().GetFirst();
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Set<TComponent>(int entityID, in TComponent component) where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
Lookup<TComponent>().Set(entityID, component);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity GetSingletonEntity<TComponent>() where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TComponent>().FirstEntity();
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReadOnlySpan<TComponent> ReadComponents<TComponent>() where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TComponent>().AllComponents();
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Remove(int entityID, int storageIndex)
|
|
||||||
{
|
|
||||||
storages[storageIndex].Remove(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Remove<TComponent>(int entityID) where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
Lookup<TComponent>().Remove(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Clear()
|
|
||||||
{
|
|
||||||
for (var i = 0; i < storages.Length; i += 1)
|
|
||||||
{
|
|
||||||
if (storages[i] != null)
|
|
||||||
{
|
|
||||||
storages[i].Clear();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// these methods used to implement transfers and debugging
|
|
||||||
|
|
||||||
internal unsafe void* UntypedGet(int entityID, int componentTypeIndex)
|
|
||||||
{
|
|
||||||
return storages[componentTypeIndex].UntypedGet(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
internal unsafe void Set(int entityID, int componentTypeIndex, void* component)
|
|
||||||
{
|
|
||||||
storages[componentTypeIndex].Set(entityID, component);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void CreateMissingStorages(ComponentDepot other)
|
|
||||||
{
|
|
||||||
while (other.ComponentTypeIndices.Count >= storages.Length)
|
|
||||||
{
|
|
||||||
Array.Resize(ref storages, storages.Length * 2);
|
|
||||||
}
|
|
||||||
|
|
||||||
while (other.ComponentTypeIndices.Count >= other.storages.Length)
|
|
||||||
{
|
|
||||||
Array.Resize(ref other.storages, other.storages.Length * 2);
|
|
||||||
}
|
|
||||||
|
|
||||||
for (var i = 0; i < other.ComponentTypeIndices.Count; i += 1)
|
|
||||||
{
|
|
||||||
if (storages[i] == null && other.storages[i] != null)
|
|
||||||
{
|
|
||||||
storages[i] = other.storages[i].CreateStorage();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// this method is used to iterate components of an entity, only for use with a debug inspector
|
|
||||||
|
|
||||||
#if DEBUG
|
|
||||||
public object Debug_Get(int entityID, int componentTypeIndex)
|
|
||||||
{
|
|
||||||
return storages[componentTypeIndex].Debug_Get(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public IEnumerable<int> Debug_GetEntityIDs(int componentTypeIndex)
|
|
||||||
{
|
|
||||||
return storages[componentTypeIndex].Debug_GetEntityIDs();
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
}
|
|
|
@ -1,182 +1,140 @@
|
||||||
using System;
|
using System;
|
||||||
using System.Collections.Generic;
|
using System.Collections.Generic;
|
||||||
using System.Runtime.CompilerServices;
|
using MoonTools.ECS.Collections;
|
||||||
using System.Runtime.InteropServices;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
internal class ComponentStorage : IDisposable
|
||||||
{
|
{
|
||||||
internal abstract class ComponentStorage
|
internal readonly Dictionary<Entity, int> EntityIDToStorageIndex = new Dictionary<Entity, int>(16);
|
||||||
{
|
internal readonly NativeArray Components;
|
||||||
internal abstract unsafe void Set(int entityID, void* component);
|
internal readonly NativeArray<Entity> EntityIDs;
|
||||||
public abstract bool Remove(int entityID);
|
internal readonly TypeId TypeId;
|
||||||
public abstract void Clear();
|
|
||||||
|
|
||||||
// used for debugging and template instantiation
|
private bool IsDisposed;
|
||||||
internal abstract unsafe void* UntypedGet(int entityID);
|
|
||||||
// used to create correctly typed storage on snapshot
|
public ComponentStorage(TypeId typeId, int elementSize)
|
||||||
public abstract ComponentStorage CreateStorage();
|
{
|
||||||
#if DEBUG
|
Components = new NativeArray(elementSize);
|
||||||
internal abstract object Debug_Get(int entityID);
|
EntityIDs = new NativeArray<Entity>();
|
||||||
internal abstract IEnumerable<int> Debug_GetEntityIDs();
|
TypeId = typeId;
|
||||||
#endif
|
|
||||||
}
|
}
|
||||||
|
|
||||||
internal unsafe class ComponentStorage<TComponent> : ComponentStorage, IDisposable where TComponent : unmanaged
|
public bool Any()
|
||||||
{
|
{
|
||||||
private readonly Dictionary<int, int> entityIDToStorageIndex = new Dictionary<int, int>(16);
|
return Components.Count > 0;
|
||||||
private TComponent* components;
|
}
|
||||||
private int* entityIDs;
|
|
||||||
private int count = 0;
|
|
||||||
private int capacity = 16;
|
|
||||||
private bool disposed;
|
|
||||||
|
|
||||||
public ComponentStorage()
|
public bool Has(Entity entity)
|
||||||
{
|
{
|
||||||
components = (TComponent*) NativeMemory.Alloc((nuint) (capacity * Unsafe.SizeOf<TComponent>()));
|
return EntityIDToStorageIndex.ContainsKey(entity);
|
||||||
entityIDs = (int*) NativeMemory.Alloc((nuint) (capacity * Unsafe.SizeOf<int>()));
|
}
|
||||||
}
|
|
||||||
|
|
||||||
public bool Any()
|
public ref T Get<T>(in Entity entity) where T : unmanaged
|
||||||
{
|
{
|
||||||
return count > 0;
|
return ref Components.Get<T>(EntityIDToStorageIndex[entity]);
|
||||||
}
|
}
|
||||||
|
|
||||||
public ref readonly TComponent Get(int entityID)
|
public ref T GetFirst<T>() where T : unmanaged
|
||||||
{
|
{
|
||||||
return ref components[entityIDToStorageIndex[entityID]];
|
|
||||||
}
|
|
||||||
|
|
||||||
internal override unsafe void* UntypedGet(int entityID)
|
|
||||||
{
|
|
||||||
return &components[entityIDToStorageIndex[entityID]];
|
|
||||||
}
|
|
||||||
|
|
||||||
public ref readonly TComponent GetFirst()
|
|
||||||
{
|
|
||||||
#if DEBUG
|
#if DEBUG
|
||||||
if (count == 0)
|
if (Components.Count == 0)
|
||||||
{
|
{
|
||||||
throw new IndexOutOfRangeException("Component storage is empty!");
|
throw new IndexOutOfRangeException("Component storage is empty!");
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
return ref components[0];
|
return ref Components.Get<T>(0);
|
||||||
}
|
}
|
||||||
|
|
||||||
public void Set(int entityID, in TComponent component)
|
// Returns true if the entity had this component.
|
||||||
|
public bool Set<T>(in Entity entity, in T component) where T : unmanaged
|
||||||
|
{
|
||||||
|
if (EntityIDToStorageIndex.TryGetValue(entity, out var index))
|
||||||
{
|
{
|
||||||
if (!entityIDToStorageIndex.ContainsKey(entityID))
|
Components.Set(index, component);
|
||||||
{
|
return true;
|
||||||
var index = count;
|
|
||||||
count += 1;
|
|
||||||
|
|
||||||
if (index >= capacity)
|
|
||||||
{
|
|
||||||
capacity *= 2;
|
|
||||||
components = (TComponent*) NativeMemory.Realloc(components, (nuint) (capacity * Unsafe.SizeOf<TComponent>()));
|
|
||||||
entityIDs = (int*) NativeMemory.Realloc(entityIDs, (nuint) (capacity * Unsafe.SizeOf<int>()));
|
|
||||||
}
|
|
||||||
|
|
||||||
entityIDToStorageIndex[entityID] = index;
|
|
||||||
entityIDs[index] = entityID;
|
|
||||||
}
|
|
||||||
|
|
||||||
components[entityIDToStorageIndex[entityID]] = component;
|
|
||||||
}
|
}
|
||||||
|
else
|
||||||
internal override unsafe void Set(int entityID, void* component)
|
|
||||||
{
|
{
|
||||||
Set(entityID, *(TComponent*) component);
|
EntityIDToStorageIndex[entity] = Components.Count;
|
||||||
}
|
EntityIDs.Append(entity);
|
||||||
|
Components.Append(component);
|
||||||
// Returns true if the entity had this component.
|
|
||||||
public override bool Remove(int entityID)
|
|
||||||
{
|
|
||||||
if (entityIDToStorageIndex.TryGetValue(entityID, out int storageIndex))
|
|
||||||
{
|
|
||||||
entityIDToStorageIndex.Remove(entityID);
|
|
||||||
|
|
||||||
var lastElementIndex = count - 1;
|
|
||||||
|
|
||||||
// move a component into the hole to maintain contiguous memory
|
|
||||||
if (lastElementIndex != storageIndex)
|
|
||||||
{
|
|
||||||
var lastEntityID = entityIDs[lastElementIndex];
|
|
||||||
entityIDToStorageIndex[lastEntityID] = storageIndex;
|
|
||||||
components[storageIndex] = components[lastElementIndex];
|
|
||||||
entityIDs[storageIndex] = lastEntityID;
|
|
||||||
}
|
|
||||||
|
|
||||||
count -= 1;
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
public override void Clear()
|
// Returns true if the entity had this component.
|
||||||
|
public bool Remove(in Entity entity)
|
||||||
|
{
|
||||||
|
if (EntityIDToStorageIndex.TryGetValue(entity, out int index))
|
||||||
{
|
{
|
||||||
count = 0;
|
var lastElementIndex = Components.Count - 1;
|
||||||
entityIDToStorageIndex.Clear();
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReadOnlySpan<TComponent> AllComponents()
|
var lastEntity = EntityIDs[lastElementIndex];
|
||||||
{
|
|
||||||
return new ReadOnlySpan<TComponent>(components, count);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity FirstEntity()
|
// move a component into the hole to maintain contiguous memory
|
||||||
{
|
Components.Delete(index);
|
||||||
#if DEBUG
|
EntityIDs.Delete(index);
|
||||||
if (count == 0)
|
EntityIDToStorageIndex.Remove(entity);
|
||||||
|
|
||||||
|
// update the index if it changed
|
||||||
|
if (lastElementIndex != index)
|
||||||
{
|
{
|
||||||
throw new IndexOutOfRangeException("Component storage is empty!");
|
EntityIDToStorageIndex[lastEntity] = index;
|
||||||
}
|
}
|
||||||
#endif
|
|
||||||
return new Entity(entityIDs[0]);
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
public override ComponentStorage<TComponent> CreateStorage()
|
return false;
|
||||||
{
|
}
|
||||||
return new ComponentStorage<TComponent>();
|
|
||||||
}
|
|
||||||
|
|
||||||
|
public void Clear()
|
||||||
|
{
|
||||||
|
Components.Clear();
|
||||||
|
EntityIDs.Clear();
|
||||||
|
EntityIDToStorageIndex.Clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
public Entity FirstEntity()
|
||||||
|
{
|
||||||
#if DEBUG
|
#if DEBUG
|
||||||
internal override object Debug_Get(int entityID)
|
if (EntityIDs.Count == 0)
|
||||||
{
|
{
|
||||||
return components[entityIDToStorageIndex[entityID]];
|
throw new IndexOutOfRangeException("Component storage is empty!");
|
||||||
}
|
|
||||||
|
|
||||||
internal override IEnumerable<int> Debug_GetEntityIDs()
|
|
||||||
{
|
|
||||||
return entityIDToStorageIndex.Keys;
|
|
||||||
}
|
|
||||||
|
|
||||||
protected virtual void Dispose(bool disposing)
|
|
||||||
{
|
|
||||||
if (!disposed)
|
|
||||||
{
|
|
||||||
NativeMemory.Free(components);
|
|
||||||
NativeMemory.Free(entityIDs);
|
|
||||||
components = null;
|
|
||||||
entityIDs = null;
|
|
||||||
|
|
||||||
disposed = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
~ComponentStorage()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: false);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Dispose()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: true);
|
|
||||||
GC.SuppressFinalize(this);
|
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
return EntityIDs[0];
|
||||||
|
}
|
||||||
|
|
||||||
|
#if DEBUG
|
||||||
|
internal IEnumerable<Entity> Debug_GetEntities()
|
||||||
|
{
|
||||||
|
return EntityIDToStorageIndex.Keys;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
Components.Dispose();
|
||||||
|
EntityIDs.Dispose();
|
||||||
|
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// ~ComponentStorage()
|
||||||
|
// {
|
||||||
|
// // Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
// Dispose(disposing: false);
|
||||||
|
// }
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,63 +1,17 @@
|
||||||
// NOTE: these methods are very inefficient
|
// NOTE: these methods are very inefficient
|
||||||
// this class should only be used in debugging contexts!!
|
// this class should only be used in debugging contexts!!
|
||||||
|
|
||||||
#if DEBUG
|
#if DEBUG
|
||||||
using System;
|
using System;
|
||||||
using System.Collections.Generic;
|
using System.Collections.Generic;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public abstract class DebugSystem : System
|
||||||
{
|
{
|
||||||
public abstract class DebugSystem : System
|
protected DebugSystem(World world) : base(world) { }
|
||||||
{
|
|
||||||
protected DebugSystem(World world) : base(world)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
protected ComponentEnumerator Debug_GetAllComponents(Entity entity)
|
protected World.ComponentTypeEnumerator Debug_GetAllComponentTypes(Entity entity) => World.Debug_GetAllComponentTypes(entity);
|
||||||
{
|
protected IEnumerable<Entity> Debug_GetEntities(Type componentType) => World.Debug_GetEntities(componentType);
|
||||||
return new ComponentEnumerator(ComponentDepot, entity, EntityStorage.ComponentTypeIndices(entity.ID));
|
protected IEnumerable<Type> Debug_SearchComponentType(string typeString) => World.Debug_SearchComponentType(typeString);
|
||||||
}
|
|
||||||
|
|
||||||
protected IEnumerable<Entity> Debug_GetEntities(Type componentType)
|
|
||||||
{
|
|
||||||
foreach (var entityID in ComponentDepot.Debug_GetEntityIDs(ComponentTypeIndices.GetIndex(componentType)))
|
|
||||||
{
|
|
||||||
yield return new Entity(entityID);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
protected IEnumerable<Type> Debug_SearchComponentType(string typeString)
|
|
||||||
{
|
|
||||||
foreach (var type in ComponentTypeIndices.Types)
|
|
||||||
{
|
|
||||||
if (type.ToString().ToLower().Contains(typeString.ToLower()))
|
|
||||||
{
|
|
||||||
yield return type;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public ref struct ComponentEnumerator
|
|
||||||
{
|
|
||||||
private ComponentDepot ComponentDepot;
|
|
||||||
private Entity Entity;
|
|
||||||
private ReverseSpanEnumerator<int> ComponentTypeIndices;
|
|
||||||
|
|
||||||
public ComponentEnumerator GetEnumerator() => this;
|
|
||||||
|
|
||||||
internal ComponentEnumerator(
|
|
||||||
ComponentDepot componentDepot,
|
|
||||||
Entity entity,
|
|
||||||
Collections.IndexableSet<int> componentTypeIndices
|
|
||||||
) {
|
|
||||||
ComponentDepot = componentDepot;
|
|
||||||
Entity = entity;
|
|
||||||
ComponentTypeIndices = componentTypeIndices.GetEnumerator();
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool MoveNext() => ComponentTypeIndices.MoveNext();
|
|
||||||
public object Current => ComponentDepot.Debug_Get(Entity.ID, ComponentTypeIndices.Current);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|
|
@ -1,69 +0,0 @@
|
||||||
using System;
|
|
||||||
using System.Runtime.CompilerServices;
|
|
||||||
using System.Runtime.InteropServices;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS.Collections
|
|
||||||
{
|
|
||||||
public unsafe class NativeArray<T> : IDisposable where T : unmanaged
|
|
||||||
{
|
|
||||||
private T* Array;
|
|
||||||
private int count;
|
|
||||||
private int capacity;
|
|
||||||
|
|
||||||
public int Count => count;
|
|
||||||
|
|
||||||
public ReverseSpanEnumerator<T> GetEnumerator() => new ReverseSpanEnumerator<T>(new Span<T>(Array, Count));
|
|
||||||
|
|
||||||
private bool disposed;
|
|
||||||
|
|
||||||
public NativeArray(int capacity = 16)
|
|
||||||
{
|
|
||||||
this.capacity = capacity;
|
|
||||||
Array = (T*) NativeMemory.Alloc((nuint) (capacity * Unsafe.SizeOf<T>()));
|
|
||||||
count = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
public ref T this[int i] => ref Array[i];
|
|
||||||
|
|
||||||
public void Add(T item)
|
|
||||||
{
|
|
||||||
if (count >= capacity)
|
|
||||||
{
|
|
||||||
capacity *= 2;
|
|
||||||
Array = (T*) NativeMemory.Realloc(Array, (nuint) (capacity * Unsafe.SizeOf<T>()));
|
|
||||||
}
|
|
||||||
|
|
||||||
Array[count] = item;
|
|
||||||
count += 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Clear()
|
|
||||||
{
|
|
||||||
count = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
protected virtual void Dispose(bool disposing)
|
|
||||||
{
|
|
||||||
if (!disposed)
|
|
||||||
{
|
|
||||||
NativeMemory.Free(Array);
|
|
||||||
Array = null;
|
|
||||||
|
|
||||||
disposed = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
~NativeArray()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: false);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Dispose()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: true);
|
|
||||||
GC.SuppressFinalize(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
|
@ -1,49 +1,3 @@
|
||||||
using System;
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
public readonly record struct Entity(uint ID);
|
||||||
{
|
|
||||||
public struct Entity : IEquatable<Entity>
|
|
||||||
{
|
|
||||||
public int ID { get; }
|
|
||||||
|
|
||||||
internal Entity(int id)
|
|
||||||
{
|
|
||||||
ID = id;
|
|
||||||
}
|
|
||||||
|
|
||||||
public override bool Equals(object? obj)
|
|
||||||
{
|
|
||||||
return obj is Entity entity && Equals(entity);
|
|
||||||
}
|
|
||||||
|
|
||||||
public override int GetHashCode()
|
|
||||||
{
|
|
||||||
return HashCode.Combine(ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool Equals(Entity other)
|
|
||||||
{
|
|
||||||
return ID == other.ID;
|
|
||||||
}
|
|
||||||
|
|
||||||
public static bool operator ==(Entity a, Entity b)
|
|
||||||
{
|
|
||||||
return a.Equals(b);
|
|
||||||
}
|
|
||||||
|
|
||||||
public static bool operator !=(Entity a, Entity b)
|
|
||||||
{
|
|
||||||
return !a.Equals(b);
|
|
||||||
}
|
|
||||||
|
|
||||||
public static implicit operator int(Entity e)
|
|
||||||
{
|
|
||||||
return e.ID;
|
|
||||||
}
|
|
||||||
|
|
||||||
public static implicit operator Entity(int i)
|
|
||||||
{
|
|
||||||
return new Entity(i);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
|
@ -1,127 +1,36 @@
|
||||||
using System;
|
namespace MoonTools.ECS;
|
||||||
using System.Collections.Generic;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
public abstract class EntityComponentReader
|
||||||
{
|
{
|
||||||
public abstract class EntityComponentReader
|
protected readonly World World;
|
||||||
|
public FilterBuilder FilterBuilder => World.FilterBuilder;
|
||||||
|
|
||||||
|
protected EntityComponentReader(World world)
|
||||||
{
|
{
|
||||||
internal readonly World World;
|
World = world;
|
||||||
internal EntityStorage EntityStorage => World.EntityStorage;
|
|
||||||
internal ComponentDepot ComponentDepot => World.ComponentDepot;
|
|
||||||
internal RelationDepot RelationDepot => World.RelationDepot;
|
|
||||||
protected FilterBuilder FilterBuilder => new FilterBuilder(FilterStorage, ComponentTypeIndices);
|
|
||||||
internal FilterStorage FilterStorage => World.FilterStorage;
|
|
||||||
internal TypeIndices ComponentTypeIndices => World.ComponentTypeIndices;
|
|
||||||
internal TypeIndices RelationTypeIndices => World.RelationTypeIndices;
|
|
||||||
|
|
||||||
public EntityComponentReader(World world)
|
|
||||||
{
|
|
||||||
World = world;
|
|
||||||
}
|
|
||||||
|
|
||||||
protected string GetTag(in Entity entity)
|
|
||||||
{
|
|
||||||
return World.GetTag(entity);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected ReadOnlySpan<TComponent> ReadComponents<TComponent>() where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return ComponentDepot.ReadComponents<TComponent>();
|
|
||||||
}
|
|
||||||
|
|
||||||
protected bool Has<TComponent>(in Entity entity) where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
var storageIndex = ComponentTypeIndices.GetIndex<TComponent>();
|
|
||||||
return EntityStorage.HasComponent(entity.ID, storageIndex);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected bool Some<TComponent>() where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return ComponentDepot.Some<TComponent>();
|
|
||||||
}
|
|
||||||
|
|
||||||
protected ref readonly TComponent Get<TComponent>(in Entity entity) where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return ref ComponentDepot.Get<TComponent>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected ref readonly TComponent GetSingleton<TComponent>() where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return ref ComponentDepot.GetFirst<TComponent>();
|
|
||||||
}
|
|
||||||
|
|
||||||
protected Entity GetSingletonEntity<TComponent>() where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
return ComponentDepot.GetSingletonEntity<TComponent>();
|
|
||||||
}
|
|
||||||
|
|
||||||
protected ReverseSpanEnumerator<(Entity, Entity)> Relations<TRelationKind>() where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.Relations<TRelationKind>();
|
|
||||||
}
|
|
||||||
|
|
||||||
protected bool Related<TRelationKind>(in Entity a, in Entity b) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.Related<TRelationKind>(a.ID, b.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected TRelationKind GetRelationData<TRelationKind>(in Entity a, in Entity b) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.Get<TRelationKind>(a, b);
|
|
||||||
}
|
|
||||||
|
|
||||||
// relations go A->B, so given A, will give all entities in outgoing relations of this kind.
|
|
||||||
protected ReverseSpanEnumerator<Entity> OutRelations<TRelationKind>(in Entity entity) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.OutRelations<TRelationKind>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected Entity OutRelationSingleton<TRelationKind>(in Entity entity) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.OutRelationSingleton<TRelationKind>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
// NOTE: this WILL crash if at least n + 1 relations do not exist!
|
|
||||||
protected Entity NthOutRelation<TRelationKind>(in Entity entity, int n) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.NthOutRelation<TRelationKind>(entity.ID, n);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected bool HasOutRelation<TRelationKind>(in Entity entity) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.HasOutRelation<TRelationKind>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected int OutRelationCount<TRelationKind>(in Entity entity) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.OutRelationCount<TRelationKind>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Relations go A->B, so given B, will give all entities in incoming A relations of this kind.
|
|
||||||
protected ReverseSpanEnumerator<Entity> InRelations<TRelationKind>(in Entity entity) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.InRelations<TRelationKind>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected Entity InRelationSingleton<TRelationKind>(in Entity entity) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.InRelationSingleton<TRelationKind>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
// NOTE: this WILL crash if at least n + 1 relations do not exist!
|
|
||||||
protected Entity NthInRelation<TRelationKind>(in Entity entity, int n) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.NthInRelation<TRelationKind>(entity.ID, n);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected bool HasInRelation<TRelationKind>(in Entity entity) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.HasInRelation<TRelationKind>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected int InRelationCount<TRelationKind>(in Entity entity) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return RelationDepot.InRelationCount<TRelationKind>(entity.ID);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
protected string GetTag(in Entity entity) => World.GetTag(entity);
|
||||||
|
|
||||||
|
protected bool Has<T>(in Entity Entity) where T : unmanaged => World.Has<T>(Entity);
|
||||||
|
protected bool Some<T>() where T : unmanaged => World.Some<T>();
|
||||||
|
protected ref T Get<T>(in Entity Entity) where T : unmanaged => ref World.Get<T>(Entity);
|
||||||
|
protected ref T GetSingleton<T>() where T : unmanaged => ref World.GetSingleton<T>();
|
||||||
|
protected Entity GetSingletonEntity<T>() where T : unmanaged => World.GetSingletonEntity<T>();
|
||||||
|
|
||||||
|
protected ReverseSpanEnumerator<(Entity, Entity)> Relations<T>() where T : unmanaged => World.Relations<T>();
|
||||||
|
protected bool Related<T>(in Entity entityA, in Entity entityB) where T : unmanaged => World.Related<T>(entityA, entityB);
|
||||||
|
protected T GetRelationData<T>(in Entity entityA, in Entity entityB) where T : unmanaged => World.GetRelationData<T>(entityA, entityB);
|
||||||
|
|
||||||
|
protected ReverseSpanEnumerator<Entity> OutRelations<T>(in Entity entity) where T : unmanaged => World.OutRelations<T>(entity);
|
||||||
|
protected Entity OutRelationSingleton<T>(in Entity entity) where T : unmanaged => World.OutRelationSingleton<T>(entity);
|
||||||
|
protected bool HasOutRelation<T>(in Entity entity) where T : unmanaged => World.HasOutRelation<T>(entity);
|
||||||
|
protected int OutRelationCount<T>(in Entity entity) where T : unmanaged => World.OutRelationCount<T>(entity);
|
||||||
|
protected Entity NthOutRelation<T>(in Entity entity, int n) where T : unmanaged => World.NthOutRelation<T>(entity, n);
|
||||||
|
|
||||||
|
protected ReverseSpanEnumerator<Entity> InRelations<T>(in Entity entity) where T : unmanaged => World.InRelations<T>(entity);
|
||||||
|
protected Entity InRelationSingleton<T>(in Entity entity) where T : unmanaged => World.InRelationSingleton<T>(entity);
|
||||||
|
protected bool HasInRelation<T>(in Entity entity) where T : unmanaged => World.HasInRelation<T>(entity);
|
||||||
|
protected int InRelationCount<T>(in Entity entity) where T : unmanaged => World.InRelationCount<T>(entity);
|
||||||
|
protected Entity NthInRelation<T>(in Entity entity, int n) where T : unmanaged => World.NthInRelation<T>(entity, n);
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,142 +0,0 @@
|
||||||
using System.Collections.Generic;
|
|
||||||
using MoonTools.ECS.Collections;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
|
||||||
{
|
|
||||||
internal class EntityStorage
|
|
||||||
{
|
|
||||||
private int nextID = 0;
|
|
||||||
// FIXME: why is this duplicated?
|
|
||||||
private readonly Stack<int> availableIDs = new Stack<int>();
|
|
||||||
// FIXME: this is only needed in debug mode
|
|
||||||
private readonly HashSet<int> availableIDHash = new HashSet<int>();
|
|
||||||
|
|
||||||
private Dictionary<int, IndexableSet<int>> EntityToComponentTypeIndices = new Dictionary<int, IndexableSet<int>>();
|
|
||||||
private Dictionary<int, IndexableSet<int>> EntityToRelationTypeIndices = new Dictionary<int, IndexableSet<int>>();
|
|
||||||
|
|
||||||
public int Count => nextID - availableIDs.Count;
|
|
||||||
|
|
||||||
public Dictionary<int, string> Tags = new Dictionary<int, string>();
|
|
||||||
|
|
||||||
public Entity Create(string tag)
|
|
||||||
{
|
|
||||||
var entity = new Entity(NextID());
|
|
||||||
|
|
||||||
if (!EntityToComponentTypeIndices.ContainsKey(entity.ID))
|
|
||||||
{
|
|
||||||
EntityToComponentTypeIndices.Add(entity.ID, new IndexableSet<int>());
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!EntityToRelationTypeIndices.ContainsKey(entity.ID))
|
|
||||||
{
|
|
||||||
EntityToRelationTypeIndices.Add(entity.ID, new IndexableSet<int>());
|
|
||||||
}
|
|
||||||
|
|
||||||
Tags[entity.ID] = tag;
|
|
||||||
|
|
||||||
return entity;
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool Exists(in Entity entity)
|
|
||||||
{
|
|
||||||
return Taken(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Tag(in Entity entity, string tag)
|
|
||||||
{
|
|
||||||
Tags[entity.ID] = tag;
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Destroy(in Entity entity)
|
|
||||||
{
|
|
||||||
EntityToComponentTypeIndices[entity.ID].Clear();
|
|
||||||
EntityToRelationTypeIndices[entity.ID].Clear();
|
|
||||||
Tags.Remove(entity.ID);
|
|
||||||
Release(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns true if the component is new.
|
|
||||||
public bool SetComponent(int entityID, int componentTypeIndex)
|
|
||||||
{
|
|
||||||
return EntityToComponentTypeIndices[entityID].Add(componentTypeIndex);
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool HasComponent(int entityID, int componentTypeIndex)
|
|
||||||
{
|
|
||||||
return EntityToComponentTypeIndices[entityID].Contains(componentTypeIndex);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Returns true if the component existed.
|
|
||||||
public bool RemoveComponent(int entityID, int componentTypeIndex)
|
|
||||||
{
|
|
||||||
return EntityToComponentTypeIndices[entityID].Remove(componentTypeIndex);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void AddRelationKind(int entityID, int relationIndex)
|
|
||||||
{
|
|
||||||
EntityToRelationTypeIndices[entityID].Add(relationIndex);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void RemoveRelation(int entityId, int relationIndex)
|
|
||||||
{
|
|
||||||
EntityToRelationTypeIndices[entityId].Remove(relationIndex);
|
|
||||||
}
|
|
||||||
|
|
||||||
public string Tag(int entityID)
|
|
||||||
{
|
|
||||||
return Tags[entityID];
|
|
||||||
}
|
|
||||||
|
|
||||||
public IndexableSet<int> ComponentTypeIndices(int entityID)
|
|
||||||
{
|
|
||||||
return EntityToComponentTypeIndices[entityID];
|
|
||||||
}
|
|
||||||
|
|
||||||
public IndexableSet<int> RelationTypeIndices(int entityID)
|
|
||||||
{
|
|
||||||
return EntityToRelationTypeIndices[entityID];
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Clear()
|
|
||||||
{
|
|
||||||
nextID = 0;
|
|
||||||
foreach (var componentSet in EntityToComponentTypeIndices.Values)
|
|
||||||
{
|
|
||||||
componentSet.Clear();
|
|
||||||
}
|
|
||||||
foreach (var relationSet in EntityToRelationTypeIndices.Values)
|
|
||||||
{
|
|
||||||
relationSet.Clear();
|
|
||||||
}
|
|
||||||
availableIDs.Clear();
|
|
||||||
availableIDHash.Clear();
|
|
||||||
}
|
|
||||||
|
|
||||||
private int NextID()
|
|
||||||
{
|
|
||||||
if (availableIDs.Count > 0)
|
|
||||||
{
|
|
||||||
var id = availableIDs.Pop();
|
|
||||||
availableIDHash.Remove(id);
|
|
||||||
return id;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
var id = nextID;
|
|
||||||
nextID += 1;
|
|
||||||
return id;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
private bool Taken(int id)
|
|
||||||
{
|
|
||||||
return !availableIDHash.Contains(id) && id < nextID;
|
|
||||||
}
|
|
||||||
|
|
||||||
private void Release(int id)
|
|
||||||
{
|
|
||||||
availableIDs.Push(id);
|
|
||||||
availableIDHash.Add(id);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
|
@ -1,36 +1,35 @@
|
||||||
using System;
|
using System;
|
||||||
using System.Runtime.CompilerServices;
|
using System.Runtime.CompilerServices;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public ref struct ReverseSpanEnumerator<T>
|
||||||
{
|
{
|
||||||
public ref struct ReverseSpanEnumerator<T>
|
private ReadOnlySpan<T> Span;
|
||||||
|
private int Index;
|
||||||
|
|
||||||
|
public ReverseSpanEnumerator<T> GetEnumerator() => this;
|
||||||
|
|
||||||
|
public T Current => Span[Index];
|
||||||
|
|
||||||
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||||
|
public bool MoveNext()
|
||||||
{
|
{
|
||||||
private ReadOnlySpan<T> Span;
|
if (Index > 0)
|
||||||
private int index;
|
|
||||||
|
|
||||||
public ReverseSpanEnumerator<T> GetEnumerator() => this;
|
|
||||||
|
|
||||||
public T Current => Span[index];
|
|
||||||
|
|
||||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
||||||
public bool MoveNext()
|
|
||||||
{
|
{
|
||||||
if (index > 0)
|
Index -= 1;
|
||||||
{
|
return true;
|
||||||
index -= 1;
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
return false;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
return false;
|
||||||
public ReverseSpanEnumerator(Span<T> span)
|
|
||||||
{
|
|
||||||
Span = span;
|
|
||||||
index = span.Length;
|
|
||||||
}
|
|
||||||
|
|
||||||
public static ReverseSpanEnumerator<T> Empty => new ReverseSpanEnumerator<T>();
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||||
|
public ReverseSpanEnumerator(Span<T> span)
|
||||||
|
{
|
||||||
|
Span = span;
|
||||||
|
Index = span.Length;
|
||||||
|
}
|
||||||
|
|
||||||
|
public static ReverseSpanEnumerator<T> Empty => new ReverseSpanEnumerator<T>();
|
||||||
}
|
}
|
||||||
|
|
141
src/Filter.cs
141
src/Filter.cs
|
@ -1,38 +1,123 @@
|
||||||
using System;
|
using System;
|
||||||
using System.Collections.Generic;
|
|
||||||
using MoonTools.ECS.Collections;
|
using MoonTools.ECS.Collections;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public class Filter
|
||||||
{
|
{
|
||||||
public class Filter
|
private World World;
|
||||||
|
internal FilterSignature Signature;
|
||||||
|
|
||||||
|
internal IndexableSet<Entity> EntitySet = new IndexableSet<Entity>();
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public ReverseSpanEnumerator<Entity> Entities => EntitySet.GetEnumerator();
|
||||||
|
|
||||||
|
public bool Empty => EntitySet.Count == 0;
|
||||||
|
public int Count => EntitySet.Count;
|
||||||
|
|
||||||
|
// WARNING: this WILL crash if the index is out of range!
|
||||||
|
public Entity NthEntity(int index) => EntitySet[index];
|
||||||
|
|
||||||
|
// WARNING: this WILL crash if the filter is empty!
|
||||||
|
public Entity RandomEntity => EntitySet[RandomManager.Next(EntitySet.Count)];
|
||||||
|
public RandomEntityEnumerator EntitiesInRandomOrder => new RandomEntityEnumerator(this);
|
||||||
|
|
||||||
|
internal Filter(World world, FilterSignature signature)
|
||||||
{
|
{
|
||||||
internal FilterSignature Signature;
|
World = world;
|
||||||
private FilterStorage FilterStorage;
|
Signature = signature;
|
||||||
|
}
|
||||||
|
|
||||||
internal Filter(FilterStorage filterStorage, IndexableSet<int> included, IndexableSet<int> excluded)
|
public void DestroyAllEntities()
|
||||||
|
{
|
||||||
|
foreach (var entity in EntitySet)
|
||||||
{
|
{
|
||||||
FilterStorage = filterStorage;
|
World.Destroy(entity);
|
||||||
Signature = new FilterSignature(included, excluded);
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReverseSpanEnumerator<Entity> Entities => FilterStorage.FilterEntities(Signature);
|
|
||||||
public RandomEntityEnumerator EntitiesInRandomOrder => FilterStorage.FilterEntitiesRandom(Signature);
|
|
||||||
public Entity RandomEntity => FilterStorage.FilterRandomEntity(Signature);
|
|
||||||
|
|
||||||
public int Count => FilterStorage.FilterCount(Signature);
|
|
||||||
public bool Empty => Count == 0;
|
|
||||||
|
|
||||||
// WARNING: this WILL crash if the index is out of range!
|
|
||||||
public Entity NthEntity(int index) => FilterStorage.FilterNthEntity(Signature, index);
|
|
||||||
|
|
||||||
public void RegisterAddCallback(Action<Entity> callback)
|
|
||||||
{
|
|
||||||
FilterStorage.RegisterAddCallback(Signature, callback);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void RegisterRemoveCallback(Action<Entity> callback)
|
|
||||||
{
|
|
||||||
FilterStorage.RegisterRemoveCallback(Signature, callback);
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
internal void Check(Entity entity)
|
||||||
|
{
|
||||||
|
foreach (var type in Signature.Included)
|
||||||
|
{
|
||||||
|
if (!World.Has(entity, type))
|
||||||
|
{
|
||||||
|
EntitySet.Remove(entity);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var type in Signature.Excluded)
|
||||||
|
{
|
||||||
|
if (World.Has(entity, type))
|
||||||
|
{
|
||||||
|
EntitySet.Remove(entity);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
EntitySet.Add(entity);
|
||||||
|
}
|
||||||
|
|
||||||
|
internal void AddEntity(in Entity entity)
|
||||||
|
{
|
||||||
|
EntitySet.Add(entity);
|
||||||
|
}
|
||||||
|
|
||||||
|
internal void RemoveEntity(in Entity entity)
|
||||||
|
{
|
||||||
|
EntitySet.Remove(entity);
|
||||||
|
}
|
||||||
|
|
||||||
|
internal void Clear()
|
||||||
|
{
|
||||||
|
EntitySet.Clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
public ref struct RandomEntityEnumerator
|
||||||
|
{
|
||||||
|
private Filter Filter;
|
||||||
|
private LinearCongruentialEnumerator LinearCongruentialEnumerator;
|
||||||
|
|
||||||
|
public RandomEntityEnumerator GetEnumerator() => this;
|
||||||
|
|
||||||
|
internal RandomEntityEnumerator(Filter filter)
|
||||||
|
{
|
||||||
|
Filter = filter;
|
||||||
|
LinearCongruentialEnumerator =
|
||||||
|
RandomManager.LinearCongruentialSequence(filter.Count);
|
||||||
|
}
|
||||||
|
|
||||||
|
public bool MoveNext() => LinearCongruentialEnumerator.MoveNext();
|
||||||
|
public Entity Current => Filter.NthEntity(LinearCongruentialEnumerator.Current);
|
||||||
|
}
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
if (disposing)
|
||||||
|
{
|
||||||
|
EntitySet.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// // TODO: override finalizer only if 'Dispose(bool disposing)' has code to free unmanaged resources
|
||||||
|
// ~Filter()
|
||||||
|
// {
|
||||||
|
// // Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
// Dispose(disposing: false);
|
||||||
|
// }
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -4,42 +4,40 @@ namespace MoonTools.ECS
|
||||||
{
|
{
|
||||||
public struct FilterBuilder
|
public struct FilterBuilder
|
||||||
{
|
{
|
||||||
private TypeIndices ComponentTypeIndices;
|
World World;
|
||||||
private FilterStorage FilterStorage;
|
IndexableSet<TypeId> Included;
|
||||||
private IndexableSet<int> Included;
|
IndexableSet<TypeId> Excluded;
|
||||||
private IndexableSet<int> Excluded;
|
|
||||||
|
|
||||||
internal FilterBuilder(FilterStorage filterStorage, TypeIndices componentTypeIndices)
|
internal FilterBuilder(World world)
|
||||||
{
|
{
|
||||||
FilterStorage = filterStorage;
|
World = world;
|
||||||
ComponentTypeIndices = componentTypeIndices;
|
Included = new IndexableSet<TypeId>();
|
||||||
Included = new IndexableSet<int>();
|
Excluded = new IndexableSet<TypeId>();
|
||||||
Excluded = new IndexableSet<int>();
|
|
||||||
}
|
}
|
||||||
|
|
||||||
private FilterBuilder(FilterStorage filterStorage, TypeIndices componentTypeIndices, IndexableSet<int> included, IndexableSet<int> excluded)
|
private FilterBuilder(World world, IndexableSet<TypeId> included, IndexableSet<TypeId> excluded)
|
||||||
{
|
{
|
||||||
FilterStorage = filterStorage;
|
World = world;
|
||||||
ComponentTypeIndices = componentTypeIndices;
|
|
||||||
Included = included;
|
Included = included;
|
||||||
Excluded = excluded;
|
Excluded = excluded;
|
||||||
}
|
}
|
||||||
|
|
||||||
public FilterBuilder Include<TComponent>() where TComponent : unmanaged
|
public FilterBuilder Include<T>() where T : unmanaged
|
||||||
{
|
{
|
||||||
Included.Add(ComponentTypeIndices.GetIndex<TComponent>());
|
Included.Add(World.GetComponentTypeId<T>());
|
||||||
return new FilterBuilder(FilterStorage, ComponentTypeIndices, Included, Excluded);
|
return new FilterBuilder(World, Included, Excluded);
|
||||||
}
|
}
|
||||||
|
|
||||||
public FilterBuilder Exclude<TComponent>() where TComponent : unmanaged
|
public FilterBuilder Exclude<T>() where T : unmanaged
|
||||||
{
|
{
|
||||||
Excluded.Add(ComponentTypeIndices.GetIndex<TComponent>());
|
Excluded.Add(World.GetComponentTypeId<T>());
|
||||||
return new FilterBuilder(FilterStorage, ComponentTypeIndices, Included, Excluded);
|
return new FilterBuilder(World, Included, Excluded);
|
||||||
}
|
}
|
||||||
|
|
||||||
public Filter Build()
|
public Filter Build()
|
||||||
{
|
{
|
||||||
return FilterStorage.CreateFilter(Included, Excluded);
|
var signature = new FilterSignature(Included, Excluded);
|
||||||
|
return World.GetFilter(signature);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,71 +1,69 @@
|
||||||
using System;
|
using System;
|
||||||
using System.Collections.Generic;
|
|
||||||
using MoonTools.ECS.Collections;
|
using MoonTools.ECS.Collections;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public struct FilterSignature : IEquatable<FilterSignature>
|
||||||
{
|
{
|
||||||
public struct FilterSignature : IEquatable<FilterSignature>
|
public readonly IndexableSet<TypeId> Included;
|
||||||
|
public readonly IndexableSet<TypeId> Excluded;
|
||||||
|
|
||||||
|
public FilterSignature(IndexableSet<TypeId> included, IndexableSet<TypeId> excluded)
|
||||||
{
|
{
|
||||||
public readonly IndexableSet<int> Included;
|
Included = included;
|
||||||
public readonly IndexableSet<int> Excluded;
|
Excluded = excluded;
|
||||||
|
}
|
||||||
|
|
||||||
public FilterSignature(IndexableSet<int> included, IndexableSet<int> excluded)
|
public override bool Equals(object? obj)
|
||||||
{
|
{
|
||||||
Included = included;
|
return obj is FilterSignature signature && Equals(signature);
|
||||||
Excluded = excluded;
|
}
|
||||||
}
|
|
||||||
|
|
||||||
public override bool Equals(object? obj)
|
public bool Equals(FilterSignature other)
|
||||||
|
{
|
||||||
|
foreach (var included in Included)
|
||||||
{
|
{
|
||||||
return obj is FilterSignature signature && Equals(signature);
|
if (!other.Included.Contains(included))
|
||||||
}
|
|
||||||
|
|
||||||
public bool Equals(FilterSignature other)
|
|
||||||
{
|
|
||||||
foreach (var included in Included)
|
|
||||||
{
|
{
|
||||||
if (!other.Included.Contains(included))
|
return false;
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
foreach (var excluded in Excluded)
|
|
||||||
{
|
|
||||||
if (!other.Excluded.Contains(excluded))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
public override int GetHashCode()
|
foreach (var excluded in Excluded)
|
||||||
{
|
{
|
||||||
var hashcode = 1;
|
if (!other.Excluded.Contains(excluded))
|
||||||
|
|
||||||
foreach (var type in Included)
|
|
||||||
{
|
{
|
||||||
hashcode = HashCode.Combine(hashcode, type);
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
foreach (var type in Excluded)
|
|
||||||
{
|
|
||||||
hashcode = HashCode.Combine(hashcode, type);
|
|
||||||
}
|
|
||||||
|
|
||||||
return hashcode;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
public static bool operator ==(FilterSignature left, FilterSignature right)
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
public override int GetHashCode()
|
||||||
|
{
|
||||||
|
var hashcode = 1;
|
||||||
|
|
||||||
|
foreach (var type in Included)
|
||||||
{
|
{
|
||||||
return left.Equals(right);
|
hashcode = HashCode.Combine(hashcode, type);
|
||||||
}
|
}
|
||||||
|
|
||||||
public static bool operator !=(FilterSignature left, FilterSignature right)
|
foreach (var type in Excluded)
|
||||||
{
|
{
|
||||||
return !(left == right);
|
hashcode = HashCode.Combine(hashcode, type);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
return hashcode;
|
||||||
|
}
|
||||||
|
|
||||||
|
public static bool operator ==(FilterSignature left, FilterSignature right)
|
||||||
|
{
|
||||||
|
return left.Equals(right);
|
||||||
|
}
|
||||||
|
|
||||||
|
public static bool operator !=(FilterSignature left, FilterSignature right)
|
||||||
|
{
|
||||||
|
return !(left == right);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,273 +0,0 @@
|
||||||
using System;
|
|
||||||
using System.Collections.Generic;
|
|
||||||
using MoonTools.ECS.Collections;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
|
||||||
{
|
|
||||||
internal class FilterStorage
|
|
||||||
{
|
|
||||||
private EntityStorage EntityStorage;
|
|
||||||
private TypeIndices ComponentTypeIndices;
|
|
||||||
private Dictionary<FilterSignature, IndexableSet<Entity>> filterSignatureToEntityIDs = new Dictionary<FilterSignature, IndexableSet<Entity>>();
|
|
||||||
private Dictionary<int, List<FilterSignature>> typeToFilterSignatures = new Dictionary<int, List<FilterSignature>>();
|
|
||||||
|
|
||||||
private Dictionary<FilterSignature, Action<Entity>> addCallbacks = new Dictionary<FilterSignature, Action<Entity>>();
|
|
||||||
private Dictionary<FilterSignature, Action<Entity>> removeCallbacks = new Dictionary<FilterSignature, Action<Entity>>();
|
|
||||||
|
|
||||||
public FilterStorage(EntityStorage entityStorage, TypeIndices componentTypeIndices)
|
|
||||||
{
|
|
||||||
EntityStorage = entityStorage;
|
|
||||||
ComponentTypeIndices = componentTypeIndices;
|
|
||||||
}
|
|
||||||
|
|
||||||
private void CopyTypeCache(Dictionary<int, List<FilterSignature>> typeCache)
|
|
||||||
{
|
|
||||||
foreach (var type in typeCache.Keys)
|
|
||||||
{
|
|
||||||
if (!typeToFilterSignatures.ContainsKey(type))
|
|
||||||
{
|
|
||||||
typeToFilterSignatures.Add(type, new List<FilterSignature>());
|
|
||||||
|
|
||||||
foreach (var signature in typeCache[type])
|
|
||||||
{
|
|
||||||
typeToFilterSignatures[type].Add(signature);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void CreateMissingStorages(FilterStorage other)
|
|
||||||
{
|
|
||||||
foreach (var filterSignature in other.filterSignatureToEntityIDs.Keys)
|
|
||||||
{
|
|
||||||
if (!filterSignatureToEntityIDs.ContainsKey(filterSignature))
|
|
||||||
{
|
|
||||||
filterSignatureToEntityIDs.Add(filterSignature, new IndexableSet<Entity>());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
CopyTypeCache(other.typeToFilterSignatures);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Filter CreateFilter(IndexableSet<int> included, IndexableSet<int> excluded)
|
|
||||||
{
|
|
||||||
var filterSignature = new FilterSignature(included, excluded);
|
|
||||||
if (!filterSignatureToEntityIDs.ContainsKey(filterSignature))
|
|
||||||
{
|
|
||||||
filterSignatureToEntityIDs.Add(filterSignature, new IndexableSet<Entity>());
|
|
||||||
|
|
||||||
foreach (var type in included)
|
|
||||||
{
|
|
||||||
if (!typeToFilterSignatures.ContainsKey(type))
|
|
||||||
{
|
|
||||||
typeToFilterSignatures.Add(type, new List<FilterSignature>());
|
|
||||||
}
|
|
||||||
|
|
||||||
typeToFilterSignatures[type].Add(filterSignature);
|
|
||||||
}
|
|
||||||
|
|
||||||
foreach (var type in excluded)
|
|
||||||
{
|
|
||||||
if (!typeToFilterSignatures.ContainsKey(type))
|
|
||||||
{
|
|
||||||
typeToFilterSignatures.Add(type, new List<FilterSignature>());
|
|
||||||
}
|
|
||||||
|
|
||||||
typeToFilterSignatures[type].Add(filterSignature);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return new Filter(this, included, excluded);
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReverseSpanEnumerator<Entity> FilterEntities(FilterSignature filterSignature)
|
|
||||||
{
|
|
||||||
return filterSignatureToEntityIDs[filterSignature].GetEnumerator();
|
|
||||||
}
|
|
||||||
|
|
||||||
public RandomEntityEnumerator FilterEntitiesRandom(FilterSignature filterSignature)
|
|
||||||
{
|
|
||||||
return new RandomEntityEnumerator(
|
|
||||||
this,
|
|
||||||
filterSignature,
|
|
||||||
RandomManager.LinearCongruentialSequence(FilterCount(filterSignature)));
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity FilterNthEntity(FilterSignature filterSignature, int index)
|
|
||||||
{
|
|
||||||
return new Entity(filterSignatureToEntityIDs[filterSignature][index]);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity FilterRandomEntity(FilterSignature filterSignature)
|
|
||||||
{
|
|
||||||
var randomIndex = RandomManager.Next(FilterCount(filterSignature));
|
|
||||||
return new Entity(filterSignatureToEntityIDs[filterSignature][randomIndex]);
|
|
||||||
}
|
|
||||||
|
|
||||||
public int FilterCount(FilterSignature filterSignature)
|
|
||||||
{
|
|
||||||
return filterSignatureToEntityIDs[filterSignature].Count;
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Check(int entityID, int componentTypeIndex)
|
|
||||||
{
|
|
||||||
if (typeToFilterSignatures.TryGetValue(componentTypeIndex, out var filterSignatures))
|
|
||||||
{
|
|
||||||
foreach (var filterSignature in filterSignatures)
|
|
||||||
{
|
|
||||||
CheckFilter(entityID, filterSignature);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Check<TComponent>(int entityID) where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
Check(entityID, ComponentTypeIndices.GetIndex<TComponent>());
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool CheckSatisfied(int entityID, FilterSignature filterSignature)
|
|
||||||
{
|
|
||||||
foreach (var type in filterSignature.Included)
|
|
||||||
{
|
|
||||||
if (!EntityStorage.HasComponent(entityID, type))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
foreach (var type in filterSignature.Excluded)
|
|
||||||
{
|
|
||||||
if (EntityStorage.HasComponent(entityID, type))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
private void CheckFilter(int entityID, FilterSignature filterSignature)
|
|
||||||
{
|
|
||||||
foreach (var type in filterSignature.Included)
|
|
||||||
{
|
|
||||||
if (!EntityStorage.HasComponent(entityID, type))
|
|
||||||
{
|
|
||||||
if (filterSignatureToEntityIDs[filterSignature].Remove(entityID))
|
|
||||||
{
|
|
||||||
if (removeCallbacks.TryGetValue(filterSignature, out var removeCallback))
|
|
||||||
{
|
|
||||||
removeCallback(entityID);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
foreach (var type in filterSignature.Excluded)
|
|
||||||
{
|
|
||||||
if (EntityStorage.HasComponent(entityID, type))
|
|
||||||
{
|
|
||||||
if (filterSignatureToEntityIDs[filterSignature].Remove(entityID))
|
|
||||||
{
|
|
||||||
if (removeCallbacks.TryGetValue(filterSignature, out var removeCallback))
|
|
||||||
{
|
|
||||||
removeCallback(entityID);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (filterSignatureToEntityIDs[filterSignature].Add(entityID))
|
|
||||||
{
|
|
||||||
if (addCallbacks.TryGetValue(filterSignature, out var addCallback))
|
|
||||||
{
|
|
||||||
addCallback(entityID);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void RemoveEntity(int entityID, int componentTypeIndex)
|
|
||||||
{
|
|
||||||
if (typeToFilterSignatures.TryGetValue(componentTypeIndex, out var filterSignatures))
|
|
||||||
{
|
|
||||||
foreach (var filterSignature in filterSignatures)
|
|
||||||
{
|
|
||||||
if (filterSignatureToEntityIDs[filterSignature].Remove(entityID))
|
|
||||||
{
|
|
||||||
if (removeCallbacks.TryGetValue(filterSignature, out var removeCallback))
|
|
||||||
{
|
|
||||||
removeCallback(entityID);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Used by TransferEntity
|
|
||||||
public void AddEntity(FilterSignature signature, int entityID)
|
|
||||||
{
|
|
||||||
filterSignatureToEntityIDs[signature].Add(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void TransferStorage(Dictionary<int, int> worldToTransferID, FilterStorage other)
|
|
||||||
{
|
|
||||||
foreach (var (filterSignature, entityIDs) in filterSignatureToEntityIDs)
|
|
||||||
{
|
|
||||||
foreach (var entity in entityIDs)
|
|
||||||
{
|
|
||||||
if (worldToTransferID.ContainsKey(entity))
|
|
||||||
{
|
|
||||||
var otherEntityID = worldToTransferID[entity];
|
|
||||||
other.AddEntity(filterSignature, otherEntityID);
|
|
||||||
|
|
||||||
if (other.addCallbacks.TryGetValue(filterSignature, out var addCallback))
|
|
||||||
{
|
|
||||||
addCallback(otherEntityID);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// used by World.Clear, ignores callbacks
|
|
||||||
public void Clear()
|
|
||||||
{
|
|
||||||
foreach (var (filterSignature, entityIDs) in filterSignatureToEntityIDs)
|
|
||||||
{
|
|
||||||
entityIDs.Clear();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void RegisterAddCallback(FilterSignature filterSignature, Action<Entity> callback)
|
|
||||||
{
|
|
||||||
addCallbacks.Add(filterSignature, callback);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void RegisterRemoveCallback(FilterSignature filterSignature, Action<Entity> callback)
|
|
||||||
{
|
|
||||||
removeCallbacks.Add(filterSignature, callback);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public ref struct RandomEntityEnumerator
|
|
||||||
{
|
|
||||||
public RandomEntityEnumerator GetEnumerator() => this;
|
|
||||||
|
|
||||||
private FilterStorage FilterStorage;
|
|
||||||
private FilterSignature FilterSignature;
|
|
||||||
private LinearCongruentialEnumerator LinearCongruentialEnumerator;
|
|
||||||
|
|
||||||
internal RandomEntityEnumerator(
|
|
||||||
FilterStorage filterStorage,
|
|
||||||
FilterSignature filterSignature,
|
|
||||||
LinearCongruentialEnumerator linearCongruentialEnumerator)
|
|
||||||
{
|
|
||||||
FilterStorage = filterStorage;
|
|
||||||
FilterSignature = filterSignature;
|
|
||||||
LinearCongruentialEnumerator = linearCongruentialEnumerator;
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool MoveNext() => LinearCongruentialEnumerator.MoveNext();
|
|
||||||
public Entity Current => FilterStorage.FilterNthEntity(FilterSignature, LinearCongruentialEnumerator.Current);
|
|
||||||
}
|
|
||||||
}
|
|
|
@ -0,0 +1,62 @@
|
||||||
|
using System;
|
||||||
|
using MoonTools.ECS.Collections;
|
||||||
|
|
||||||
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
internal class IdAssigner : IDisposable
|
||||||
|
{
|
||||||
|
uint Next;
|
||||||
|
NativeArray<uint> AvailableIds = new NativeArray<uint>();
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public uint Assign()
|
||||||
|
{
|
||||||
|
if (AvailableIds.TryPop(out var id))
|
||||||
|
{
|
||||||
|
return id;
|
||||||
|
}
|
||||||
|
|
||||||
|
id = Next;
|
||||||
|
Next += 1;
|
||||||
|
return id;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Unassign(uint id)
|
||||||
|
{
|
||||||
|
AvailableIds.Append(id);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void CopyTo(IdAssigner other)
|
||||||
|
{
|
||||||
|
AvailableIds.CopyTo(other.AvailableIds);
|
||||||
|
other.Next = Next;
|
||||||
|
}
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
if (disposing)
|
||||||
|
{
|
||||||
|
AvailableIds.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// // TODO: override finalizer only if 'Dispose(bool disposing)' has code to free unmanaged resources
|
||||||
|
// ~IdAssigner()
|
||||||
|
// {
|
||||||
|
// // Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
// Dispose(disposing: false);
|
||||||
|
// }
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
|
}
|
||||||
|
}
|
|
@ -1,103 +0,0 @@
|
||||||
using System;
|
|
||||||
using System.Collections.Generic;
|
|
||||||
using System.Runtime.CompilerServices;
|
|
||||||
using System.Runtime.InteropServices;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS.Collections
|
|
||||||
{
|
|
||||||
public unsafe class IndexableSet<T> : IDisposable where T : unmanaged
|
|
||||||
{
|
|
||||||
private Dictionary<T, int> indices;
|
|
||||||
private T* array;
|
|
||||||
private int count;
|
|
||||||
private int capacity;
|
|
||||||
private bool disposed;
|
|
||||||
|
|
||||||
public int Count => count;
|
|
||||||
public ReverseSpanEnumerator<T> GetEnumerator() => new ReverseSpanEnumerator<T>(new Span<T>(array, count));
|
|
||||||
|
|
||||||
public IndexableSet(int capacity = 32)
|
|
||||||
{
|
|
||||||
this.capacity = capacity;
|
|
||||||
count = 0;
|
|
||||||
|
|
||||||
indices = new Dictionary<T, int>(capacity);
|
|
||||||
array = (T*) NativeMemory.Alloc((nuint) (capacity * Unsafe.SizeOf<T>()));
|
|
||||||
}
|
|
||||||
|
|
||||||
public T this[int i] => array[i];
|
|
||||||
|
|
||||||
public bool Contains(T element)
|
|
||||||
{
|
|
||||||
return indices.ContainsKey(element);
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool Add(T element)
|
|
||||||
{
|
|
||||||
if (!Contains(element))
|
|
||||||
{
|
|
||||||
indices.Add(element, count);
|
|
||||||
|
|
||||||
if (count >= capacity)
|
|
||||||
{
|
|
||||||
capacity *= 2;
|
|
||||||
array = (T*) NativeMemory.Realloc(array, (nuint) (capacity * Unsafe.SizeOf<T>()));
|
|
||||||
}
|
|
||||||
|
|
||||||
array[count] = element;
|
|
||||||
count += 1;
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool Remove(T element)
|
|
||||||
{
|
|
||||||
if (!Contains(element))
|
|
||||||
{
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
var lastElement = array[Count - 1];
|
|
||||||
var index = indices[element];
|
|
||||||
array[index] = lastElement;
|
|
||||||
indices[lastElement] = index;
|
|
||||||
count -= 1;
|
|
||||||
indices.Remove(element);
|
|
||||||
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Clear()
|
|
||||||
{
|
|
||||||
indices.Clear();
|
|
||||||
count = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
protected virtual void Dispose(bool disposing)
|
|
||||||
{
|
|
||||||
if (!disposed)
|
|
||||||
{
|
|
||||||
NativeMemory.Free(array);
|
|
||||||
array = null;
|
|
||||||
|
|
||||||
disposed = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
~IndexableSet()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: false);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Dispose()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: true);
|
|
||||||
GC.SuppressFinalize(this);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
|
@ -1,18 +1,18 @@
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
{
|
|
||||||
public abstract class Manipulator : EntityComponentReader
|
|
||||||
{
|
|
||||||
public Manipulator(World world) : base(world)
|
|
||||||
{
|
|
||||||
}
|
|
||||||
|
|
||||||
protected Entity CreateEntity(string tag = "") => World.CreateEntity(tag);
|
public abstract class Manipulator : EntityComponentReader
|
||||||
protected void Tag(Entity entity, string tag) => World.Tag(entity, tag);
|
{
|
||||||
protected void Set<TComponent>(in Entity entity, in TComponent component) where TComponent : unmanaged => World.Set<TComponent>(entity, component);
|
public Manipulator(World world) : base(world)
|
||||||
protected void Remove<TComponent>(in Entity entity) where TComponent : unmanaged => World.Remove<TComponent>(entity);
|
{
|
||||||
protected void Relate<TRelationKind>(in Entity entityA, in Entity entityB, TRelationKind relationData) where TRelationKind : unmanaged => World.Relate(entityA, entityB, relationData);
|
|
||||||
protected void Unrelate<TRelationKind>(in Entity entityA, in Entity entityB) where TRelationKind : unmanaged => World.Unrelate<TRelationKind>(entityA, entityB);
|
|
||||||
protected void UnrelateAll<TRelationKind>(in Entity entity) where TRelationKind : unmanaged => World.UnrelateAll<TRelationKind>(entity);
|
|
||||||
protected void Destroy(in Entity entity) => World.Destroy(entity);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
protected Entity CreateEntity(string tag = "") => World.CreateEntity(tag);
|
||||||
|
protected void Tag(Entity entity, string tag) => World.Tag(entity, tag);
|
||||||
|
protected void Set<TComponent>(in Entity entity, in TComponent component) where TComponent : unmanaged => World.Set<TComponent>(entity, component);
|
||||||
|
protected void Remove<TComponent>(in Entity entity) where TComponent : unmanaged => World.Remove<TComponent>(entity);
|
||||||
|
|
||||||
|
protected void Relate<TRelationKind>(in Entity entityA, in Entity entityB, TRelationKind relationData) where TRelationKind : unmanaged => World.Relate(entityA, entityB, relationData);
|
||||||
|
protected void Unrelate<TRelationKind>(in Entity entityA, in Entity entityB) where TRelationKind : unmanaged => World.Unrelate<TRelationKind>(entityA, entityB);
|
||||||
|
protected void UnrelateAll<TRelationKind>(in Entity entity) where TRelationKind : unmanaged => World.UnrelateAll<TRelationKind>(entity);
|
||||||
|
protected void Destroy(in Entity entity) => World.Destroy(entity);
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,68 +0,0 @@
|
||||||
using System;
|
|
||||||
using System.Collections.Generic;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
|
||||||
{
|
|
||||||
internal class MessageDepot
|
|
||||||
{
|
|
||||||
private Dictionary<Type, MessageStorage> storages = new Dictionary<Type, MessageStorage>();
|
|
||||||
|
|
||||||
private MessageStorage<TMessage> Lookup<TMessage>() where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
if (!storages.ContainsKey(typeof(TMessage)))
|
|
||||||
{
|
|
||||||
storages.Add(typeof(TMessage), new MessageStorage<TMessage>());
|
|
||||||
}
|
|
||||||
|
|
||||||
return storages[typeof(TMessage)] as MessageStorage<TMessage>;
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Add<TMessage>(in TMessage message) where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
Lookup<TMessage>().Add(message);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Add<TMessage>(int entityID, in TMessage message) where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
Lookup<TMessage>().Add(entityID, message);
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool Some<TMessage>() where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TMessage>().Some();
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReadOnlySpan<TMessage> All<TMessage>() where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TMessage>().All();
|
|
||||||
}
|
|
||||||
|
|
||||||
public TMessage First<TMessage>() where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TMessage>().First();
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReverseSpanEnumerator<TMessage> WithEntity<TMessage>(int entityID) where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TMessage>().WithEntity(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public ref readonly TMessage FirstWithEntity<TMessage>(int entityID) where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return ref Lookup<TMessage>().FirstWithEntity(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool SomeWithEntity<TMessage>(int entityID) where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TMessage>().SomeWithEntity(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Clear()
|
|
||||||
{
|
|
||||||
foreach (var storage in storages.Values)
|
|
||||||
{
|
|
||||||
storage.Clear();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
|
@ -1,131 +1,63 @@
|
||||||
using System;
|
using System;
|
||||||
using System.Collections.Generic;
|
|
||||||
using System.Runtime.CompilerServices;
|
|
||||||
using System.Runtime.InteropServices;
|
|
||||||
using MoonTools.ECS.Collections;
|
using MoonTools.ECS.Collections;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public class MessageStorage : IDisposable
|
||||||
{
|
{
|
||||||
internal abstract class MessageStorage
|
private NativeArray Messages;
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public MessageStorage(int elementSize)
|
||||||
{
|
{
|
||||||
public abstract void Clear();
|
Messages = new NativeArray(elementSize);
|
||||||
}
|
}
|
||||||
|
|
||||||
internal unsafe class MessageStorage<TMessage> : MessageStorage, IDisposable where TMessage : unmanaged
|
public void Add<T>(in T message) where T : unmanaged
|
||||||
{
|
{
|
||||||
private int count = 0;
|
Messages.Append(message);
|
||||||
private int capacity = 128;
|
}
|
||||||
private TMessage* messages;
|
|
||||||
// duplicating storage here for fast iteration
|
|
||||||
private Dictionary<int, NativeArray<TMessage>> entityToMessages = new Dictionary<int, NativeArray<TMessage>>();
|
|
||||||
private bool disposed;
|
|
||||||
|
|
||||||
public MessageStorage()
|
public bool Some()
|
||||||
|
{
|
||||||
|
return Messages.Count > 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
public ReadOnlySpan<T> All<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
return Messages.ToSpan<T>();
|
||||||
|
}
|
||||||
|
|
||||||
|
public T First<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
return Messages.Get<T>(0);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Clear()
|
||||||
|
{
|
||||||
|
Messages.Clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
private void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
{
|
{
|
||||||
messages = (TMessage*) NativeMemory.Alloc((nuint) (capacity * Unsafe.SizeOf<TMessage>()));
|
Messages.Dispose();
|
||||||
|
IsDisposed = true;
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
public void Add(in TMessage message)
|
// ~MessageStorage()
|
||||||
{
|
// {
|
||||||
if (count == capacity)
|
// // Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
{
|
// Dispose(disposing: false);
|
||||||
capacity *= 2;
|
// }
|
||||||
messages = (TMessage*) NativeMemory.Realloc(messages, (nuint) (capacity * Unsafe.SizeOf<TMessage>()));
|
|
||||||
}
|
|
||||||
|
|
||||||
messages[count] = message;
|
public void Dispose()
|
||||||
count += 1;
|
{
|
||||||
}
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
public void Add(int entityID, in TMessage message)
|
GC.SuppressFinalize(this);
|
||||||
{
|
|
||||||
if (!entityToMessages.ContainsKey(entityID))
|
|
||||||
{
|
|
||||||
entityToMessages.Add(entityID, new NativeArray<TMessage>());
|
|
||||||
}
|
|
||||||
entityToMessages[entityID].Add(message);
|
|
||||||
|
|
||||||
Add(message);
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool Some()
|
|
||||||
{
|
|
||||||
return count > 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReadOnlySpan<TMessage> All()
|
|
||||||
{
|
|
||||||
return new ReadOnlySpan<TMessage>(messages, count);
|
|
||||||
}
|
|
||||||
|
|
||||||
public TMessage First()
|
|
||||||
{
|
|
||||||
return messages[0];
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReverseSpanEnumerator<TMessage> WithEntity(int entityID)
|
|
||||||
{
|
|
||||||
if (entityToMessages.TryGetValue(entityID, out var messages))
|
|
||||||
{
|
|
||||||
return messages.GetEnumerator();
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
return ReverseSpanEnumerator<TMessage>.Empty;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public ref readonly TMessage FirstWithEntity(int entityID)
|
|
||||||
{
|
|
||||||
return ref entityToMessages[entityID][0];
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool SomeWithEntity(int entityID)
|
|
||||||
{
|
|
||||||
return entityToMessages.ContainsKey(entityID) && entityToMessages[entityID].Count > 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
public override void Clear()
|
|
||||||
{
|
|
||||||
count = 0;
|
|
||||||
foreach (var set in entityToMessages.Values)
|
|
||||||
{
|
|
||||||
set.Clear();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
protected virtual void Dispose(bool disposing)
|
|
||||||
{
|
|
||||||
if (!disposed)
|
|
||||||
{
|
|
||||||
Clear();
|
|
||||||
|
|
||||||
if (disposing)
|
|
||||||
{
|
|
||||||
foreach (var array in entityToMessages.Values)
|
|
||||||
{
|
|
||||||
array.Dispose();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
NativeMemory.Free(messages);
|
|
||||||
messages = null;
|
|
||||||
|
|
||||||
disposed = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
~MessageStorage()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: false);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Dispose()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: true);
|
|
||||||
GC.SuppressFinalize(this);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
367
src/Random.cs
367
src/Random.cs
|
@ -1,209 +1,208 @@
|
||||||
using System;
|
using System;
|
||||||
using System.Runtime.CompilerServices;
|
using System.Runtime.CompilerServices;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// This class implements the well equidistributed long-period linear pseudorandom number generator.
|
||||||
|
/// Code taken from Chris Lomont: http://lomont.org/papers/2008/Lomont_PRNG_2008.pdf
|
||||||
|
/// </summary>
|
||||||
|
public class Random
|
||||||
{
|
{
|
||||||
|
public const int STATE_BYTE_COUNT = 68; // 16 state ints + 1 index int
|
||||||
|
|
||||||
|
uint[] State = new uint[16];
|
||||||
|
uint Index = 0;
|
||||||
|
uint Seed;
|
||||||
|
|
||||||
/// <summary>
|
/// <summary>
|
||||||
/// This class implements the well equidistributed long-period linear pseudorandom number generator.
|
/// Initializes the RNG with an arbitrary seed.
|
||||||
/// Code taken from Chris Lomont: http://lomont.org/papers/2008/Lomont_PRNG_2008.pdf
|
|
||||||
/// </summary>
|
/// </summary>
|
||||||
public class Random
|
public Random()
|
||||||
{
|
{
|
||||||
public const int STATE_BYTE_COUNT = 68; // 16 state ints + 1 index int
|
Init((uint) Environment.TickCount);
|
||||||
|
}
|
||||||
|
|
||||||
uint[] State = new uint[16];
|
/// <summary>
|
||||||
uint Index = 0;
|
/// Initializes the RNG with a given seed.
|
||||||
uint Seed;
|
/// </summary>
|
||||||
|
public void Init(uint seed)
|
||||||
/// <summary>
|
{
|
||||||
/// Initializes the RNG with an arbitrary seed.
|
Seed = seed;
|
||||||
/// </summary>
|
uint s = seed;
|
||||||
public Random()
|
for (int i = 0; i < 16; i++)
|
||||||
{
|
{
|
||||||
Init((uint) Environment.TickCount);
|
s = (((s * 214013 + 2531011) >> 16) & 0x7fffffff) | 0;
|
||||||
|
State[i] = ~ ~s; //i ;
|
||||||
}
|
}
|
||||||
|
Index = 0;
|
||||||
|
}
|
||||||
|
|
||||||
/// <summary>
|
/// <summary>
|
||||||
/// Initializes the RNG with a given seed.
|
/// Returns the seed that was used to initialize the RNG.
|
||||||
/// </summary>
|
/// </summary>
|
||||||
public void Init(uint seed)
|
public uint GetSeed()
|
||||||
|
{
|
||||||
|
return Seed;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns the entire state of the RNG as a string.
|
||||||
|
/// </summary>
|
||||||
|
public string PrintState()
|
||||||
|
{
|
||||||
|
var s = "";
|
||||||
|
for (var i = 0; i < 16; i += 1)
|
||||||
{
|
{
|
||||||
Seed = seed;
|
s += State[i];
|
||||||
uint s = seed;
|
|
||||||
for (int i = 0; i < 16; i++)
|
|
||||||
{
|
|
||||||
s = (((s * 214013 + 2531011) >> 16) & 0x7fffffff) | 0;
|
|
||||||
State[i] = ~ ~s; //i ;
|
|
||||||
}
|
|
||||||
Index = 0;
|
|
||||||
}
|
}
|
||||||
|
s += Index;
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
|
||||||
/// <summary>
|
/// <summary>
|
||||||
/// Returns the seed that was used to initialize the RNG.
|
/// Saves the entire state of the RNG to a Span.
|
||||||
/// </summary>
|
/// </summary>
|
||||||
public uint GetSeed()
|
/// <param name="bytes">Must be a span of at least STATE_BYTE_COUNT bytes.</param>
|
||||||
|
/// <exception cref="ArgumentException">Thrown if the byte span is too short.</exception>
|
||||||
|
public unsafe void SaveState(Span<byte> bytes)
|
||||||
|
{
|
||||||
|
#if DEBUG
|
||||||
|
if (bytes.Length < STATE_BYTE_COUNT)
|
||||||
{
|
{
|
||||||
return Seed;
|
throw new ArgumentException("Byte span too short!");
|
||||||
}
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
/// <summary>
|
fixed (byte* ptr = bytes)
|
||||||
/// Returns the entire state of the RNG as a string.
|
|
||||||
/// </summary>
|
|
||||||
public string PrintState()
|
|
||||||
{
|
{
|
||||||
var s = "";
|
var offset = 0;
|
||||||
for (var i = 0; i < 16; i += 1)
|
for (var i = 0; i < 16; i += 1)
|
||||||
{
|
{
|
||||||
s += State[i];
|
Unsafe.Write(ptr + offset, State[i]);
|
||||||
|
offset += 4;
|
||||||
}
|
}
|
||||||
s += Index;
|
|
||||||
return s;
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
Unsafe.Write(ptr + offset, Index);
|
||||||
/// Saves the entire state of the RNG to a Span.
|
|
||||||
/// </summary>
|
|
||||||
/// <param name="bytes">Must be a span of at least STATE_BYTE_COUNT bytes.</param>
|
|
||||||
/// <exception cref="ArgumentException">Thrown if the byte span is too short.</exception>
|
|
||||||
public unsafe void SaveState(Span<byte> bytes)
|
|
||||||
{
|
|
||||||
#if DEBUG
|
|
||||||
if (bytes.Length < STATE_BYTE_COUNT)
|
|
||||||
{
|
|
||||||
throw new ArgumentException("Byte span too short!");
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
fixed (byte* ptr = bytes)
|
|
||||||
{
|
|
||||||
var offset = 0;
|
|
||||||
for (var i = 0; i < 16; i += 1)
|
|
||||||
{
|
|
||||||
Unsafe.Write(ptr + offset, State[i]);
|
|
||||||
offset += 4;
|
|
||||||
}
|
|
||||||
|
|
||||||
Unsafe.Write(ptr + offset, Index);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// Loads the entire state of the RNG from a Span.
|
|
||||||
/// </summary>
|
|
||||||
/// <param name="bytes">Must be a span of at least STATE_BYTE_COUNT bytes.</param>
|
|
||||||
/// <exception cref="ArgumentException">Thrown if the byte span is too short.</exception>
|
|
||||||
public unsafe void LoadState(Span<byte> bytes)
|
|
||||||
{
|
|
||||||
#if DEBUG
|
|
||||||
if (bytes.Length < STATE_BYTE_COUNT)
|
|
||||||
{
|
|
||||||
throw new ArgumentException("Byte span too short!");
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
fixed (byte* ptr = bytes)
|
|
||||||
{
|
|
||||||
var offset = 0;
|
|
||||||
|
|
||||||
for (var i = 0; i < 16; i += 1)
|
|
||||||
{
|
|
||||||
State[i] = Unsafe.Read<uint>(ptr + offset);
|
|
||||||
offset += 4;
|
|
||||||
}
|
|
||||||
|
|
||||||
Index = Unsafe.Read<uint>(ptr + offset);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
private uint NextInternal()
|
|
||||||
{
|
|
||||||
uint a, b, c, d;
|
|
||||||
a = State[Index];
|
|
||||||
c = State[(Index+13)&15];
|
|
||||||
b = a^c^(a<<16)^(c<<15);
|
|
||||||
c = State[(Index+9)&15];
|
|
||||||
c ^= (c>>11);
|
|
||||||
a = State[Index] = b^c;
|
|
||||||
d = (uint) (a ^((a<<5)&0xDA442D24UL));
|
|
||||||
Index = (Index + 15)&15;
|
|
||||||
a = State[Index];
|
|
||||||
State[Index] = a^b^d^(a<<2)^(b<<18)^(c<<28);
|
|
||||||
return State[Index];
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// Returns a non-negative signed integer.
|
|
||||||
/// </summary>
|
|
||||||
public int Next()
|
|
||||||
{
|
|
||||||
return (int) (NextInternal() >>> 1); // unsigned bitshift right to get rid of signed bit
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// Returns a non-negative signed integer less than max.
|
|
||||||
/// </summary>
|
|
||||||
public int Next(int max)
|
|
||||||
{
|
|
||||||
return (int) (((double) Next()) * max / int.MaxValue);
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// Returns a signed integer greater than or equal to min and less than max.
|
|
||||||
/// </summary>
|
|
||||||
public int Next(int min, int max)
|
|
||||||
{
|
|
||||||
var diff = max - min;
|
|
||||||
var next = Next(diff);
|
|
||||||
return min + next;
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// Returns a non-negative signed 64 bit integer.
|
|
||||||
/// </summary>
|
|
||||||
public long NextInt64()
|
|
||||||
{
|
|
||||||
long next = NextInternal();
|
|
||||||
next <<= 32;
|
|
||||||
next |= NextInternal();
|
|
||||||
next >>>= 1;
|
|
||||||
return next;
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// Returns a non-negative signed 64 bit integer less than max.
|
|
||||||
/// </summary>
|
|
||||||
public long NextInt64(long max)
|
|
||||||
{
|
|
||||||
var next = NextInt64();
|
|
||||||
return (long) (((double) next) * max / long.MaxValue);
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// Returns a non-negative signed 64 bit integer greater than or equal to min and less than max.
|
|
||||||
/// </summary>
|
|
||||||
public long NextInt64(long min, long max)
|
|
||||||
{
|
|
||||||
var diff = max - min;
|
|
||||||
var next = NextInt64(diff);
|
|
||||||
return min + next;
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// Returns a single-precision floating point value between 0 and 1.
|
|
||||||
/// </summary>
|
|
||||||
public float NextSingle()
|
|
||||||
{
|
|
||||||
var n = NextInternal();
|
|
||||||
return ((float) n) / uint.MaxValue;
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// Returns a double-precision floating point value between 0 and 1.
|
|
||||||
/// </summary>
|
|
||||||
public double NextDouble()
|
|
||||||
{
|
|
||||||
var n = NextInternal();
|
|
||||||
return ((double) n) / uint.MaxValue;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Loads the entire state of the RNG from a Span.
|
||||||
|
/// </summary>
|
||||||
|
/// <param name="bytes">Must be a span of at least STATE_BYTE_COUNT bytes.</param>
|
||||||
|
/// <exception cref="ArgumentException">Thrown if the byte span is too short.</exception>
|
||||||
|
public unsafe void LoadState(Span<byte> bytes)
|
||||||
|
{
|
||||||
|
#if DEBUG
|
||||||
|
if (bytes.Length < STATE_BYTE_COUNT)
|
||||||
|
{
|
||||||
|
throw new ArgumentException("Byte span too short!");
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
fixed (byte* ptr = bytes)
|
||||||
|
{
|
||||||
|
var offset = 0;
|
||||||
|
|
||||||
|
for (var i = 0; i < 16; i += 1)
|
||||||
|
{
|
||||||
|
State[i] = Unsafe.Read<uint>(ptr + offset);
|
||||||
|
offset += 4;
|
||||||
|
}
|
||||||
|
|
||||||
|
Index = Unsafe.Read<uint>(ptr + offset);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private uint NextInternal()
|
||||||
|
{
|
||||||
|
uint a, b, c, d;
|
||||||
|
a = State[Index];
|
||||||
|
c = State[(Index+13)&15];
|
||||||
|
b = a^c^(a<<16)^(c<<15);
|
||||||
|
c = State[(Index+9)&15];
|
||||||
|
c ^= (c>>11);
|
||||||
|
a = State[Index] = b^c;
|
||||||
|
d = (uint) (a ^((a<<5)&0xDA442D24UL));
|
||||||
|
Index = (Index + 15)&15;
|
||||||
|
a = State[Index];
|
||||||
|
State[Index] = a^b^d^(a<<2)^(b<<18)^(c<<28);
|
||||||
|
return State[Index];
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns a non-negative signed integer.
|
||||||
|
/// </summary>
|
||||||
|
public int Next()
|
||||||
|
{
|
||||||
|
return (int) (NextInternal() >>> 1); // unsigned bitshift right to get rid of signed bit
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns a non-negative signed integer less than max.
|
||||||
|
/// </summary>
|
||||||
|
public int Next(int max)
|
||||||
|
{
|
||||||
|
return (int) (((double) Next()) * max / int.MaxValue);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns a signed integer greater than or equal to min and less than max.
|
||||||
|
/// </summary>
|
||||||
|
public int Next(int min, int max)
|
||||||
|
{
|
||||||
|
var diff = max - min;
|
||||||
|
var next = Next(diff);
|
||||||
|
return min + next;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns a non-negative signed 64 bit integer.
|
||||||
|
/// </summary>
|
||||||
|
public long NextInt64()
|
||||||
|
{
|
||||||
|
long next = NextInternal();
|
||||||
|
next <<= 32;
|
||||||
|
next |= NextInternal();
|
||||||
|
next >>>= 1;
|
||||||
|
return next;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns a non-negative signed 64 bit integer less than max.
|
||||||
|
/// </summary>
|
||||||
|
public long NextInt64(long max)
|
||||||
|
{
|
||||||
|
var next = NextInt64();
|
||||||
|
return (long) (((double) next) * max / long.MaxValue);
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns a non-negative signed 64 bit integer greater than or equal to min and less than max.
|
||||||
|
/// </summary>
|
||||||
|
public long NextInt64(long min, long max)
|
||||||
|
{
|
||||||
|
var diff = max - min;
|
||||||
|
var next = NextInt64(diff);
|
||||||
|
return min + next;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns a single-precision floating point value between 0 and 1.
|
||||||
|
/// </summary>
|
||||||
|
public float NextSingle()
|
||||||
|
{
|
||||||
|
var n = NextInternal();
|
||||||
|
return ((float) n) / uint.MaxValue;
|
||||||
|
}
|
||||||
|
|
||||||
|
/// <summary>
|
||||||
|
/// Returns a double-precision floating point value between 0 and 1.
|
||||||
|
/// </summary>
|
||||||
|
public double NextDouble()
|
||||||
|
{
|
||||||
|
var n = NextInternal();
|
||||||
|
return ((double) n) / uint.MaxValue;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,82 +1,81 @@
|
||||||
using System.Runtime.CompilerServices;
|
using System.Runtime.CompilerServices;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public static class RandomManager
|
||||||
{
|
{
|
||||||
public static class RandomManager
|
private static Random Random = new Random();
|
||||||
|
|
||||||
|
private static int[] Primes =
|
||||||
{
|
{
|
||||||
private static Random Random = new Random();
|
2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919
|
||||||
|
};
|
||||||
|
|
||||||
private static int[] Primes =
|
public static void SetRandom(Random random)
|
||||||
{
|
{
|
||||||
2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919
|
Random = random;
|
||||||
};
|
|
||||||
|
|
||||||
public static void SetRandom(Random random)
|
|
||||||
{
|
|
||||||
Random = random;
|
|
||||||
}
|
|
||||||
|
|
||||||
internal static int Next(int maxValue)
|
|
||||||
{
|
|
||||||
return Random.Next(maxValue);
|
|
||||||
}
|
|
||||||
|
|
||||||
/// <summary>
|
|
||||||
/// A psuedorandom nonrepeating sequence of integers from 0 to n.
|
|
||||||
/// </summary>
|
|
||||||
internal static LinearCongruentialEnumerator LinearCongruentialSequence(int n)
|
|
||||||
{
|
|
||||||
if (n == 0)
|
|
||||||
{
|
|
||||||
// bail out, empty enumerator
|
|
||||||
return new LinearCongruentialEnumerator(0, 0, 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
var x = Primes[Random.Next(Primes.Length - 1)];
|
|
||||||
while (x % n == 0)
|
|
||||||
{
|
|
||||||
// not coprime, try again
|
|
||||||
x = Primes[Random.Next(Primes.Length - 1)];
|
|
||||||
}
|
|
||||||
|
|
||||||
return new LinearCongruentialEnumerator(Random.Next(n), x, n);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
public struct LinearCongruentialEnumerator
|
internal static int Next(int maxValue)
|
||||||
{
|
{
|
||||||
private readonly int start;
|
return Random.Next(maxValue);
|
||||||
private readonly int count;
|
}
|
||||||
private readonly int prime;
|
|
||||||
private int current;
|
|
||||||
|
|
||||||
public LinearCongruentialEnumerator GetEnumerator() => this;
|
/// <summary>
|
||||||
|
/// A psuedorandom nonrepeating sequence of integers from 0 to n.
|
||||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
/// </summary>
|
||||||
internal LinearCongruentialEnumerator(int start, int prime, int count)
|
internal static LinearCongruentialEnumerator LinearCongruentialSequence(int n)
|
||||||
|
{
|
||||||
|
if (n == 0)
|
||||||
{
|
{
|
||||||
current = start;
|
// bail out, empty enumerator
|
||||||
this.start = start;
|
return new LinearCongruentialEnumerator(0, 0, 0);
|
||||||
this.prime = prime;
|
|
||||||
this.count = count;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
var x = Primes[Random.Next(Primes.Length - 1)];
|
||||||
public bool MoveNext()
|
while (x % n == 0)
|
||||||
{
|
{
|
||||||
current += 1;
|
// not coprime, try again
|
||||||
if (current < start + count)
|
x = Primes[Random.Next(Primes.Length - 1)];
|
||||||
{
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
return false;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
public int Current
|
return new LinearCongruentialEnumerator(Random.Next(n), x, n);
|
||||||
{
|
}
|
||||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
}
|
||||||
get => (current * prime) % count;
|
|
||||||
}
|
public struct LinearCongruentialEnumerator
|
||||||
|
{
|
||||||
|
private readonly int start;
|
||||||
|
private readonly int count;
|
||||||
|
private readonly int prime;
|
||||||
|
private int current;
|
||||||
|
|
||||||
|
public LinearCongruentialEnumerator GetEnumerator() => this;
|
||||||
|
|
||||||
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||||
|
internal LinearCongruentialEnumerator(int start, int prime, int count)
|
||||||
|
{
|
||||||
|
current = start;
|
||||||
|
this.start = start;
|
||||||
|
this.prime = prime;
|
||||||
|
this.count = count;
|
||||||
|
}
|
||||||
|
|
||||||
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||||
|
public bool MoveNext()
|
||||||
|
{
|
||||||
|
current += 1;
|
||||||
|
if (current < start + count)
|
||||||
|
{
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
public int Current
|
||||||
|
{
|
||||||
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||||
|
get => (current * prime) % count;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,193 +0,0 @@
|
||||||
using System;
|
|
||||||
using System.Collections.Generic;
|
|
||||||
using System.Runtime.CompilerServices;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
|
||||||
{
|
|
||||||
internal class RelationDepot
|
|
||||||
{
|
|
||||||
private EntityStorage EntityStorage;
|
|
||||||
private TypeIndices RelationTypeIndices;
|
|
||||||
private RelationStorage[] storages = new RelationStorage[256];
|
|
||||||
|
|
||||||
public RelationDepot(EntityStorage entityStorage, TypeIndices relationTypeIndices)
|
|
||||||
{
|
|
||||||
EntityStorage = entityStorage;
|
|
||||||
RelationTypeIndices = relationTypeIndices;
|
|
||||||
}
|
|
||||||
|
|
||||||
private void Register<TRelationKind>(int index) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
if (index >= storages.Length)
|
|
||||||
{
|
|
||||||
Array.Resize(ref storages, storages.Length * 2);
|
|
||||||
}
|
|
||||||
|
|
||||||
storages[index] = new RelationStorage<TRelationKind>();
|
|
||||||
}
|
|
||||||
|
|
||||||
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
|
||||||
private RelationStorage<TRelationKind> Lookup<TRelationKind>() where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
var storageIndex = RelationTypeIndices.GetIndex<TRelationKind>();
|
|
||||||
// TODO: is there some way to avoid this null check?
|
|
||||||
if (storages[storageIndex] == null)
|
|
||||||
{
|
|
||||||
Register<TRelationKind>(storageIndex);
|
|
||||||
}
|
|
||||||
return (RelationStorage<TRelationKind>) storages[storageIndex];
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Set<TRelationKind>(in Entity entityA, in Entity entityB, TRelationKind relationData) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
Lookup<TRelationKind>().Set(entityA, entityB, relationData);
|
|
||||||
}
|
|
||||||
|
|
||||||
public TRelationKind Get<TRelationKind>(in Entity entityA, in Entity entityB) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().Get(entityA, entityB);
|
|
||||||
}
|
|
||||||
|
|
||||||
public (bool, bool) Remove<TRelationKind>(in Entity entityA, in Entity entityB) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().Remove(entityA, entityB);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void UnrelateAll<TRelationKind>(int entityID) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
Lookup<TRelationKind>().UnrelateAll(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReverseSpanEnumerator<(Entity, Entity)> Relations<TRelationKind>() where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().All();
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool Related<TRelationKind>(int idA, int idB) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().Has((idA, idB));
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReverseSpanEnumerator<Entity> OutRelations<TRelationKind>(int entityID) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().OutRelations(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity OutRelationSingleton<TRelationKind>(int entityID) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().OutFirst(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity NthOutRelation<TRelationKind>(int entityID, int n) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().OutNth(entityID, n);
|
|
||||||
}
|
|
||||||
|
|
||||||
public int OutRelationCount<TRelationKind>(int entityID) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().OutRelationCount(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool HasOutRelation<TRelationKind>(int entityID) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().HasOutRelation(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public ReverseSpanEnumerator<Entity> InRelations<TRelationKind>(int entityID) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().InRelations(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity NthInRelation<TRelationKind>(int entityID, int n) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().InNth(entityID, n);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity InRelationSingleton<TRelationKind>(int entityID) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().InFirst(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public bool HasInRelation<TRelationKind>(int entityID) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().HasInRelation(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public int InRelationCount<TRelationKind>(int entityID) where TRelationKind : unmanaged
|
|
||||||
{
|
|
||||||
return Lookup<TRelationKind>().InRelationCount(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
// untyped methods used for destroying and snapshots
|
|
||||||
|
|
||||||
public unsafe void Set(int entityA, int entityB, int relationTypeIndex, void* relationData)
|
|
||||||
{
|
|
||||||
storages[relationTypeIndex].Set(entityA, entityB, relationData);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void UnrelateAll(int entityID, int relationTypeIndex)
|
|
||||||
{
|
|
||||||
storages[relationTypeIndex].UnrelateAll(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Clear()
|
|
||||||
{
|
|
||||||
for (var i = 0; i < storages.Length; i += 1)
|
|
||||||
{
|
|
||||||
if (storages[i] != null)
|
|
||||||
{
|
|
||||||
storages[i].Clear();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void CreateMissingStorages(RelationDepot other)
|
|
||||||
{
|
|
||||||
while (other.RelationTypeIndices.Count >= storages.Length)
|
|
||||||
{
|
|
||||||
Array.Resize(ref storages, storages.Length * 2);
|
|
||||||
}
|
|
||||||
|
|
||||||
while (other.RelationTypeIndices.Count >= other.storages.Length)
|
|
||||||
{
|
|
||||||
Array.Resize(ref other.storages, other.storages.Length * 2);
|
|
||||||
}
|
|
||||||
|
|
||||||
for (var i = 0; i < other.RelationTypeIndices.Count; i += 1)
|
|
||||||
{
|
|
||||||
if (storages[i] == null && other.storages[i] != null)
|
|
||||||
{
|
|
||||||
storages[i] = other.storages[i].CreateStorage();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public unsafe void TransferStorage(Dictionary<int, int> worldToTransferID, RelationDepot other)
|
|
||||||
{
|
|
||||||
for (var i = 0; i < storages.Length; i += 1)
|
|
||||||
{
|
|
||||||
if (storages[i] != null)
|
|
||||||
{
|
|
||||||
foreach (var (a, b) in storages[i].All())
|
|
||||||
{
|
|
||||||
if (worldToTransferID.TryGetValue(a, out var otherA))
|
|
||||||
{
|
|
||||||
if (worldToTransferID.TryGetValue(b, out var otherB))
|
|
||||||
{
|
|
||||||
var storageIndex = storages[i].GetStorageIndex(a, b);
|
|
||||||
var relationData = storages[i].Get(storageIndex);
|
|
||||||
other.Set(otherA, otherB, i, relationData);
|
|
||||||
other.EntityStorage.AddRelationKind(otherA, i);
|
|
||||||
other.EntityStorage.AddRelationKind(otherB, i);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
throw new InvalidOperationException($"Missing transfer entity! {EntityStorage.Tag(a.ID)} related to {EntityStorage.Tag(b.ID)}");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
|
@ -1,332 +1,284 @@
|
||||||
using System;
|
using System;
|
||||||
using System.Collections.Generic;
|
using System.Collections.Generic;
|
||||||
using System.Runtime.CompilerServices;
|
using System.Runtime.CompilerServices;
|
||||||
using System.Runtime.InteropServices;
|
|
||||||
using MoonTools.ECS.Collections;
|
using MoonTools.ECS.Collections;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
// TODO: implement this entire class with NativeMemory equivalents, can just memcpy for snapshots
|
||||||
|
internal class RelationStorage
|
||||||
{
|
{
|
||||||
internal abstract class RelationStorage
|
internal NativeArray Relations;
|
||||||
|
internal NativeArray RelationDatas;
|
||||||
|
internal Dictionary<(Entity, Entity), int> Indices = new Dictionary<(Entity, Entity), int>(16);
|
||||||
|
internal Dictionary<Entity, IndexableSet<Entity>> OutRelationSets = new Dictionary<Entity, IndexableSet<Entity>>(16);
|
||||||
|
internal Dictionary<Entity, IndexableSet<Entity>> InRelationSets = new Dictionary<Entity, IndexableSet<Entity>>(16);
|
||||||
|
private Stack<IndexableSet<Entity>> ListPool = new Stack<IndexableSet<Entity>>();
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public RelationStorage(int relationDataSize)
|
||||||
{
|
{
|
||||||
public abstract unsafe void Set(int entityA, int entityB, void* relationData);
|
Relations = new NativeArray(Unsafe.SizeOf<(Entity, Entity)>());
|
||||||
public abstract int GetStorageIndex(int entityA, int entityB);
|
RelationDatas = new NativeArray(relationDataSize);
|
||||||
public abstract unsafe void* Get(int relationStorageIndex);
|
|
||||||
public abstract void UnrelateAll(int entityID);
|
|
||||||
public abstract ReverseSpanEnumerator<(Entity, Entity)> All();
|
|
||||||
public abstract RelationStorage CreateStorage();
|
|
||||||
public abstract void Clear();
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Relation is the two entities, A related to B.
|
public ReverseSpanEnumerator<(Entity, Entity)> All()
|
||||||
// TRelation is the data attached to the relation.
|
|
||||||
internal unsafe class RelationStorage<TRelation> : RelationStorage, IDisposable where TRelation : unmanaged
|
|
||||||
{
|
{
|
||||||
private int count = 0;
|
return new ReverseSpanEnumerator<(Entity, Entity)>(Relations.ToSpan<(Entity, Entity)>());
|
||||||
private int capacity = 16;
|
}
|
||||||
private (Entity, Entity)* relations;
|
|
||||||
private TRelation* relationDatas;
|
|
||||||
private Dictionary<(Entity, Entity), int> indices = new Dictionary<(Entity, Entity), int>(16);
|
|
||||||
private Dictionary<int, IndexableSet<Entity>> outRelations = new Dictionary<int, IndexableSet<Entity>>(16);
|
|
||||||
private Dictionary<int, IndexableSet<Entity>> inRelations = new Dictionary<int, IndexableSet<Entity>>(16);
|
|
||||||
private Stack<IndexableSet<Entity>> listPool = new Stack<IndexableSet<Entity>>();
|
|
||||||
|
|
||||||
private bool disposed;
|
public unsafe void Set<T>(in Entity entityA, in Entity entityB, in T relationData) where T : unmanaged
|
||||||
|
{
|
||||||
|
var relation = (entityA, entityB);
|
||||||
|
|
||||||
public RelationStorage()
|
if (Indices.TryGetValue(relation, out var index))
|
||||||
{
|
{
|
||||||
relations = ((Entity, Entity)*) NativeMemory.Alloc((nuint) (capacity * Unsafe.SizeOf<(Entity, Entity)>()));
|
RelationDatas.Set(index, relationData);
|
||||||
relationDatas = (TRelation*) NativeMemory.Alloc((nuint) (capacity * Unsafe.SizeOf<TRelation>()));
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
public override ReverseSpanEnumerator<(Entity, Entity)> All()
|
if (!OutRelationSets.ContainsKey(entityA))
|
||||||
{
|
{
|
||||||
return new ReverseSpanEnumerator<(Entity, Entity)>(new Span<(Entity, Entity)>(relations, count));
|
OutRelationSets[entityA] = AcquireHashSetFromPool();
|
||||||
}
|
}
|
||||||
|
OutRelationSets[entityA].Add(entityB);
|
||||||
|
|
||||||
public void Set(in Entity entityA, in Entity entityB, TRelation relationData)
|
if (!InRelationSets.ContainsKey(entityB))
|
||||||
{
|
{
|
||||||
var relation = (entityA, entityB);
|
InRelationSets[entityB] = AcquireHashSetFromPool();
|
||||||
|
|
||||||
if (indices.TryGetValue(relation, out var index))
|
|
||||||
{
|
|
||||||
relationDatas[index] = relationData;
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
var idA = entityA.ID;
|
|
||||||
var idB = entityB.ID;
|
|
||||||
|
|
||||||
if (!outRelations.ContainsKey(idA))
|
|
||||||
{
|
|
||||||
outRelations[idA] = AcquireHashSetFromPool();
|
|
||||||
}
|
|
||||||
outRelations[idA].Add(idB);
|
|
||||||
|
|
||||||
if (!inRelations.ContainsKey(idB))
|
|
||||||
{
|
|
||||||
inRelations[idB] = AcquireHashSetFromPool();
|
|
||||||
}
|
|
||||||
inRelations[idB].Add(idA);
|
|
||||||
|
|
||||||
if (count >= capacity)
|
|
||||||
{
|
|
||||||
capacity *= 2;
|
|
||||||
relations = ((Entity, Entity)*) NativeMemory.Realloc(relations, (nuint) (capacity * Unsafe.SizeOf<(Entity, Entity)>()));
|
|
||||||
relationDatas = (TRelation*) NativeMemory.Realloc(relationDatas, (nuint) (capacity * Unsafe.SizeOf<TRelation>()));
|
|
||||||
}
|
|
||||||
|
|
||||||
relations[count] = relation;
|
|
||||||
relationDatas[count] = relationData;
|
|
||||||
indices.Add(relation, count);
|
|
||||||
count += 1;
|
|
||||||
}
|
}
|
||||||
|
InRelationSets[entityB].Add(entityA);
|
||||||
|
|
||||||
public TRelation Get(in Entity entityA, in Entity entityB)
|
Relations.Append(relation);
|
||||||
|
RelationDatas.Append(relationData);
|
||||||
|
Indices.Add(relation, Relations.Count - 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
public ref T Get<T>(in Entity entityA, in Entity entityB) where T : unmanaged
|
||||||
|
{
|
||||||
|
var relationIndex = Indices[(entityA, entityB)];
|
||||||
|
return ref RelationDatas.Get<T>(relationIndex);
|
||||||
|
}
|
||||||
|
|
||||||
|
public bool Has(Entity entityA, Entity entityB)
|
||||||
|
{
|
||||||
|
return Indices.ContainsKey((entityA, entityB));
|
||||||
|
}
|
||||||
|
|
||||||
|
public ReverseSpanEnumerator<Entity> OutRelations(Entity Entity)
|
||||||
|
{
|
||||||
|
if (OutRelationSets.TryGetValue(Entity, out var entityOutRelations))
|
||||||
{
|
{
|
||||||
return relationDatas[indices[(entityA, entityB)]];
|
return entityOutRelations.GetEnumerator();
|
||||||
}
|
}
|
||||||
|
else
|
||||||
public bool Has((Entity, Entity) relation)
|
|
||||||
{
|
{
|
||||||
return indices.ContainsKey(relation);
|
return ReverseSpanEnumerator<Entity>.Empty;
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
public ReverseSpanEnumerator<Entity> OutRelations(int entityID)
|
public Entity OutFirst(Entity Entity)
|
||||||
{
|
{
|
||||||
if (outRelations.TryGetValue(entityID, out var entityOutRelations))
|
return OutNth(Entity, 0);
|
||||||
{
|
}
|
||||||
return entityOutRelations.GetEnumerator();
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
return ReverseSpanEnumerator<Entity>.Empty;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity OutFirst(int entityID)
|
public Entity OutNth(Entity Entity, int n)
|
||||||
{
|
{
|
||||||
return OutNth(entityID, 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity OutNth(int entityID, int n)
|
|
||||||
{
|
|
||||||
#if DEBUG
|
#if DEBUG
|
||||||
if (!outRelations.ContainsKey(entityID) || outRelations[entityID].Count == 0)
|
if (!OutRelationSets.ContainsKey(Entity) || OutRelationSets[Entity].Count == 0)
|
||||||
{
|
{
|
||||||
throw new KeyNotFoundException("No out relations to this entity!");
|
throw new KeyNotFoundException("No out relations to this entity!");
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
return outRelations[entityID][n];
|
return OutRelationSets[Entity][n];
|
||||||
}
|
}
|
||||||
|
|
||||||
public bool HasOutRelation(int entityID)
|
public bool HasOutRelation(Entity Entity)
|
||||||
{
|
{
|
||||||
return outRelations.ContainsKey(entityID) && outRelations[entityID].Count > 0;
|
return OutRelationSets.ContainsKey(Entity) && OutRelationSets[Entity].Count > 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
public int OutRelationCount(int entityID)
|
public int OutRelationCount(Entity Entity)
|
||||||
{
|
{
|
||||||
return outRelations.TryGetValue(entityID, out var entityOutRelations) ? entityOutRelations.Count : 0;
|
return OutRelationSets.TryGetValue(Entity, out var entityOutRelations) ? entityOutRelations.Count : 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
public ReverseSpanEnumerator<Entity> InRelations(int entityID)
|
public ReverseSpanEnumerator<Entity> InRelations(Entity Entity)
|
||||||
|
{
|
||||||
|
if (InRelationSets.TryGetValue(Entity, out var entityInRelations))
|
||||||
{
|
{
|
||||||
if (inRelations.TryGetValue(entityID, out var entityInRelations))
|
return entityInRelations.GetEnumerator();
|
||||||
{
|
|
||||||
return entityInRelations.GetEnumerator();
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
return ReverseSpanEnumerator<Entity>.Empty;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
else
|
||||||
public Entity InFirst(int entityID)
|
|
||||||
{
|
{
|
||||||
return InNth(entityID, 0);
|
return ReverseSpanEnumerator<Entity>.Empty;
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
public Entity InNth(int entityID, int n)
|
public Entity InFirst(Entity Entity)
|
||||||
{
|
{
|
||||||
|
return InNth(Entity, 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
public Entity InNth(Entity Entity, int n)
|
||||||
|
{
|
||||||
#if DEBUG
|
#if DEBUG
|
||||||
if (!inRelations.ContainsKey(entityID) || inRelations[entityID].Count == 0)
|
if (!InRelationSets.ContainsKey(Entity) || InRelationSets[Entity].Count == 0)
|
||||||
{
|
{
|
||||||
throw new KeyNotFoundException("No in relations to this entity!");
|
throw new KeyNotFoundException("No in relations to this entity!");
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
return inRelations[entityID][n];
|
return InRelationSets[Entity][n];
|
||||||
}
|
}
|
||||||
|
|
||||||
public bool HasInRelation(int entityID)
|
public bool HasInRelation(Entity Entity)
|
||||||
|
{
|
||||||
|
return InRelationSets.ContainsKey(Entity) && InRelationSets[Entity].Count > 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
public int InRelationCount(Entity Entity)
|
||||||
|
{
|
||||||
|
return InRelationSets.TryGetValue(Entity, out var entityInRelations) ? entityInRelations.Count : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
public (bool, bool) Remove(in Entity entityA, in Entity entityB)
|
||||||
|
{
|
||||||
|
var aEmpty = false;
|
||||||
|
var bEmpty = false;
|
||||||
|
var relation = (entityA, entityB);
|
||||||
|
|
||||||
|
if (OutRelationSets.TryGetValue(entityA, out var entityOutRelations))
|
||||||
{
|
{
|
||||||
return inRelations.ContainsKey(entityID) && inRelations[entityID].Count > 0;
|
entityOutRelations.Remove(entityB);
|
||||||
}
|
if (OutRelationSets[entityA].Count == 0)
|
||||||
|
|
||||||
public int InRelationCount(int entityID)
|
|
||||||
{
|
|
||||||
return inRelations.TryGetValue(entityID, out var entityInRelations) ? entityInRelations.Count : 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
public (bool, bool) Remove(in Entity entityA, in Entity entityB)
|
|
||||||
{
|
|
||||||
var aEmpty = false;
|
|
||||||
var bEmpty = false;
|
|
||||||
var relation = (entityA, entityB);
|
|
||||||
|
|
||||||
if (outRelations.TryGetValue(entityA.ID, out var entityOutRelations))
|
|
||||||
{
|
{
|
||||||
entityOutRelations.Remove(entityB.ID);
|
aEmpty = true;
|
||||||
if (outRelations[entityA.ID].Count == 0)
|
}
|
||||||
{
|
}
|
||||||
aEmpty = true;
|
|
||||||
}
|
if (InRelationSets.TryGetValue(entityB, out var entityInRelations))
|
||||||
|
{
|
||||||
|
entityInRelations.Remove(entityA);
|
||||||
|
if (InRelationSets[entityB].Count == 0)
|
||||||
|
{
|
||||||
|
bEmpty = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (Indices.TryGetValue(relation, out var index))
|
||||||
|
{
|
||||||
|
var lastElementIndex = Relations.Count - 1;
|
||||||
|
|
||||||
|
// move an element into the hole
|
||||||
|
if (index != lastElementIndex)
|
||||||
|
{
|
||||||
|
var lastRelation = Relations.Get<(Entity, Entity)>(lastElementIndex);
|
||||||
|
Indices[lastRelation] = index;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (inRelations.TryGetValue(entityB.ID, out var entityInRelations))
|
RelationDatas.Delete(index);
|
||||||
|
Relations.Delete(index);
|
||||||
|
|
||||||
|
Indices.Remove(relation);
|
||||||
|
}
|
||||||
|
|
||||||
|
return (aEmpty, bEmpty);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void RemoveEntity(in Entity entity)
|
||||||
|
{
|
||||||
|
if (OutRelationSets.TryGetValue(entity, out var entityOutRelations))
|
||||||
|
{
|
||||||
|
foreach (var entityB in entityOutRelations)
|
||||||
{
|
{
|
||||||
entityInRelations.Remove(entityA.ID);
|
Remove(entity, entityB);
|
||||||
if (inRelations[entityB.ID].Count == 0)
|
|
||||||
{
|
|
||||||
bEmpty = true;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if (indices.TryGetValue(relation, out var index))
|
ReturnHashSetToPool(entityOutRelations);
|
||||||
{
|
OutRelationSets.Remove(entity);
|
||||||
var lastElementIndex = count - 1;
|
}
|
||||||
|
|
||||||
// move an element into the hole
|
if (InRelationSets.TryGetValue(entity, out var entityInRelations))
|
||||||
if (index != lastElementIndex)
|
{
|
||||||
|
foreach (var entityA in entityInRelations)
|
||||||
|
{
|
||||||
|
Remove(entityA, entity);
|
||||||
|
}
|
||||||
|
|
||||||
|
ReturnHashSetToPool(entityInRelations);
|
||||||
|
InRelationSets.Remove(entity);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
internal IndexableSet<Entity> AcquireHashSetFromPool()
|
||||||
|
{
|
||||||
|
if (ListPool.Count == 0)
|
||||||
|
{
|
||||||
|
ListPool.Push(new IndexableSet<Entity>());
|
||||||
|
}
|
||||||
|
|
||||||
|
return ListPool.Pop();
|
||||||
|
}
|
||||||
|
|
||||||
|
private void ReturnHashSetToPool(IndexableSet<Entity> hashSet)
|
||||||
|
{
|
||||||
|
hashSet.Clear();
|
||||||
|
ListPool.Push(hashSet);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Clear()
|
||||||
|
{
|
||||||
|
Indices.Clear();
|
||||||
|
|
||||||
|
foreach (var set in InRelationSets.Values)
|
||||||
|
{
|
||||||
|
ReturnHashSetToPool(set);
|
||||||
|
}
|
||||||
|
InRelationSets.Clear();
|
||||||
|
|
||||||
|
foreach (var set in OutRelationSets.Values)
|
||||||
|
{
|
||||||
|
ReturnHashSetToPool(set);
|
||||||
|
}
|
||||||
|
OutRelationSets.Clear();
|
||||||
|
|
||||||
|
Relations.Clear();
|
||||||
|
RelationDatas.Clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
Clear();
|
||||||
|
|
||||||
|
if (disposing)
|
||||||
|
{
|
||||||
|
foreach (var set in ListPool)
|
||||||
{
|
{
|
||||||
var lastRelation = relations[lastElementIndex];
|
set.Dispose();
|
||||||
indices[lastRelation] = index;
|
|
||||||
relationDatas[index] = relationDatas[lastElementIndex];
|
|
||||||
relations[index] = lastRelation;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
count -= 1;
|
Relations.Dispose();
|
||||||
indices.Remove(relation);
|
RelationDatas.Dispose();
|
||||||
}
|
}
|
||||||
|
|
||||||
return (aEmpty, bEmpty);
|
IsDisposed = true;
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
private IndexableSet<Entity> AcquireHashSetFromPool()
|
// ~RelationStorage()
|
||||||
{
|
// {
|
||||||
if (listPool.Count == 0)
|
// // Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
{
|
// Dispose(disposing: false);
|
||||||
listPool.Push(new IndexableSet<Entity>());
|
// }
|
||||||
}
|
|
||||||
|
|
||||||
return listPool.Pop();
|
public void Dispose()
|
||||||
}
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
private void ReturnHashSetToPool(IndexableSet<Entity> hashSet)
|
Dispose(disposing: true);
|
||||||
{
|
GC.SuppressFinalize(this);
|
||||||
hashSet.Clear();
|
|
||||||
listPool.Push(hashSet);
|
|
||||||
}
|
|
||||||
|
|
||||||
// untyped methods used for internal implementation
|
|
||||||
|
|
||||||
public override unsafe void Set(int entityA, int entityB, void* relationData)
|
|
||||||
{
|
|
||||||
Set(entityA, entityB, *(TRelation*) relationData);
|
|
||||||
}
|
|
||||||
|
|
||||||
public override int GetStorageIndex(int entityA, int entityB)
|
|
||||||
{
|
|
||||||
return indices[(entityA, entityB)];
|
|
||||||
}
|
|
||||||
|
|
||||||
public override unsafe void* Get(int relationStorageIndex)
|
|
||||||
{
|
|
||||||
return &relationDatas[relationStorageIndex];
|
|
||||||
}
|
|
||||||
|
|
||||||
public override void UnrelateAll(int entityID)
|
|
||||||
{
|
|
||||||
if (outRelations.TryGetValue(entityID, out var entityOutRelations))
|
|
||||||
{
|
|
||||||
foreach (var entityB in entityOutRelations)
|
|
||||||
{
|
|
||||||
Remove(entityID, entityB);
|
|
||||||
}
|
|
||||||
|
|
||||||
ReturnHashSetToPool(entityOutRelations);
|
|
||||||
outRelations.Remove(entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (inRelations.TryGetValue(entityID, out var entityInRelations))
|
|
||||||
{
|
|
||||||
foreach (var entityA in entityInRelations)
|
|
||||||
{
|
|
||||||
Remove(entityA, entityID);
|
|
||||||
}
|
|
||||||
|
|
||||||
ReturnHashSetToPool(entityInRelations);
|
|
||||||
inRelations.Remove(entityID);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public override RelationStorage<TRelation> CreateStorage()
|
|
||||||
{
|
|
||||||
return new RelationStorage<TRelation>();
|
|
||||||
}
|
|
||||||
|
|
||||||
public override void Clear()
|
|
||||||
{
|
|
||||||
count = 0;
|
|
||||||
indices.Clear();
|
|
||||||
|
|
||||||
foreach (var set in inRelations.Values)
|
|
||||||
{
|
|
||||||
ReturnHashSetToPool(set);
|
|
||||||
}
|
|
||||||
inRelations.Clear();
|
|
||||||
|
|
||||||
foreach (var set in outRelations.Values)
|
|
||||||
{
|
|
||||||
ReturnHashSetToPool(set);
|
|
||||||
}
|
|
||||||
outRelations.Clear();
|
|
||||||
}
|
|
||||||
|
|
||||||
protected virtual void Dispose(bool disposing)
|
|
||||||
{
|
|
||||||
if (!disposed)
|
|
||||||
{
|
|
||||||
Clear();
|
|
||||||
|
|
||||||
if (disposing)
|
|
||||||
{
|
|
||||||
foreach (var set in listPool)
|
|
||||||
{
|
|
||||||
set.Dispose();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
NativeMemory.Free(relations);
|
|
||||||
NativeMemory.Free(relationDatas);
|
|
||||||
relations = null;
|
|
||||||
relationDatas = null;
|
|
||||||
|
|
||||||
disposed = true;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
~RelationStorage()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: false);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Dispose()
|
|
||||||
{
|
|
||||||
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
|
||||||
Dispose(disposing: true);
|
|
||||||
GC.SuppressFinalize(this);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
|
@ -1,7 +1,6 @@
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public abstract class Renderer : EntityComponentReader
|
||||||
{
|
{
|
||||||
public abstract class Renderer : EntityComponentReader
|
public Renderer(World world) : base(world) { }
|
||||||
{
|
|
||||||
public Renderer(World world) : base(world) { }
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
|
@ -0,0 +1,384 @@
|
||||||
|
using System;
|
||||||
|
using System.Collections.Generic;
|
||||||
|
using System.Runtime.CompilerServices;
|
||||||
|
using MoonTools.ECS.Collections;
|
||||||
|
|
||||||
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
// TODO: we should implement a NativeDictionary that can be memcopied
|
||||||
|
public class Snapshot : IDisposable
|
||||||
|
{
|
||||||
|
private Dictionary<TypeId, ComponentSnapshot> ComponentSnapshots = new Dictionary<TypeId, ComponentSnapshot>();
|
||||||
|
|
||||||
|
private Dictionary<FilterSignature, List<Entity>> Filters = new Dictionary<FilterSignature, List<Entity>>();
|
||||||
|
|
||||||
|
private Dictionary<TypeId, RelationSnapshot> RelationSnapshots =
|
||||||
|
new Dictionary<TypeId, RelationSnapshot>();
|
||||||
|
|
||||||
|
private Dictionary<Entity, IndexableSet<TypeId>> EntityRelationIndex =
|
||||||
|
new Dictionary<Entity, IndexableSet<TypeId>>();
|
||||||
|
|
||||||
|
private Dictionary<Entity, IndexableSet<TypeId>> EntityComponentIndex =
|
||||||
|
new Dictionary<Entity, IndexableSet<TypeId>>();
|
||||||
|
|
||||||
|
private Dictionary<Entity, string> EntityTags = new Dictionary<Entity, string>();
|
||||||
|
|
||||||
|
private IdAssigner EntityIdAssigner = new IdAssigner();
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public void Restore(World world)
|
||||||
|
{
|
||||||
|
// restore id assigner state
|
||||||
|
EntityIdAssigner.CopyTo(world.EntityIdAssigner);
|
||||||
|
|
||||||
|
// restore filter states
|
||||||
|
// this could be sped up if we figured out a direct IndexableSet copy
|
||||||
|
foreach (var (signature, entityList) in Filters)
|
||||||
|
{
|
||||||
|
var filter = world.FilterIndex[signature];
|
||||||
|
|
||||||
|
filter.Clear();
|
||||||
|
|
||||||
|
foreach (var entity in entityList)
|
||||||
|
{
|
||||||
|
filter.AddEntity(entity);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// clear all component storages in case any were created after snapshot
|
||||||
|
// FIXME: this can be eliminated via component discovery
|
||||||
|
foreach (var (typeId, componentStorage) in world.ComponentIndex)
|
||||||
|
{
|
||||||
|
componentStorage.Clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
// clear all relation storages in case any were created after snapshot
|
||||||
|
// FIXME: this can be eliminated via component discovery
|
||||||
|
foreach (var (typeId, relationStorage) in world.RelationIndex)
|
||||||
|
{
|
||||||
|
relationStorage.Clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
// restore components
|
||||||
|
foreach (var (typeId, componentSnapshot) in ComponentSnapshots)
|
||||||
|
{
|
||||||
|
var componentStorage = world.ComponentIndex[typeId];
|
||||||
|
componentSnapshot.Restore(componentStorage);
|
||||||
|
}
|
||||||
|
|
||||||
|
// restore relation state
|
||||||
|
foreach (var (typeId, relationSnapshot) in RelationSnapshots)
|
||||||
|
{
|
||||||
|
var relationStorage = world.RelationIndex[typeId];
|
||||||
|
relationSnapshot.Restore(relationStorage);
|
||||||
|
}
|
||||||
|
|
||||||
|
// restore entity relation index state
|
||||||
|
// FIXME: arghhhh this is so slow
|
||||||
|
|
||||||
|
foreach (var (id, relationTypeSet) in world.EntityRelationIndex)
|
||||||
|
{
|
||||||
|
relationTypeSet.Clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var (id, relationTypeSet) in EntityRelationIndex)
|
||||||
|
{
|
||||||
|
foreach (var typeId in relationTypeSet)
|
||||||
|
{
|
||||||
|
world.EntityRelationIndex[id].Add(typeId);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// restore entity component index state
|
||||||
|
// FIXME: arrghghhh this is so slow
|
||||||
|
|
||||||
|
foreach (var (id, componentTypeSet) in world.EntityComponentIndex)
|
||||||
|
{
|
||||||
|
componentTypeSet.Clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var (id, componentTypeSet) in EntityComponentIndex)
|
||||||
|
{
|
||||||
|
foreach (var typeId in componentTypeSet)
|
||||||
|
{
|
||||||
|
world.EntityComponentIndex[id].Add(typeId);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// restore entity tags
|
||||||
|
foreach (var (id, s) in EntityTags)
|
||||||
|
{
|
||||||
|
world.EntityTags[id] = s;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Take(World world)
|
||||||
|
{
|
||||||
|
// copy id assigner state
|
||||||
|
world.EntityIdAssigner.CopyTo(EntityIdAssigner);
|
||||||
|
|
||||||
|
// copy filter states
|
||||||
|
foreach (var (_, filter) in world.FilterIndex)
|
||||||
|
{
|
||||||
|
TakeFilterSnapshot(filter);
|
||||||
|
}
|
||||||
|
|
||||||
|
// copy components
|
||||||
|
foreach (var (typeId, componentStorage) in world.ComponentIndex)
|
||||||
|
{
|
||||||
|
TakeComponentSnapshot(typeId, componentStorage);
|
||||||
|
}
|
||||||
|
|
||||||
|
// copy relations
|
||||||
|
foreach (var (typeId, relationStorage) in world.RelationIndex)
|
||||||
|
{
|
||||||
|
TakeRelationSnapshot(typeId, relationStorage);
|
||||||
|
}
|
||||||
|
|
||||||
|
// copy entity relation index
|
||||||
|
// FIXME: arghhhh this is so slow
|
||||||
|
foreach (var (id, relationTypeSet) in world.EntityRelationIndex)
|
||||||
|
{
|
||||||
|
if (!EntityRelationIndex.ContainsKey(id))
|
||||||
|
{
|
||||||
|
EntityRelationIndex.Add(id, new IndexableSet<TypeId>());
|
||||||
|
}
|
||||||
|
|
||||||
|
EntityRelationIndex[id].Clear();
|
||||||
|
|
||||||
|
foreach (var typeId in relationTypeSet)
|
||||||
|
{
|
||||||
|
EntityRelationIndex[id].Add(typeId);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// copy entity component index
|
||||||
|
// FIXME: arghhhh this is so slow
|
||||||
|
foreach (var (id, componentTypeSet) in world.EntityComponentIndex)
|
||||||
|
{
|
||||||
|
if (!EntityComponentIndex.ContainsKey(id))
|
||||||
|
{
|
||||||
|
EntityComponentIndex.Add(id, new IndexableSet<TypeId>());
|
||||||
|
}
|
||||||
|
|
||||||
|
EntityComponentIndex[id].Clear();
|
||||||
|
|
||||||
|
foreach (var typeId in componentTypeSet)
|
||||||
|
{
|
||||||
|
EntityComponentIndex[id].Add(typeId);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// copy entity tags
|
||||||
|
foreach (var (id, s) in world.EntityTags)
|
||||||
|
{
|
||||||
|
EntityTags[id] = s;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private void TakeFilterSnapshot(Filter filter)
|
||||||
|
{
|
||||||
|
if (!Filters.TryGetValue(filter.Signature, out var entities))
|
||||||
|
{
|
||||||
|
entities = new List<Entity>();
|
||||||
|
Filters.Add(filter.Signature, entities);
|
||||||
|
}
|
||||||
|
|
||||||
|
entities.Clear();
|
||||||
|
|
||||||
|
foreach (var entity in filter.EntitySet.AsSpan())
|
||||||
|
{
|
||||||
|
entities.Add(entity);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private void TakeComponentSnapshot(TypeId typeId, ComponentStorage componentStorage)
|
||||||
|
{
|
||||||
|
if (!ComponentSnapshots.TryGetValue(typeId, out var componentSnapshot))
|
||||||
|
{
|
||||||
|
componentSnapshot = new ComponentSnapshot(componentStorage.Components.ElementSize);
|
||||||
|
ComponentSnapshots.Add(typeId, componentSnapshot);
|
||||||
|
}
|
||||||
|
|
||||||
|
componentSnapshot.Take(componentStorage);
|
||||||
|
}
|
||||||
|
|
||||||
|
private void TakeRelationSnapshot(TypeId typeId, RelationStorage relationStorage)
|
||||||
|
{
|
||||||
|
if (!RelationSnapshots.TryGetValue(typeId, out var snapshot))
|
||||||
|
{
|
||||||
|
snapshot = new RelationSnapshot(relationStorage.RelationDatas.ElementSize);
|
||||||
|
RelationSnapshots.Add(typeId, snapshot);
|
||||||
|
}
|
||||||
|
|
||||||
|
snapshot.Take(relationStorage);
|
||||||
|
}
|
||||||
|
|
||||||
|
private class ComponentSnapshot : IDisposable
|
||||||
|
{
|
||||||
|
private readonly NativeArray Components;
|
||||||
|
private readonly NativeArray<Entity> EntityIDs;
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public ComponentSnapshot(int elementSize)
|
||||||
|
{
|
||||||
|
Components = new NativeArray(elementSize);
|
||||||
|
EntityIDs = new NativeArray<Entity>();
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Take(ComponentStorage componentStorage)
|
||||||
|
{
|
||||||
|
componentStorage.Components.CopyAllTo(Components);
|
||||||
|
componentStorage.EntityIDs.CopyTo(EntityIDs);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Restore(ComponentStorage componentStorage)
|
||||||
|
{
|
||||||
|
Components.CopyAllTo(componentStorage.Components);
|
||||||
|
EntityIDs.CopyTo(componentStorage.EntityIDs);
|
||||||
|
|
||||||
|
componentStorage.EntityIDToStorageIndex.Clear();
|
||||||
|
for (int i = 0; i < EntityIDs.Count; i += 1)
|
||||||
|
{
|
||||||
|
var entityID = EntityIDs[i];
|
||||||
|
componentStorage.EntityIDToStorageIndex[entityID] = i;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
if (disposing)
|
||||||
|
{
|
||||||
|
Components.Dispose();
|
||||||
|
EntityIDs.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private class RelationSnapshot : IDisposable
|
||||||
|
{
|
||||||
|
private NativeArray Relations;
|
||||||
|
private NativeArray RelationDatas;
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
public RelationSnapshot(int elementSize)
|
||||||
|
{
|
||||||
|
Relations = new NativeArray(Unsafe.SizeOf<(Entity, Entity)>());
|
||||||
|
RelationDatas = new NativeArray(elementSize);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Take(RelationStorage relationStorage)
|
||||||
|
{
|
||||||
|
relationStorage.Relations.CopyAllTo(Relations);
|
||||||
|
relationStorage.RelationDatas.CopyAllTo(RelationDatas);
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Restore(RelationStorage relationStorage)
|
||||||
|
{
|
||||||
|
relationStorage.Clear();
|
||||||
|
|
||||||
|
Relations.CopyAllTo(relationStorage.Relations);
|
||||||
|
RelationDatas.CopyAllTo(relationStorage.RelationDatas);
|
||||||
|
|
||||||
|
for (int index = 0; index < Relations.Count; index += 1)
|
||||||
|
{
|
||||||
|
var relation = Relations.Get<(Entity, Entity)>(index);
|
||||||
|
relationStorage.Indices[relation] = index;
|
||||||
|
|
||||||
|
relationStorage.Indices[relation] = index;
|
||||||
|
|
||||||
|
if (!relationStorage.OutRelationSets.ContainsKey(relation.Item1))
|
||||||
|
{
|
||||||
|
relationStorage.OutRelationSets[relation.Item1] =
|
||||||
|
relationStorage.AcquireHashSetFromPool();
|
||||||
|
}
|
||||||
|
|
||||||
|
relationStorage.OutRelationSets[relation.Item1].Add(relation.Item2);
|
||||||
|
|
||||||
|
if (!relationStorage.InRelationSets.ContainsKey(relation.Item2))
|
||||||
|
{
|
||||||
|
relationStorage.InRelationSets[relation.Item2] =
|
||||||
|
relationStorage.AcquireHashSetFromPool();
|
||||||
|
}
|
||||||
|
|
||||||
|
relationStorage.InRelationSets[relation.Item2].Add(relation.Item1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
if (disposing)
|
||||||
|
{
|
||||||
|
Relations.Dispose();
|
||||||
|
RelationDatas.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
if (disposing)
|
||||||
|
{
|
||||||
|
foreach (var componentSnapshot in ComponentSnapshots.Values)
|
||||||
|
{
|
||||||
|
componentSnapshot.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var relationSnapshot in RelationSnapshots.Values)
|
||||||
|
{
|
||||||
|
relationSnapshot.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var componentSet in EntityComponentIndex.Values)
|
||||||
|
{
|
||||||
|
componentSet.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var relationSet in EntityRelationIndex.Values)
|
||||||
|
{
|
||||||
|
relationSet.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
EntityIdAssigner.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
|
}
|
||||||
|
}
|
|
@ -1,47 +1,15 @@
|
||||||
using System;
|
using System;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public abstract class System : Manipulator
|
||||||
{
|
{
|
||||||
public abstract class System : Manipulator
|
protected System(World world) : base(world) { }
|
||||||
{
|
|
||||||
internal MessageDepot MessageDepot => World.MessageDepot;
|
|
||||||
|
|
||||||
public System(World world) : base(world) { }
|
public abstract void Update();
|
||||||
|
|
||||||
public abstract void Update(TimeSpan delta);
|
protected ReadOnlySpan<T> ReadMessages<T>() where T : unmanaged => World.ReadMessages<T>();
|
||||||
|
protected T ReadMessage<T>() where T : unmanaged => World.ReadMessage<T>();
|
||||||
protected ReadOnlySpan<TMessage> ReadMessages<TMessage>() where TMessage : unmanaged
|
protected bool SomeMessage<T>() where T : unmanaged => World.SomeMessage<T>();
|
||||||
{
|
protected void Send<T>(T message) where T : unmanaged => World.Send(message);
|
||||||
return MessageDepot.All<TMessage>();
|
|
||||||
}
|
|
||||||
|
|
||||||
protected TMessage ReadMessage<TMessage>() where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return MessageDepot.First<TMessage>();
|
|
||||||
}
|
|
||||||
|
|
||||||
protected bool SomeMessage<TMessage>() where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return MessageDepot.Some<TMessage>();
|
|
||||||
}
|
|
||||||
|
|
||||||
protected ReverseSpanEnumerator<TMessage> ReadMessagesWithEntity<TMessage>(in Entity entity) where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return MessageDepot.WithEntity<TMessage>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected ref readonly TMessage ReadMessageWithEntity<TMessage>(in Entity entity) where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return ref MessageDepot.FirstWithEntity<TMessage>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected bool SomeMessageWithEntity<TMessage>(in Entity entity) where TMessage : unmanaged
|
|
||||||
{
|
|
||||||
return MessageDepot.SomeWithEntity<TMessage>(entity.ID);
|
|
||||||
}
|
|
||||||
|
|
||||||
protected void Send<TMessage>(in TMessage message) where TMessage : unmanaged => World.Send(message);
|
|
||||||
|
|
||||||
protected void Send<TMessage>(in Entity entity, in TMessage message) where TMessage : unmanaged => World.Send(entity, message);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
|
@ -0,0 +1,11 @@
|
||||||
|
using System;
|
||||||
|
|
||||||
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public readonly record struct TypeId(uint Value) : IComparable<TypeId>
|
||||||
|
{
|
||||||
|
public int CompareTo(TypeId other)
|
||||||
|
{
|
||||||
|
return Value.CompareTo(other.Value);
|
||||||
|
}
|
||||||
|
}
|
|
@ -1,33 +0,0 @@
|
||||||
using System;
|
|
||||||
using System.Collections.Generic;
|
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
|
||||||
{
|
|
||||||
public class TypeIndices
|
|
||||||
{
|
|
||||||
Dictionary<Type, int> TypeToIndex = new Dictionary<Type, int>();
|
|
||||||
int nextID = 0;
|
|
||||||
public int Count => TypeToIndex.Count;
|
|
||||||
|
|
||||||
public int GetIndex<T>() where T : unmanaged
|
|
||||||
{
|
|
||||||
if (!TypeToIndex.ContainsKey(typeof(T)))
|
|
||||||
{
|
|
||||||
TypeToIndex.Add(typeof(T), nextID);
|
|
||||||
nextID += 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
return TypeToIndex[typeof(T)];
|
|
||||||
}
|
|
||||||
|
|
||||||
public int GetIndex(Type type)
|
|
||||||
{
|
|
||||||
return TypeToIndex[type];
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
#if DEBUG
|
|
||||||
public Dictionary<Type, int>.KeyCollection Types => TypeToIndex.Keys;
|
|
||||||
#endif
|
|
||||||
}
|
|
||||||
}
|
|
672
src/World.cs
672
src/World.cs
|
@ -1,194 +1,520 @@
|
||||||
using System;
|
using System;
|
||||||
using System.Collections.Generic;
|
using System.Collections.Generic;
|
||||||
|
using System.Runtime.CompilerServices;
|
||||||
|
using MoonTools.ECS.Collections;
|
||||||
|
|
||||||
namespace MoonTools.ECS
|
namespace MoonTools.ECS;
|
||||||
|
|
||||||
|
public class World : IDisposable
|
||||||
{
|
{
|
||||||
public class World
|
// Get TypeId from a Type
|
||||||
{
|
private readonly Dictionary<Type, TypeId> TypeToId = new Dictionary<Type, TypeId>();
|
||||||
internal readonly static TypeIndices ComponentTypeIndices = new TypeIndices();
|
|
||||||
internal readonly static TypeIndices RelationTypeIndices = new TypeIndices();
|
|
||||||
internal readonly EntityStorage EntityStorage = new EntityStorage();
|
|
||||||
internal readonly ComponentDepot ComponentDepot;
|
|
||||||
internal readonly MessageDepot MessageDepot = new MessageDepot();
|
|
||||||
internal readonly RelationDepot RelationDepot;
|
|
||||||
internal readonly FilterStorage FilterStorage;
|
|
||||||
public FilterBuilder FilterBuilder => new FilterBuilder(FilterStorage, ComponentTypeIndices);
|
|
||||||
|
|
||||||
public World()
|
|
||||||
{
|
|
||||||
ComponentDepot = new ComponentDepot(ComponentTypeIndices);
|
|
||||||
RelationDepot = new RelationDepot(EntityStorage, RelationTypeIndices);
|
|
||||||
FilterStorage = new FilterStorage(EntityStorage, ComponentTypeIndices);
|
|
||||||
}
|
|
||||||
|
|
||||||
public Entity CreateEntity(string tag = "")
|
|
||||||
{
|
|
||||||
return EntityStorage.Create(tag);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Tag(Entity entity, string tag)
|
|
||||||
{
|
|
||||||
EntityStorage.Tag(entity, tag);
|
|
||||||
}
|
|
||||||
|
|
||||||
public string GetTag(Entity entity)
|
|
||||||
{
|
|
||||||
return EntityStorage.Tag(entity);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void Set<TComponent>(Entity entity, in TComponent component) where TComponent : unmanaged
|
|
||||||
{
|
|
||||||
#if DEBUG
|
#if DEBUG
|
||||||
// check for use after destroy
|
private Dictionary<TypeId, Type> IdToType = new Dictionary<TypeId, Type>();
|
||||||
if (!EntityStorage.Exists(entity))
|
|
||||||
{
|
|
||||||
throw new InvalidOperationException("This entity is not valid!");
|
|
||||||
}
|
|
||||||
#endif
|
#endif
|
||||||
ComponentDepot.Set<TComponent>(entity.ID, component);
|
|
||||||
|
|
||||||
if (EntityStorage.SetComponent(entity.ID, ComponentTypeIndices.GetIndex<TComponent>()))
|
// Get element size from a TypeId
|
||||||
|
private readonly Dictionary<TypeId, int> ElementSizes = new Dictionary<TypeId, int>();
|
||||||
|
|
||||||
|
// Filters
|
||||||
|
internal readonly Dictionary<FilterSignature, Filter> FilterIndex = new Dictionary<FilterSignature, Filter>();
|
||||||
|
private readonly Dictionary<TypeId, List<Filter>> TypeToFilter = new Dictionary<TypeId, List<Filter>>();
|
||||||
|
|
||||||
|
// TODO: can we make the tag an native array of chars at some point?
|
||||||
|
internal Dictionary<Entity, string> EntityTags = new Dictionary<Entity, string>();
|
||||||
|
|
||||||
|
// Relation Storages
|
||||||
|
internal Dictionary<TypeId, RelationStorage> RelationIndex = new Dictionary<TypeId, RelationStorage>();
|
||||||
|
internal Dictionary<Entity, IndexableSet<TypeId>> EntityRelationIndex = new Dictionary<Entity, IndexableSet<TypeId>>();
|
||||||
|
|
||||||
|
// Message Storages
|
||||||
|
private Dictionary<TypeId, MessageStorage> MessageIndex = new Dictionary<TypeId, MessageStorage>();
|
||||||
|
|
||||||
|
public FilterBuilder FilterBuilder => new FilterBuilder(this);
|
||||||
|
|
||||||
|
internal readonly Dictionary<TypeId, ComponentStorage> ComponentIndex = new Dictionary<TypeId, ComponentStorage>();
|
||||||
|
internal Dictionary<Entity, IndexableSet<TypeId>> EntityComponentIndex = new Dictionary<Entity, IndexableSet<TypeId>>();
|
||||||
|
|
||||||
|
internal IdAssigner EntityIdAssigner = new IdAssigner();
|
||||||
|
private IdAssigner TypeIdAssigner = new IdAssigner();
|
||||||
|
|
||||||
|
private bool IsDisposed;
|
||||||
|
|
||||||
|
internal TypeId GetTypeId<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
if (TypeToId.ContainsKey(typeof(T)))
|
||||||
|
{
|
||||||
|
return TypeToId[typeof(T)];
|
||||||
|
}
|
||||||
|
|
||||||
|
var typeId = new TypeId(TypeIdAssigner.Assign());
|
||||||
|
TypeToId.Add(typeof(T), typeId);
|
||||||
|
ElementSizes.Add(typeId, Unsafe.SizeOf<T>());
|
||||||
|
|
||||||
|
#if DEBUG
|
||||||
|
IdToType.Add(typeId, typeof(T));
|
||||||
|
#endif
|
||||||
|
|
||||||
|
return typeId;
|
||||||
|
}
|
||||||
|
|
||||||
|
internal TypeId GetComponentTypeId<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var typeId = GetTypeId<T>();
|
||||||
|
if (ComponentIndex.TryGetValue(typeId, out var componentStorage))
|
||||||
|
{
|
||||||
|
return typeId;
|
||||||
|
}
|
||||||
|
|
||||||
|
componentStorage = new ComponentStorage(typeId, ElementSizes[typeId]);
|
||||||
|
ComponentIndex.Add(typeId, componentStorage);
|
||||||
|
TypeToFilter.Add(typeId, new List<Filter>());
|
||||||
|
return typeId;
|
||||||
|
}
|
||||||
|
|
||||||
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||||
|
private ComponentStorage GetComponentStorage<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var typeId = GetTypeId<T>();
|
||||||
|
if (ComponentIndex.TryGetValue(typeId, out var componentStorage))
|
||||||
|
{
|
||||||
|
return componentStorage;
|
||||||
|
}
|
||||||
|
|
||||||
|
componentStorage = new ComponentStorage(typeId, ElementSizes[typeId]);
|
||||||
|
ComponentIndex.Add(typeId, componentStorage);
|
||||||
|
TypeToFilter.Add(typeId, new List<Filter>());
|
||||||
|
return componentStorage;
|
||||||
|
}
|
||||||
|
|
||||||
|
// FILTERS
|
||||||
|
|
||||||
|
internal Filter GetFilter(FilterSignature signature)
|
||||||
|
{
|
||||||
|
if (!FilterIndex.TryGetValue(signature, out var filter))
|
||||||
|
{
|
||||||
|
filter = new Filter(this, signature);
|
||||||
|
|
||||||
|
foreach (var typeId in signature.Included)
|
||||||
{
|
{
|
||||||
FilterStorage.Check<TComponent>(entity.ID);
|
TypeToFilter[typeId].Add(filter);
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var typeId in signature.Excluded)
|
||||||
|
{
|
||||||
|
TypeToFilter[typeId].Add(filter);
|
||||||
|
}
|
||||||
|
|
||||||
|
FilterIndex.Add(signature, filter);
|
||||||
|
}
|
||||||
|
|
||||||
|
return filter;
|
||||||
|
}
|
||||||
|
|
||||||
|
// ENTITIES
|
||||||
|
|
||||||
|
public Entity CreateEntity(string tag = "")
|
||||||
|
{
|
||||||
|
var entity = new Entity(EntityIdAssigner.Assign());
|
||||||
|
|
||||||
|
if (!EntityComponentIndex.ContainsKey(entity))
|
||||||
|
{
|
||||||
|
EntityRelationIndex.Add(entity, new IndexableSet<TypeId>());
|
||||||
|
EntityComponentIndex.Add(entity, new IndexableSet<TypeId>());
|
||||||
|
}
|
||||||
|
|
||||||
|
EntityTags[entity] = tag;
|
||||||
|
|
||||||
|
return entity;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Tag(Entity entity, string tag)
|
||||||
|
{
|
||||||
|
EntityTags[entity] = tag;
|
||||||
|
}
|
||||||
|
|
||||||
|
public string GetTag(Entity entity)
|
||||||
|
{
|
||||||
|
return EntityTags[entity];
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Destroy(in Entity entity)
|
||||||
|
{
|
||||||
|
// remove all components from storages
|
||||||
|
foreach (var componentTypeIndex in EntityComponentIndex[entity])
|
||||||
|
{
|
||||||
|
var componentStorage = ComponentIndex[componentTypeIndex];
|
||||||
|
componentStorage.Remove(entity);
|
||||||
|
|
||||||
|
foreach (var filter in TypeToFilter[componentTypeIndex])
|
||||||
|
{
|
||||||
|
filter.RemoveEntity(entity);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// untyped version for Transfer
|
// remove all relations from storage
|
||||||
// no filter check because filter state is copied directly
|
foreach (var relationTypeIndex in EntityRelationIndex[entity])
|
||||||
internal unsafe void Set(Entity entity, int componentTypeIndex, void* component)
|
|
||||||
{
|
{
|
||||||
ComponentDepot.Set(entity.ID, componentTypeIndex, component);
|
var relationStorage = RelationIndex[relationTypeIndex];
|
||||||
EntityStorage.SetComponent(entity.ID, componentTypeIndex);
|
relationStorage.RemoveEntity(entity);
|
||||||
}
|
}
|
||||||
|
|
||||||
public void Remove<TComponent>(in Entity entity) where TComponent : unmanaged
|
EntityComponentIndex[entity].Clear();
|
||||||
|
EntityRelationIndex[entity].Clear();
|
||||||
|
|
||||||
|
// recycle ID
|
||||||
|
EntityIdAssigner.Unassign(entity.ID);
|
||||||
|
}
|
||||||
|
|
||||||
|
// COMPONENTS
|
||||||
|
|
||||||
|
public bool Has<T>(in Entity entity) where T : unmanaged
|
||||||
|
{
|
||||||
|
var storage = GetComponentStorage<T>();
|
||||||
|
return storage.Has(entity);
|
||||||
|
}
|
||||||
|
|
||||||
|
internal bool Has(in Entity entity, in TypeId typeId)
|
||||||
|
{
|
||||||
|
return EntityComponentIndex[entity].Contains(typeId);
|
||||||
|
}
|
||||||
|
|
||||||
|
public bool Some<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var storage = GetComponentStorage<T>();
|
||||||
|
return storage.Any();
|
||||||
|
}
|
||||||
|
|
||||||
|
public ref T Get<T>(in Entity entity) where T : unmanaged
|
||||||
|
{
|
||||||
|
var storage = GetComponentStorage<T>();
|
||||||
|
return ref storage.Get<T>(entity);
|
||||||
|
}
|
||||||
|
|
||||||
|
public ref T GetSingleton<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var storage = GetComponentStorage<T>();
|
||||||
|
return ref storage.GetFirst<T>();
|
||||||
|
}
|
||||||
|
|
||||||
|
public Entity GetSingletonEntity<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var storage = GetComponentStorage<T>();
|
||||||
|
return storage.FirstEntity();
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Set<T>(in Entity entity, in T component) where T : unmanaged
|
||||||
|
{
|
||||||
|
var componentStorage = GetComponentStorage<T>();
|
||||||
|
|
||||||
|
if (!componentStorage.Set(entity, component))
|
||||||
{
|
{
|
||||||
if (EntityStorage.RemoveComponent(entity.ID, ComponentTypeIndices.GetIndex<TComponent>()))
|
EntityComponentIndex[entity].Add(componentStorage.TypeId);
|
||||||
|
|
||||||
|
foreach (var filter in TypeToFilter[componentStorage.TypeId])
|
||||||
{
|
{
|
||||||
// Run filter storage update first so that the entity state is still valid in the remove callback.
|
filter.Check(entity);
|
||||||
FilterStorage.Check<TComponent>(entity.ID);
|
|
||||||
ComponentDepot.Remove<TComponent>(entity.ID);
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
}
|
||||||
public void Relate<TRelationKind>(in Entity entityA, in Entity entityB, TRelationKind relationData) where TRelationKind : unmanaged
|
|
||||||
{
|
public void Remove<T>(in Entity entity) where T : unmanaged
|
||||||
RelationDepot.Set(entityA, entityB, relationData);
|
{
|
||||||
var relationTypeIndex = RelationTypeIndices.GetIndex<TRelationKind>();
|
var componentStorage = GetComponentStorage<T>();
|
||||||
EntityStorage.AddRelationKind(entityA.ID, relationTypeIndex);
|
|
||||||
EntityStorage.AddRelationKind(entityB.ID, relationTypeIndex);
|
if (componentStorage.Remove(entity))
|
||||||
}
|
{
|
||||||
|
EntityComponentIndex[entity].Remove(componentStorage.TypeId);
|
||||||
public void Unrelate<TRelationKind>(in Entity entityA, in Entity entityB) where TRelationKind : unmanaged
|
|
||||||
{
|
foreach (var filter in TypeToFilter[componentStorage.TypeId])
|
||||||
var (aEmpty, bEmpty) = RelationDepot.Remove<TRelationKind>(entityA, entityB);
|
{
|
||||||
|
filter.Check(entity);
|
||||||
if (aEmpty)
|
}
|
||||||
{
|
}
|
||||||
EntityStorage.RemoveRelation(entityA.ID, RelationTypeIndices.GetIndex<TRelationKind>());
|
}
|
||||||
}
|
|
||||||
|
// RELATIONS
|
||||||
if (bEmpty)
|
|
||||||
{
|
private RelationStorage RegisterRelationType(TypeId typeId)
|
||||||
EntityStorage.RemoveRelation(entityB.ID, RelationTypeIndices.GetIndex<TRelationKind>());
|
{
|
||||||
}
|
var relationStorage = new RelationStorage(ElementSizes[typeId]);
|
||||||
}
|
RelationIndex.Add(typeId, relationStorage);
|
||||||
|
return relationStorage;
|
||||||
public void UnrelateAll<TRelationKind>(in Entity entity) where TRelationKind : unmanaged
|
}
|
||||||
{
|
|
||||||
RelationDepot.UnrelateAll<TRelationKind>(entity.ID);
|
[MethodImpl(MethodImplOptions.AggressiveInlining)]
|
||||||
EntityStorage.RemoveRelation(entity.ID, RelationTypeIndices.GetIndex<TRelationKind>());
|
private RelationStorage GetRelationStorage<T>() where T : unmanaged
|
||||||
}
|
{
|
||||||
|
var typeId = GetTypeId<T>();
|
||||||
public void Send<TMessage>(in TMessage message) where TMessage : unmanaged
|
if (RelationIndex.TryGetValue(typeId, out var relationStorage))
|
||||||
{
|
{
|
||||||
MessageDepot.Add(message);
|
return relationStorage;
|
||||||
}
|
}
|
||||||
|
|
||||||
public void Send<TMessage>(in Entity entity, in TMessage message) where TMessage : unmanaged
|
return RegisterRelationType(typeId);
|
||||||
{
|
}
|
||||||
MessageDepot.Add(entity.ID, message);
|
|
||||||
}
|
public void Relate<T>(in Entity entityA, in Entity entityB, in T relation) where T : unmanaged
|
||||||
|
{
|
||||||
public void Destroy(in Entity entity)
|
var relationStorage = GetRelationStorage<T>();
|
||||||
{
|
relationStorage.Set(entityA, entityB, relation);
|
||||||
foreach (var componentTypeIndex in EntityStorage.ComponentTypeIndices(entity.ID))
|
EntityRelationIndex[entityA].Add(TypeToId[typeof(T)]);
|
||||||
{
|
EntityRelationIndex[entityB].Add(TypeToId[typeof(T)]);
|
||||||
// Run filter storage update first so that the entity state is still valid in the remove callback.
|
}
|
||||||
FilterStorage.RemoveEntity(entity.ID, componentTypeIndex);
|
|
||||||
ComponentDepot.Remove(entity.ID, componentTypeIndex);
|
public void Unrelate<T>(in Entity entityA, in Entity entityB) where T : unmanaged
|
||||||
}
|
{
|
||||||
|
var relationStorage = GetRelationStorage<T>();
|
||||||
foreach (var relationTypeIndex in EntityStorage.RelationTypeIndices(entity.ID))
|
relationStorage.Remove(entityA, entityB);
|
||||||
{
|
}
|
||||||
RelationDepot.UnrelateAll(entity.ID, relationTypeIndex);
|
|
||||||
EntityStorage.RemoveRelation(entity.ID, relationTypeIndex);
|
public void UnrelateAll<T>(in Entity entity) where T : unmanaged
|
||||||
}
|
{
|
||||||
|
var relationStorage = GetRelationStorage<T>();
|
||||||
EntityStorage.Destroy(entity);
|
relationStorage.RemoveEntity(entity);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public bool Related<T>(in Entity entityA, in Entity entityB) where T : unmanaged
|
||||||
public void FinishUpdate()
|
{
|
||||||
{
|
var relationStorage = GetRelationStorage<T>();
|
||||||
MessageDepot.Clear();
|
return relationStorage.Has(entityA, entityB);
|
||||||
}
|
}
|
||||||
|
|
||||||
public void Clear()
|
public T GetRelationData<T>(in Entity entityA, in Entity entityB) where T : unmanaged
|
||||||
{
|
{
|
||||||
EntityStorage.Clear();
|
var relationStorage = GetRelationStorage<T>();
|
||||||
MessageDepot.Clear();
|
return relationStorage.Get<T>(entityA, entityB);
|
||||||
RelationDepot.Clear();
|
}
|
||||||
ComponentDepot.Clear();
|
|
||||||
FilterStorage.Clear();
|
public ReverseSpanEnumerator<(Entity, Entity)> Relations<T>() where T : unmanaged
|
||||||
}
|
{
|
||||||
|
var relationStorage = GetRelationStorage<T>();
|
||||||
private Dictionary<int, int> WorldToTransferID = new Dictionary<int, int>();
|
return relationStorage.All();
|
||||||
|
}
|
||||||
/// <summary>
|
|
||||||
/// If you are using the World Transfer feature, call this once after your systems/filters have all been initialized.
|
public ReverseSpanEnumerator<Entity> OutRelations<T>(Entity entity) where T : unmanaged
|
||||||
/// </summary>
|
{
|
||||||
public void PrepareTransferTo(World other)
|
var relationStorage = GetRelationStorage<T>();
|
||||||
{
|
return relationStorage.OutRelations(entity);
|
||||||
other.FilterStorage.CreateMissingStorages(FilterStorage);
|
}
|
||||||
}
|
|
||||||
|
public Entity OutRelationSingleton<T>(in Entity entity) where T : unmanaged
|
||||||
// FIXME: there's probably a better way to handle Filters so they are not world-bound
|
{
|
||||||
public unsafe void Transfer(World other, Filter filter, Filter otherFilter)
|
var relationStorage = GetRelationStorage<T>();
|
||||||
{
|
return relationStorage.OutFirst(entity);
|
||||||
WorldToTransferID.Clear();
|
}
|
||||||
other.ComponentDepot.CreateMissingStorages(ComponentDepot);
|
|
||||||
other.RelationDepot.CreateMissingStorages(RelationDepot);
|
public bool HasOutRelation<T>(in Entity entity) where T : unmanaged
|
||||||
|
{
|
||||||
// destroy all entities matching the filter
|
var relationStorage = GetRelationStorage<T>();
|
||||||
foreach (var entity in otherFilter.Entities)
|
return relationStorage.HasOutRelation(entity);
|
||||||
{
|
}
|
||||||
other.Destroy(entity);
|
|
||||||
}
|
public int OutRelationCount<T>(in Entity entity) where T : unmanaged
|
||||||
|
{
|
||||||
// create entities
|
var relationStorage = GetRelationStorage<T>();
|
||||||
foreach (var entity in filter.Entities)
|
return relationStorage.OutRelationCount(entity);
|
||||||
{
|
}
|
||||||
var otherWorldEntity = other.CreateEntity(GetTag(entity));
|
|
||||||
WorldToTransferID.Add(entity.ID, otherWorldEntity.ID);
|
public Entity NthOutRelation<T>(in Entity entity, int n) where T : unmanaged
|
||||||
}
|
{
|
||||||
|
var relationStorage = GetRelationStorage<T>();
|
||||||
// transfer relations
|
return relationStorage.OutNth(entity, n);
|
||||||
RelationDepot.TransferStorage(WorldToTransferID, other.RelationDepot);
|
}
|
||||||
|
|
||||||
// set components
|
public ReverseSpanEnumerator<Entity> InRelations<T>(Entity entity) where T : unmanaged
|
||||||
foreach (var entity in filter.Entities)
|
{
|
||||||
{
|
var relationStorage = GetRelationStorage<T>();
|
||||||
var otherWorldEntity = WorldToTransferID[entity.ID];
|
return relationStorage.InRelations(entity);
|
||||||
|
}
|
||||||
foreach (var componentTypeIndex in EntityStorage.ComponentTypeIndices(entity.ID))
|
|
||||||
{
|
public Entity InRelationSingleton<T>(in Entity entity) where T : unmanaged
|
||||||
other.Set(otherWorldEntity, componentTypeIndex, ComponentDepot.UntypedGet(entity.ID, componentTypeIndex));
|
{
|
||||||
}
|
var relationStorage = GetRelationStorage<T>();
|
||||||
}
|
return relationStorage.InFirst(entity);
|
||||||
|
}
|
||||||
// transfer filters last so callbacks trigger correctly
|
|
||||||
FilterStorage.TransferStorage(WorldToTransferID, other.FilterStorage);
|
public bool HasInRelation<T>(in Entity entity) where T : unmanaged
|
||||||
}
|
{
|
||||||
|
var relationStorage = GetRelationStorage<T>();
|
||||||
|
return relationStorage.HasInRelation(entity);
|
||||||
|
}
|
||||||
|
|
||||||
|
public int InRelationCount<T>(in Entity entity) where T : unmanaged
|
||||||
|
{
|
||||||
|
var relationStorage = GetRelationStorage<T>();
|
||||||
|
return relationStorage.InRelationCount(entity);
|
||||||
|
}
|
||||||
|
|
||||||
|
public Entity NthInRelation<T>(in Entity entity, int n) where T : unmanaged
|
||||||
|
{
|
||||||
|
var relationStorage = GetRelationStorage<T>();
|
||||||
|
return relationStorage.InNth(entity, n);
|
||||||
|
}
|
||||||
|
|
||||||
|
// MESSAGES
|
||||||
|
|
||||||
|
private TypeId GetMessageTypeId<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var typeId = GetTypeId<T>();
|
||||||
|
|
||||||
|
if (!MessageIndex.ContainsKey(typeId))
|
||||||
|
{
|
||||||
|
MessageIndex.Add(typeId, new MessageStorage(Unsafe.SizeOf<T>()));
|
||||||
|
}
|
||||||
|
|
||||||
|
return typeId;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void Send<T>(in T message) where T : unmanaged
|
||||||
|
{
|
||||||
|
var typeId = GetMessageTypeId<T>();
|
||||||
|
MessageIndex[typeId].Add(message);
|
||||||
|
}
|
||||||
|
|
||||||
|
public bool SomeMessage<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var typeId = GetMessageTypeId<T>();
|
||||||
|
return MessageIndex[typeId].Some();
|
||||||
|
}
|
||||||
|
|
||||||
|
public ReadOnlySpan<T> ReadMessages<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var typeId = GetMessageTypeId<T>();
|
||||||
|
return MessageIndex[typeId].All<T>();
|
||||||
|
}
|
||||||
|
|
||||||
|
public T ReadMessage<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var typeId = GetMessageTypeId<T>();
|
||||||
|
return MessageIndex[typeId].First<T>();
|
||||||
|
}
|
||||||
|
|
||||||
|
public void ClearMessages<T>() where T : unmanaged
|
||||||
|
{
|
||||||
|
var typeId = GetMessageTypeId<T>();
|
||||||
|
MessageIndex[typeId].Clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
// TODO: temporary component storage?
|
||||||
|
public void FinishUpdate()
|
||||||
|
{
|
||||||
|
foreach (var (_, messageStorage) in MessageIndex)
|
||||||
|
{
|
||||||
|
messageStorage.Clear();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// DEBUG
|
||||||
|
// NOTE: these methods are very inefficient
|
||||||
|
// they should only be used in debugging contexts!!
|
||||||
|
#if DEBUG
|
||||||
|
public ComponentTypeEnumerator Debug_GetAllComponentTypes(Entity entity)
|
||||||
|
{
|
||||||
|
return new ComponentTypeEnumerator(this, EntityComponentIndex[entity]);
|
||||||
|
}
|
||||||
|
|
||||||
|
public IEnumerable<Entity> Debug_GetEntities(Type componentType)
|
||||||
|
{
|
||||||
|
var storage = ComponentIndex[TypeToId[componentType]];
|
||||||
|
return storage.Debug_GetEntities();
|
||||||
|
}
|
||||||
|
|
||||||
|
public IEnumerable<Type> Debug_SearchComponentType(string typeString)
|
||||||
|
{
|
||||||
|
foreach (var type in TypeToId.Keys)
|
||||||
|
{
|
||||||
|
if (type.ToString().ToLower().Contains(typeString.ToLower()))
|
||||||
|
{
|
||||||
|
yield return type;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public ref struct ComponentTypeEnumerator
|
||||||
|
{
|
||||||
|
private World World;
|
||||||
|
private IndexableSet<TypeId> Types;
|
||||||
|
private int ComponentIndex;
|
||||||
|
|
||||||
|
public ComponentTypeEnumerator GetEnumerator() => this;
|
||||||
|
|
||||||
|
internal ComponentTypeEnumerator(
|
||||||
|
World world,
|
||||||
|
IndexableSet<TypeId> types
|
||||||
|
)
|
||||||
|
{
|
||||||
|
World = world;
|
||||||
|
Types = types;
|
||||||
|
ComponentIndex = -1;
|
||||||
|
}
|
||||||
|
|
||||||
|
public bool MoveNext()
|
||||||
|
{
|
||||||
|
ComponentIndex += 1;
|
||||||
|
return ComponentIndex < Types.Count;
|
||||||
|
}
|
||||||
|
|
||||||
|
public Type Current => World.IdToType[Types[ComponentIndex]];
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
protected virtual void Dispose(bool disposing)
|
||||||
|
{
|
||||||
|
if (!IsDisposed)
|
||||||
|
{
|
||||||
|
if (disposing)
|
||||||
|
{
|
||||||
|
foreach (var componentStorage in ComponentIndex.Values)
|
||||||
|
{
|
||||||
|
componentStorage.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var relationStorage in RelationIndex.Values)
|
||||||
|
{
|
||||||
|
relationStorage.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var messageStorage in MessageIndex.Values)
|
||||||
|
{
|
||||||
|
messageStorage.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var typeSet in EntityComponentIndex.Values)
|
||||||
|
{
|
||||||
|
typeSet.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var typeSet in EntityRelationIndex.Values)
|
||||||
|
{
|
||||||
|
typeSet.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
foreach (var filter in FilterIndex.Values)
|
||||||
|
{
|
||||||
|
filter.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
EntityIdAssigner.Dispose();
|
||||||
|
TypeIdAssigner.Dispose();
|
||||||
|
}
|
||||||
|
|
||||||
|
IsDisposed = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// // TODO: override finalizer only if 'Dispose(bool disposing)' has code to free unmanaged resources
|
||||||
|
// ~World()
|
||||||
|
// {
|
||||||
|
// // Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
// Dispose(disposing: false);
|
||||||
|
// }
|
||||||
|
|
||||||
|
public void Dispose()
|
||||||
|
{
|
||||||
|
// Do not change this code. Put cleanup code in 'Dispose(bool disposing)' method
|
||||||
|
Dispose(disposing: true);
|
||||||
|
GC.SuppressFinalize(this);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue