Identity Registry

A simple and effective class to help with registering and providing unique id's. Uses a binary tree data structure to deliver, set and check id's with a log(N) time complexity. Suitable for both lower value id's, higher values, or the whole spectrum with the ability to keep the memory footprint low*.

Useful when unique id's are strictly required, or when you do not want to have 128-bit GUIDs for your data's id's. This solution delivers 32-bit uints.

* tips to keep memory footprint low are included in the manual.

Primary Features:

• Functions: FindNext() and FindNext(uint fromId)
• Function: Set(uint id, bool used)
• Function: Contains(uint id)
• Ability to save and load the registry into a data array.
• No Garbage Collection while in use by utilizing pooling.
• Usable with full range of uint's. From 0 to id 4,294,967,295.
• Branching kept minimum for performance.
• Source code included.

In need of help or have a feature request? Feel free to contact me. Also for purchasing assessments.

Limitations:

• Designed to work with scripting, no GameObject components are included in this package.
• Does not work within Unity Jobs or Burst compiler.

Extra Information:

Manual