Struct libreda_db::reference_access::CellInstRef
source · pub struct CellInstRef<'a, H: HierarchyBase + ?Sized> { /* private fields */ }
Expand description
Default implementation for CellInstRef
.
This is just a wrapper around a netlist and a cell ID.
Implementations§
source§impl<'a, H: HierarchyBase> CellInstRef<'a, H>
impl<'a, H: HierarchyBase> CellInstRef<'a, H>
sourcepub fn id(&self) -> H::CellInstId
pub fn id(&self) -> H::CellInstId
Get the ID of this cell instance.
sourcepub fn template_id(&self) -> H::CellId
pub fn template_id(&self) -> H::CellId
Get the ID of the template cell of this instance.
source§impl<'a, L: LayoutBase> CellInstRef<'a, L>
impl<'a, L: LayoutBase> CellInstRef<'a, L>
sourcepub fn get_transform(&self) -> SimpleTransform<L::Coord>
pub fn get_transform(&self) -> SimpleTransform<L::Coord>
Get the geometric transform that describes the location of a cell instance relative to its parent.
source§impl<'a, N: NetlistBase> CellInstRef<'a, N>
impl<'a, N: NetlistBase> CellInstRef<'a, N>
sourcepub fn each_pin_instance_id(&self) -> impl Iterator<Item = N::PinInstId> + '_
pub fn each_pin_instance_id(&self) -> impl Iterator<Item = N::PinInstId> + '_
Iterate over the IDs of all pins of this cell.
sourcepub fn each_pin_instance(&self) -> impl Iterator<Item = PinInstRef<'a, N>> + '_
pub fn each_pin_instance(&self) -> impl Iterator<Item = PinInstRef<'a, N>> + '_
Iterate over all pins of this cell.
sourcepub fn each_net(&self) -> impl Iterator<Item = NetRef<'a, N>> + '_
pub fn each_net(&self) -> impl Iterator<Item = NetRef<'a, N>> + '_
Iterate over all nets are connected to this instance. A net might appear more than once.
sourcepub fn pin_instance(&self, pin: &N::PinId) -> PinInstRef<'a, N>
pub fn pin_instance(&self, pin: &N::PinId) -> PinInstRef<'a, N>
Get the pin instance which matches the given pin template.
sourcepub fn pin_instance_by_name(&self, name: &str) -> Option<PinInstRef<'a, N>>
pub fn pin_instance_by_name(&self, name: &str) -> Option<PinInstRef<'a, N>>
Find a pin instance by its name.
Trait Implementations§
source§impl<'a, H: HierarchyBase> Debug for CellInstRef<'a, H>
impl<'a, H: HierarchyBase> Debug for CellInstRef<'a, H>
source§impl<'a, H: HierarchyBase> PartialEq for CellInstRef<'a, H>
impl<'a, H: HierarchyBase> PartialEq for CellInstRef<'a, H>
impl<'a, H: HierarchyBase> Eq for CellInstRef<'a, H>
Auto Trait Implementations§
impl<'a, H> Freeze for CellInstRef<'a, H>
impl<'a, H> RefUnwindSafe for CellInstRef<'a, H>
impl<'a, H> Send for CellInstRef<'a, H>
impl<'a, H> Sync for CellInstRef<'a, H>
impl<'a, H> Unpin for CellInstRef<'a, H>
impl<'a, H> UnwindSafe for CellInstRef<'a, H>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more