Containers

Logical representation of a (game) grid

Creates a new grid with the given dimensions, filled with a default value

The number of columns in the grid.

The number of rows in the grid.

Swaps the values of two given grid cells.

Checks if a given cell position exists in the grid.

Returns the value stored at the given grid cell.

Assigns a given value to a given grid cell.

Get using a coordinate pair.

Assign using a coordinate pair.

Constructs a string representation of this grid.

Logical representation of a grid with many empty spaces

Creates a new empty sparse grid

Creates a unique identifier for a given cell position.

Checks if a given cell position exists in the grid.

Removes the value stored at the given grid cell.

Returns the value stored at the given grid cell.

Assigns a given value to a given grid cell.

Clears the grid.

Returns the values stored in the grid.

First-in-first-out (FIFO) data structure

Creates a new empty queue

Adds a value to the back of the queue

Removes and returns the value from the front of the queue

Checks if the queue is empty

Last-in-first-out (LIFO) data structure (stack)

Creates a new empty dequeue

Adds a value to the top of the stack

Removes and returns the value from the top of the stack

Checks if the dequeue is empty

A simple ring buffer (circular buffer) implementation

Creates a new ring buffer of the given size, filled with a default value

Adds a value to the buffer, overwriting the oldest value if full

Returns the most recently added value

Gets a value at the given offset from the current position

Gets the size of the ring buffer