primus_quem

Dedicated total first-match expression: first live element of a source satisfying the owned ubi predicate, nihil for no-match and empty sources.

Aliases: primus quem

Syntax: primus_quem(<source>, ubi <binder> { <predicate> })

Category#

collection

Related#

• لاشيء

Examples#

radix/corpus/primus-quem/primus-quem.fab (canonical · concept)#

Dedicated total first-match expression: first live element of a source satisfying the owned ubi predicate, nihil for no-match and empty sources.

# =============================================================================
# primus_quem — dedicated total first-match selection over a bounded source.
# =============================================================================
#
# What this teaches:
#   • dedicated head — `primus_quem(source, ubi x { predicate })` is its own
#     expression (not a `rumpe`/`si` reuse and not a method call); the `ubi`
#     tail is owned by this head
#   • total evaluation — the predicate is evaluated for EVERY candidate lane
#     (post-match lanes included); selection is dataflow first-live, never an
#     early exit
#   • `T ∪ nihil` — no-match and empty sources return `nihil`, never an error;
#     a predicate ERROR rides the error channel and is never converted to
#     `nihil`
#   • first-live — later live lanes never overwrite the first stored match
#     ([1.0, 5.0, 3.0] over `> 2.0` picks 5.0, not 3.0)
#   • declines — unbounded sources fail closed (SEM059
#     first_match_unbounded_source, causa not_bounded) and multi-axis `apud`
#     coordinates stay unsupported in v1 (SEM059
#     first_match_expression_unsupported); see primus-quem-decline.fab
#
# Common mistakes:
#   • expecting an index/value pair — v1 returns only `T ∪ nihil`; construct
#     the explicit pair yourself if you need the index
#   • expecting early exit — the predicate still runs after the first match
#
# See also: ubi, nihil, filtrata, primus
# =============================================================================

# Route T — array literal source: first live lane over `> 0.0` is 1.0.
functio elige_litteram() → fractus ∪ nihil {
    redde primus_quem([1.0, -2.0, 3.0], ubi x { x > 0.0 })
}

# No-match — no live lane yields nihil, never an error.
functio elige_nullum() → fractus ∪ nihil {
    redde primus_quem([1.0, 2.0], ubi x { x > 9.0 })
}

# Empty source — a statically zero-length array yields nihil.
functio elige_vacuum(lista<f32> xs) → fractus ∪ nihil {
    redde primus_quem(xs, ubi x { x > 0.0 })
}

# First-live — with matches at 5.0 and 3.0, the FIRST live lane wins.
functio elige_primum_viventem(lista<f32> xs) → fractus ∪ nihil {
    redde primus_quem(xs, ubi x { x > 2.0 })
}

incipit {
    fixum fractus ∪ nihil litteram ← elige_litteram()
    fixum fractus ∪ nihil nullum ← elige_nullum()
    fixum lista<f32> vacua_lista ← []
    fixum fractus ∪ nihil vacuum ← elige_vacuum(vacua_lista)
    fixum lista<f32> xs ← [1.0, 5.0, 3.0]
    fixum fractus ∪ nihil primum ← elige_primum_viventem(xs)

    nota litteram
    nota nullum
    nota vacuum
    nota primum
}

Expected output:

1.0
nihil
nihil
5.0

radix/corpus/primus-quem/primus-quem-decline.fab (supporting · reject)#

primus_quem AIR decline rows: unbounded sources fail closed (not_bounded) and apud coordinates on first-match stay unsupported in v1.

# =============================================================================
# primus_quem decline — bounded sources only on the AIR lane.
# =============================================================================
#
# Decline rows (reject reason in each comment):
#   1. unbounded source — an unbounded `lista` parameter has no static
#      extent; the AIR gate fails closed:
#      SEM059 first_match_unbounded_source (causa not_bounded)
#   2. apud coordinates — the multi-axis `apud [i]` form on the first-match
#      head stays unsupported in v1 (honest decline, not a silent pass):
#      SEM059 first_match_expression_unsupported
#
# Common mistakes:
#   • expecting an unbounded `lista` local to admit because its initializer
#      is a literal — the route classifier sees the unbounded path type
#   • expecting early-exit semantics to excuse the bound — admission needs
#      the static extent for the first-live mask, not an unroll
#
# See also: primus_quem, ubi, lista, apud
# =============================================================================

# 1. unbounded — lista parameter has no static extent, declines not_bounded
@ radix lane "air"
functio elige_infinita(lista<f32> xs) → fractus ∪ nihil {
    redde primus_quem(xs, ubi v { v > 0.0 })
}

# 2. apud coordinates — multi-axis first-match stays unsupported in v1
@ radix lane "air"
functio elige_apud(tf32[4] a) → fractus ∪ nihil {
    redde primus_quem(a apud [i], ubi v { v > 0.0 })
}

Expected: compilation rejects this example.