Vec

final def !=(arg0: Any): Boolean

def ##(right: Data): Bits

Concatenation between two data

final def ##(): Int

def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def /:[B](z: B)(op: (B, T) ⇒ B): B

def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def :\[B](z: B)(op: (T, B) ⇒ B): B

final def ==(arg0: Any): Boolean

var _spinalTags: LinkedHashSet[SpinalTag]

def access(address: UInt): T

def addAttribute(attribute: Attribute): Vec.this.type

def addAttribute(name: String, value: Int): Vec.this.type

def addAttribute(name: String, value: String): Vec.this.type

def addAttribute(name: String): Vec.this.type

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def addTag[T <: SpinalTag](spinalTag: T): Vec.this.type

def addTags[T <: SpinalTag](tags: Iterable[T]): Vec.this.type

def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

def allowDirectionLessIo: Vec.this.type

def allowOverride: Vec.this.type

Allow a data to be overrided

def allowPartialyAssigned: Vec.this.type

def allowPruning(): Vec.this.type

def allowSimplifyIt(): Vec.this.type

def allowUnsetRegToAvoidLatch: Vec.this.type

def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]

def apply(address: UInt): T

Access an element of the vector by an UInt index

def apply(idx: Int): T

Access an element of the vector by an Int index

def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1

def as[T <: Data](dataType: HardType[T]): T

def asBits: Bits

Cast data to Bits

def asData: Data

def asInOut(): Vec.this.type

set a data as inout

def asInput(): Vec.this.type

Set a data as input

final def asInstanceOf[T0]: T0

def asOutput(): Vec.this.type

Set a data as output

def assignDontCare(): Vec.this.type

final def assignFrom(that: AnyRef, target: AnyRef = this): Unit

def assignFromBits(bits: Bits, hi: Int, lo: Int): Unit

def assignFromBits(bits: Bits): Unit

def assignFromBits(bits: Bits, offset: Int, bitCount: BitCount): Unit

def assignUnassignedByName(that: MultiData): Unit

def canEqual(that: Any): Boolean

def clone(): Vec.this.type

def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

def combinations(n: Int): Iterator[IndexedSeq[T]]

def companion: GenericCompanion[IndexedSeq]

def component: Component

def compose[A](g: (A) ⇒ Int): (A) ⇒ T

final def compositAssignFrom(that: AnyRef, target: AnyRef, kind: AnyRef): Unit

var compositeAssign: Assignable

def contains[A1 >: T](elem: A1): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

def copyDirectionOfImpl(that: Data): Vec.this.type

def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: T](xs: Array[B]): Unit

def copyToArray[B >: T](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: T](dest: Buffer[B]): Unit

def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean

def count(p: (T) ⇒ Boolean): Int

val dataType: HardType[T]

def diff[B >: T](that: GenSeq[B]): IndexedSeq[T]

def dirString(): String

def distinct: IndexedSeq[T]

def dontSimplifyIt(): Vec.this.type

def drop(n: Int): IndexedSeq[T]

def dropRight(n: Int): IndexedSeq[T]

def dropWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

def elements: ArrayBuffer[(String, Data)]

def elementsString: String

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: (T) ⇒ Boolean): Boolean

def existsTag(cond: (SpinalTag) ⇒ Boolean): Boolean

def filter(p: (T) ⇒ Boolean): IndexedSeq[T]

def filterNot(p: (T) ⇒ Boolean): IndexedSeq[T]

def filterTag(cond: (SpinalTag) ⇒ Boolean): Iterable[SpinalTag]

def find(p: (T) ⇒ Boolean): Option[T]

def find(name: String): Data

def findTag(cond: (SpinalTag) ⇒ Boolean): Option[SpinalTag]

def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

def flatten: Seq[BaseType]

def flattenForeach(body: (BaseType) ⇒ Unit): Unit

def flattenLocalName: Seq[String]

def flip(): Vec.this.type

flip the direction of the data

def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

def foldRight[B](z: B)(op: (T, B) ⇒ B): B

def forall(p: (T) ⇒ Boolean): Boolean

