Queue

Auto-generated from src/stdlib/queue.mcrs — do not edit manually.

API

• queue_push
• queue_pop
• queue_peek
• queue_size
• queue_empty
• queue_clear

---

queue_push v3.0.0

Enqueue a value into the queue.

The value is appended to the end of storage rs:arrays Queue.

fn queue_push(val: int)

Parameters

Parameter	Description
val	Value to enqueue

Example

queue_push(42)

---

queue_pop v3.0.0

Dequeue and return the front value.

Advances the head pointer by one. If the queue is empty, returns -1.

fn queue_pop(): int

Returns: Front value, or -1 if empty

Example

let v: int = queue_pop()

---

queue_peek v3.0.0

Peek at the front value without removing it.

If the queue is empty, returns -1.

fn queue_peek(): int

Returns: Front value, or -1 if empty

Example

let front: int = queue_peek()

---

queue_size v3.0.0

Get the number of elements in the queue.

This is the count of un-popped elements: raw_size - head.

fn queue_size(): int

Returns: Queue size

Example

let n: int = queue_size()

---

queue_empty v3.0.0

Check if the queue is empty.

fn queue_empty(): int

Returns: 1 if empty, 0 otherwise

Example

if (queue_empty() == 1) { }

---

queue_clear v3.0.0

Clear all elements from the queue.

Resets storage rs:arrays Queue to an empty list and the head pointer to 0.

fn queue_clear()

Example

queue_clear()

---