class DominatorTree extends AnyRef
The dominator tree associated to a CFG which can be traversed in several ways.
- Source
- CFG.scala
- Alphabetic
- By Inheritance
- DominatorTree
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def postorder[Res](zero: Res)(f: (Res, Option[Int], Int) => Res): Res
Traverses this tree, accumulating the result through the function
fin postorder.Traverses this tree, accumulating the result through the function
fin postorder.The second argument of
fis the parent of the currently processed node, if any. - def postorderM[F[_], Res](zero: Res)(f: (Res, Option[Int], Int) => F[Res])(implicit F: Monad[F]): F[Res]
Monadicly traverses this tree, accumulating the result through the function
fin postorder.Monadicly traverses this tree, accumulating the result through the function
fin postorder.The second argument of
fis the parent of the currently processed node, if any.This may be used to impement short-circuit semantics.
- def preorder[Res](zero: Res)(f: (Res, Option[Int], Int) => Res): Res
Traverses this tree, accumulating the result through the function
fin preorder.Traverses this tree, accumulating the result through the function
fin preorder.The second argument of
fis the parent of the currently processed node, if any. - def preorderM[F[_], Res](zero: Res)(f: (Res, Option[Int], Int) => F[Res])(implicit F: Monad[F]): F[Res]
Monadicly traverses this tree, accumulating the result through the function
fin preorder.Monadicly traverses this tree, accumulating the result through the function
fin preorder.The second argument of
fis the parent of the currently processed node, if any.This may be used to impement short-circuit semantics.
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
- Deprecated
(Since version ) see corresponding Javadoc for more information.