Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @native() @throws( ... )

6.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

7.  def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

8.  def finalize(): Unit

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

9.  def findInstancesInHierarchy(module: String): Seq[Seq[WDefInstance]]

   Finds the absolute paths (each represented by a Seq of instances representing the chain of hierarchy) of all instances of a particular module.

   Finds the absolute paths (each represented by a Seq of instances representing the chain of hierarchy) of all instances of a particular module.

   module

   the name of the selected module

   returns

   a Seq[ Seq[WDefInstance] ] of absolute instance paths

10.  lazy val fullHierarchy: LinkedHashMap[WDefInstance, Seq[Seq[WDefInstance]]]

    A list of absolute paths (each represented by a Seq of instances) of all module instances in the Circuit.

11.  def getChildrenInstances: LinkedHashMap[String, LinkedHashSet[WDefInstance]]

    Given a circuit, returns a map from module name to children instance/module definitions

12.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

13.  lazy val graph: DiGraph[WDefInstance]

    A directed graph showing the instance dependencies among modules in the circuit.

    A directed graph showing the instance dependencies among modules in the circuit. Every WDefInstance of a module has an edge to every WDefInstance arising from every instance statement in that module.

14.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

15.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

16.  def lowestCommonAncestor(moduleA: Seq[WDefInstance], moduleB: Seq[WDefInstance]): Seq[WDefInstance]

    Finds the lowest common ancestor instances for two module names in a design

17.  val moduleMap: Map[String, DefModule]
18.  def moduleOrder: Seq[DefModule]

    Module order from highest module to leaf module

    Module order from highest module to leaf module

    returns

    sequence of modules in order from top to leaf

19.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

20.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

21.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

22.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

23.  def toString(): String

    Definition Classes

    AnyRef → Any

24.  lazy val tour: EulerTour[Seq[WDefInstance]]

    An EulerTour representation of the DiGraph

25.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

26.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )