Struct TaxonomyTree 

pub struct TaxonomyTree { /* private fields */ }

Unified inheritance graph for Haystack 4 defs.

Supports multiple inheritance (a def can have multiple supertypes via the is tag). Pre-computes mandatory marker sets on first access for fast fits() evaluation.

Implementations

impl TaxonomyTree

pub fn new() -> Self

Create an empty taxonomy tree.

pub fn add(&mut self, name: &str, supertypes: &[String])

Register a type with its supertypes.

pub fn is_subtype(&self, child: &str, parent: &str) -> bool

Check if child is a subtype of parent.

Uses BFS up the parent chain. Returns true if child equals parent or if parent is an ancestor.

pub fn supertypes_of(&self, name: &str) -> Vec<String>

Full ancestor chain (transitive, breadth-first).

Returns all ancestors of name, nearest first.

pub fn subtypes_of(&self, name: &str) -> Vec<String>

Direct children of a type.

pub fn all_subtypes(&self, name: &str) -> Vec<String>

All descendants (transitive, breadth-first).

pub fn mandatory_tags( &self, name: &str, mandatory_defs: &HashSet<String>, ) -> HashSet<String>

Get mandatory marker tags for a type.

Walks the supertype chain and collects all types that are marked as mandatory. Results are cached.

pub fn contains(&self, name: &str) -> bool

Check if a type is registered in the taxonomy.

pub fn len(&self) -> usize

Number of registered types.

pub fn is_empty(&self) -> bool

Returns true if no types are registered.

pub fn clear_cache(&self)

Clear the mandatory tag cache (used after library unload).

Trait Implementations

impl Default for TaxonomyTree

fn default() -> Self

Returns the “default value” for a type.