Struct libreda_db::rw_reference_access::hierarchy_reference_access::CellInstRef

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

Default implementation for CellInstRef. This is just a wrapper around a netlist and a cell ID.

Fields

base: RwRefAccess<H>

Reference to the parent netlist.

id: H::CellInstId

ID of the corresponding cell instance.

Implementations

impl<H: HierarchyBase> CellInstRef<H>

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

Access the base structure.

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

Get the ID of this cell instance.

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

Get the name of the cell instance.

pub fn parent(&self) -> CellRef<H>

Get the parent cell of this instance.

pub fn template(&self) -> CellRef<H>

Get the template cell of this instance.

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

Get the ID of the parent cell of this instance.

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

Get the ID of the template cell of this instance.

Trait Implementations

impl<H: Clone + HierarchyBase> Clone for CellInstRef<H>where H::CellInstId: Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<H: Hash + HierarchyBase> Hash for CellInstRef<H>where H::CellInstId: Hash,

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<CellInstRef<T>> for CellInstRef<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 CellInstRef<T>