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 FIFO (First In is First Out, first element pushed will be removed first) stack
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 basic stack with push, and pop
For reading large files which otherwise, would take too much memory
To make reading a Tree (made up of TreeNode) a bit easier
This module contains classes that are related to data storage