Struct LinkIndexNetwork 

pub struct LinkIndexNetwork<I>
where
    I: IndexLike,
{ /* private fields */ }

Link Index Network: manages bond/link indices with reverse lookup.

Provides O(1) lookup from index ID to the edge containing that index. This is essential for efficient replaceind operations on TreeTN.

Type Parameters

• I: Index type (must implement IndexLike)

Implementations

impl<I> LinkIndexNetwork<I>

where I: IndexLike,

pub fn new() -> Self

Create a new empty LinkIndexNetwork.

pub fn with_capacity(edges: usize) -> Self

Create with initial capacity.

pub fn insert(&mut self, edge: EdgeIndex, index: &I)

Register a link index for an edge.

Arguments

• edge - The edge index
• index - The link index on this edge

pub fn remove(&mut self, index: &I) -> Option<EdgeIndex>

Remove a link index registration.

Arguments

• index - The link index to remove

Returns

The edge that was associated with this index, if any.

pub fn find_edge(&self, index: &I) -> Option<EdgeIndex>

Find the edge containing a given index.

Arguments

• index - The index to look up

Returns

The edge containing this index, or None if not found.

pub fn find_edge_by_id(&self, id: &I::Id) -> Option<EdgeIndex>

Find the edge containing an index by ID.

pub fn contains(&self, index: &I) -> bool

Check if an index is registered.

pub fn contains_id(&self, id: &I::Id) -> bool

Check if an index ID is registered.

pub fn replace_index( &mut self, old_index: &I, new_index: &I, edge: EdgeIndex, ) -> Result<(), String>

Update the index for an edge (e.g., after SVD creates new bond index).

Arguments

• old_index - The old index to replace
• new_index - The new index
• edge - The edge (for validation)

Returns

Ok if successful, Err if old_index was not registered or edge mismatch.

pub fn len(&self) -> usize

Number of registered link indices.

pub fn is_empty(&self) -> bool

Check if empty.

pub fn clear(&mut self)

Clear all registrations.

pub fn iter(&self) -> impl Iterator<Item = (&I::Id, &EdgeIndex)>

Iterate over all (index_id, edge) pairs.

Trait Implementations

impl<I> Clone for LinkIndexNetwork<I>

where I: IndexLike + Clone, I::Id: Clone,

fn clone(&self) -> LinkIndexNetwork<I>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<I> Debug for LinkIndexNetwork<I>

where I: IndexLike + Debug, I::Id: Debug,

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

Formats the value using the given formatter.

impl<I> Default for LinkIndexNetwork<I>

where I: IndexLike,

fn default() -> Self

Returns the “default value” for a type.