pub struct DeadCodeElimination;Expand description
Dead code elimination - remove unused nodes
Trait Implementations§
Source§impl OptimizationPass for DeadCodeElimination
impl OptimizationPass for DeadCodeElimination
Source§fn apply(&self, graph: ComputationGraph) -> JitResult<ComputationGraph>
fn apply(&self, graph: ComputationGraph) -> JitResult<ComputationGraph>
Apply the optimization to the graph
Auto Trait Implementations§
impl Freeze for DeadCodeElimination
impl RefUnwindSafe for DeadCodeElimination
impl Send for DeadCodeElimination
impl Sync for DeadCodeElimination
impl Unpin for DeadCodeElimination
impl UnsafeUnpin for DeadCodeElimination
impl UnwindSafe for DeadCodeElimination
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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