public void CopyToTest()
{
var set = UnsafeHashSet.Allocate <int>(10);
// Fill set
for (int i = 0; i < 10; i++)
{
UnsafeHashSet.Add(set, i);
}
var count = UnsafeHashSet.GetCount(set);
int *arr = stackalloc int[count];
UnsafeHashSet.CopyTo <int>(set, arr, 0);
// Check
int num = 0;
for (int i = 0; i < count; i++)
{
Assert.AreEqual(i, arr[num++]);
}
UnsafeHashSet.Free(set);
}
public void ClearHashSet()
{
var set = UnsafeHashSet.Allocate <int>(3);
UnsafeHashSet.Add(set, 1);
UnsafeHashSet.Add(set, 2);
UnsafeHashSet.Add(set, 3);
Assert.IsTrue(UnsafeHashSet.Contains(set, 2));
Assert.AreEqual(3, UnsafeHashSet.GetCount(set));
UnsafeHashSet.Add(set, 4);
Assert.AreEqual(4, UnsafeHashSet.GetCount(set));
UnsafeHashSet.Clear(set);
Assert.AreEqual(0, UnsafeHashSet.GetCount(set));
Assert.IsFalse(UnsafeHashSet.Contains(set, 2));
UnsafeHashSet.Add(set, 4);
Assert.AreEqual(1, UnsafeHashSet.GetCount(set));
Assert.IsTrue(UnsafeHashSet.Contains(set, 4));
UnsafeHashSet.Clear(set);
Assert.AreEqual(0, UnsafeHashSet.GetCount(set));
UnsafeHashSet.Free(set);
}
public void InvalidTypeTest()
{
var set = UnsafeHashSet.Allocate <int>(10);
Assert.Catch <AssertException>(() => { UnsafeHashSet.Add <float>(set, 4); });
UnsafeHashSet.Free(set);
}
public void ConstructorTest()
{
var set = UnsafeHashSet.Allocate <int>(10);
Assert.AreEqual(0, UnsafeHashSet.GetCount(set));
// Next expected prime is 17
Assert.AreEqual(17, UnsafeHashSet.GetCapacity(set));
UnsafeHashSet.Free(set);
}
public void AddDuplicateTest()
{
var set = UnsafeHashSet.Allocate <int>(3);
Assert.IsTrue(UnsafeHashSet.Add(set, 5));
Assert.IsTrue(UnsafeHashSet.Add(set, 8));
Assert.IsTrue(UnsafeHashSet.Add(set, 9));
Assert.IsFalse(UnsafeHashSet.Add(set, 5));
Assert.AreEqual(3, UnsafeHashSet.GetCapacity(set));
UnsafeHashSet.Free(set);
}
private UnsafeHashSet *GetOddEvenSet(bool isOdd = false)
{
var set = UnsafeHashSet.Allocate <int>(10);
int num = isOdd ? 1 : 0;
for (int i = 0; i < 5; i++)
{
UnsafeHashSet.Add(set, num);
num += 2;
}
return(set);
}
public void AddHashCollisionTest()
{
// Tests linked-list functionality when hash collisions occur.
var set = UnsafeHashSet.Allocate <DuplicateKey>(3);
Assert.IsTrue(UnsafeHashSet.Add(set, new DuplicateKey(1)));
Assert.IsTrue(UnsafeHashSet.Add(set, new DuplicateKey(2)));
Assert.IsTrue(UnsafeHashSet.Add(set, new DuplicateKey(3)));
Assert.IsFalse(UnsafeHashSet.Add(set, new DuplicateKey(1)));
Assert.IsTrue(UnsafeHashSet.Contains(set, new DuplicateKey(2)));
Assert.AreEqual(3, UnsafeHashSet.GetCapacity(set));
UnsafeHashSet.Free(set);
}
public void AddTest()
{
var set = UnsafeHashSet.Allocate <int>(10);
for (int i = 0; i < 10; i++)
{
UnsafeHashSet.Add <int>(set, i * i * i);
}
int *arr = stackalloc int[10];
UnsafeHashSet.CopyTo <int>(set, arr, 0);
for (int i = 0; i < 10; i++)
{
Assert.AreEqual(i * i * i, arr[i]);
}
UnsafeHashSet.Free(set);
}
public void IteratorTest()
{
var set = UnsafeHashSet.Allocate <int>(10);
// Fill set
for (int i = 0; i < 10; i++)
{
UnsafeHashSet.Add(set, i);
}
var enumerator = UnsafeHashSet.GetEnumerator <int>(set);
for (int i = 0; i < 10; i++)
{
enumerator.MoveNext();
Assert.AreEqual(i, enumerator.Current);
}
UnsafeHashSet.Free(set);
}
public void CopyHashCollisionTest()
{
// Tests linked-list functionality when hash collisions occur.
var set = UnsafeHashSet.Allocate <DuplicateKey>(3);
Assert.IsTrue(UnsafeHashSet.Add(set, new DuplicateKey(1)));
Assert.IsTrue(UnsafeHashSet.Add(set, new DuplicateKey(2)));
Assert.IsTrue(UnsafeHashSet.Add(set, new DuplicateKey(3)));
var arr = stackalloc DuplicateKey[3];
UnsafeHashSet.CopyTo <DuplicateKey>(set, arr, 0);
for (int i = 0; i < 3; i++)
{
Assert.AreEqual(new DuplicateKey(i + 1), arr[i]);
}
UnsafeHashSet.Free(set);
}
public void ExpandFailedTest()
{
var initialCapacity = 7;
var set = UnsafeHashSet.Allocate <int>(initialCapacity, true);
// Valid adds
for (int i = 0; i < initialCapacity; i++)
{
UnsafeHashSet.Add(set, i + 1);
}
Assert.AreEqual(initialCapacity, UnsafeHashSet.GetCount(set));
Assert.AreEqual(initialCapacity, UnsafeHashSet.GetCapacity(set));
Assert.Throws <InvalidOperationException>(() =>
{
UnsafeHashSet.Add(set, 42);
});
UnsafeHashSet.Free(set);
}
public void ContainsTest()
{
var set = UnsafeHashSet.Allocate <int>(10);
Assert.IsFalse(UnsafeHashSet.Contains <int>(set, 1));
UnsafeHashSet.Add(set, 1);
UnsafeHashSet.Add(set, 7);
UnsafeHashSet.Add(set, 51);
UnsafeHashSet.Add(set, 13);
Assert.IsFalse(UnsafeHashSet.Contains <int>(set, 3));
Assert.IsTrue(UnsafeHashSet.Contains <int>(set, 1));
Assert.IsTrue(UnsafeHashSet.Contains <int>(set, 7));
Assert.IsTrue(UnsafeHashSet.Contains <int>(set, 13));
Assert.IsTrue(UnsafeHashSet.Contains <int>(set, 51));
Assert.IsFalse(UnsafeHashSet.Contains <int>(set, 14));
UnsafeHashSet.Free(set);
}
public void RemoveTest()
{
var set = UnsafeHashSet.Allocate <int>(10);
Assert.IsFalse(UnsafeHashSet.Remove <int>(set, 1));
UnsafeHashSet.Add(set, 1);
UnsafeHashSet.Add(set, 7);
UnsafeHashSet.Add(set, 51);
UnsafeHashSet.Add(set, 13);
Assert.IsFalse(UnsafeHashSet.Remove <int>(set, 3));
Assert.IsTrue(UnsafeHashSet.Remove <int>(set, 1));
Assert.IsTrue(UnsafeHashSet.Remove <int>(set, 7));
Assert.IsTrue(UnsafeHashSet.Remove <int>(set, 13));
Assert.IsTrue(UnsafeHashSet.Remove <int>(set, 51));
Assert.IsFalse(UnsafeHashSet.Remove <int>(set, 13));
UnsafeHashSet.Free(set);
}
public void ExpandTest()
{
var initialCapacity = 7;
var set = UnsafeHashSet.Allocate <int>(initialCapacity, fixedSize: false);
// Valid adds
for (int i = 0; i < initialCapacity; i++)
{
UnsafeHashSet.Add(set, i + 1);
}
Assert.AreEqual(initialCapacity, UnsafeHashSet.GetCount(set));
Assert.AreEqual(initialCapacity, UnsafeHashSet.GetCapacity(set));
UnsafeHashSet.Add(set, 42);
UnsafeHashSet.Add(set, 18);
var nextCapacity = UnsafeHashCollection.GetNextPrime(initialCapacity + 1);
Assert.AreEqual(9, UnsafeHashSet.GetCount(set));
Assert.AreEqual(nextCapacity, UnsafeHashSet.GetCapacity(set));
UnsafeHashSet.Free(set);
}
public NativeHashSet(int capacity)
{
m_inner = UnsafeHashSet.Allocate <T>(capacity, false);
}
public void FreeFixedSet()
{
var s = UnsafeHashSet.Allocate <int>(2, true);
UnsafeHashSet.Free(s);
}
public void FreeDynamicSet()
{
var s = UnsafeHashSet.Allocate <int>(2, false);
UnsafeHashSet.Free(s);
}
public NativeHashSet(int capacity, bool fixedSize)
{
m_inner = UnsafeHashSet.Allocate <T>(capacity, fixedSize);
}