GroupComponents

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def applyGrouping(m: Module, labelOrder: Seq[String], label2group: Map[String, MSet[String]], label2module: Map[String, String], label2instance: Map[String, String], label2annotation: Map[String, GroupAnnotation]): Seq[Module]

Applies datastructures to a module, to group its components into distinct modules

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def execute(state: CircuitState): CircuitState

Perform the transform, encode renaming with RenameMap, and can delete annotations Called by runTransform.

final def getClass(): Class[_]

def getComponentConnectivity(m: Module): MutableDiGraph[String]

Compute how each component connects to each other component It is non-directioned; there is an edge from source to sink and from sink to souce

def getWRef(e: Expression): WRef

def groupModule(m: Module, groups: Seq[GroupAnnotation], mnamespace: Namespace): Seq[Module]

def hashCode(): Int

def inputForm: CircuitForm

The firrtl.CircuitForm that this transform requires to operate on

final def isInstanceOf[T0]: Boolean

val logger: Logger

def name: String

A convenience function useful for debugging and error messages

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def outputForm: CircuitForm

The firrtl.CircuitForm that this transform outputs

final def runTransform(state: CircuitState): CircuitState

Perform the transform and update annotations.

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def transform(state: CircuitState): CircuitState

A mathematical transform on some type

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit

final def getMyAnnotations(state: CircuitState): Seq[Annotation]

Convenience method to get annotations relevant to this Transform