MCPcopy Create free account
hub / github.com/argumentcomputer/ix / min_leaf

Method min_leaf

crates/kernel/src/shard.rs:291–296  ·  view source on GitHub ↗

The smallest shard id under this node — its left-to-right position. Used to keep aggregation children in shard order (so the subject merkle-fold stays the left-associative order the agg guest reproduces).

(&self)

Source from the content-addressed store, hash-verified

289 pub fn collect_leaves(&self, out: &mut Vec<u32>) {
290 match self {
291 AggNode::Leaf(id) => out.push(*id),
292 AggNode::Internal(l, r) => {
293 l.collect_leaves(out);
294 r.collect_leaves(out);
295 },
296 }
297 }
298
299 /// The smallest shard id under this node — its left-to-right position. Used to

Callers 1

build_planFunction · 0.80

Calls

no outgoing calls

Tested by

no test coverage detected