def foreach[U](f: (T) ⇒ U): Unit

def foreachReflectableNameables(doThat: (Any) ⇒ Unit): Unit

def foreachTag(body: (SpinalTag) ⇒ Unit): Unit

def freeze(): Vec.this.type

def genIf(cond: Boolean): Vec.this.type

Generate this if condition is true

def genericBuilder[B]: Builder[B, IndexedSeq[B]]

def getBitsWidth: Int

Return the width of the data

final def getClass(): Class[_]

def getComponent(): Component

def getComponents(): Seq[Component]

Get current component with all parents

def getDirection: IODirection

def getDisplayName(): String

def getInstanceCounter: Int

def getMode: Byte

def getName(default: String): String

def getName(): String

def getPartialName(): String

def getRealSource: Any

def getRealSourceNoRec: Any

def getRefOwnersChain(): List[Any]

def getRootParent: Data

def getScalaLocationLong: String

def getScalaLocationShort: String

def getScalaTrace(): Throwable

def getTag[T <: SpinalTag](clazz: Class[T]): Option[T]

def getTags(): LinkedHashSet[SpinalTag]

def getZero: Vec.this.type

Create a data set to 0

val globalData: GlobalData

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

def grouped(size: Int): Iterator[IndexedSeq[T]]

def hasDefiniteSize: Boolean

def hasTag[T <: SpinalTag](clazz: Class[T]): Boolean

def hasTag(spinalTag: SpinalTag): Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def indexOf[B >: T](elem: B, from: Int): Int

def indexOf[B >: T](elem: B): Int

def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: T](that: GenSeq[B]): Int

def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

def indexWhere(p: (T) ⇒ Boolean): Int

def indices: Range

def init: IndexedSeq[T]

final def initFrom(that: AnyRef, target: AnyRef = this): Unit

def inits: Iterator[IndexedSeq[T]]

def instanceAttributes(language: Language): Iterable[Attribute]

def instanceAttributes: Iterable[Attribute]

def intersect[B >: T](that: GenSeq[B]): IndexedSeq[T]

def isAnalog: Boolean

def isComb: Boolean

def isCompletelyUnnamed: Boolean

def isDefinedAt(idx: Int): Boolean

def isDirectionLess: Boolean

def isEmpty: Boolean

def isEmptyOfTag: Boolean

def isInOut: Boolean

def isInput: Boolean

def isInputOrInOut: Boolean

final def isInstanceOf[T0]: Boolean

def isNamed: Boolean

def isOutput: Boolean

def isOutputOrInOut: Boolean

def isPriorityApplicable(namePriority: Byte): Boolean

def isReg: Boolean

final def isTraversableAgain: Boolean

def isUnnamed: Boolean

def iterator: Iterator[T]

def keep(): Vec.this.type

def last: T

def lastIndexOf[B >: T](elem: B, end: Int): Int

def lastIndexOf[B >: T](elem: B): Int

def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int

def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (T) ⇒ Boolean): Int

def lastOption: Option[T]

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[T]

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def max[B >: T](implicit cmp: Ordering[B]): T

def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def min[B >: T](implicit cmp: Ordering[B]): T

def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

var name: String

var nameableRef: Nameable

final def ne(arg0: AnyRef): Boolean

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

def noBackendCombMerge: Vec.this.type

def noCombLoopCheck: Vec.this.type

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def onEachAttributes(doIt: (Attribute) ⇒ Unit): Unit

def oneHotAccess(oneHot: Bits): T

Access an element of the vector by a oneHot value

def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def overrideLocalName(name: String): Vec.this.type

def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def par: ParSeq[T]

def parCombiner: Combiner[T, ParSeq[T]]

var parent: Data

var parentScope: ScopeStatement

def partition(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def permutations: Iterator[IndexedSeq[T]]

def prefixLength(p: (T) ⇒ Boolean): Int

def product[B >: T](implicit num: Numeric[B]): B

def pull(): Vec.this.type

Pull a signal to the top level (use for debugging)

def purify(): Vec.this.type

def randBoot(u: Unit): Vec.this.type

Useful for register that doesn't need a reset value in RTL, but need a random value for simulation (avoid x-propagation)

def range: Range

def read(address: UInt): T

def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: T](op: (B, T) ⇒ B): B

