Add more data structures to package collection

[gingerBill]

More data structures to add:

• Array
• Queue
• Map (Hash Table)
• Small Array
• Set
• Bit Array
• B Tree
• B+ Tree
• R Tree
• Red-Black tree
• Range Tree
• Heap
• Fibonacci Heap
• Ring
• Skip list
• C Trie
• D Trie

[kevinw]

@gingerBill I thought Small Array would be something more like https://github.com/KhronosGroup/SPIRV-Cross/blob/master/spirv_cross_containers.hpp#L191 -- where the backing store begins on the stack, but is automatically moved to the heap for you if the number of elements grows too big. This extra bit of functionality seems to be missing from your Small Array. We already have an allocator that can point at stack allocated memory.

[gingerBill]

@kevinw It might be better to call it a Fixed_Small_Array and then have your Dynamic_Small_Array be a separate thing you'd like.

[kevinw]

Yeah, that would make sense! Although I wonder about the need for a Fixed_Small_Array, really...

[gingerBill]

I use the construct of a "fixed small array" all the time, especially when I want a small inline data structure that requires no external allocator.

[ghost]

What about also adding a Ternary Search Tree. I think I seen these would be useful for spellcheck type of things.

[ghost]

Dense and Sparse Spatial Hashing

[gingerBill]

This entire package needs a redesign and rethinking #782