std

Package algebra is the G++ algebraic hierarchy: eight classes from Magma to Group, related by embedding, with each structure's laws declared exactly where the structure earns them.

Package clock is a time-source seam for deterministic fake-time testing of time-driven components.

Package closeonce makes Close idempotent: the first Close runs the teardown and caches its error; every later Close returns that same error without re-running teardown.

Package deepmap is a generic two-level map — the (outer key, inner key) → value shape that shows up wherever state is namespaced per owner (per-filter metadata, per-tenant settings, per-connection registries).

Package guarded makes locking discipline structural: a Guarded[T] owns both the mutex and the value it protects, so the value is reachable only through With/Get — there is no way to touch it outside the lock.

Package kleene is Kleene's strong three-valued logic (K3): the truth value of a proposition that may be undetermined — a header not yet seen, a stream half not yet observed, a sensor not yet read.

Package latch is a one-shot quiescence rendezvous: an in-flight counter and a trip switch.

Package memo is a concurrent compute-once cache: the first Get for a key runs the compute function OUTSIDE any lock, then publishes with first-writer-wins pointer identity — every caller for a key observes the SAME value, and a losing concurrent compute is discarded.

Package option is the presence type of G++: a value that is there (Some) or absent (None).

Derived combinators and the lexeme layer, built on the consumed/empty core — sequencing, repetition, separators, operator chains, and whitespace handling.

Package registry is a freeze-after-boot name registry: Register during initialization, Freeze exactly once when wiring is complete, Lookup forever after.

Package result is the railway type of G++: a computation that either produced a value (Ok) or failed (Err).

Package retry is a bounded, context-aware retry loop with exponential backoff: attempt, wait base·2^n capped at cap, honor ctx cancellation mid-wait, and surface the LAST error when attempts are exhausted — the loop every fetcher hand-rolls.

Package vec is a length-indexed sequence: Vec[T, n] carries its length in its type, so First and Rest exist only for non-empty vectors — the checker proves it, erasure drops it, and the generated Go stays a plain cons-list any Go program can use (guarded at the exported boundary).