object MustDeduplicateTransform
Ordering
- Alphabetic
- By Inheritance
Inherited
- MustDeduplicateTransform
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- case class DedupFailure(shouldDedup: Seq[OfModule], relevantMods: Set[OfModule], candidates: Seq[DedupFailureCandidate]) extends Product with Serializable
- sealed trait DedupFailureCandidate extends AnyRef
- final class DeduplicationFailureException extends FirrtlUserException
- case class DisjointChildren(a: OfModule, b: OfModule, reason: Reason) extends DedupFailureCandidate with Product with Serializable
- case class LikelyShouldMatch(a: OfModule, b: OfModule) extends DedupFailureCandidate with Product with Serializable
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
- def findDedupFailures(shouldDedup: Seq[OfModule], graph: InstanceKeyGraph): DedupFailure
Reports deduplication failures two Modules
Reports deduplication failures two Modules
- returns
(Set of Modules that only appear in one hierarchy or the other, candidate pairs of Module names)
- 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
- def makeDedupFailureDiGraph(failure: DedupFailure, graph: DiGraph[String]): DiGraph[String]
Turn a DedupFailure into a pretty graph for visualization
Turn a DedupFailure into a pretty graph for visualization
- failure
Failure to visualize
- graph
DiGraph of module names (no instance information)
- 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()
- 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])
- object DisjointChildren extends Serializable
This is the documentation for Firrtl.