vyre-primitives 0.4.1

Compositional primitives for vyre — marker types (always on) + Tier 2.5 LEGO substrate (feature-gated per domain).
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

//! Tier 2.5 bitset primitives — `and`/`or`/`not`/`xor`/`popcount`/
//! `any`/`contains` over packed u32 bitsets. These are the LEGO
//! blocks every higher-level graph/taint composition reaches for
//! when combining two NodeSets.
//!
//! All primitives operate on the same bitset shape: a u32 buffer
//! with `word_count` slots, where bit `i` of word `w` represents
//! element `w * 32 + i`. Sizes are declared at `Program` build
//! time so the backend can allocate + validate layout up front.

pub mod and;
pub mod and_into;
pub mod and_not;
pub mod and_not_into;
pub mod any;
pub mod clear_bit;
pub mod contains;
pub mod copy;
pub mod equal;
pub mod four_russians;
pub mod not;
pub mod or;
pub mod or_into;
pub mod popcount;
pub mod select;
pub mod set_bit;
pub mod subset_of;
pub mod test_bit;
pub mod xor;
pub mod xor_into;

/// Stochastic computing primitive (#59) — bitstream multiplication
/// via AND. Power-efficient inference substrate.
pub mod stochastic_compute;

/// Words needed to hold a bitset over `n` elements.
///
/// Overflow-safe — `(n + 31) / 32` wraps to 0 for `n > u32::MAX - 31`;
/// `div_ceil` handles the overflow correctly. Per AUDIT_2026-04-24
/// F-CT-01 / F-LBL-01 (kimi).
#[must_use]
pub const fn bitset_words(n: u32) -> u32 {
    n.div_ceil(32)
}