pub struct CellRef<'a, H: HierarchyBase + ?Sized> { /* private fields */ }
Expand description
A reference to a cell. This is just a wrapper around a netlist and a cell ID.
Implementations§
Source§impl<'a, H: HierarchyBase> CellRef<'a, H>
impl<'a, H: HierarchyBase> CellRef<'a, H>
Sourcepub fn each_cell_instance_id(&self) -> impl Iterator<Item = H::CellInstId> + '_
pub fn each_cell_instance_id(&self) -> impl Iterator<Item = H::CellInstId> + '_
Iterate over the IDs of all child instances.
Sourcepub fn each_cell_instance(
&self,
) -> impl Iterator<Item = CellInstRef<'a, H>> + '_
pub fn each_cell_instance( &self, ) -> impl Iterator<Item = CellInstRef<'a, H>> + '_
Iterate over all child instances.
Sourcepub fn cell_instance_by_name(&self, name: &str) -> Option<CellInstRef<'a, H>>
pub fn cell_instance_by_name(&self, name: &str) -> Option<CellInstRef<'a, H>>
Find a child instance by its name.
Sourcepub fn each_reference_id(&self) -> impl Iterator<Item = H::CellInstId> + '_
pub fn each_reference_id(&self) -> impl Iterator<Item = H::CellInstId> + '_
Iterate over the IDs of all instances of this cell.
Sourcepub fn each_reference(&self) -> impl Iterator<Item = CellInstRef<'a, H>> + '_
pub fn each_reference(&self) -> impl Iterator<Item = CellInstRef<'a, H>> + '_
Iterate over the of all instances of this cell.
Sourcepub fn num_references(&self) -> usize
pub fn num_references(&self) -> usize
Get the total number of usages of this cell.
Sourcepub fn each_cell_dependency(&self) -> impl Iterator<Item = CellRef<'a, H>> + '_
pub fn each_cell_dependency(&self) -> impl Iterator<Item = CellRef<'a, H>> + '_
Iterate over all dependencies of this cell.
Sourcepub fn num_cell_dependencies(&self) -> usize
pub fn num_cell_dependencies(&self) -> usize
Get the total number of direct dependencies of this cell.
Sourcepub fn each_dependent_cell(&self) -> impl Iterator<Item = CellRef<'a, H>> + '_
pub fn each_dependent_cell(&self) -> impl Iterator<Item = CellRef<'a, H>> + '_
Iterate over all cells that directly depend on this cell.
Sourcepub fn num_dependent_cells(&self) -> usize
pub fn num_dependent_cells(&self) -> usize
Get the total number of cells which depend on this cell (i.e. use it).
Sourcepub fn num_child_instances(&self) -> usize
pub fn num_child_instances(&self) -> usize
Get the number of cell instances inside the cell
.
Source§impl<'a, L: LayoutBase> CellRef<'a, L>
impl<'a, L: LayoutBase> CellRef<'a, L>
Sourcepub fn each_shape_per_layer(
&self,
layer_id: &L::LayerId,
) -> impl Iterator<Item = ShapeRef<'_, L>> + '_
pub fn each_shape_per_layer( &self, layer_id: &L::LayerId, ) -> impl Iterator<Item = ShapeRef<'_, L>> + '_
Iterate over all shapes on a layer.
Sourcepub fn each_shape(&self) -> impl Iterator<Item = ShapeRef<'_, L>> + '_
pub fn each_shape(&self) -> impl Iterator<Item = ShapeRef<'_, L>> + '_
Iterate over all shapes defined in this cell.
Sourcepub fn bounding_box_per_layer(
&self,
layer_id: &L::LayerId,
) -> Option<Rect<L::Coord>>
pub fn bounding_box_per_layer( &self, layer_id: &L::LayerId, ) -> Option<Rect<L::Coord>>
Get the bounding box of the shapes on a specific layer.
Sourcepub fn bounding_box(&self) -> Option<Rect<L::Coord>>
pub fn bounding_box(&self) -> Option<Rect<L::Coord>>
Get the bounding box of the shapes on all layers.
Source§impl<'a, N: NetlistBase> CellRef<'a, N>
impl<'a, N: NetlistBase> CellRef<'a, N>
Sourcepub fn each_pin_id(&self) -> impl Iterator<Item = N::PinId> + '_
pub fn each_pin_id(&self) -> impl Iterator<Item = N::PinId> + '_
Iterate over the IDs of all pins of this cell.
Sourcepub fn each_pin(&self) -> impl Iterator<Item = PinRef<'a, N>> + '_
pub fn each_pin(&self) -> impl Iterator<Item = PinRef<'a, N>> + '_
Iterate over all pins of this cell.
Sourcepub fn each_input_pin(&self) -> impl Iterator<Item = PinRef<'a, N>> + '_
pub fn each_input_pin(&self) -> impl Iterator<Item = PinRef<'a, N>> + '_
Iterate over all input pins of this cell.
Sourcepub fn each_output_pin(&self) -> impl Iterator<Item = PinRef<'a, N>> + '_
pub fn each_output_pin(&self) -> impl Iterator<Item = PinRef<'a, N>> + '_
Iterate over all output pins of this cell.
Sourcepub fn pin_by_name(&self, name: &str) -> Option<PinRef<'a, N>>
pub fn pin_by_name(&self, name: &str) -> Option<PinRef<'a, N>>
Find a pin by it’s name.
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 that live directly in this cell.
Sourcepub fn num_internal_nets(&self) -> usize
pub fn num_internal_nets(&self) -> usize
Get the number of nets inside this cell.
Sourcepub fn net_by_name(&self, name: &str) -> Option<NetRef<'a, N>>
pub fn net_by_name(&self, name: &str) -> Option<NetRef<'a, N>>
Find a net by its name.
Trait Implementations§
Source§impl<'a, H: HierarchyBase> Clone for CellRef<'a, H>
impl<'a, H: HierarchyBase> Clone for CellRef<'a, H>
Source§impl<'a, H: HierarchyBase> Debug for CellRef<'a, H>
impl<'a, H: HierarchyBase> Debug for CellRef<'a, H>
Source§impl<'a, H: HierarchyBase> PartialEq for CellRef<'a, H>
impl<'a, H: HierarchyBase> PartialEq for CellRef<'a, H>
impl<'a, H: HierarchyBase> Eq for CellRef<'a, H>
Auto Trait Implementations§
impl<'a, H> Freeze for CellRef<'a, H>
impl<'a, H> RefUnwindSafe for CellRef<'a, H>
impl<'a, H> Send for CellRef<'a, H>
impl<'a, H> Sync for CellRef<'a, H>
impl<'a, H> Unpin for CellRef<'a, H>
impl<'a, H> UnwindSafe for CellRef<'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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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>
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>
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