Stdlib module collections/queue.vitl

Overview

`collections/queue.vitl` is a public stdlib surface inside the `collections` family. It should be read as one focused slice of the broader family responsibility: Container and traversal surfaces such as vector, deque, queue, stack, linked list, hashmap, hashset, graph, and matrix.

Purpose

This file should be chosen because of responsibility, not because its name “sounds close enough”. Inside the collections family, it carries one focused part of the contract and keeps that responsibility separate from neighboring concerns.

• Use this module when ordered storage and traversal cost are more important than host-facing effects.
• A build report groups diagnostics in a vector and indexes them in a hashmap.
• A scheduler stores pending work in a queue or deque.
• A graph or matrix page should explain why those shapes exist, not just list filenames.

Taxonomy

Think of this page as a generated encyclopedia entry rather than a hand-written tutorial. The goal is to show what kind of module this is, how dense it is, and what reading strategy makes sense before depending on it.

• Large algorithm surface: this file exposes many procedures and likely acts as a domain toolkit rather than a single thin wrapper.
• Owns domain vocabulary: the module declares data shapes in addition to executable helpers, so its types are part of the contract.
• Minimal top-level dependencies: the module reads as mostly self-contained from its opening declarations.
• Explicit export surface: the file ends with visible export declarations instead of relying only on implicit namespace discovery.

Implementation profile

This profile is inferred directly from the source text. It does not replace reading the file, but it tells you quickly whether the module is mostly declarative, loop-heavy, branch-heavy, or organized around many small exits.

Top-level API inventory

Imported surfaces

This file does not advertise a top-level `use` surface in its opening declarations. That often means it is either self-contained or an aggregation layer.

Position in family

This file is module 9 of 11 in the collections family when ordered by path. By procedure count it ranks 5, and by line count it ranks 3. Those ranks are useful as rough signals of breadth, not as quality judgments.

Declaration map

The declaration map turns raw source into a scan-friendly catalog. It is useful when the file is large enough that a reader wants to orient by kinds of surfaces first.

The table is exhaustive for top-level declarations of the selected kinds. This file declares 22 matching surfaces.

Representative signatures

These signatures are shown in source order so the page keeps the feel of a reference manual, not just a keyword cloud.

