A priority queue container that uses a custom delegate to compare elements and ensure that the correct one is always at the front of the queue.
A last-in first-out queue-interface container, also commonly known as a stack.
A priority queue based on the heap data structure, providing constant-time access and logarithmic-time removal of the highest priority item, and logarithmic insertion of items.
A container with a push/pop queue interface which pops elements at random, with no influence from how recently any particular element was pushed into the queue.
A dictionary class that can be serialized by Unity.
A container supporting abstract push and pop actions for inserting and removing elements in an implementation-defined order, and allowing the front item to be accessed without popping it.
A container supporting abstract push and pop actions for inserting and removing elements in an implementation-defined order.
The custom delegate signature for comparing two elements to determine their appropriate order.