For reading/writing sequentially to a ubyte[]
To manage allocating extra for cases like lists where you need to create new objects often. Also manages initializing the objects through a init function. Creates a number of extra objects at one time, so it has to allocate memory less often.
A First-In First-Out stack
**NOT IMPLEMENTED YET** For reading large files which otherwise, would take too much memory
A linked list, used where only reading in the forward direction is required
Use to manage dynamic arrays that frequently change lengths
Used in log display widgets (like in dub package qui qui.widgets.LogWidget)
A linked list based stack with push, and pop
Stores bit flags against each enum member, and provides overloaded bitwise operators
used by Tree class to hold individual nodes in the tree
To make reading a Tree (made up of TreeNode) a bit easier
Used to read some data type as ubyte[x]
Some data structures