Awesome

UnsafeCollections

As this fork diverged too much from the original, it became its own repository.

This project contains various collections that perform no managed memory allocation. It alleviates GC (Garbage Collector) pressure useful for usecases such as Unity.

Project is targeted as a .Net 2.0 Standard library. Usable in Unity via dll.

Usage

The NativeCollections (under UnsafeCollections/Collections/Native/) are usable just like the matching collections in C# would. The API matches as much as possible with the C# API of the same collection. All of the NativeCollection objects are safe to pass as value.

You must instantiate the collections with any non-default constructor. After you are done using it, you again must call the Dispose function. The matching UnsafeCollection objects work similarly, but instead you must call Allocate and Free respectively.

Currently Implemented

• Array
• List
• LinkedList
• Stack
• Queue
• Bit Set
• Ring Buffer
• Min Heap
• Max Heap
• Dictionary
• HashSet
• SortedDictionary
• SortedSet
• Concurrent SPSC Lockfree Queue
• Concurrent MPSC Lockfree Queue
• Concurrent MPMC Queue (Lockfree with fixed size)

Build

Use Preprocessor directive UNITY to build the project using the Unity memory allocators instead of the .Net ones.

The library is usable in both .Net and Unity.

Performance

Comparison is made for List between .Net List, UnsafeList and NativeList. This is done not only to show the difference between this and the .Net implementation, but also between the Native and Unsafe implementations.

List

Adding x items to a list, followed by a clear:

Adding x items to a list where the list has to resize (followed by a clear):

Grabbing the index of a "random" item in the list

Because the difference in performance between Unsafe and Native is minor, only a comparison between .Net and Native will be made from this point onwards. Do note that the timings for the Unsafe collections are usually slightly lower.

Queue

Enqueue > Peek > Dequeue operations

Sorted Set

SortedSet Add in reverse order (worst case)

Dictionary

Dictionary Add followed by Remove