def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: T](op: (T, B) ⇒ B): B

def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

var refOwner: RefOwnerType

def reflectNames(): Unit

def removeAssignments(): Vec.this.type

def removeTag(spinalTag: SpinalTag): Vec.this.type

def removeTags(tags: Iterable[SpinalTag]): Vec.this.type

def repr: IndexedSeq[T]

def resized: Vec.this.type

Resized data regarding target

def reverse: IndexedSeq[T]

def reverseIterator: Iterator[T]

def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def reversed: List[T]

def runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean

def sameElements[B >: T](that: GenIterable[B]): Boolean

var scalaTrace: Throwable

def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[T], B, That]): That

def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

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

def seq: IndexedSeq[T]

def setAsAnalog(): Vec.this.type

def setAsComb(): Vec.this.type

Set baseType to Combinatorial

def setAsDirectionLess(): Vec.this.type

remove the direction (in,out,inout) to a data

def setAsReg(): Vec.this.type

Set baseType to reg

def setCompositeName(nameable: Nameable, postfix: String, namePriority: Byte): Vec.this.type

def setCompositeName(nameable: Nameable, postfix: String, weak: Boolean): Vec.this.type

def setCompositeName(nameable: Nameable, postfix: String): Vec.this.type

def setCompositeName(nameable: Nameable, namePriority: Byte): Vec.this.type

def setCompositeName(nameable: Nameable, weak: Boolean): Vec.this.type

def setCompositeName(nameable: Nameable): Vec.this.type

def setName(name: String, namePriority: Byte): Vec.this.type

def setName(name: String, weak: Boolean): Vec.this.type

def setName(name: String): Vec.this.type

def setNameAsWeak(): Vec.this.type

def setPartialName(name: String, namePriority: Byte): Vec.this.type

def setPartialName(name: String, weak: Boolean): Vec.this.type

def setPartialName(owner: Nameable, name: String, namePriority: Byte): Vec.this.type

def setPartialName(owner: Nameable, name: String, weak: Boolean): Vec.this.type

def setPartialName(name: String): Vec.this.type

def setPartialName(owner: Nameable, name: String): Vec.this.type

def setRefOwner(that: Any): Unit

def setScalaLocated(source: ScalaLocated): Vec.this.type

def setWeakName(name: String): Vec.this.type

def size: Int

def slice(from: Int, until: Int): IndexedSeq[T]

def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]

def sliding(size: Int): Iterator[IndexedSeq[T]]

def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[T]

def sortWith(lt: (T, T) ⇒ Boolean): IndexedSeq[T]

def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]

def span(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

def spinalTags: LinkedHashSet[SpinalTag]

def splitAt(n: Int): (IndexedSeq[T], IndexedSeq[T])

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def stringPrefix: String

def sum[B >: T](implicit num: Numeric[B]): B

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

def tail: IndexedSeq[T]

def tails: Iterator[IndexedSeq[T]]

def take(n: Int): IndexedSeq[T]

def takeRight(n: Int): IndexedSeq[T]

def takeWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

def thisCollection: IndexedSeq[T]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

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

def toCollection(repr: IndexedSeq[T]): IndexedSeq[T]

def toIndexedSeq: IndexedSeq[T]

def toIo(): Vec.this.type

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

def toSeq: Seq[T]

def toSet[B >: T]: Set[B]

def toStream: Stream[T]

def toString(): String

def toTraversable: Traversable[T]

def toVector: Vector[T]

def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

def unfreeze(): Vec.this.type

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

def unsetName(): Vec.this.type

def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

val vec: Vector[T]

def view(from: Int, until: Int): SeqView[T, IndexedSeq[T]]

def view: SeqView[T, IndexedSeq[T]]

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, IndexedSeq[T]]

def wrapNext(): Vec.this.type

def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[IndexedSeq[T], (A1, Int), That]): That

def asDirectionLess(): Vec.this.type

def finalize(): Unit