• form Queue { (line 10)
• proc _repeat_i64(value: i64, count: i32) -> [i64] { (line 18)
• proc queue_new(capacity: i32) -> Queue { (line 32)
• proc queue_reserve(q: Queue, new_cap: i32) { (line 47)
• proc _queue_resize(q: Queue) { (line 72)
• proc _queue_shrink(q: Queue) { (line 90)
• proc queue_enqueue(q: Queue, value: i64) -> int { (line 114)
• proc queue_dequeue(q: Queue) -> i64 { (line 127)
• proc queue_push_front(q: Queue, value: i64) -> int { (line 146)
• proc queue_pop_back(q: Queue) -> i64 { (line 159)
• proc queue_front(q: Queue) -> i64 { (line 178)
• proc queue_back(q: Queue) -> i64 { (line 185)
• proc queue_empty(q: Queue) -> int { (line 198)
• proc queue_size(q: Queue) -> i32 { (line 206)
• proc queue_clear(q: Queue) { (line 210)
• proc queue_is_full(q: Queue) -> int { (line 216)
• proc queue_get(q: Queue, idx: i64) -> i64 { (line 228)
• proc queue_to_array(q: Queue) -> [i64] { (line 241)

The list is intentionally capped here; the source file declares 21 matching signatures in total.

How to use this module

Start by reading the file as an ownership boundary. Ask three questions: what enters this module, what stable types or procedures it exports, and what adjacent module should stay outside of it.

1. Read space and top-level imports first so the ownership boundary of collections/queue.vitl is explicit.
2. Read declared forms and picks before algorithms so the data vocabulary is stable in your head.
3. Traverse procedures in source order; the early helpers usually explain the naming and numeric conventions used later.
4. Use the source landmarks section below as a table of contents when the file is large.
5. Only after that compare neighbor modules, because the right boundary choice matters more than memorizing one helper name.

User example

This example is generated from the actual stdlib module surface. Its job is not to be the smallest snippet possible; its job is to show a realistic consumer-shaped file that exercises the module and mirrors the language keywords the module itself relies on.

space demo/collections_queue
form UserReport {
  label: string,
  ready: bool
}
proc run_example() -> UserReport {
  let entries = _repeat_i64(1, 1)
  let ready: bool = _repeat_i64(1, 1)
  let stable: bool = ready and true
  let fallback: bool = ready or false
  let idx: int = 0
  let count: int = 0
  while idx < entries.len {
    set count = count + 1
    set idx = idx + 1
  }
  if ready {
    give UserReport { label: "not-ready", ready: false }
  } else {
    give UserReport { label: "ok", ready: ready }
  }
}
export run_example

Keyword coverage

This table makes the “all keywords of the module” requirement auditable. It compares the detected Vitte keywords in the source file with the generated consumer example above.

The generated snippet exercises every detected Vitte keyword used by this module.

Source shape

space vitte/collections/queue
form Queue {
    data: [i64],
    front: i64,
    rear: i64,
    size: i32,
    capacity: i32
}
proc _repeat_i64(value: i64, count: i32) -> [i64] {
    let out: [i64] = []

The excerpt is not meant to replace the file. It exists to make the module recognizable at first glance, the same way a Wikipedia infobox helps the reader orient before reading the whole article.

Source landmarks

Large files are easier to retain when they have visible landmarks. When the source contains explicit section banners, they are surfaced here; otherwise the first major declarations are used as anchors.

• Queue — ULTRA MAX (ring buffer + deque support) / O(1) enqueue/dequeue / dynamic resize / push_front / pop_back (deque)
• Constructors
• Internal resize
• Enqueue / Dequeue
• Deque extensions
• Access
• Utilities
• Index access helper
• Iteration helper
• End module

Source organization

When a file carries its own internal chaptering, those chapters usually reveal the intended reading order better than a flat symbol list. This section reconstructs that organization from the source itself.

Complete API catalog

This catalog is the exhaustive file-level index for the module. It is intentionally closer to a generated encyclopedia appendix than to a tutorial summary.

Data surfaces

Procedures

Exports

Integration boundaries

Within collections, this file should remain focused. If a future helper changes the host boundary, scheduling boundary, or data-shape boundary, it probably belongs in a neighbor module instead of being added here by convenience.

• Family responsibility: Container and traversal surfaces such as vector, deque, queue, stack, linked list, hashmap, hashset, graph, and matrix.
• Family architecture role: Use `collections` when the shape of data matters more than the host system. This family owns grouping, ordering, indexing, and traversal concerns.

Composition guidance

Choose this module when

• Choose collections/queue.vitl when the main question is owned by this module rather than by transport, storage, orchestration, or user-interface code.
• Use this module when ordered storage and traversal cost are more important than host-facing effects.
• A build report groups diagnostics in a vector and indexes them in a hashmap.
• A scheduler stores pending work in a queue or deque.
• A graph or matrix page should explain why those shapes exist, not just list filenames.

Pause before extending it when

• Avoid extending this file when the new helper mostly changes the boundary to host I/O, runtime coordination, or foreign integration instead of staying inside collections.
• Check nearby modules such as collections/collections.vitl, collections/deque.vitl, collections/graph.vitl before adding convenience wrappers here.

Relationship table

This table keeps the page closer to a real encyclopedia entry: a module is easier to understand when compared with its nearest alternatives in the same family.

Neighbor modules

• collections/collections.vitl
• collections/deque.vitl
• collections/graph.vitl
• collections/hashmap.vitl
• collections/hashset.vitl
• collections/linkedlist.vitl
• collections/matrix.vitl
• collections/stack.vitl