Struct ResolvedGroupHierarchy 

pub struct ResolvedGroupHierarchy<C: Ord + Clone> { /* private fields */ }

Validated coefficient-group hierarchy over carrier coordinates C.

Construction enforces the full group policy (unique non-empty labels, non-empty coordinate sets, acyclic parent chains terminating at known groups, child ⊆ parent, interior coordinates == union of children). After construction, callers walk groups in their original order and request the concatenated penalty components per group.

Implementations

impl<C: Ord + Clone> ResolvedGroupHierarchy<C>

pub fn build(groups: Vec<ResolvedGroup<C>>) -> Result<Self, String>

Validate the carrier-resolved groups and build the hierarchy.

groups must already have had each selector resolved into coordinates by the carrier. The order of groups is preserved for Self::groups.

pub fn groups(&self) -> &[ResolvedGroup<C>]

The resolved groups, in their original declaration order.

pub fn concatenated_penalty_components(&self, label: &str) -> Vec<BTreeSet<C>>

Concatenated penalty components for label, recursively expanded.

A leaf group yields a single component (its own coordinate set). An interior node yields the concatenation of its children’s components, expanding recursively when a child is itself interior. This realizes the hierarchical-Gamma identity in which an interior node’s coefficient vector is the concatenation of its child vectors under one precision: overlapping children stay separate factors so their log normalizers and quadratic contributions both add — it is not a block-sum shortcut.

Trait Implementations

impl<C: Ord + Clone> Debug for ResolvedGroupHierarchy<C>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.