Vec

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

def ##[T <: Data](right: T): Vec.this.type

def ##(b: Node): Node

final def ##(): Int

def ++(xs: GenTraversableOnce[T]): Buffer[T]

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

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

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

def ++=(xs: TraversableOnce[T]): Vec.this.type

def ++=:(xs: TraversableOnce[T]): Vec.this.type

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

def +=(elem: T): Vec.this.type

def +=(elem1: T, elem2: T, elems: T*): Vec.this.type

def +=:(elem: T): Vec.this.type

def -(elem1: T, elem2: T, elems: T*): Buffer[T]

def -(elem: T): Buffer[T]

def --(xs: GenTraversableOnce[T]): Buffer[T]

def --=(xs: TraversableOnce[T]): Vec.this.type

def -=(x: T): Vec.this.type

def -=(elem1: T, elem2: T, elems: T*): Vec.this.type

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

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

def :=(src: UInt): Unit

def :=[T <: Data](src: Iterable[T]): Unit

def :=[T <: Data](data: T): Unit

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

def <<(cmd: Message[T]): Unit

def <>(src: Iterable[T]): Unit

def <>(src: Vec[T]): Unit

def <>(src: Node): Unit

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def ===[T <: Data](right: T): Bool

def ^^(src: Node): Unit

def addConsumers(): Unit

def addString(b: StringBuilder): StringBuilder

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

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

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

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

def append(elems: T*): Unit

def appendAll(xs: TraversableOnce[T]): Unit

def apply(ind: UInt): T

def apply(idx: Int): T

def apply(name: String): Data

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

def asDirectionless(): Vec.this.type

def asInput(): Vec.this.type

final def asInstanceOf[T0]: T0

def asOutput(): Vec.this.type

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

def assign(src: Node): Unit

def bitSet(off: UInt, dat: UInt): UInt

def canEqual(that: Any): Boolean

def clear(): Unit

def clearlyEquals(x: Node): Boolean

var clock: Clock

def clone(): Vec.this.type

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

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

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

var comp: proc

def companion: GenericCompanion[Buffer]

var component: Module

def componentOf: Module

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

val consumers: ArrayBuffer[Node]

def contains[T <: Bits](x: T): Bool

def contains(elem: Any): Boolean

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

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) ⇒ Bool): UInt

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

var depth: Int

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

def distinct: Buffer[T]

var driveRand: Boolean

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

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

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

def emitIndex(): Int

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

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

def extract(b: Bundle): List[Node]

def extract(widths: Array[Int]): List[UInt]

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

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

def finalize(): Unit

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

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

def flatten: Array[(String, Bits)]

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

var flattened: Boolean

var flattenedVec: Node

def flip(): Vec.this.type

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) ⇒ Bool): Bool

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

def forceMatchingWidths: Unit

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

def fromBits(b: Bits): Vec.this.type

def fromNode(n: Node): Vec.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.

val gen: (Int) ⇒ T

var genError: Boolean

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

final def getClass(): Class[_]

def getLit: Literal

def getNode(): Node

def getWidth(): Int

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

var index: Int

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) ⇒ Bool): UInt

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

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

def indices: Range

def infer: Boolean

var inferCount: Int

var inferWidth: (Node) ⇒ Int

def init: Buffer[T]

def init(n: String, w: Int, ins: Node*): Node

def init(n: String, width: (Node) ⇒ Int, ins: Node*): Node

def initOf(n: String, width: (Node) ⇒ Int, ins: List[Node]): Node

def inits: Iterator[Buffer[T]]

val inputs: ArrayBuffer[Node]

def insert(n: Int, elems: T*): Unit

def insertAll(n: Int, iter: Traversable[T]): Unit

def insertAll(n: Int, iter: Iterable[T]): Unit

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

def isByValue: Boolean

var isClkInput: Boolean

def isDefinedAt(idx: Int): Boolean

def isDirectionless: Boolean

def isEmpty: Boolean

var isFixedWidth: Boolean

def isInObject: Boolean

def isInVCD: Boolean

final def isInstanceOf[T0]: Boolean

def isIo: Boolean

def isIo_=(isIo: Boolean): Unit

def isLit: Boolean

def isMemOutput: Boolean

var isPrintArg: Boolean

def isRamWriteInput(i: Node): Boolean

def isReg: Boolean

var isScanArg: Boolean

var isSigned: Boolean

final def isTraversableAgain: Boolean

var isTypeNode: Boolean

def isUsedByRam: Boolean

var isWidthWalked: Boolean

def iterator: Iterator[T]

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) ⇒ Bool): UInt

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]

var line: StackTraceElement

def litOf: Literal

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

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

def matchWidth(w: Int): Node

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

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

def maxNum: BigInt

def maybeFlatten: Seq[Node]

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

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

def minNum: BigInt

def mkString: String

def mkString(sep: String): String

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

var name: String

var nameHolder: nameable

def nameIt(path: String): Unit

var named: Boolean

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

final def ne(arg0: AnyRef): Boolean

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

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

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

def par: ParSeq[T]

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

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

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

def permutations: Iterator[Buffer[T]]

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

def prepend(elems: T*): Unit

def prependAll(xs: TraversableOnce[T]): Unit

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.

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

var prune: Boolean

def read(addr: UInt): T

def readOnly: Seq[T]

val readPortCache: HashMap[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]

def remove(n: Int): T

def remove(n: Int, count: Int): Unit

def removeTypeNodes(): Unit

def repr: Buffer[T]

def reverse: Buffer[T]

def reverseIterator: Iterator[T]

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

def reversed: List[T]

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

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

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

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

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

var sccIndex: Int

var sccLowlink: Int

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

val self: ArrayBuffer[T]

def seq: Seq[T]

def setIsClkInput: Unit

def setIsSigned: Unit

def setIsTypeNode(): Unit

def setName(n: String): Unit

def setWidth(w: Int): Unit

def signed: Vec.this.type

def size: Int

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

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

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

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

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

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

def sortedElements: ArrayBuffer[ArrayBuffer[Data]]

var sortedElementsCache: ArrayBuffer[ArrayBuffer[Data]]

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

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

var stack: Array[StackTraceElement]

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: Buffer[T]

def tails: Iterator[Buffer[T]]

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

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

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

def terminate(): Unit

def thisCollection: Seq[T]

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

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

def toBits(): UInt

def toBool(): Bool

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

def toCollection(repr: Buffer[T]): Seq[T]

def toIndexedSeq: IndexedSeq[T]

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 toNode: Node

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 traceNode(c: Module, stack: Stack[() ⇒ Any]): Unit

def traceableNodes: Array[Node]

def transform(f: (T) ⇒ T): Vec.this.type

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

def trimEnd(n: Int): Unit

def trimStart(n: Int): Unit

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

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

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

def update(n: Int, newelem: T): Unit

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

def value: BigInt

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

var walked: Boolean

def width: Int

var width_: Int

def width_=(w: Int): Unit

Sets the width of a Node.

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

def write(addr: UInt, data: T): Unit

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

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

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

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