Packages

final class MixedVec[T <: Data] extends Record with IndexedSeq[T]

A hardware array of elements that can hold values of different types/widths, unlike Vec which can only hold elements of the same type/width.

Source
MixedVec.scala
Example:
  1. val v = Wire(MixedVec(Seq(UInt(8.W), UInt(16.W), UInt(32.W))))
    v(0) := 100.U(8.W)
    v(1) := 10000.U(16.W)
    v(2) := 101.U(32.W)
Linear Supertypes
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, Record, Aggregate, Data, SourceInfoDoc, NamedComponent, HasId, internal.InstanceId, AnyRef, Any
Ordering
  1. Grouped
  2. Alphabetic
  3. By Inheritance
Inherited
  1. MixedVec
  2. IndexedSeq
  3. IndexedSeqLike
  4. Seq
  5. SeqLike
  6. GenSeq
  7. GenSeqLike
  8. Iterable
  9. IterableLike
  10. Equals
  11. GenIterable
  12. GenIterableLike
  13. Traversable
  14. GenTraversable
  15. GenericTraversableTemplate
  16. TraversableLike
  17. GenTraversableLike
  18. Parallelizable
  19. TraversableOnce
  20. GenTraversableOnce
  21. FilterMonadic
  22. HasNewBuilder
  23. PartialFunction
  24. Function1
  25. Record
  26. Aggregate
  27. Data
  28. SourceInfoDoc
  29. NamedComponent
  30. HasId
  31. InstanceId
  32. AnyRef
  33. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MixedVec(eltsIn: Seq[T])

    eltsIn

    Element types. Must be Chisel types.

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. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  4. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike
  5. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike
  6. def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  7. def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  8. def :=(that: Seq[T]): Unit

    Strong bulk connect, assigning elements in this MixedVec from elements in a Seq.

    Strong bulk connect, assigning elements in this MixedVec from elements in a Seq.

    Note

    the lengths of this and that must match

  9. final def :=(that: ⇒ Data)(implicit sourceInfo: SourceInfo, connectionCompileOptions: CompileOptions): Unit

    Connect this data to that data mono-directionally and element-wise.

    Connect this data to that data mono-directionally and element-wise.

    This uses the MonoConnect algorithm.

    that

    the data to connect to

    Definition Classes
    Data
  10. final def <>(that: ⇒ Data)(implicit sourceInfo: SourceInfo, connectionCompileOptions: CompileOptions): Unit

    Connect this data to that data bi-directionally and element-wise.

    Connect this data to that data bi-directionally and element-wise.

    This uses the BiConnect algorithm.

    that

    the data to connect to

    Definition Classes
    Data
  11. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  15. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  16. def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  17. def apply(index: Int): T

    Statically (elaboration-time) retrieve the element at the given index.

    Statically (elaboration-time) retrieve the element at the given index.

    index

    Index with which to retrieve.

    returns

    Retrieved index.

    Definition Classes
    MixedVec → SeqLike → GenSeqLike → Function1
  18. def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. macro def asTypeOf[T <: Data](that: T): T

    Does a reinterpret cast of the bits in this node into the format that provides.

    Does a reinterpret cast of the bits in this node into the format that provides. Returns a new Wire of that type. Does not modify existing nodes.

    x.asTypeOf(that) performs the inverse operation of x := that.toBits.

    Definition Classes
    Data
    Note

    bit widths are NOT checked, may pad or drop bits from input

    ,

    that should have known widths

  21. final macro def asUInt(): UInt

    Reinterpret cast to UInt.

    Reinterpret cast to UInt.

    Definition Classes
    Data
    Note

    value not guaranteed to be preserved: for example, a SInt of width 3 and value -1 (0b111) would become an UInt with value 7

    ,

    Aggregates are recursively packed with the first element appearing in the least-significant bits of the result.

  22. def autoSeed(name: String): MixedVec.this.type

    Takes the last seed suggested.

    Takes the last seed suggested. Multiple calls to this function will take the last given seed, unless this HasId is a module port (see overridden method in Data.scala).

    If the final computed name conflicts with the final name of another signal, the final name may get uniquified by appending a digit at the end of the name.

    Is a lower priority than suggestName, in that regardless of whether autoSeed was called, suggestName will always take precedence if it was called.

    returns

    this object

    Definition Classes
    Data → HasId
  23. def binding: Option[Binding]
    Attributes
    protected[chisel3]
    Definition Classes
    Data
  24. def bindingToString: String
    Attributes
    protected
    Definition Classes
    Data
  25. def binding_=(target: Binding): Unit
    Attributes
    protected
    Definition Classes
    Data
  26. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  27. def circuitName: String
    Attributes
    protected
    Definition Classes
    HasId
  28. def className: String

    Name for Pretty Printing

    Name for Pretty Printing

    Definition Classes
    Record
  29. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  30. def cloneType: MixedVec.this.type

    Internal API; Chisel users should look at chisel3.chiselTypeOf(...).

    Internal API; Chisel users should look at chisel3.chiselTypeOf(...).

    cloneType must be defined for any Chisel object extending Data. It is responsible for constructing a basic copy of the object being cloned.

    returns

    a copy of the object.

    Definition Classes
    MixedVecData
  31. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  32. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
    Definition Classes
    TraversableOnce
  33. def combinations(n: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    SeqLike
  34. def companion: GenericCompanion[IndexedSeq]
    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  35. def compose[A](g: (A) ⇒ Int): (A) ⇒ T
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  36. def computeName(defaultPrefix: Option[String], defaultSeed: Option[String]): Option[String]

    Computes the name of this HasId, if one exists

    Computes the name of this HasId, if one exists

    defaultPrefix

    Optionally provide a default prefix for computing the name

    defaultSeed

    Optionally provide default seed for computing the name

    returns

    the name, if it can be computed

    Definition Classes
    HasId
  37. def contains[A1 >: T](elem: A1): Boolean
    Definition Classes
    SeqLike
  38. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  39. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  40. def copyToArray[B >: T](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  41. def copyToArray[B >: T](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  42. def copyToBuffer[B >: T](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  43. def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  44. def count(p: (T) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  45. def diff[B >: T](that: GenSeq[B]): IndexedSeq[T]
    Definition Classes
    SeqLike → GenSeqLike
  46. def distinct: IndexedSeq[T]
    Definition Classes
    SeqLike → GenSeqLike
  47. def do_asTypeOf[T <: Data](that: T)(implicit sourceInfo: SourceInfo, compileOptions: CompileOptions): T

    Definition Classes
    Data
  48. def do_asUInt(implicit sourceInfo: SourceInfo, compileOptions: CompileOptions): UInt

    Definition Classes
    AggregateData
  49. def drop(n: Int): IndexedSeq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  50. def dropRight(n: Int): IndexedSeq[T]
    Definition Classes
    IterableLike
  51. def dropWhile(p: (T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. val elements: ListMap[String, T]
    Definition Classes
    MixedVecRecord
  53. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  54. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  55. def equals(that: Any): Boolean
    Definition Classes
    MixedVec → GenSeqLike → Equals → HasId → AnyRef → Any
  56. def exists(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def filter(p: (T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  58. def filterNot(p: (T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  59. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  60. def find(p: (T) ⇒ Boolean): Option[T]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  62. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
    Definition Classes
    GenericTraversableTemplate
  63. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  65. def foldRight[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  66. def forall(p: (T) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  67. def foreach[U](f: (T) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  68. def genericBuilder[B]: Builder[B, IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
  69. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  70. def getElements: Seq[Data]

    Returns a Seq of the immediate contents of this Aggregate, in order.

    Returns a Seq of the immediate contents of this Aggregate, in order.

    Definition Classes
    RecordAggregate
  71. final def getWidth: Int

    Returns the width, in bits, if currently known.

    Returns the width, in bits, if currently known.

    Definition Classes
    Data
  72. def groupBy[K](f: (T) ⇒ K): Map[K, IndexedSeq[T]]
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def grouped(size: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    IterableLike
  74. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  75. def hasSeed: Boolean

    returns

    Whether either autoName or suggestName has been called

    Definition Classes
    HasId
  76. def hashCode(): Int
    Definition Classes
    MixedVec → IndexedSeqLike → GenSeqLike → HasId → AnyRef → Any
  77. def head: T
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  78. def headOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  79. def indexOf[B >: T](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  80. def indexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  81. def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  82. def indexOfSlice[B >: T](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  83. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  84. def indexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  85. def indices: Range
    Definition Classes
    SeqLike
  86. def init: IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  87. def inits: Iterator[IndexedSeq[T]]
    Definition Classes
    TraversableLike
  88. def instanceName: String
    Definition Classes
    HasId → InstanceId
  89. def intersect[B >: T](that: GenSeq[B]): IndexedSeq[T]
    Definition Classes
    SeqLike → GenSeqLike
  90. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  91. def isEmpty: Boolean
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  92. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  93. def isLit(): Boolean
    Definition Classes
    Data
  94. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  95. final def isWidthKnown: Boolean

    Returns whether the width is currently known.

    Returns whether the width is currently known.

    Definition Classes
    Data
  96. def iterator: Iterator[T]
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  97. def last: T
    Definition Classes
    TraversableLike → GenTraversableLike
  98. def lastIndexOf[B >: T](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  99. def lastIndexOf[B >: T](elem: B): Int
    Definition Classes
    GenSeqLike
  100. def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  101. def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  102. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  103. def lastIndexWhere(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  104. def lastOption: Option[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  105. def length: Int

    Get the length of this MixedVec.

    Get the length of this MixedVec.

    returns

    Number of elements in this MixedVec.

    Definition Classes
    MixedVec → SeqLike → GenSeqLike
  106. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  107. def lift: (Int) ⇒ Option[T]
    Definition Classes
    PartialFunction
  108. def litOption(): Option[BigInt]

    Return an Aggregate's literal value if it is a literal, None otherwise.

    Return an Aggregate's literal value if it is a literal, None otherwise. If any element of the aggregate is not a literal with a defined width, the result isn't a literal.

    returns

    an Aggregate's literal value if it is a literal.

    Definition Classes
    AggregateData
  109. def litValue(): BigInt

    Returns the literal value if this is a literal that is representable as bits, otherwise crashes.

    Returns the literal value if this is a literal that is representable as bits, otherwise crashes.

    Definition Classes
    Data
  110. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  111. def max[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def min[B >: T](implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  119. def newBuilder: Builder[T, IndexedSeq[T]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  120. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  122. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  123. def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  124. def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  125. def par: ParSeq[T]
    Definition Classes
    Parallelizable
  126. def parCombiner: Combiner[T, ParSeq[T]]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  127. def parentModName: String
    Definition Classes
    HasId → InstanceId
  128. def parentPathName: String
    Definition Classes
    HasId → InstanceId
  129. def partition(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  131. def pathName: String
    Definition Classes
    HasId → InstanceId
  132. def permutations: Iterator[IndexedSeq[T]]
    Definition Classes
    SeqLike
  133. def prefixLength(p: (T) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  134. def product[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def reduceLeft[B >: T](op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce
  137. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  139. def reduceRight[B >: T](op: (T, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  140. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def repr: IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def reverse: IndexedSeq[T]
    Definition Classes
    SeqLike → GenSeqLike
  143. def reverseIterator: Iterator[T]
    Definition Classes
    SeqLike
  144. def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  145. def reversed: List[T]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  146. def runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  147. def sameElements[B >: T](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  148. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  149. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  150. 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.

  151. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  152. def seq: IndexedSeq[T]
    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  153. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  154. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    IndexedSeqLike → GenTraversableOnce
  155. def slice(from: Int, until: Int): IndexedSeq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  156. def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    IterableLike
  157. def sliding(size: Int): Iterator[IndexedSeq[T]]
    Definition Classes
    IterableLike
  158. def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[T]
    Definition Classes
    SeqLike
  159. def sortWith(lt: (T, T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    SeqLike
  160. def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]
    Definition Classes
    SeqLike
  161. def span(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  162. def splitAt(n: Int): (IndexedSeq[T], IndexedSeq[T])
    Definition Classes
    TraversableLike → GenTraversableLike
  163. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  164. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  165. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  166. def suggestName(seed: ⇒ String): MixedVec.this.type

    Takes the first seed suggested.

    Takes the first seed suggested. Multiple calls to this function will be ignored. If the final computed name conflicts with another name, it may get uniquified by appending a digit at the end.

    Is a higher priority than autoSeed, in that regardless of whether autoSeed was called, suggestName will always take precedence.

    seed

    The seed for the name of this component

    returns

    this object

    Definition Classes
    HasId
  167. def sum[B >: T](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  168. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  169. def tail: IndexedSeq[T]
    Definition Classes
    TraversableLike → GenTraversableLike
  170. def tails: Iterator[IndexedSeq[T]]
    Definition Classes
    TraversableLike
  171. def take(n: Int): IndexedSeq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  172. def takeRight(n: Int): IndexedSeq[T]
    Definition Classes
    IterableLike
  173. def takeWhile(p: (T) ⇒ Boolean): IndexedSeq[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  174. def thisCollection: IndexedSeq[T]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  175. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  176. final def toAbsoluteTarget: ReferenceTarget

    Returns a FIRRTL IsMember that refers to the absolute path to this object in the elaborated hardware graph

    Returns a FIRRTL IsMember that refers to the absolute path to this object in the elaborated hardware graph

    Definition Classes
    NamedComponent → InstanceId
  177. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  178. def toBuffer[A1 >: T]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  179. def toCollection(repr: IndexedSeq[T]): IndexedSeq[T]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  180. def toIndexedSeq: IndexedSeq[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def toIterable: Iterable[T]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  182. def toIterator: Iterator[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  183. def toList: List[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  184. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  185. final def toNamed: ComponentName

    Returns a FIRRTL ComponentName that references this object

    Returns a FIRRTL ComponentName that references this object

    Definition Classes
    NamedComponent → InstanceId
    Note

    Should not be called until circuit elaboration is complete

  186. def toPrintable: Printable

    Default "pretty-print" implementation Analogous to printing a Map Results in "$className(elt0.name -> elt0.value, ...)"

    Default "pretty-print" implementation Analogous to printing a Map Results in "$className(elt0.name -> elt0.value, ...)"

    Definition Classes
    RecordData
  187. def toSeq: Seq[T]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  188. def toSet[B >: T]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  189. def toStream: Stream[T]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  190. def toString(): String
    Definition Classes
    SeqLike → TraversableLike → Any
  191. final def toTarget: ReferenceTarget

    Returns a FIRRTL ReferenceTarget that references this object

    Returns a FIRRTL ReferenceTarget that references this object

    Definition Classes
    NamedComponent → InstanceId
    Note

    Should not be called until circuit elaboration is complete

  192. def toTraversable: Traversable[T]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  193. def toVector: Vector[T]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  194. 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.

  195. def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  196. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    GenericTraversableTemplate
  197. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    GenericTraversableTemplate
  198. def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  199. def view(from: Int, until: Int): SeqView[T, IndexedSeq[T]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  200. def view: SeqView[T, IndexedSeq[T]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  201. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  202. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  203. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  204. final def widthOption: Option[Int]

    Returns Some(width) if the width is known, else None.

    Returns Some(width) if the width is known, else None.

    Definition Classes
    Data
  205. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, IndexedSeq[T]]
    Definition Classes
    TraversableLike → FilterMonadic
  206. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  207. 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
  208. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[IndexedSeq[T], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, T) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (T, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

  3. def litArg(): Option[LitArg]
    Definition Classes
    Data
    Annotations
    @chiselRuntimeDeprecated() @deprecated
    Deprecated

    (Since version 3.2) litArg is deprecated, use litOption or litTo*Option

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 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 Record

Inherited from Aggregate

Inherited from Data

Inherited from SourceInfoDoc

Inherited from NamedComponent

Inherited from HasId

Inherited from internal.InstanceId

Inherited from AnyRef

Inherited from Any

Connect

Utilities for connecting hardware components

Ungrouped

SourceInfoTransformMacro

These internal methods are not part of the public-facing API!

The equivalent public-facing methods do not have the do_ prefix or have the same name. Use and look at the documentation for those. If you want left shift, use <<, not do_<<. If you want conversion to a Seq of Bools look at the asBools above, not the one below. Users can safely ignore every method in this group!

🐉🐉🐉 Here be dragons... 🐉🐉🐉

These do_X methods are used to enable both implicit passing of SourceInfo and chisel3.CompileOptions while also supporting chained apply methods. In effect all "normal" methods that you, as a user, will use in your designs, are converted to their "hidden", do_*, via macro transformations. Without using macros here, only one of the above wanted behaviors is allowed (implicit passing and chained applies)---the compiler interprets a chained apply as an explicit 'implicit' argument and will throw type errors.

The "normal", public-facing methods then take no SourceInfo. However, a macro transforms this public-facing method into a call to an internal, hidden do_* that takes an explicit SourceInfo by inserting an implicitly[SourceInfo] as the explicit argument.