Stdlib module core/algorithms.vitl

Overview

`core/algorithms.vitl` is a public stdlib surface inside the `core` family. It should be read as one focused slice of the broader family responsibility: Portable low-level building blocks: types, strings, memory helpers, panic/runtime-adjacent basics, and reusable utility routines.

Purpose

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

• A manifest validator stores names and counters with `core` types.
• A pure helper normalizes a string or integer without touching host state.
• The same helper can be reused in compiler code, stdlib code, and user code.

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.

• Medium procedure surface: this file groups several related operations behind one namespace.
• 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 2 of 9 in the core family when ordered by path. By procedure count it ranks 9, and by line count it ranks 4. 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 21 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.

• pick SortOrder { (line 5)
• form SearchResult { (line 10)
• proc compare_i64(left: i64, right: i64, order: SortOrder) -> bool { (line 15)
• proc swap_i64(values: [i64], left: int, right: int) -> [i64] { (line 23)
• proc reverse_i64(values: [i64]) -> [i64] { (line 34)
• proc bubble_sort_i64(values: [i64], order: SortOrder) -> [i64] { (line 57)
• proc insertion_sort_i64(values: [i64], order: SortOrder) -> [i64] { (line 89)
• proc selection_sort_i64(values: [i64], order: SortOrder) -> [i64] { (line 115)
• proc quick_sort_range_i64(values: [i64], low: int, high: int, order: SortOrder) -> [i64] { (line 146)
• proc quick_sort_i64(values: [i64], order: SortOrder) -> [i64] { (line 188)
• proc linear_search_i64(values: [i64], target: i64) -> SearchResult { (line 201)
• proc binary_search_i64(values: [i64], target: i64) -> SearchResult { (line 221)
• proc contains_i64(values: [i64], target: i64) -> bool { (line 261)
• proc sum_i64(values: [i64]) -> i64 { (line 265)
• proc average_i64(values: [i64]) -> f64 { (line 277)
• proc max_i64(values: [i64]) -> i64 { (line 285)
• proc min_i64(values: [i64]) -> i64 { (line 304)
• proc is_sorted_i64(values: [i64], order: SortOrder) -> bool { (line 323)

The list is intentionally capped here; the source file declares 20 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 core/algorithms.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. 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/core_algorithms
form UserReport {
  label: string,
  ready: bool
}
pick UserOutcome {
  case Ready(message: string)
  case Empty(reason: string)
}
proc run_example() -> UserOutcome {
  let entries = swap_i64([], 1, 1)
  let ready: bool = compare_i64(1, 1, SortOrder())
  let failed: bool = false
  let stable: bool = ready and true
  let idx: int = 0
  let count: int = 0
  while idx < entries.len {
    set count = count + 1
    set idx = idx + 1
  }
  if not ready {
    give UserOutcome.Empty("module not ready")
  } else {
    give UserOutcome.Ready("ok")
  }
  let copies: f64 = 1 as f64
}
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/stdlib/core/algorithms
export *
pick SortOrder {
  Ascending,
  Descending
}
form SearchResult {
  found: bool,
  index: int
}

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.

• Line 1: space vitte/stdlib/core/algorithms
• Line 3: export *
• Line 5: pick SortOrder {
• Line 10: form SearchResult {
• Line 15: proc compare_i64(left: i64, right: i64, order: SortOrder) -> bool {
• Line 23: proc swap_i64(values: [i64], left: int, right: int) -> [i64] {
• Line 34: proc reverse_i64(values: [i64]) -> [i64] {
• Line 57: proc bubble_sort_i64(values: [i64], order: SortOrder) -> [i64] {

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 core, 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: Portable low-level building blocks: types, strings, memory helpers, panic/runtime-adjacent basics, and reusable utility routines.
• Family architecture role: Use `core` when the code should remain portable and unsurprising. It is the family you reach for before involving the filesystem, network, process table, or threading runtime.

Composition guidance

Choose this module when

• Choose core/algorithms.vitl when the main question is owned by this module rather than by transport, storage, orchestration, or user-interface code.
• A manifest validator stores names and counters with `core` types.
• A pure helper normalizes a string or integer without touching host state.
• The same helper can be reused in compiler code, stdlib code, and user code.

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 core.
• Check nearby modules such as core/concurrency.vitl, core/io_helpers.vitl, core/memory.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

• core/concurrency.vitl
• core/io_helpers.vitl
• core/memory.vitl
• core/panic.vitl
• core/strings.vitl
• core/types.vitl
• core/utils.vitl
• core.vitl