Showing results for 'tag:data_structures'
 Fast, simple, abstract 47-state autojoining library
|
 Lets you specify regions of the map that trigger Entered and Exited events.
|
|
|
Create and manage pools of objects for retrieval and reuse later.
|
A library for creating finite state machines.
|
|
 A library that implements basic data structures used in everyday programming.
|
||
|
A priority queue data structure built using a binary heap.
|
||
|
A RestrictedNumber data type
|
A list kept sorted by the contained item's ref value
|
|
|
Reusable datum handling votes with ID restrictions.
|
BYOND JSON (de)serialization with versioning and type checking
|
|
|
pif_ShuffleQueue is a queue-like data structure, but with a twist.
|
Handle attack/skill cooldown periods flexibly and simply (supports saving)
|
|
|
This library implements an iterator protocol for incrementally iterating through data, for example from a data structure ...
|
||
|
A simple demonstration of linking objects into a chain
|
A small collection of procedures that have been transformed into datum versions.
|
|
