Queue is a first in first out (FIFO) data structure, allowing to process their elements in the order they come.

You can create a queue manually by using the new or construct it using the from_array.

let queue = @queue.new()
let queue2 = of([1,2,3])
let queue3 = of([1,1,4])

To clear the queue, you can use the clear method.

let queue = @queue.of([1,2,3])
queue.clear()

You can get the length of the queue by using the length method. The is_empty method can be used to check if the queue is empty.

let queue = @queue.of([1,2,3])
queue.length() // 3
queue.is_empty() // false

You can add elements to the queue using the push method and remove them using the pop method.

let queue = @queue.new()
queue.push(1)
queue.push(2)
queue.pop() // Some(1)
queue.pop() // Some(2)

You can get the first element of the queue without removing it using the peek method.

let queue = @queue.of([1,2,3])
queue.peek() // Some(1)

You can traverse the queue using the each method.

let queue = @queue.of([1,2,3])
let mut sum = 0
queue.each(fn(x) { sum += x }) // sum = 6

You can fold the queue using the fold method.

let queue = @queue.of([1,2,3])
let sum = queue.fold(~init = 0, fn(acc, x) { acc + x }) // sum = 6

You can copy a queue using the copy method.

let queue = @queue.of([1,2,3])
let queue2 = queue.copy()

Transfer the elements from one queue to another using the transfer method.

let dst : @queue.T[Int] = @queue.new()
let src : @queue.T[Int] = @queue.of([5, 6, 7, 8])
src.transfer(dst)