--- A simple queue implementation in Luau.
type Queue<T> = {
	_first: number,

	_last: number,

	_queue: {T},

	isEmpty: (self: Queue<T>) -> boolean,

	enqueue: (self: Queue<T>, value: T) -> (),

	dequeue: (self: Queue<T>) -> T
}

--- A simple stack implementation in Luau.
type Stack<T> = {
	_stack: {T},

	isEmpty: (self: Stack<T>) -> boolean,

	push: (self: Stack<T>, value: T) -> (),

	pop: (self: Stack<T>) -> T
}

--- Create a new queue
function Queue.new<T>() -> Queue<T> end

-- Check if the queue is empty
function Queue.isEmpty<T>(self: Queue<T>) end

--- Add a value to the queue
function Queue.enqueue<T>(self: Queue<T>, value: T) end

--- Remove a value from the queue
function Queue.dequeue<T>(self: Queue<T>) -> T end

--- Create a new stack
function Stack.new<T>() -> Stack<T> end

--- Check if the stack is empty
function Stack.isEmpty<T>(self: Stack<T>) end

--- Put a new value onto the stack
function Stack.push<T>(self: Stack<T>, value) end

--- Take a value off the stack
function Stack.pop<T>(self: Stack<T>) end