Struct ProfilePartitions 

pub struct ProfilePartitions { /* private fields */ }

Partition a dataset’s vector space by its profiles matching a pattern, treated as cumulative size tiers (an SRD-71 partition source). One partition per masked profile, in canonical (base-count-ascending) order: partition k spans [prev_masked_base_count, this_masked_base_count) — exactly the vectors added at that tier — so a sweep’s “load only the increment since the previously loaded set” is just the partition’s [start_of(p), end_of(p)), and a partition inherently knows its start (no cross-iteration carry needed). idx_of(p) is the 0-based masked position (pairs with matching_profile_name_at to address the tier’s own ground-truth facets); count_of(p) is the number of masked tiers; base_extent is the largest masked tier’s size.

pattern follows the literal / glob / regex promotion of crate::library::support::pattern::compile_pattern; * (or any pattern that matches all names) selects every profile.

Signature: profile_partitions(group, pattern: str) -> (PartitionList)

Implementations

impl ProfilePartitions

pub fn new() -> Self

A profile_partitions node with the given constant arguments.

Trait Implementations

impl Default for ProfilePartitions

fn default() -> Self

Returns the “default value” for a type.

impl PolydatNode for ProfilePartitions

fn meta(&self) -> &NodeMeta

Return this node’s metadata (port names and types).

fn eval(&self, inputs: &[Value], outputs: &mut [Value])

Evaluate the node: read from inputs, write to outputs.

fn scratch_layout(&self) -> Vec<ScratchElem>

The scratch entries a state owns for this node’s evaluation (axiom S3), one per entry in the order the node expects them in Self::eval_in. Empty for a node that evaluates over Values alone, which is every node but a native cone.

fn eval_in( &self, scratch: &mut [ScratchBuf], inputs: &[Value], outputs: &mut [Value], )

Self::eval with the node’s scratch, which the evaluating state owns and hands in: storage belongs to the state, never to the node, which is shared by every state of the program.

fn commutativity(&self) -> Commutativity

Declare which inputs are interchangeable for this node.

fn accepts_none_inputs(&self) -> bool

True iff this node should receive Value::None inputs directly rather than have the kernel propagate None through it. Default: false — most nodes follow SRD-74 Rule 1 (None in → None out, no eval invocation).

fn compiled_u64(&self) -> Option<CompiledU64Op>

Return a compiled u64-only evaluation closure, if this node operates entirely in u64 space.

fn compiled_slot(&self, _wire_types: &[PortType]) -> Option<CompiledSlotKit>

Return a slot-compiled closure for nodes with typed-slice ports (§8.4 layer 3): slice inputs read (ptr, len) slot pairs; vector outputs write into kernel-owned scratch. Checked by the compiled-kernel builders AFTER Self::compiled_u64 — pure-scalar nodes never need it. Default None: the node stays on typed eval.

fn jit_constants(&self) -> Vec<u64>

Return assembly-time constants for JIT compilation.

fn purity(&self) -> Purity

Declare this node’s purity status per the runtime_model.md’s D2 axiom. Default: Purity::Pure. Override to declare an observable side channel (Purity::SideChannel) or eval-call-spanning state (Purity::Nondeterministic).

fn simd_variant(&self) -> Option<SimdVariant>

Explicit SIMD-native implementation of this scalar node, if one has been registered with a semantic contract.

fn fusion_subgraph(&self) -> Option<FusionSubgraph<'_>>

A synthetic fusion node’s view of the subgraph it stands in for (SRD-105 cone extraction). Program-identity hashing (PolydatProgram::canonical_hash) walks THROUGH fusion nodes into this subgraph, so identity is invariant to the engine mix: jit=off and jit=auto compiles of the same source hash identically, and resume-skip matching survives mode changes. Default None: ordinary nodes hash as themselves.