1036 lines
32 KiB
C#
1036 lines
32 KiB
C#
|
using NUnit.Framework;
|
||
|
|
using Unity.Collections;
|
||
|
|
using Unity.Jobs;
|
||
|
|
using Unity.Collections.LowLevel.Unsafe;
|
||
|
|
using Unity.Collections.LowLevel.Unsafe.NotBurstCompatible;
|
||
|
|
using Unity.Collections.Tests;
|
||
|
|
using System;
|
||
|
|
using Unity.Burst;
|
||
|
|
using System.Runtime.InteropServices;
|
||
|
|
using UnityEngine.TestTools;
|
||
|
|
using System.Text.RegularExpressions;
|
||
|
|
using UnityEngine;
|
||
|
|
|
||
|
|
internal class NativeHashMapTests : CollectionsTestCommonBase
|
||
|
|
{
|
||
|
|
#pragma warning disable 0649 // always default value
|
||
|
|
struct NonBlittableStruct : IEquatable<NonBlittableStruct>
|
||
|
|
{
|
||
|
|
object o;
|
||
|
|
|
||
|
|
public bool Equals(NonBlittableStruct other)
|
||
|
|
{
|
||
|
|
return Equals(o, other.o);
|
||
|
|
}
|
||
|
|
|
||
|
|
public override bool Equals(object obj)
|
||
|
|
{
|
||
|
|
if (ReferenceEquals(null, obj)) return false;
|
||
|
|
return obj is NonBlittableStruct other && Equals(other);
|
||
|
|
}
|
||
|
|
|
||
|
|
public override int GetHashCode()
|
||
|
|
{
|
||
|
|
return (o != null ? o.GetHashCode() : 0);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
#pragma warning restore 0649
|
||
|
|
|
||
|
|
static void ExpectedCount<TKey, TValue>(ref NativeHashMap<TKey, TValue> container, int expected)
|
||
|
|
where TKey : unmanaged, IEquatable<TKey>
|
||
|
|
where TValue : unmanaged
|
||
|
|
{
|
||
|
|
Assert.AreEqual(expected == 0, container.IsEmpty);
|
||
|
|
Assert.AreEqual(expected, container.Count);
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_TryAdd_TryGetValue_Clear()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(16, Allocator.Temp);
|
||
|
|
ExpectedCount(ref hashMap, 0);
|
||
|
|
|
||
|
|
int iSquared;
|
||
|
|
// Make sure GetValue fails if hash map is empty
|
||
|
|
Assert.IsFalse(hashMap.TryGetValue(0, out iSquared), "TryGetValue on empty hash map did not fail");
|
||
|
|
|
||
|
|
// Make sure inserting values work
|
||
|
|
for (int i = 0; i < 16; ++i)
|
||
|
|
Assert.IsTrue(hashMap.TryAdd(i, i * i), "Failed to add value");
|
||
|
|
ExpectedCount(ref hashMap, 16);
|
||
|
|
|
||
|
|
// Make sure inserting duplicate keys fails
|
||
|
|
for (int i = 0; i < 16; ++i)
|
||
|
|
Assert.IsFalse(hashMap.TryAdd(i, i), "Adding duplicate keys did not fail");
|
||
|
|
ExpectedCount(ref hashMap, 16);
|
||
|
|
|
||
|
|
// Make sure reading the inserted values work
|
||
|
|
for (int i = 0; i < 16; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryGetValue(i, out iSquared), "Failed get value from hash table");
|
||
|
|
Assert.AreEqual(iSquared, i * i, "Got the wrong value from the hash table");
|
||
|
|
}
|
||
|
|
|
||
|
|
// Make sure clearing removes all keys
|
||
|
|
hashMap.Clear();
|
||
|
|
ExpectedCount(ref hashMap, 0);
|
||
|
|
|
||
|
|
for (int i = 0; i < 16; ++i)
|
||
|
|
Assert.IsFalse(hashMap.TryGetValue(i, out iSquared), "Got value from hash table after clearing");
|
||
|
|
|
||
|
|
hashMap.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_Key_Collisions()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(16, Allocator.Temp);
|
||
|
|
int iSquared;
|
||
|
|
// Make sure GetValue fails if hash map is empty
|
||
|
|
Assert.IsFalse(hashMap.TryGetValue(0, out iSquared), "TryGetValue on empty hash map did not fail");
|
||
|
|
// Make sure inserting values work
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
Assert.IsTrue(hashMap.TryAdd(i, i * i), "Failed to add value");
|
||
|
|
// The bucket size is capacity * 2, adding that number should result in hash collisions
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
Assert.IsTrue(hashMap.TryAdd(i + 32, i), "Failed to add value with potential hash collision");
|
||
|
|
// Make sure reading the inserted values work
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryGetValue(i, out iSquared), "Failed get value from hash table");
|
||
|
|
Assert.AreEqual(iSquared, i * i, "Got the wrong value from the hash table");
|
||
|
|
}
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryGetValue(i + 32, out iSquared), "Failed get value from hash table");
|
||
|
|
Assert.AreEqual(iSquared, i, "Got the wrong value from the hash table");
|
||
|
|
}
|
||
|
|
hashMap.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[StructLayout(LayoutKind.Explicit)]
|
||
|
|
unsafe struct LargeKey : IEquatable<LargeKey>
|
||
|
|
{
|
||
|
|
[FieldOffset(0)]
|
||
|
|
public int* Ptr;
|
||
|
|
|
||
|
|
[FieldOffset(300)]
|
||
|
|
int x;
|
||
|
|
|
||
|
|
public bool Equals(LargeKey rhs)
|
||
|
|
{
|
||
|
|
return Ptr == rhs.Ptr;
|
||
|
|
}
|
||
|
|
public override int GetHashCode()
|
||
|
|
{
|
||
|
|
return (int)Ptr;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_HashMapSupportsAutomaticCapacityChange()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(1, Allocator.Temp);
|
||
|
|
int iSquared;
|
||
|
|
// Make sure inserting values work and grows the capacity
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
Assert.IsTrue(hashMap.TryAdd(i, i * i), "Failed to add value");
|
||
|
|
Assert.IsTrue(hashMap.Capacity >= 8, "Capacity was not updated correctly");
|
||
|
|
// Make sure reading the inserted values work
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryGetValue(i, out iSquared), "Failed get value from hash table");
|
||
|
|
Assert.AreEqual(iSquared, i * i, "Got the wrong value from the hash table");
|
||
|
|
}
|
||
|
|
hashMap.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
[TestRequiresDotsDebugOrCollectionChecks]
|
||
|
|
public void NativeHashMap_HashMapSameKey()
|
||
|
|
{
|
||
|
|
using (var hashMap = new NativeHashMap<int, int>(0, Allocator.Persistent))
|
||
|
|
{
|
||
|
|
Assert.DoesNotThrow(() => hashMap.Add(0, 0));
|
||
|
|
Assert.Throws<ArgumentException>(() => hashMap.Add(0, 0));
|
||
|
|
}
|
||
|
|
|
||
|
|
using (var hashMap = new NativeHashMap<int, int>(0, Allocator.Persistent))
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryAdd(0, 0));
|
||
|
|
Assert.IsFalse(hashMap.TryAdd(0, 0));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_IsEmpty()
|
||
|
|
{
|
||
|
|
var container = new NativeHashMap<int, int>(0, Allocator.Persistent);
|
||
|
|
Assert.IsTrue(container.IsEmpty);
|
||
|
|
|
||
|
|
container.TryAdd(0, 0);
|
||
|
|
Assert.IsFalse(container.IsEmpty);
|
||
|
|
Assert.AreNotEqual(0, container.Capacity);
|
||
|
|
ExpectedCount(ref container, 1);
|
||
|
|
|
||
|
|
container.Remove(0);
|
||
|
|
Assert.IsTrue(container.IsEmpty);
|
||
|
|
|
||
|
|
container.TryAdd(0, 0);
|
||
|
|
container.Clear();
|
||
|
|
Assert.IsTrue(container.IsEmpty);
|
||
|
|
|
||
|
|
container.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_HashMapEmptyCapacity()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(0, Allocator.Persistent);
|
||
|
|
hashMap.TryAdd(0, 0);
|
||
|
|
Assert.AreNotEqual(0, hashMap.Capacity);
|
||
|
|
ExpectedCount(ref hashMap, 1);
|
||
|
|
hashMap.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_Remove()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(8, Allocator.Temp);
|
||
|
|
int iSquared;
|
||
|
|
// Make sure inserting values work
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryAdd(i, i * i), "Failed to add value");
|
||
|
|
}
|
||
|
|
|
||
|
|
// Make sure reading the inserted values work
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryGetValue(i, out iSquared), "Failed get value from hash table");
|
||
|
|
Assert.AreEqual(iSquared, i * i, "Got the wrong value from the hash table");
|
||
|
|
}
|
||
|
|
for (int rm = 0; rm < 8; ++rm)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.Remove(rm));
|
||
|
|
Assert.IsFalse(hashMap.TryGetValue(rm, out iSquared), "Failed to remove value from hash table");
|
||
|
|
for (int i = rm + 1; i < 8; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryGetValue(i, out iSquared), "Failed get value from hash table");
|
||
|
|
Assert.AreEqual(iSquared, i * i, "Got the wrong value from the hash table");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
// Make sure entries were freed
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryAdd(i, i * i), "Failed to add value");
|
||
|
|
}
|
||
|
|
|
||
|
|
hashMap.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_RemoveOnEmptyMap_DoesNotThrow()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(0, Allocator.Temp);
|
||
|
|
Assert.DoesNotThrow(() => hashMap.Remove(0));
|
||
|
|
Assert.DoesNotThrow(() => hashMap.Remove(-425196));
|
||
|
|
hashMap.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_TryAddScalability()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(1, Allocator.Persistent);
|
||
|
|
for (int i = 0; i != 1000 * 100; i++)
|
||
|
|
{
|
||
|
|
hashMap.TryAdd(i, i);
|
||
|
|
}
|
||
|
|
|
||
|
|
int value;
|
||
|
|
Assert.IsFalse(hashMap.TryGetValue(-1, out value));
|
||
|
|
Assert.IsFalse(hashMap.TryGetValue(1000 * 1000, out value));
|
||
|
|
|
||
|
|
for (int i = 0; i != 1000 * 100; i++)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(hashMap.TryGetValue(i, out value));
|
||
|
|
Assert.AreEqual(i, value);
|
||
|
|
}
|
||
|
|
|
||
|
|
hashMap.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_GetKeysEmpty()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(1, Allocator.Temp);
|
||
|
|
var keys = hashMap.GetKeyArray(Allocator.Temp);
|
||
|
|
hashMap.Dispose();
|
||
|
|
|
||
|
|
Assert.AreEqual(0, keys.Length);
|
||
|
|
keys.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_GetKeys()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(1, Allocator.Temp);
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
hashMap.TryAdd(i, 2 * i);
|
||
|
|
}
|
||
|
|
var keys = hashMap.GetKeyArray(Allocator.Temp);
|
||
|
|
hashMap.Dispose();
|
||
|
|
|
||
|
|
Assert.AreEqual(30, keys.Length);
|
||
|
|
keys.Sort();
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(i, keys[i]);
|
||
|
|
}
|
||
|
|
keys.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_GetValues()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(1, Allocator.Temp);
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
hashMap.TryAdd(i, 2 * i);
|
||
|
|
}
|
||
|
|
var values = hashMap.GetValueArray(Allocator.Temp);
|
||
|
|
hashMap.Dispose();
|
||
|
|
|
||
|
|
Assert.AreEqual(30, values.Length);
|
||
|
|
values.Sort();
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(2 * i, values[i]);
|
||
|
|
}
|
||
|
|
values.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_GetKeysAndValues()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(1, Allocator.Temp);
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
hashMap.TryAdd(i, 2 * i);
|
||
|
|
}
|
||
|
|
var keysValues = hashMap.GetKeyValueArrays(Allocator.Temp);
|
||
|
|
hashMap.Dispose();
|
||
|
|
|
||
|
|
Assert.AreEqual(30, keysValues.Keys.Length);
|
||
|
|
Assert.AreEqual(30, keysValues.Values.Length);
|
||
|
|
|
||
|
|
// ensure keys and matching values are aligned
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(2 * keysValues.Keys[i], keysValues.Values[i]);
|
||
|
|
}
|
||
|
|
|
||
|
|
keysValues.Keys.Sort();
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(i, keysValues.Keys[i]);
|
||
|
|
}
|
||
|
|
|
||
|
|
keysValues.Values.Sort();
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(2 * i, keysValues.Values[i]);
|
||
|
|
}
|
||
|
|
|
||
|
|
keysValues.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
public struct TestEntityGuid : IEquatable<TestEntityGuid>, IComparable<TestEntityGuid>
|
||
|
|
{
|
||
|
|
public ulong a;
|
||
|
|
public ulong b;
|
||
|
|
|
||
|
|
public bool Equals(TestEntityGuid other)
|
||
|
|
{
|
||
|
|
return a == other.a && b == other.b;
|
||
|
|
}
|
||
|
|
|
||
|
|
public override int GetHashCode()
|
||
|
|
{
|
||
|
|
unchecked
|
||
|
|
{
|
||
|
|
return (a.GetHashCode() * 397) ^ b.GetHashCode();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public int CompareTo(TestEntityGuid other)
|
||
|
|
{
|
||
|
|
var aComparison = a.CompareTo(other.a);
|
||
|
|
if (aComparison != 0) return aComparison;
|
||
|
|
return b.CompareTo(other.b);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_GetKeysGuid()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<TestEntityGuid, int>(1, Allocator.Temp);
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
var didAdd = hashMap.TryAdd(new TestEntityGuid() { a = (ulong)i * 5, b = 3 * (ulong)i }, 2 * i);
|
||
|
|
Assert.IsTrue(didAdd);
|
||
|
|
}
|
||
|
|
|
||
|
|
// Validate Hashtable has all the expected values
|
||
|
|
ExpectedCount(ref hashMap, 30);
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
int output;
|
||
|
|
var exists = hashMap.TryGetValue(new TestEntityGuid() { a = (ulong)i * 5, b = 3 * (ulong)i }, out output);
|
||
|
|
Assert.IsTrue(exists);
|
||
|
|
Assert.AreEqual(2 * i, output);
|
||
|
|
}
|
||
|
|
|
||
|
|
// Validate keys array
|
||
|
|
var keys = hashMap.GetKeyArray(Allocator.Temp);
|
||
|
|
Assert.AreEqual(30, keys.Length);
|
||
|
|
|
||
|
|
keys.Sort();
|
||
|
|
for (int i = 0; i < 30; ++i)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(new TestEntityGuid() { a = (ulong)i * 5, b = 3 * (ulong)i }, keys[i]);
|
||
|
|
}
|
||
|
|
|
||
|
|
hashMap.Dispose();
|
||
|
|
keys.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_IndexerWorks()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(1, Allocator.Temp);
|
||
|
|
hashMap[5] = 7;
|
||
|
|
Assert.AreEqual(7, hashMap[5]);
|
||
|
|
|
||
|
|
hashMap[5] = 9;
|
||
|
|
Assert.AreEqual(9, hashMap[5]);
|
||
|
|
|
||
|
|
hashMap.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_ContainsKeyHashMap()
|
||
|
|
{
|
||
|
|
var hashMap = new NativeHashMap<int, int>(1, Allocator.Temp);
|
||
|
|
hashMap[5] = 7;
|
||
|
|
|
||
|
|
Assert.IsTrue(hashMap.ContainsKey(5));
|
||
|
|
Assert.IsFalse(hashMap.ContainsKey(6));
|
||
|
|
|
||
|
|
hashMap.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
[TestRequiresCollectionChecks]
|
||
|
|
public void NativeHashMap_UseAfterFree_UsesCustomOwnerTypeName()
|
||
|
|
{
|
||
|
|
var container = new NativeHashMap<int, int>(10, CommonRwdAllocator.Handle);
|
||
|
|
container[0] = 123;
|
||
|
|
container.Dispose();
|
||
|
|
NUnit.Framework.Assert.That(() => container[0],
|
||
|
|
Throws.Exception.TypeOf<ObjectDisposedException>()
|
||
|
|
.With.Message.Contains($"The {container.GetType()} has been deallocated"));
|
||
|
|
}
|
||
|
|
|
||
|
|
[BurstCompile(CompileSynchronously = true)]
|
||
|
|
struct NativeHashMap_CreateAndUseAfterFreeBurst : IJob
|
||
|
|
{
|
||
|
|
public void Execute()
|
||
|
|
{
|
||
|
|
var container = new NativeHashMap<int, int>(10, Allocator.Temp);
|
||
|
|
container[0] = 17;
|
||
|
|
container.Dispose();
|
||
|
|
container[1] = 42;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
[TestRequiresCollectionChecks]
|
||
|
|
public void NativeHashMap_CreateAndUseAfterFreeInBurstJob_UsesCustomOwnerTypeName()
|
||
|
|
{
|
||
|
|
// Make sure this isn't the first container of this type ever created, so that valid static safety data exists
|
||
|
|
var container = new NativeHashMap<int, int>(10, CommonRwdAllocator.Handle);
|
||
|
|
container.Dispose();
|
||
|
|
|
||
|
|
var job = new NativeHashMap_CreateAndUseAfterFreeBurst
|
||
|
|
{
|
||
|
|
};
|
||
|
|
|
||
|
|
// Two things:
|
||
|
|
// 1. This exception is logged, not thrown; thus, we use LogAssert to detect it.
|
||
|
|
// 2. Calling write operation after container.Dispose() emits an unintuitive error message. For now, all this test cares about is whether it contains the
|
||
|
|
// expected type name.
|
||
|
|
job.Run();
|
||
|
|
LogAssert.Expect(LogType.Exception,
|
||
|
|
new Regex($"InvalidOperationException: The {Regex.Escape(container.GetType().ToString())} has been declared as \\[ReadOnly\\] in the job, but you are writing to it"));
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_ForEach_FixedStringInHashMap()
|
||
|
|
{
|
||
|
|
using (var stringList = new NativeList<FixedString32Bytes>(10, Allocator.Persistent) { "Hello", ",", "World", "!" })
|
||
|
|
{
|
||
|
|
var seen = new NativeArray<int>(stringList.Length, Allocator.Temp);
|
||
|
|
var container = new NativeHashMap<FixedString128Bytes, float>(50, Allocator.Temp);
|
||
|
|
foreach (var str in stringList)
|
||
|
|
{
|
||
|
|
container.Add(str, 0);
|
||
|
|
}
|
||
|
|
|
||
|
|
foreach (var pair in container)
|
||
|
|
{
|
||
|
|
int index = stringList.IndexOf(pair.Key);
|
||
|
|
Assert.AreEqual(stringList[index], pair.Key.ToString());
|
||
|
|
seen[index] = seen[index] + 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
for (int i = 0; i < stringList.Length; i++)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(1, seen[i], $"Incorrect value count {stringList[i]}");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_EnumeratorDoesNotReturnRemovedElementsTest()
|
||
|
|
{
|
||
|
|
NativeHashMap<int, int> container = new NativeHashMap<int, int>(5, Allocator.Temp);
|
||
|
|
for (int i = 0; i < 5; i++)
|
||
|
|
{
|
||
|
|
container.Add(i, i);
|
||
|
|
}
|
||
|
|
|
||
|
|
int elementToRemove = 2;
|
||
|
|
container.Remove(elementToRemove);
|
||
|
|
|
||
|
|
using (var enumerator = container.GetEnumerator())
|
||
|
|
{
|
||
|
|
while (enumerator.MoveNext())
|
||
|
|
{
|
||
|
|
Assert.AreNotEqual(elementToRemove, enumerator.Current.Key);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
container.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_EnumeratorInfiniteIterationTest()
|
||
|
|
{
|
||
|
|
NativeHashMap<int, int> container = new NativeHashMap<int, int>(5, Allocator.Temp);
|
||
|
|
for (int i = 0; i < 5; i++)
|
||
|
|
{
|
||
|
|
container.Add(i, i);
|
||
|
|
}
|
||
|
|
|
||
|
|
for (int i = 0; i < 2; i++)
|
||
|
|
{
|
||
|
|
container.Remove(i);
|
||
|
|
}
|
||
|
|
|
||
|
|
var expected = container.Count;
|
||
|
|
int count = 0;
|
||
|
|
using (var enumerator = container.GetEnumerator())
|
||
|
|
{
|
||
|
|
while (enumerator.MoveNext())
|
||
|
|
{
|
||
|
|
if (count++ > expected)
|
||
|
|
{
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
Assert.AreEqual(expected, count);
|
||
|
|
container.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_ForEach([Values(10, 1000)] int n)
|
||
|
|
{
|
||
|
|
var seen = new NativeArray<int>(n, Allocator.Temp);
|
||
|
|
using (var container = new NativeHashMap<int, int>(32, CommonRwdAllocator.Handle))
|
||
|
|
{
|
||
|
|
for (int i = 0; i < n; i++)
|
||
|
|
{
|
||
|
|
container.Add(i, i * 37);
|
||
|
|
}
|
||
|
|
|
||
|
|
var count = 0;
|
||
|
|
foreach (var kv in container)
|
||
|
|
{
|
||
|
|
int value;
|
||
|
|
Assert.True(container.TryGetValue(kv.Key, out value));
|
||
|
|
Assert.AreEqual(value, kv.Value);
|
||
|
|
Assert.AreEqual(kv.Key * 37, kv.Value);
|
||
|
|
|
||
|
|
seen[kv.Key] = seen[kv.Key] + 1;
|
||
|
|
++count;
|
||
|
|
}
|
||
|
|
|
||
|
|
Assert.AreEqual(container.Count, count);
|
||
|
|
for (int i = 0; i < n; i++)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(1, seen[i], $"Incorrect key count {i}");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
struct NativeHashMap_ForEach_Job : IJob
|
||
|
|
{
|
||
|
|
public NativeHashMap<int, int>.ReadOnly Input;
|
||
|
|
|
||
|
|
[ReadOnly]
|
||
|
|
public int Num;
|
||
|
|
|
||
|
|
public void Execute()
|
||
|
|
{
|
||
|
|
var seen = new NativeArray<int>(Num, Allocator.Temp);
|
||
|
|
|
||
|
|
var count = 0;
|
||
|
|
foreach (var kv in Input)
|
||
|
|
{
|
||
|
|
int value;
|
||
|
|
Assert.True(Input.TryGetValue(kv.Key, out value));
|
||
|
|
Assert.AreEqual(value, kv.Value);
|
||
|
|
Assert.AreEqual(kv.Key * 37, kv.Value);
|
||
|
|
|
||
|
|
seen[kv.Key] = seen[kv.Key] + 1;
|
||
|
|
++count;
|
||
|
|
}
|
||
|
|
|
||
|
|
Assert.AreEqual(Input.Count, count);
|
||
|
|
for (int i = 0; i < Num; i++)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(1, seen[i], $"Incorrect key count {i}");
|
||
|
|
}
|
||
|
|
|
||
|
|
seen.Dispose();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_ForEach_From_Job([Values(10, 1000)] int n)
|
||
|
|
{
|
||
|
|
var seen = new NativeArray<int>(n, Allocator.Temp);
|
||
|
|
using (var container = new NativeHashMap<int, int>(32, CommonRwdAllocator.Handle))
|
||
|
|
{
|
||
|
|
for (int i = 0; i < n; i++)
|
||
|
|
{
|
||
|
|
container.Add(i, i * 37);
|
||
|
|
}
|
||
|
|
|
||
|
|
new NativeHashMap_ForEach_Job
|
||
|
|
{
|
||
|
|
Input = container.AsReadOnly(),
|
||
|
|
Num = n,
|
||
|
|
|
||
|
|
}.Run();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
struct NativeHashMap_Write_Job : IJob
|
||
|
|
{
|
||
|
|
public NativeHashMap<int, int> Input;
|
||
|
|
|
||
|
|
public void Execute()
|
||
|
|
{
|
||
|
|
Input.Clear();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_Write_From_Job()
|
||
|
|
{
|
||
|
|
using (var container = new NativeHashMap<int, int>(32, CommonRwdAllocator.Handle))
|
||
|
|
{
|
||
|
|
container.Add(1, 37);
|
||
|
|
Assert.IsFalse(container.IsEmpty);
|
||
|
|
new NativeHashMap_Write_Job
|
||
|
|
{
|
||
|
|
Input = container,
|
||
|
|
}.Run();
|
||
|
|
Assert.IsTrue(container.IsEmpty);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
[TestRequiresCollectionChecks]
|
||
|
|
public void NativeHashMap_ForEach_Throws_When_Modified()
|
||
|
|
{
|
||
|
|
using (var container = new NativeHashMap<int, int>(32, CommonRwdAllocator.Handle))
|
||
|
|
{
|
||
|
|
container.Add(0, 012);
|
||
|
|
container.Add(1, 123);
|
||
|
|
container.Add(2, 234);
|
||
|
|
container.Add(3, 345);
|
||
|
|
container.Add(4, 456);
|
||
|
|
container.Add(5, 567);
|
||
|
|
container.Add(6, 678);
|
||
|
|
container.Add(7, 789);
|
||
|
|
container.Add(8, 890);
|
||
|
|
container.Add(9, 901);
|
||
|
|
|
||
|
|
Assert.Throws<ObjectDisposedException>(() =>
|
||
|
|
{
|
||
|
|
foreach (var kv in container)
|
||
|
|
{
|
||
|
|
container.Add(10, 10);
|
||
|
|
}
|
||
|
|
});
|
||
|
|
|
||
|
|
Assert.Throws<ObjectDisposedException>(() =>
|
||
|
|
{
|
||
|
|
foreach (var kv in container)
|
||
|
|
{
|
||
|
|
container.Remove(1);
|
||
|
|
}
|
||
|
|
});
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
struct NativeHashMap_ForEachIterator : IJob
|
||
|
|
{
|
||
|
|
[ReadOnly]
|
||
|
|
public NativeHashMap<int, int>.Enumerator Iter;
|
||
|
|
|
||
|
|
public void Execute()
|
||
|
|
{
|
||
|
|
while (Iter.MoveNext())
|
||
|
|
{
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
[TestRequiresCollectionChecks]
|
||
|
|
public void NativeHashMap_ForEach_Throws_Job_Iterator()
|
||
|
|
{
|
||
|
|
using (var container = new NativeHashMap<int, int>(32, CommonRwdAllocator.Handle))
|
||
|
|
{
|
||
|
|
var jobHandle = new NativeHashMap_ForEachIterator
|
||
|
|
{
|
||
|
|
Iter = container.GetEnumerator()
|
||
|
|
|
||
|
|
}.Schedule();
|
||
|
|
|
||
|
|
Assert.Throws<InvalidOperationException>(() => { container.Add(1, 1); });
|
||
|
|
|
||
|
|
jobHandle.Complete();
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_CustomAllocatorTest()
|
||
|
|
{
|
||
|
|
AllocatorManager.Initialize();
|
||
|
|
var allocatorHelper = new AllocatorHelper<CustomAllocatorTests.CountingAllocator>(AllocatorManager.Persistent);
|
||
|
|
ref var allocator = ref allocatorHelper.Allocator;
|
||
|
|
allocator.Initialize();
|
||
|
|
|
||
|
|
using (var container = new NativeHashMap<int, int>(1, allocator.Handle))
|
||
|
|
{
|
||
|
|
}
|
||
|
|
|
||
|
|
Assert.IsTrue(allocator.WasUsed);
|
||
|
|
allocator.Dispose();
|
||
|
|
allocatorHelper.Dispose();
|
||
|
|
AllocatorManager.Shutdown();
|
||
|
|
}
|
||
|
|
|
||
|
|
[BurstCompile]
|
||
|
|
struct BurstedCustomAllocatorJob : IJob
|
||
|
|
{
|
||
|
|
[NativeDisableUnsafePtrRestriction]
|
||
|
|
public unsafe CustomAllocatorTests.CountingAllocator* Allocator;
|
||
|
|
|
||
|
|
public void Execute()
|
||
|
|
{
|
||
|
|
unsafe
|
||
|
|
{
|
||
|
|
using (var container = new NativeHashMap<int, int>(1, Allocator->Handle))
|
||
|
|
{
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public unsafe void NativeHashMap_BurstedCustomAllocatorTest()
|
||
|
|
{
|
||
|
|
AllocatorManager.Initialize();
|
||
|
|
var allocatorHelper = new AllocatorHelper<CustomAllocatorTests.CountingAllocator>(AllocatorManager.Persistent);
|
||
|
|
ref var allocator = ref allocatorHelper.Allocator;
|
||
|
|
allocator.Initialize();
|
||
|
|
|
||
|
|
var allocatorPtr = (CustomAllocatorTests.CountingAllocator*)UnsafeUtility.AddressOf<CustomAllocatorTests.CountingAllocator>(ref allocator);
|
||
|
|
unsafe
|
||
|
|
{
|
||
|
|
var handle = new BurstedCustomAllocatorJob { Allocator = allocatorPtr }.Schedule();
|
||
|
|
handle.Complete();
|
||
|
|
}
|
||
|
|
|
||
|
|
Assert.IsTrue(allocator.WasUsed);
|
||
|
|
allocator.Dispose();
|
||
|
|
allocatorHelper.Dispose();
|
||
|
|
AllocatorManager.Shutdown();
|
||
|
|
}
|
||
|
|
|
||
|
|
public struct NestedHashMap
|
||
|
|
{
|
||
|
|
public NativeHashMap<int, int> map;
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_Nested()
|
||
|
|
{
|
||
|
|
var mapInner = new NativeHashMap<int, int>(16, CommonRwdAllocator.Handle);
|
||
|
|
NestedHashMap mapStruct = new NestedHashMap { map = mapInner };
|
||
|
|
|
||
|
|
var mapNestedStruct = new NativeHashMap<int, NestedHashMap>(16, CommonRwdAllocator.Handle);
|
||
|
|
var mapNested = new NativeHashMap<int, NativeHashMap<int, int>>(16, CommonRwdAllocator.Handle);
|
||
|
|
|
||
|
|
mapNested[14] = mapInner;
|
||
|
|
mapNestedStruct[17] = mapStruct;
|
||
|
|
|
||
|
|
mapNested.Dispose();
|
||
|
|
mapNestedStruct.Dispose();
|
||
|
|
mapInner.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_ForEach_FixedStringKey()
|
||
|
|
{
|
||
|
|
using (var stringList = new NativeList<FixedString32Bytes>(10, Allocator.Persistent) { "Hello", ",", "World", "!" })
|
||
|
|
{
|
||
|
|
var seen = new NativeArray<int>(stringList.Length, Allocator.Temp);
|
||
|
|
var container = new NativeHashMap<FixedString128Bytes, float>(50, Allocator.Temp);
|
||
|
|
foreach (var str in stringList)
|
||
|
|
{
|
||
|
|
container.Add(str, 0);
|
||
|
|
}
|
||
|
|
|
||
|
|
foreach (var pair in container)
|
||
|
|
{
|
||
|
|
int index = stringList.IndexOf(pair.Key);
|
||
|
|
Assert.AreEqual(stringList[index], pair.Key.ToString());
|
||
|
|
seen[index] = seen[index] + 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
for (int i = 0; i < stringList.Length; i++)
|
||
|
|
{
|
||
|
|
Assert.AreEqual(1, seen[i], $"Incorrect value count {stringList[i]}");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_SupportsAutomaticCapacityChange()
|
||
|
|
{
|
||
|
|
var container = new NativeHashMap<int, int>(1, Allocator.Temp);
|
||
|
|
int iSquared;
|
||
|
|
|
||
|
|
// Make sure inserting values work and grows the capacity
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(container.TryAdd(i, i * i), "Failed to add value");
|
||
|
|
}
|
||
|
|
Assert.IsTrue(container.Capacity >= 8, "Capacity was not updated correctly");
|
||
|
|
|
||
|
|
// Make sure reading the inserted values work
|
||
|
|
for (int i = 0; i < 8; ++i)
|
||
|
|
{
|
||
|
|
Assert.IsTrue(container.TryGetValue(i, out iSquared), "Failed get value from hash table");
|
||
|
|
Assert.AreEqual(iSquared, i * i, "Got the wrong value from the hash table");
|
||
|
|
}
|
||
|
|
|
||
|
|
container.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
[TestRequiresDotsDebugOrCollectionChecks]
|
||
|
|
public void NativeHashMap_SameKey()
|
||
|
|
{
|
||
|
|
using (var container = new NativeHashMap<int, int>(0, Allocator.Persistent))
|
||
|
|
{
|
||
|
|
Assert.DoesNotThrow(() => container.Add(0, 0));
|
||
|
|
Assert.Throws<ArgumentException>(() => container.Add(0, 0));
|
||
|
|
}
|
||
|
|
|
||
|
|
using (var container = new NativeHashMap<int, int>(0, Allocator.Persistent))
|
||
|
|
{
|
||
|
|
Assert.IsTrue(container.TryAdd(0, 0));
|
||
|
|
Assert.IsFalse(container.TryAdd(0, 0));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_EmptyCapacity()
|
||
|
|
{
|
||
|
|
var container = new NativeHashMap<int, int>(0, Allocator.Persistent);
|
||
|
|
container.TryAdd(0, 0);
|
||
|
|
ExpectedCount(ref container, 1);
|
||
|
|
container.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public unsafe void NativeHashMap_TrimExcess()
|
||
|
|
{
|
||
|
|
using (var container = new NativeHashMap<int, int>(1024, Allocator.Persistent))
|
||
|
|
{
|
||
|
|
var oldCapacity = container.Capacity;
|
||
|
|
|
||
|
|
container.Add(123, 345);
|
||
|
|
container.TrimExcess();
|
||
|
|
Assert.AreEqual(1, container.Count);
|
||
|
|
Assert.AreNotEqual(oldCapacity, container.Capacity);
|
||
|
|
|
||
|
|
oldCapacity = container.Capacity;
|
||
|
|
|
||
|
|
container.Remove(123);
|
||
|
|
Assert.AreEqual(container.Count, 0);
|
||
|
|
container.TrimExcess();
|
||
|
|
Assert.AreEqual(oldCapacity, container.Capacity);
|
||
|
|
|
||
|
|
container.Add(123, 345);
|
||
|
|
Assert.AreEqual(container.Count, 1);
|
||
|
|
Assert.AreEqual(oldCapacity, container.Capacity);
|
||
|
|
|
||
|
|
container.Clear();
|
||
|
|
Assert.AreEqual(container.Count, 0);
|
||
|
|
Assert.AreEqual(oldCapacity, container.Capacity);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_DisposeJob()
|
||
|
|
{
|
||
|
|
var container0 = new NativeHashMap<int, int>(1, Allocator.Persistent);
|
||
|
|
Assert.True(container0.IsCreated);
|
||
|
|
Assert.DoesNotThrow(() => { container0.Add(0, 1); });
|
||
|
|
Assert.True(container0.ContainsKey(0));
|
||
|
|
|
||
|
|
var container1 = new NativeHashMap<int, int>(1, Allocator.Persistent);
|
||
|
|
Assert.True(container1.IsCreated);
|
||
|
|
Assert.DoesNotThrow(() => { container1.Add(1, 2); });
|
||
|
|
Assert.True(container1.ContainsKey(1));
|
||
|
|
|
||
|
|
var disposeJob0 = container0.Dispose(default);
|
||
|
|
Assert.False(container0.IsCreated);
|
||
|
|
#if ENABLE_UNITY_COLLECTIONS_CHECKS
|
||
|
|
Assert.Throws<ObjectDisposedException>(
|
||
|
|
() => { container0.ContainsKey(0); });
|
||
|
|
#endif
|
||
|
|
|
||
|
|
var disposeJob = container1.Dispose(disposeJob0);
|
||
|
|
Assert.False(container1.IsCreated);
|
||
|
|
#if ENABLE_UNITY_COLLECTIONS_CHECKS
|
||
|
|
Assert.Throws<ObjectDisposedException>(
|
||
|
|
() => { container1.ContainsKey(1); });
|
||
|
|
#endif
|
||
|
|
|
||
|
|
disposeJob.Complete();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_CanInsertSentinelValue()
|
||
|
|
{
|
||
|
|
var map = new NativeHashMap<uint, int>(32, Allocator.Temp);
|
||
|
|
map.Add(uint.MaxValue, 123);
|
||
|
|
FastAssert.AreEqual(1, map.Count);
|
||
|
|
int v;
|
||
|
|
FastAssert.IsTrue(map.TryGetValue(uint.MaxValue, out v));
|
||
|
|
FastAssert.AreEqual(123, v);
|
||
|
|
map.Dispose();
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_SoakTest([Values(1, 2, 3, 4, 5, 6, 7, 8, 9, 10)] int s)
|
||
|
|
{
|
||
|
|
Unity.Mathematics.Random rng = Unity.Mathematics.Random.CreateFromIndex((uint)s);
|
||
|
|
var d = new System.Collections.Generic.Dictionary<ulong, int>();
|
||
|
|
var map = new NativeHashMap<ulong, int>(32, Allocator.Temp);
|
||
|
|
var list = new NativeList<ulong>(32, Allocator.Temp);
|
||
|
|
|
||
|
|
unsafe ulong NextULong(ref Unity.Mathematics.Random rng)
|
||
|
|
{
|
||
|
|
var u = rng.NextUInt2();
|
||
|
|
return *(ulong*)&u;
|
||
|
|
}
|
||
|
|
|
||
|
|
for (int i = 0; i < 200; i++)
|
||
|
|
{
|
||
|
|
var x = NextULong(ref rng);
|
||
|
|
while (d.ContainsKey(x))
|
||
|
|
x = NextULong(ref rng);
|
||
|
|
d.Add(x, list.Length);
|
||
|
|
map.Add(x, list.Length);
|
||
|
|
list.Add(x);
|
||
|
|
}
|
||
|
|
FastAssert.AreEqual(d.Count, list.Length);
|
||
|
|
FastAssert.AreEqual(map.Count, list.Length);
|
||
|
|
foreach (var kvp in d)
|
||
|
|
{
|
||
|
|
FastAssert.IsTrue(map.TryGetValue(kvp.Key, out var v));
|
||
|
|
FastAssert.AreEqual(kvp.Value, v);
|
||
|
|
}
|
||
|
|
|
||
|
|
for (int i = 0; i < 10000; i++)
|
||
|
|
{
|
||
|
|
float removeProb = list.Length == 0 ? 0 : 0.5f;
|
||
|
|
if (rng.NextFloat() <= removeProb)
|
||
|
|
{
|
||
|
|
// remove value
|
||
|
|
int index = rng.NextInt(list.Length);
|
||
|
|
var key = list[index];
|
||
|
|
list.RemoveAtSwapBack(index);
|
||
|
|
FastAssert.IsTrue(d.TryGetValue(key, out var idx1));
|
||
|
|
FastAssert.IsTrue(d.Remove(key));
|
||
|
|
FastAssert.IsTrue(map.TryGetValue(key, out var idx2));
|
||
|
|
FastAssert.AreEqual(idx1, idx2);
|
||
|
|
map.Remove(key);
|
||
|
|
if (index < list.Length)
|
||
|
|
{
|
||
|
|
d[list[index]] = index;
|
||
|
|
map[list[index]] = index;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
else
|
||
|
|
{
|
||
|
|
// add value
|
||
|
|
var x = NextULong(ref rng);
|
||
|
|
while (d.ContainsKey(x))
|
||
|
|
x = NextULong(ref rng);
|
||
|
|
d.Add(x, list.Length);
|
||
|
|
map.Add(x, list.Length);
|
||
|
|
list.Add(x);
|
||
|
|
}
|
||
|
|
FastAssert.AreEqual(d.Count, list.Length);
|
||
|
|
FastAssert.AreEqual(map.Count, list.Length);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
[Test]
|
||
|
|
public void NativeHashMap_IndexerAdd_ResizesContainer()
|
||
|
|
{
|
||
|
|
var container = new NativeHashMap<int, int>(8, Allocator.Persistent);
|
||
|
|
for (int i = 0; i < 1024; i++)
|
||
|
|
{
|
||
|
|
container[i] = i;
|
||
|
|
}
|
||
|
|
Assert.AreEqual(1024, container.Count);
|
||
|
|
container.Dispose();
|
||
|
|
}
|
||
|
|
}
|