Struct NormalizedSbomIndex 

pub struct NormalizedSbomIndex { /* private fields */ }

Precomputed index for efficient SBOM queries.

This index is built once per SBOM and provides O(1) lookups for:

• Dependencies of a component (edges by source)
• Dependents of a component (edges by target)
• Components by lowercased name
• Pre-computed sort keys to avoid repeated string allocations

Implementations

impl NormalizedSbomIndex

pub fn build(sbom: &NormalizedSbom) -> Self

Build an index from a normalized SBOM.

This is an O(n + m) operation where n = components and m = edges. The resulting index provides O(1) lookups.

pub fn dependency_indices(&self, id: &CanonicalId) -> &[usize]

Get edge indices for dependencies of a component (outgoing edges).

Returns empty slice if component has no dependencies. O(1) lookup instead of O(edges).

pub fn dependent_indices(&self, id: &CanonicalId) -> &[usize]

Get edge indices for dependents of a component (incoming edges).

Returns empty slice if component has no dependents. O(1) lookup instead of O(edges).

pub fn dependencies_of<'a>( &self, id: &CanonicalId, edges: &'a [DependencyEdge], ) -> Vec<&'a DependencyEdge>

Get dependencies of a component as edges.

O(k) where k = number of dependencies (much faster than O(edges)).

pub fn dependents_of<'a>( &self, id: &CanonicalId, edges: &'a [DependencyEdge], ) -> Vec<&'a DependencyEdge>

Get dependents of a component as edges.

O(k) where k = number of dependents (much faster than O(edges)).

pub fn find_by_name_lower(&self, name_lower: &str) -> &[CanonicalId]

Find component IDs by lowercased name.

O(1) lookup instead of O(components).

pub fn search_by_name(&self, query_lower: &str) -> Vec<CanonicalId>

Find component IDs whose name contains the query (case-insensitive).

O(unique_names) - still iterates but only over unique lowercased names, not all components.

pub fn sort_key(&self, id: &CanonicalId) -> Option<&ComponentSortKey>

Get the pre-computed sort key for a component.

O(1) lookup, avoids repeated to_lowercase() calls during sorting.

pub const fn sort_keys(&self) -> &HashMap<CanonicalId, ComponentSortKey>

Get all sort keys for iteration.

pub fn has_dependencies(&self, id: &CanonicalId) -> bool

Check if component has any dependencies.

pub fn has_dependents(&self, id: &CanonicalId) -> bool

Check if component has any dependents.

pub fn dependency_count(&self, id: &CanonicalId) -> usize

Get count of dependencies for a component.

pub fn dependent_count(&self, id: &CanonicalId) -> usize

Get count of dependents for a component.

pub const fn component_count(&self) -> usize

Get total component count.

pub const fn edge_count(&self) -> usize

Get total edge count.

pub fn root_count(&self) -> usize

Get count of root components (no incoming edges).

pub fn leaf_count(&self) -> usize

Get count of leaf components (no outgoing edges).

Trait Implementations

impl Clone for NormalizedSbomIndex

fn clone(&self) -> NormalizedSbomIndex

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for NormalizedSbomIndex

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

Formats the value using the given formatter.