Struct libreda_db::rw_reference_access::hierarchy_reference_access::CellRef

pub struct CellRef<H: HierarchyBase> {
    pub(super) base: RwRefAccess<H>,
    pub(super) id: H::CellId,
}

A reference to a cell. This is just a wrapper around a netlist and a cell ID.

Fields

base: RwRefAccess<H>

Reference to the parent data structure.

id: H::CellId

ID of the corresponding cell.

Implementations

impl<H: HierarchyBase> CellRef<H>

pub fn base(&self) -> &RwRefAccess<H>

Access the base structure.

pub fn id(&self) -> H::CellId

Get the ID of this cell.

pub fn name(&self) -> H::NameType

Get the name of the cell.

pub fn each_cell_instance_id(&self) -> Vec<H::CellInstId>

Get the IDs of all cell instances in this cell.

pub fn each_cell_instance(&self) -> Vec<CellInstRef<H>>

Get all cell instances inside this cell.

pub fn cell_instance_by_name(&self, name: &str) -> Option<CellInstRef<H>>

Find a child instance by its name.

pub fn each_reference_id(&self) -> Vec<H::CellInstId>

Get the IDs of all instances of this cell.

pub fn each_reference(&self) -> Vec<CellInstRef<H>>

Get all instances of this cell.

pub fn each_cell_dependency(&self) -> Vec<CellRef<H>>

Get all dependencies of this cell.

pub fn each_dependent_cell(&self) -> Vec<CellRef<H>>

Get all cells that directly depend on this cell.

pub fn num_child_instances(&self) -> usize

Get the number of cell instances inside the cell.

impl<H: HierarchyEdit> CellRef<H>

pub fn create_instance( &self, template: &CellRef<H>, name: Option<H::NameType> ) -> CellInstRef<H>

pub fn remove_instance(&self, inst: CellInstRef<H>)

Trait Implementations

impl<H: Clone + HierarchyBase> Clone for CellRef<H>where H::CellId: Clone,

fn clone(&self) -> CellRef<H>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: HierarchyBase> Hash for CellRef<T>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: HierarchyBase> PartialEq<CellRef<T>> for CellRef<T>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: HierarchyBase> Eq for CellRef<T>