Chisel

ROM

Related Docs: object ROM | package Chisel

class ROM[T <: Data] extends Vec[T]

Class defining a ROM Use the ROM object rather than instantiating the ROM directly

Source
ROM.scala
Linear Supertypes
Vec[T], Cloneable, Cloneable, VecLike[T], IndexedSeq[T], IndexedSeqLike[T, IndexedSeq[T]], Seq[T], SeqLike[T, IndexedSeq[T]], GenSeq[T], GenSeqLike[T, IndexedSeq[T]], Iterable[T], IterableLike[T, IndexedSeq[T]], Equals, GenIterable[T], GenIterableLike[T, IndexedSeq[T]], Traversable[T], GenTraversable[T], GenericTraversableTemplate[T, IndexedSeq], TraversableLike[T, IndexedSeq[T]], GenTraversableLike[T, IndexedSeq[T]], Parallelizable[T, ParSeq[T]], TraversableOnce[T], GenTraversableOnce[T], FilterMonadic[T, IndexedSeq[T]], HasNewBuilder[T, IndexedSeq[T] @scala.annotation.unchecked.uncheckedVariance], PartialFunction[Int, T], (Int) ⇒ T, Aggregate, Data, Node, nameable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ROM
  2. Vec
  3. Cloneable
  4. Cloneable
  5. VecLike
  6. IndexedSeq
  7. IndexedSeqLike
  8. Seq
  9. SeqLike
  10. GenSeq
  11. GenSeqLike
  12. Iterable
  13. IterableLike
  14. Equals
  15. GenIterable
  16. GenIterableLike
  17. Traversable
  18. GenTraversable
  19. GenericTraversableTemplate
  20. TraversableLike
  21. GenTraversableLike
  22. Parallelizable
  23. TraversableOnce
  24. GenTraversableOnce
  25. FilterMonadic
  26. HasNewBuilder
  27. PartialFunction
  28. Function1
  29. Aggregate
  30. Data
  31. Node
  32. nameable
  33. AnyRef
  34. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ROM(elts: SortedMap[Int, T], lengthIn: Option[Int] = None)

    elts

    any number of data elements combined with Integer address

    lengthIn

    optionally force the size of the ROM

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable

    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = IndexedSeq[T]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Value Members

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

    Definition Classes
    AnyRef → Any
  2. def ##[T <: Data](right: T): ROM.this.type

    Interface required by Cat is an operator to combine data nodes together

    Interface required by Cat is an operator to combine data nodes together

    Definition Classes
    Data
  3. def ##(b: Node): Node

    The cat operator to combine two values

    The cat operator to combine two values

    0x5 ## 0x3 => 0x53
    b

    Node to cat after

    returns

    a new node as the combination of both this node and b

    Definition Classes
    Node
  4. final def ##(): Int

    Definition Classes
    AnyRef → Any
  5. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  6. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    TraversableLike
  7. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    TraversableLike
  8. def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  9. def /:[B](z: B)(op: (B, T) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  11. def :=[T <: Data](that: Iterable[T]): Unit

    Definition Classes
    Vec
  12. def :=(that: Data): Unit

    Definition Classes
    Data
  13. def :\[B](z: B)(op: (T, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def <>(src: Iterable[T]): Unit

    Definition Classes
    Vec
  15. def <>(src: Vec[T]): Unit

    Definition Classes
    Vec
  16. def <>(src: Node): Unit

    Definition Classes
    VecNode
  17. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  18. def ===[T <: Data](right: T): Bool

    Definition Classes
    Data
  19. def W0Wtransform(): Unit

    Eliminate any zero-width wires attached to this node

    Eliminate any zero-width wires attached to this node

    returns

    if the node was modified

    Definition Classes
    Node
  20. def ^^(src: Node): Unit

    Definition Classes
    Node
  21. val _id: Int

    The unique id of this node

    The unique id of this node

    Definition Classes
    Node
  22. def _isComplementOf(x: Node): Boolean

    Definition Classes
    Node
  23. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce
  24. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce
  25. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce
  26. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]

    Definition Classes
    PartialFunction → Function1
  28. def apply(ind: UInt): T

    Definition Classes
    VecVecLike
  29. def apply(idx: Int): T

    Definition Classes
    Vec → SeqLike → GenSeqLike → Function1
  30. def apply(name: String): Data

    Definition Classes
    Data
  31. def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1

    Definition Classes
    PartialFunction
  32. def asDirectionless(): ROM.this.type

    set this node as directionless

    set this node as directionless

    Definition Classes
    VecData
  33. def asInput(): ROM.this.type

    Return this object as an INPUT

    Return this object as an INPUT

    Definition Classes
    VecData
  34. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  35. def asOutput(): ROM.this.type

    Sets the direction (*dir*) of instances derived from Bits to OUTPUT or recursively sets members of Bundle/Vec to OUTPUT.

    Sets the direction (*dir*) of instances derived from Bits to OUTPUT or recursively sets members of Bundle/Vec to OUTPUT.

    returns

    this instance with its exact type.

    Definition Classes
    VecData
  36. def assign(src: Node): Unit

    Definition Classes
    Node
  37. def canCSE: Boolean

    Definition Classes
    Node
  38. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike → Equals
  39. lazy val chiselName: String

    Definition Classes
    Node
  40. var clock: Option[Clock]

    The clock for this node

    The clock for this node

    Definition Classes
    Node
  41. def clone(): ROM.this.type

    Definition Classes
    Data → AnyRef
  42. def cloneType(): ROM.this.type

    Definition Classes
    VecData
  43. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  44. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

    Definition Classes
    TraversableOnce
  45. def colonEquals(that: Bits): Unit

    Attributes
    protected
    Definition Classes
    VecData
  46. def colonEquals[T <: Data](that: Iterable[T]): Unit

    Attributes
    protected
    Definition Classes
    VecData
  47. def colonEquals(that: Bundle): Unit

    Attributes
    protected
    Definition Classes
    Data
  48. def combinations(n: Int): Iterator[IndexedSeq[T]]

    Definition Classes
    SeqLike
  49. var comp: Option[proc]

    Definition Classes
    Data
  50. def companion: GenericCompanion[IndexedSeq]

    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  51. def component: Module

    Use the function componentOf instead

    Use the function componentOf instead

    Definition Classes
    Node
  52. def componentOf: Module

    Get the module that this node is a part of or the top module if not assigned yet

    Get the module that this node is a part of or the top module if not assigned yet

    returns

    The module that this node is a part of

    Definition Classes
    Node
  53. def compose[A](g: (A) ⇒ Int): (A) ⇒ T

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  54. val consumers: LinkedHashSet[Node]

    nodes that consume one of my outputs

    nodes that consume one of my outputs

    Definition Classes
    Node
  55. def contains(x: T)(implicit evidence: <:<[T, Bits]): Bool

    Definition Classes
    VecLike
  56. def contains[A1 >: T](elem: A1): Boolean

    Definition Classes
    SeqLike
  57. def containsSlice[B](that: GenSeq[B]): Boolean

    Definition Classes
    SeqLike
  58. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  59. def copyToArray[B >: T](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def copyToArray[B >: T](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce
  61. def copyToBuffer[B >: T](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce
  62. def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean

    Definition Classes
    SeqLike → GenSeqLike
  63. def count(p: (T) ⇒ Bool): UInt

    Definition Classes
    VecLike
  64. def count(p: (T) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce
  65. def dblLitValue: Double

    Convert the node literal to a Double

    Convert the node literal to a Double

    Definition Classes
    Node
  66. def diff[B >: T](that: GenSeq[B]): IndexedSeq[T]

    Definition Classes
    SeqLike → GenSeqLike
  67. def distinct: IndexedSeq[T]

    Definition Classes
    SeqLike → GenSeqLike
  68. var driveRand: Boolean

    Definition Classes
    Node
  69. def drop(n: Int): IndexedSeq[T]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  70. def dropRight(n: Int): IndexedSeq[T]

    Definition Classes
    IterableLike
  71. def dropWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

    Definition Classes
    TraversableLike → GenTraversableLike
  72. def endsWith[B](that: GenSeq[B]): Boolean

    Definition Classes
    SeqLike → GenSeqLike
  73. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  74. def equals(that: Any): Boolean

    Compare two nodes

    Compare two nodes

    that

    the node to compare with

    Definition Classes
    Vec → GenSeqLike → Equals → Node → AnyRef → Any
  75. def equalsForCSE(x: Node): Boolean

    Definition Classes
    Node
  76. def exists(p: (T) ⇒ Bool): Bool

    Definition Classes
    VecLike
  77. def exists(p: (T) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  78. def filter(p: (T) ⇒ Boolean): IndexedSeq[T]

    Definition Classes
    TraversableLike → GenTraversableLike
  79. def filterNot(p: (T) ⇒ Boolean): IndexedSeq[T]

    Definition Classes
    TraversableLike → GenTraversableLike
  80. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  81. def find(p: (T) ⇒ Boolean): Option[T]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  82. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  83. def flatten: Array[(String, Bits)]

    Definition Classes
    VecData
  84. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

    Definition Classes
    GenericTraversableTemplate
  85. def flip(): ROM.this.type

    Change INPUTs to OUTPUTs and visa versa

    Change INPUTs to OUTPUTs and visa versa

    Definition Classes
    VecData
  86. def floLitValue: Float

    Convert the node literal to a Float

    Convert the node literal to a Float

    Definition Classes
    Node
  87. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def foldRight[B](z: B)(op: (T, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  90. def forall(p: (T) ⇒ Bool): Bool

    Definition Classes
    VecLike
  91. def forall(p: (T) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  92. def foreach[U](f: (T) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  93. def fromBits(b: Bits): ROM.this.type

    Definition Classes
    Data
  94. def fromNode(n: Node): ROM.this.type

    Factory method to create and assign a leaf-type instance out of a subclass of *Node* instance which we have lost the concrete type.

    Factory method to create and assign a leaf-type instance out of a subclass of *Node* instance which we have lost the concrete type.

    Definition Classes
    Data
  95. val gen: (Int) ⇒ T

    Definition Classes
    Vec
  96. def genericBuilder[B]: Builder[B, IndexedSeq[B]]

    Definition Classes
    GenericTraversableTemplate
  97. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  98. def getNode: Node

    returns

    The root node input

    Definition Classes
    Node
  99. def getWidth(): Int

    returns

    the width or number of bits used by this node

    Definition Classes
    VecAggregateNode
    Exceptions thrown

    ChiselException if the width of the node is unknown

  100. def groupBy[K](f: (T) ⇒ K): Map[K, IndexedSeq[T]]

    Definition Classes
    TraversableLike → GenTraversableLike
  101. def grouped(size: Int): Iterator[IndexedSeq[T]]

    Definition Classes
    IterableLike
  102. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  103. val hashCode: Int

    returns

    the unique hashCode for this node

    Definition Classes
    Vec → IndexedSeqLike → GenSeqLike → Node → AnyRef → Any
  104. def hashCodeForCSE: Int

    Definition Classes
    Node
  105. def head: T

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  106. def headOption: Option[T]

    Definition Classes
    TraversableLike → GenTraversableLike
  107. def illegalAssignment(that: Any): Unit

    Attributes
    protected
    Definition Classes
    Data
  108. def indexOf[B >: T](elem: B, from: Int): Int

    Definition Classes
    GenSeqLike
  109. def indexOf[B >: T](elem: B): Int

    Definition Classes
    GenSeqLike
  110. def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int

    Definition Classes
    SeqLike
  111. def indexOfSlice[B >: T](that: GenSeq[B]): Int

    Definition Classes
    SeqLike
  112. def indexWhere(p: (T) ⇒ Bool): UInt

    Definition Classes
    VecLike
  113. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

    Definition Classes
    SeqLike → GenSeqLike
  114. def indexWhere(p: (T) ⇒ Boolean): Int

    Definition Classes
    GenSeqLike
  115. def indices: Range

    Definition Classes
    SeqLike
  116. def infer: Boolean

    Called while we're walking the graph inferring the width of nodes.

    Called while we're walking the graph inferring the width of nodes. We return true if we should continue to walk the graph, either because there's a node whose width we don't know, or because we updated a node's width.

    Definition Classes
    Node
  117. def init: IndexedSeq[T]

    Definition Classes
    TraversableLike → GenTraversableLike
  118. def init(n: String, w: Int, ins: Node*): Node

    Init the node and calculate its width and add inputs to the node

    Init the node and calculate its width and add inputs to the node

    n

    name of node

    w

    the bit width of the node

    ins

    Nodes that are inputs to this node

    Definition Classes
    Node
  119. def init(n: String, widthFunc: (⇒ Node) ⇒ Width, ins: Node*): Node

    Init the node and calculate its width and add inputs to the node

    Init the node and calculate its width and add inputs to the node

    n

    name of node

    widthFunc

    the function to use to calculate the width of the node

    ins

    Nodes that are inputs to this node

    Definition Classes
    Node
  120. def initOf(n: String, widthfunc: (⇒ Node) ⇒ Width, ins: Iterable[Node]): Node

    Init the node and calculate its width and add inputs to the node

    Init the node and calculate its width and add inputs to the node

    n

    name of node

    widthfunc

    the function to use to calculate the width of the node

    ins

    Nodes that are inputs to this node

    Definition Classes
    Node
  121. def inits: Iterator[IndexedSeq[T]]

    Definition Classes
    TraversableLike
  122. val inputs: ArrayBuffer[Node]

    The inputs that this node depends on

    The inputs that this node depends on

    Definition Classes
    Node
  123. def intersect[B >: T](that: GenSeq[B]): IndexedSeq[T]

    Definition Classes
    SeqLike → GenSeqLike
  124. def isDefinedAt(idx: Int): Boolean

    Definition Classes
    GenSeqLike
  125. def isDirectionless: Boolean

    check if this node is neither INPUT or OUTPUT

    check if this node is neither INPUT or OUTPUT

    Definition Classes
    Data
  126. def isEmpty: Boolean

    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  127. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  128. def isIo: Boolean

    returns

    this node is an I/O Node for a module

    Definition Classes
    Node
  129. def isIo_=(isIo: Boolean): Unit

    Definition Classes
    Node
  130. final def isLit: Boolean

    This function determines if a node is a literal, a fixed value

    This function determines if a node is a literal, a fixed value

    Definition Classes
    Node
  131. def isReg: Boolean

    returns

    this node is a Register

    Definition Classes
    Node
  132. def isTopLevelIO: Boolean

    returns

    is this node I/O for the top level module

    Definition Classes
    Node
  133. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  134. var isTypeNode: Boolean

    Definition Classes
    Node
  135. def isTypeOnly: Boolean

    Chisel3 - type-only nodes (no data - no initialization or assignment) This is used to determine which nodes must be Wire() wrapped, and whether Wire() wrapping of the node is legal or not.

    Chisel3 - type-only nodes (no data - no initialization or assignment) This is used to determine which nodes must be Wire() wrapped, and whether Wire() wrapping of the node is legal or not.

    Definition Classes
    VecDataNode
  136. def isUsedByClockHi: Boolean

    Definition Classes
    Node
  137. def isWired: Boolean

    Definition Classes
    AggregateData
  138. def isZeroWidth: Boolean

    returns

    this node has zero-width

    Definition Classes
    Node
  139. def iterator: Iterator[T]

    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  140. def last: T

    Definition Classes
    TraversableLike → GenTraversableLike
  141. def lastIndexOf[B >: T](elem: B, end: Int): Int

    Definition Classes
    GenSeqLike
  142. def lastIndexOf[B >: T](elem: B): Int

    Definition Classes
    GenSeqLike
  143. def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int

    Definition Classes
    SeqLike
  144. def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int

    Definition Classes
    SeqLike
  145. def lastIndexWhere(p: (T) ⇒ Bool): UInt

    Definition Classes
    VecLike
  146. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

    Definition Classes
    SeqLike → GenSeqLike
  147. def lastIndexWhere(p: (T) ⇒ Boolean): Int

    Definition Classes
    GenSeqLike
  148. def lastOption: Option[T]

    Definition Classes
    TraversableLike → GenTraversableLike
  149. val length: Int

    Definition Classes
    ROMVec → SeqLike → GenSeqLike
  150. def lengthCompare(len: Int): Int

    Definition Classes
    SeqLike
  151. def lift: (Int) ⇒ Option[T]

    Definition Classes
    PartialFunction
  152. val line: StackTraceElement

    The trace information for chisel for this node

    The trace information for chisel for this node

    Definition Classes
    Node
  153. def litOf: Literal

    returns

    the literal value of a node

    Definition Classes
    Node
    Exceptions thrown

    ChiselException if there is no literal value available

  154. def litValue(default: BigInt = BigInt(-1)): BigInt

    returns

    the literal value of the node as a BigInt

    Bool(true).litValue() => BigInt(1)
    Definition Classes
    Node
  155. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  156. def max[B >: T](implicit cmp: Ordering[B]): T

    Definition Classes
    TraversableOnce → GenTraversableOnce
  157. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. def maybeFlatten: Seq[Node]

    Deprecated: Do not use

    Deprecated: Do not use

    Definition Classes
    Node
  159. def min[B >: T](implicit cmp: Ordering[B]): T

    Definition Classes
    TraversableOnce → GenTraversableOnce
  160. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Definition Classes
    TraversableOnce → GenTraversableOnce
  161. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  163. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. var modified: Boolean

    Definition Classes
    Node
  165. var name: String

    Definition Classes
    nameable
  166. def nameIt(path: String, isNamingIo: Boolean): Unit

    name this node

    name this node

    Definition Classes
    VecDataNode
    Note

    use setName in Node rather than this directly

  167. var named: Boolean

    _named_ is used to indicates name was set explicitely and should not be overriden by a _nameIt_ generator.

    _named_ is used to indicates name was set explicitely and should not be overriden by a _nameIt_ generator.

    Definition Classes
    nameable
  168. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  169. def needWidth(): Int

    returns

    the bitWidth of the node

    Definition Classes
    Node
    Exceptions thrown

    ChiselException if the width is not yet defined

  170. def newBuilder: Builder[T, IndexedSeq[T]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  171. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. final def notify(): Unit

    Definition Classes
    AnyRef
  173. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  174. def onlyIndexWhere(p: (T) ⇒ Bool): UInt

    Definition Classes
    VecLike
  175. def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Definition Classes
    PartialFunction
  176. def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  177. def par: ParSeq[T]

    Definition Classes
    Parallelizable
  178. def parCombiner: Combiner[T, ParSeq[T]]

    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  179. def params: Parameters

    Definition Classes
    Data
  180. def partition(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

    Definition Classes
    TraversableLike → GenTraversableLike
  181. def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  182. def permutations: Iterator[IndexedSeq[T]]

    Definition Classes
    SeqLike
  183. def prefixLength(p: (T) ⇒ Boolean): Int

    Definition Classes
    GenSeqLike
  184. def printTree(writer: PrintStream, depth: Int = 4, indent: String = ""): Unit

    Prints all members of a node and recursively its inputs up to a certain depth level This method is purely used for debugging

    Prints all members of a node and recursively its inputs up to a certain depth level This method is purely used for debugging

    Definition Classes
    Node
  185. def product[B >: T](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  186. var prune: Boolean

    Definition Classes
    Node
  187. def read(addr: UInt): T

    Read data from the ROM at an address

    Read data from the ROM at an address

    Definition Classes
    ROMVecVecLike
  188. val readPorts: HashMap[UInt, T]

    Definition Classes
    Vec
  189. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  190. def reduceLeft[B >: T](op: (B, T) ⇒ B): B

    Definition Classes
    TraversableOnce
  191. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  192. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  193. def reduceRight[B >: T](op: (T, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  194. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  195. def removeTypeNodes(): Unit

    Definition Classes
    VecNode
  196. def replaceTree(newNode: Node): Unit

    Replace the subtree starting from this node with the indicated replacement

    Replace the subtree starting from this node with the indicated replacement

    newNode

    The node to start tree from

    Definition Classes
    Node
  197. def repr: IndexedSeq[T]

    Definition Classes
    TraversableLike → GenTraversableLike
  198. def reverse: IndexedSeq[T]

    Definition Classes
    SeqLike → GenSeqLike
  199. def reverseIterator: Iterator[T]

    Definition Classes
    SeqLike
  200. def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  201. def reversed: List[T]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  202. def review(): Unit

    Review a node for optimization possibilities if its children have been updated

    Review a node for optimization possibilities if its children have been updated

    Definition Classes
    Node
  203. def runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean

    Definition Classes
    PartialFunction
  204. def sameElements[B >: T](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike
  205. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  206. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  207. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  208. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

    Definition Classes
    SeqLike → GenSeqLike
  209. val self: Vector[T]

    Definition Classes
    ROMVec
  210. def seq: IndexedSeq[T]

    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  211. def setIsTypeNode: Unit

    make this node a type node

    make this node a type node

    Definition Classes
    VecData
  212. def setIsWired(value: Boolean): Unit

    Definition Classes
    AggregateData
  213. def setName(n: String): Unit

    Set the name of a node when elaborated

    Set the name of a node when elaborated

    my.io.node.setName("MY_IO_NODE")
    n

    The name to set the node to

    Definition Classes
    Node
  214. def setWidth(w: Int): Unit

    Force the bit width of a node

    Force the bit width of a node

    w

    the bit width to force

    Definition Classes
    Node
  215. def size: Int

    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  216. def slice(from: Int, until: Int): IndexedSeq[T]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  217. def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]

    Definition Classes
    IterableLike
  218. def sliding(size: Int): Iterator[IndexedSeq[T]]

    Definition Classes
    IterableLike
  219. def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[T]

    Definition Classes
    SeqLike
  220. def sortWith(lt: (T, T) ⇒ Boolean): IndexedSeq[T]

    Definition Classes
    SeqLike
  221. def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]

    Definition Classes
    SeqLike
  222. lazy val sortedElements: Array[ArrayBuffer[Data]]

    Definition Classes
    Vec
  223. def span(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

    Definition Classes
    TraversableLike → GenTraversableLike
  224. def splitAt(n: Int): (IndexedSeq[T], IndexedSeq[T])

    Definition Classes
    TraversableLike → GenTraversableLike
  225. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

    Definition Classes
    SeqLike → GenSeqLike
  226. def startsWith[B](that: GenSeq[B]): Boolean

    Definition Classes
    GenSeqLike
  227. def stringPrefix: String

    Definition Classes
    TraversableLike → GenTraversableLike
  228. def sum[B >: T](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  229. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  230. def tail: IndexedSeq[T]

    Definition Classes
    TraversableLike → GenTraversableLike
  231. def tails: Iterator[IndexedSeq[T]]

    Definition Classes
    TraversableLike
  232. def take(n: Int): IndexedSeq[T]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  233. def takeRight(n: Int): IndexedSeq[T]

    Definition Classes
    IterableLike
  234. def takeWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  235. def thisCollection: IndexedSeq[T]

    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  236. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  237. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  238. def toBits(): UInt

    returns

    This node as a UInt

    Definition Classes
    Node
  239. def toBool(): Bool

    Try to convert this data to a Bool

    Try to convert this data to a Bool

    Definition Classes
    Data
    Exceptions thrown

    ChiselException if the width is not 1

  240. def toBuffer[A1 >: T]: Buffer[A1]

    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  241. def toCollection(repr: IndexedSeq[T]): IndexedSeq[T]

    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  242. def toIndexedSeq: IndexedSeq[T]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  243. def toIterable: Iterable[T]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  244. def toIterator: Iterator[T]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  245. def toList: List[T]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  246. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  247. lazy val toNode: Node

    returns

    This node

    Definition Classes
    DataNode
  248. def toSeq: Seq[T]

    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  249. def toSet[B >: T]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  250. def toStream: Stream[T]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  251. def toString(): String

    Definition Classes
    SeqLike → TraversableLike → Any
  252. def toTraversable: Traversable[T]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  253. def toVector: Vector[T]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  254. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  255. def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  256. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

    Definition Classes
    GenericTraversableTemplate
  257. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

    Definition Classes
    GenericTraversableTemplate
  258. def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Definition Classes
    SeqLike → GenSeqLike
  259. def usesInClockHi(i: Node): Boolean

    Definition Classes
    Node
  260. def view(from: Int, until: Int): SeqView[T, IndexedSeq[T]]

    Definition Classes
    SeqLike → IterableLike → TraversableLike
  261. def view: SeqView[T, IndexedSeq[T]]

    Definition Classes
    SeqLike → IterableLike → TraversableLike
  262. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  263. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  264. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  265. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, IndexedSeq[T]]

    Definition Classes
    TraversableLike → FilterMonadic
  266. def write(addr: UInt, data: T): Unit

    Illegal, cannot write to Read only memory

    Illegal, cannot write to Read only memory

    Definition Classes
    ROMVecVecLike
  267. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  268. def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

    Definition Classes
    IterableLike → GenIterableLike
  269. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[IndexedSeq[T], (A1, Int), That]): That

    Definition Classes
    IterableLike → GenIterableLike

Inherited from Vec[T]

Inherited from Cloneable

Inherited from Cloneable

Inherited from VecLike[T]

Inherited from IndexedSeq[T]

Inherited from IndexedSeqLike[T, IndexedSeq[T]]

Inherited from Seq[T]

Inherited from SeqLike[T, IndexedSeq[T]]

Inherited from GenSeq[T]

Inherited from GenSeqLike[T, IndexedSeq[T]]

Inherited from Iterable[T]

Inherited from IterableLike[T, IndexedSeq[T]]

Inherited from Equals

Inherited from GenIterable[T]

Inherited from GenIterableLike[T, IndexedSeq[T]]

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, IndexedSeq]

Inherited from TraversableLike[T, IndexedSeq[T]]

Inherited from GenTraversableLike[T, IndexedSeq[T]]

Inherited from Parallelizable[T, ParSeq[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, IndexedSeq[T]]

Inherited from HasNewBuilder[T, IndexedSeq[T] @scala.annotation.unchecked.uncheckedVariance]

Inherited from PartialFunction[Int, T]

Inherited from (Int) ⇒ T

Inherited from Aggregate

Inherited from Data

Inherited from Node

Inherited from nameable

Inherited from AnyRef

Inherited from Any

Ungrouped