std/queue

Queue (FIFO) data structure for ordered element processing.

Struct: `Queue<T>`

A simple FIFO (first-in, first-out) queue data structure.

struct Queue<T> {
private:
    items: [T];
    head: uint64;
    tail: uint64;
    size: uint64;
    count: uint64;
}

import "std/queue";

let queue = new Queue<T>(items);

Creates a queue from an existing array.

Instantiates a queue with a predefined capacity.

let queue = Queue<int64>::with_capacity(10u);

Creates a queue from a vector.

let vec = new Vector<int64>([1, 2, 3]);
let queue = Queue<int64>::from_vector(vec);

Enqueues an item to the back of the queue.

let result = queue.enqueue(42);
if result.is_empty() {
    println("Queue is full");
}

Returns optional<unit>::empty() if the queue is full.

Enqueues an item to the front of the queue.

let result = queue.enqueue_front(42);

Returns optional<unit>::empty() if the queue is full.

Dequeues an item from the front of the queue.

let item = queue.dequeue();
if item.has_value() {
    println(item.value());
}

Returns optional<T>::empty() if the queue is empty.

Dequeues an item from the back of the queue.

let item = queue.dequeue_back();

Returns optional<T>::empty() if the queue is empty.

View the front item without removing it.

let front = queue.peek();
if front.has_value() {
    println(*front.value());
}

View the back item without removing it.

let back = queue.peek_back();

Check if the queue is at capacity.

if queue.is_full() {
    println("Queue is full");
}

Check if the queue is empty.

if queue.is_empty() {
    println("Queue is empty");
}

Get the number of items in the queue.

println("Queue has " + queue.len() + " items");

Consumes the queue and returns a vector containing all items.

let vec = queue.to_vector();