VecLike

trait VecLike[T <: Data] extends IndexedSeq[T] with HasId with SourceInfoDoc

A trait for Vecs containing common hardware generators for collection operations.

Linear Supertypes

SourceInfoDoc, HasId, InstanceId, IndexedSeq[T], IndexedSeqOps[T, IndexedSeq, IndexedSeq[T]], IndexedSeq[T], IndexedSeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]], Seq[T], SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]], Seq[T], Equals, SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]], PartialFunction[Int, T], (Int) => T, Iterable[T], Iterable[T], IterableFactoryDefaults[T, [x]IndexedSeq[x]], IterableOps[T, [_]IndexedSeq[_], IndexedSeq[T]], IterableOnceOps[T, [_]IndexedSeq[_], IndexedSeq[T]], IterableOnce[T], AnyRef, Any

Known Subclasses

Vec

Ordering

Alphabetic
By Inheritance

Inherited

VecLike
SourceInfoDoc
HasId
InstanceId
IndexedSeq
IndexedSeqOps
IndexedSeq
IndexedSeqOps
Seq
SeqOps
Seq
Equals
SeqOps
PartialFunction
Function1
Iterable
Iterable
IterableFactoryDefaults
IterableOps
IterableOnceOps
IterableOnce
AnyRef
Any

Hide All
Show All

Visibility

Public
Protected

Abstract Value Members

abstract def apply(i: Int): T
Definition Classes
SeqOps
Annotations
@throws(scala.this.throws.<init>$default$1[IndexOutOfBoundsException])
abstract def do_apply(p: UInt)(implicit compileOptions: CompileOptions): T
abstract def length: Int
Definition Classes
SeqOps
abstract def toAbsoluteTarget: IsMember
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
InstanceId
abstract def toNamed: Named
Returns a FIRRTL Named that refers to this object in the elaborated hardware graph
Returns a FIRRTL Named that refers to this object in the elaborated hardware graph
Definition Classes
InstanceId
abstract def toTarget: IsMember
Returns a FIRRTL IsMember that refers to this object in the elaborated hardware graph
Returns a FIRRTL IsMember that refers to this object in the elaborated hardware graph
Definition Classes
InstanceId

Concrete Value Members

final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def ++[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
Definition Classes
IterableOps
Annotations
@inline()
final def ++:[B >: T](prefix: IterableOnce[B]): IndexedSeq[B]
Definition Classes
SeqOps → IterableOps
Annotations
@inline()
final def +:[B >: T](elem: B): IndexedSeq[B]
Definition Classes
SeqOps
Annotations
@inline()
final def :+[B >: T](elem: B): IndexedSeq[B]
Definition Classes
SeqOps
Annotations
@inline()
final def :++[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
Definition Classes
SeqOps
Annotations
@inline()
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def addString(b: StringBuilder): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
final def addString(b: StringBuilder, sep: String): b.type
Definition Classes
IterableOnceOps
Annotations
@inline()
def addString(b: StringBuilder, start: String, sep: String, end: String): b.type
Definition Classes
IterableOnceOps
def andThen[C](k: PartialFunction[T, C]): PartialFunction[Int, C]
Definition Classes
PartialFunction
def andThen[C](k: (T) => C): PartialFunction[Int, C]
Definition Classes
PartialFunction → Function1
def appended[B >: T](elem: B): IndexedSeq[B]
Definition Classes
SeqOps
def appendedAll[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
Definition Classes
SeqOps
macro def apply(p: UInt): T
def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) => B1): B1
Definition Classes
PartialFunction
def applyPreferredMaxLength: Int
Attributes
protected
Definition Classes
IndexedSeq
final def asInstanceOf[T0]: T0
Definition Classes
Any
def canEqual(that: Any): Boolean
Definition Classes
IndexedSeq → Seq → Equals
def circuitName: String
Attributes
protected
Definition Classes
HasId
def className: String
Attributes
protected[this]
Definition Classes
Iterable
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
final def coll: VecLike.this.type
Attributes
protected
Definition Classes
Iterable → IterableOps
def collect[B](pf: PartialFunction[T, B]): IndexedSeq[B]
Definition Classes
IterableOps → IterableOnceOps
def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
Definition Classes
IterableOnceOps
def combinations(n: Int): Iterator[IndexedSeq[T]]
Definition Classes
SeqOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, T]
Definition Classes
PartialFunction
def compose[A](g: (A) => Int): (A) => T
Definition Classes
Function1
Annotations
@unspecialized()
final def concat[B >: T](suffix: IterableOnce[B]): IndexedSeq[B]
Definition Classes
SeqOps → IterableOps
Annotations
@inline()
macro def contains(x: T)(implicit ev: <:<[T, UInt]): Bool
Outputs true if the vector contains at least one element equal to x (using the === operator).
def contains[A1 >: T](elem: A1): Boolean
Definition Classes
SeqOps
def containsSlice[B >: T](that: Seq[B]): Boolean
Definition Classes
SeqOps
def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
Definition Classes
IterableOnceOps
def copyToArray[B >: T](xs: Array[B], start: Int): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def copyToArray[B >: T](xs: Array[B]): Int
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
def corresponds[B](that: Seq[B])(p: (T, B) => Boolean): Boolean
Definition Classes
SeqOps
def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
Definition Classes
IterableOnceOps
macro def count(p: (T) => Bool): UInt
Outputs the number of elements for which p is true.
def count(p: (T) => Boolean): Int
Definition Classes
IterableOnceOps
def diff[B >: T](that: Seq[B]): IndexedSeq[T]
Definition Classes
SeqOps
def distinct: IndexedSeq[T]
Definition Classes
SeqOps
def distinctBy[B](f: (T) => B): IndexedSeq[T]
Definition Classes
SeqOps
def do_contains(x: T)(implicit sourceInfo: SourceInfo, ev: <:<[T, UInt], compileOptions: CompileOptions): Bool
def do_count(p: (T) => Bool)(implicit sourceInfo: SourceInfo, compileOptions: CompileOptions): UInt
def do_exists(p: (T) => Bool)(implicit sourceInfo: SourceInfo, compileOptions: CompileOptions): Bool
def do_forall(p: (T) => Bool)(implicit sourceInfo: SourceInfo, compileOptions: CompileOptions): Bool
def do_indexWhere(p: (T) => Bool)(implicit sourceInfo: SourceInfo, compileOptions: CompileOptions): UInt
def do_lastIndexWhere(p: (T) => Bool)(implicit sourceInfo: SourceInfo, compileOptions: CompileOptions): UInt
def do_onlyIndexWhere(p: (T) => Bool)(implicit sourceInfo: SourceInfo, compileOptions: CompileOptions): UInt
def drop(n: Int): IndexedSeq[T]
Definition Classes
IndexedSeqOps → IterableOps → IterableOnceOps
def dropRight(n: Int): IndexedSeq[T]
Definition Classes
IndexedSeqOps → IterableOps
def dropWhile(p: (T) => Boolean): IndexedSeq[T]
Definition Classes
IterableOps → IterableOnceOps
def elementWise: ElementWiseExtractor[Int, T]
Definition Classes
PartialFunction
def empty: IndexedSeq[T]
Definition Classes
IterableFactoryDefaults → IterableOps
def endsWith[B >: T](that: Iterable[B]): Boolean
Definition Classes
SeqOps
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(that: Any): Boolean
Definition Classes
VecLike → HasId → Seq → Equals → AnyRef → Any
macro def exists(p: (T) => Bool): Bool
Outputs true if p outputs true for at least one element.
def exists(p: (T) => Boolean): Boolean
Definition Classes
IterableOnceOps
def filter(pred: (T) => Boolean): IndexedSeq[T]
Definition Classes
IterableOps → IterableOnceOps
def filterNot(pred: (T) => Boolean): IndexedSeq[T]
Definition Classes
IterableOps → IterableOnceOps
def find(p: (T) => Boolean): Option[T]
Definition Classes
IterableOnceOps
def findLast(p: (T) => Boolean): Option[T]
Definition Classes
SeqOps
def flatMap[B](f: (T) => IterableOnce[B]): IndexedSeq[B]
Definition Classes
IterableOps → IterableOnceOps
def flatten[B](implicit asIterable: (T) => IterableOnce[B]): IndexedSeq[B]
Definition Classes
IterableOps → IterableOnceOps
def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
Definition Classes
IterableOnceOps
def foldLeft[B](z: B)(op: (B, T) => B): B
Definition Classes
IterableOnceOps
def foldRight[B](z: B)(op: (T, B) => B): B
Definition Classes
IndexedSeqOps → IterableOnceOps
macro def forall(p: (T) => Bool): Bool
Outputs true if p outputs true for every element.
def forall(p: (T) => Boolean): Boolean
Definition Classes
IterableOnceOps
def foreach[U](f: (T) => U): Unit
Definition Classes
IterableOnceOps
def fromSpecific(coll: IterableOnce[T]): IndexedSeq[T]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
def groupBy[K](f: (T) => K): Map[K, IndexedSeq[T]]
Definition Classes
IterableOps
def groupMap[K, B](key: (T) => K)(f: (T) => B): Map[K, IndexedSeq[B]]
Definition Classes
IterableOps
def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): Map[K, B]
Definition Classes
IterableOps
def grouped(size: Int): Iterator[IndexedSeq[T]]
Definition Classes
IterableOps
def hasSeed: Boolean
returns
Whether either autoName or suggestName has been called
Definition Classes
HasId
def hashCode(): Int
Definition Classes
VecLike → HasId → Seq → AnyRef → Any
def head: T
Definition Classes
IndexedSeqOps → IterableOps
def headOption: Option[T]
Definition Classes
IndexedSeqOps → IterableOps
def indexOf[B >: T](elem: B): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def indexOf[B >: T](elem: B, from: Int): Int
Definition Classes
SeqOps
def indexOfSlice[B >: T](that: Seq[B]): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def indexOfSlice[B >: T](that: Seq[B], from: Int): Int
Definition Classes
SeqOps
macro def indexWhere(p: (T) => Bool): UInt
Outputs the index of the first element for which p outputs true.
def indexWhere(p: (T) => Boolean): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def indexWhere(p: (T) => Boolean, from: Int): Int
Definition Classes
SeqOps
def indices: Range
Definition Classes
SeqOps
def init: IndexedSeq[T]
Definition Classes
IterableOps
def inits: Iterator[IndexedSeq[T]]
Definition Classes
IterableOps
def instanceName: String
Definition Classes
HasId → InstanceId
def intersect[B >: T](that: Seq[B]): IndexedSeq[T]
Definition Classes
SeqOps
def isDefinedAt(idx: Int): Boolean
Definition Classes
SeqOps
def isEmpty: Boolean
Definition Classes
SeqOps → IterableOnceOps
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def isTraversableAgain: Boolean
Definition Classes
IterableOps → IterableOnceOps
def iterableFactory: SeqFactory[IndexedSeq]
Definition Classes
IndexedSeq → IndexedSeq → Seq → Seq → Iterable → Iterable → IterableOps
def iterator: Iterator[T]
Definition Classes
IndexedSeqOps → IterableOnce
def knownSize: Int
Definition Classes
IndexedSeqOps → IterableOnce
def last: T
Definition Classes
IndexedSeqOps → IterableOps
def lastIndexOf[B >: T](elem: B, end: Int): Int
Definition Classes
SeqOps
def lastIndexOfSlice[B >: T](that: Seq[B]): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def lastIndexOfSlice[B >: T](that: Seq[B], end: Int): Int
Definition Classes
SeqOps
macro def lastIndexWhere(p: (T) => Bool): UInt
Outputs the index of the last element for which p outputs true.
def lastIndexWhere(p: (T) => Boolean): Int
Definition Classes
SeqOps
Annotations
@deprecatedOverriding()
def lastIndexWhere(p: (T) => Boolean, end: Int): Int
Definition Classes
SeqOps
def lastOption: Option[T]
Definition Classes
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, VecLike.this.type]
Definition Classes
Iterable
final def lengthCompare(that: Iterable[_]): Int
Definition Classes
IndexedSeqOps → SeqOps
final def lengthCompare(len: Int): Int
Definition Classes
IndexedSeqOps → SeqOps
final def lengthIs: SizeCompareOps
Definition Classes
SeqOps
Annotations
@inline()
def lift: (Int) => Option[T]
Definition Classes
PartialFunction
def map[B](f: (T) => B): IndexedSeq[B]
Definition Classes
IndexedSeqOps → IterableOps → IterableOnceOps
def max[B >: T](implicit ord: Ordering[B]): T
Definition Classes
IterableOnceOps
def maxBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
Definition Classes
IterableOnceOps
def maxByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
Definition Classes
IterableOnceOps
def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
Definition Classes
IterableOnceOps
def min[B >: T](implicit ord: Ordering[B]): T
Definition Classes
IterableOnceOps
def minBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
Definition Classes
IterableOnceOps
def minByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
Definition Classes
IterableOnceOps
def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
Definition Classes
IterableOnceOps
final def mkString: String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(sep: String): String
Definition Classes
IterableOnceOps
Annotations
@inline()
final def mkString(start: String, sep: String, end: String): String
Definition Classes
IterableOnceOps
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def newSpecificBuilder: Builder[T, IndexedSeq[T]]
Attributes
protected
Definition Classes
IterableFactoryDefaults → IterableOps
def nonEmpty: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecatedOverriding()
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
def occCounts[B](sq: Seq[B]): Map[B, Int]
Attributes
protected[collection]
Definition Classes
SeqOps
macro def onlyIndexWhere(p: (T) => Bool): UInt
Outputs the index of the element for which p outputs true, assuming that the there is exactly one such element.
Outputs the index of the element for which p outputs true, assuming that the there is exactly one such element.
The implementation may be more efficient than a priority mux, but incorrect results are possible if there is not exactly one true element.
Note
the assumption that there is only one element for which p outputs true is NOT checked (useful in cases where the condition doesn't always hold, but the results are not used in those cases)
def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Definition Classes
PartialFunction
def padTo[B >: T](len: Int, elem: B): IndexedSeq[B]
Definition Classes
SeqOps
def parentModName: String
Definition Classes
HasId → InstanceId
def parentPathName: String
Definition Classes
HasId → InstanceId
def partition(p: (T) => Boolean): (IndexedSeq[T], IndexedSeq[T])
Definition Classes
IterableOps
def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (IndexedSeq[A1], IndexedSeq[A2])
Definition Classes
IterableOps
def patch[B >: T](from: Int, other: IterableOnce[B], replaced: Int): IndexedSeq[B]
Definition Classes
SeqOps
def pathName: String
Definition Classes
HasId → InstanceId
def permutations: Iterator[IndexedSeq[T]]
Definition Classes
SeqOps
def prepended[B >: T](elem: B): IndexedSeq[B]
Definition Classes
IndexedSeqOps → SeqOps
def prependedAll[B >: T](prefix: IterableOnce[B]): IndexedSeq[B]
Definition Classes
SeqOps
def product[B >: T](implicit num: Numeric[B]): B
Definition Classes
IterableOnceOps
def reduce[B >: T](op: (B, B) => B): B
Definition Classes
IterableOnceOps
def reduceLeft[B >: T](op: (B, T) => B): B
Definition Classes
IterableOnceOps
def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceOption[B >: T](op: (B, B) => B): Option[B]
Definition Classes
IterableOnceOps
def reduceRight[B >: T](op: (T, B) => B): B
Definition Classes
IterableOnceOps
def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
Definition Classes
IterableOnceOps
def reverse: IndexedSeq[T]
Definition Classes
IndexedSeqOps → SeqOps
def reverseIterator: Iterator[T]
Definition Classes
IndexedSeqOps → SeqOps
def reversed: Iterable[T]
Attributes
protected
Definition Classes
IndexedSeqOps → IterableOnceOps
def runWith[U](action: (T) => U): (Int) => Boolean
Definition Classes
PartialFunction
def sameElements[B >: T](o: IterableOnce[B]): Boolean
Definition Classes
IndexedSeq → SeqOps
def scan[B >: T](z: B)(op: (B, B) => B): IndexedSeq[B]
Definition Classes
IterableOps
def scanLeft[B](z: B)(op: (B, T) => B): IndexedSeq[B]
Definition Classes
IterableOps → IterableOnceOps
def scanRight[B](z: B)(op: (T, B) => B): IndexedSeq[B]
Definition Classes
IterableOps
def search[B >: T](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps → SeqOps
def search[B >: T](elem: B)(implicit ord: Ordering[B]): SearchResult
Definition Classes
IndexedSeqOps → SeqOps
def segmentLength(p: (T) => Boolean, from: Int): Int
Definition Classes
SeqOps
final def segmentLength(p: (T) => Boolean): Int
Definition Classes
SeqOps
final def size: Int
Definition Classes
SeqOps → IterableOnceOps
final def sizeCompare(that: Iterable[_]): Int
Definition Classes
SeqOps → IterableOps
final def sizeCompare(otherSize: Int): Int
Definition Classes
SeqOps → IterableOps
final def sizeIs: SizeCompareOps
Definition Classes
IterableOps
Annotations
@inline()
def slice(from: Int, until: Int): IndexedSeq[T]
Definition Classes
IndexedSeqOps → IndexedSeqOps → IterableOps → IterableOnceOps
def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]
Definition Classes
IterableOps
def sliding(size: Int): Iterator[IndexedSeq[T]]
Definition Classes
IterableOps
def sortBy[B](f: (T) => B)(implicit ord: Ordering[B]): IndexedSeq[T]
Definition Classes
SeqOps
def sortWith(lt: (T, T) => Boolean): IndexedSeq[T]
Definition Classes
SeqOps
def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]
Definition Classes
SeqOps
def span(p: (T) => Boolean): (IndexedSeq[T], IndexedSeq[T])
Definition Classes
IterableOps → IterableOnceOps
def splitAt(n: Int): (IndexedSeq[T], IndexedSeq[T])
Definition Classes
IterableOps → IterableOnceOps
def startsWith[B >: T](that: IterableOnce[B], offset: Int): Boolean
Definition Classes
SeqOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S with EfficientSplit
Definition Classes
IndexedSeqOps → IterableOnce
def stringPrefix: String
Attributes
protected[this]
Definition Classes
IndexedSeq → Seq → Iterable
def suggestName(seed: => String): VecLike.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
def sum[B >: T](implicit num: Numeric[B]): B
Definition Classes
IterableOnceOps
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def tail: IndexedSeq[T]
Definition Classes
IterableOps
def tails: Iterator[IndexedSeq[T]]
Definition Classes
IterableOps
def take(n: Int): IndexedSeq[T]
Definition Classes
IndexedSeqOps → IterableOps → IterableOnceOps
def takeRight(n: Int): IndexedSeq[T]
Definition Classes
IndexedSeqOps → IterableOps
def takeWhile(p: (T) => Boolean): IndexedSeq[T]
Definition Classes
IterableOps → IterableOnceOps
def tapEach[U](f: (T) => U): IndexedSeq[T]
Definition Classes
IterableOps → IterableOnceOps
def to[C1](factory: Factory[T, C1]): C1
Definition Classes
IterableOnceOps
def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
Definition Classes
IterableOnceOps
final def toBuffer[B >: T]: Buffer[B]
Definition Classes
IterableOnceOps
Annotations
@inline()
final def toIndexedSeq: IndexedSeq[T]
Definition Classes
IndexedSeq → IterableOnceOps
def toList: List[T]
Definition Classes
IterableOnceOps
def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
Definition Classes
IterableOnceOps
final def toSeq: VecLike.this.type
Definition Classes
Seq → IterableOnceOps
def toSet[B >: T]: Set[B]
Definition Classes
IterableOnceOps
def toString(): String
Definition Classes
Seq → Function1 → Iterable → AnyRef → Any
def toVector: Vector[T]
Definition Classes
IterableOnceOps
def transpose[B](implicit asIterable: (T) => Iterable[B]): IndexedSeq[IndexedSeq[B]]
Definition Classes
IterableOps
def unapply(a: Int): Option[T]
Definition Classes
PartialFunction
def unzip[A1, A2](implicit asPair: (T) => (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
Definition Classes
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
Definition Classes
IterableOps
def updated[B >: T](index: Int, elem: B): IndexedSeq[B]
Definition Classes
SeqOps
def view: IndexedSeqView[T]
Definition Classes
IndexedSeqOps → SeqOps → IterableOps
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
def withFilter(p: (T) => Boolean): WithFilter[T, [_]IndexedSeq[_]]
Definition Classes
IterableOps
def zip[B](that: IterableOnce[B]): IndexedSeq[(T, B)]
Definition Classes
IterableOps
def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): IndexedSeq[(A1, B)]
Definition Classes
IterableOps
def zipWithIndex: IndexedSeq[(T, Int)]
Definition Classes
IterableOps → IterableOnceOps

Deprecated Value Members

final def /:[B](z: B)(op: (B, T) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
final def :\[B](z: B)(op: (T, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use foldRight instead of :\
def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.
def companion: IterableFactory[[_]IndexedSeq[_]]
Definition Classes
IterableOps
Annotations
@deprecated @deprecatedOverriding() @inline()
Deprecated
(Since version 2.13.0) Use iterableFactory instead
final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use dest ++= coll instead
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated
Deprecated
def hasDefiniteSize: Boolean
Definition Classes
IterableOnceOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
final def prefixLength(p: (T) => Boolean): Int
Definition Classes
SeqOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use segmentLength instead of prefixLength
final def repr: IndexedSeq[T]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
def reverseMap[B](f: (T) => B): IndexedSeq[B]
Definition Classes
SeqOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
def seq: VecLike.this.type
Definition Classes
Iterable
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
final def toIterable: VecLike.this.type
Definition Classes
Iterable → IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
final def toIterator: Iterator[T]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
final def toStream: Stream[T]
Definition Classes
IterableOnceOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
final def toTraversable: Traversable[T]
Definition Classes
IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections
final def union[B >: T](that: Seq[B]): IndexedSeq[B]
Definition Classes
SeqOps
Annotations
@deprecated @inline()
Deprecated
(Since version 2.13.0) Use concat instead
def view(from: Int, until: Int): IndexedSeqView[T]
Definition Classes
IndexedSeqOps → IterableOps
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

Packages

VecLike

trait VecLike[T <: Data] extends IndexedSeq[T] with HasId with SourceInfoDoc

Abstract Value Members

Concrete Value Members

Deprecated Value Members

Inherited from SourceInfoDoc

Inherited from HasId

Inherited from InstanceId

Inherited from IndexedSeq[T]

Inherited from IndexedSeqOps[T, IndexedSeq, IndexedSeq[T]]

Inherited from IndexedSeq[T]

Inherited from IndexedSeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from Seq[T]

Inherited from SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from Seq[T]

Inherited from Equals

Inherited from SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from PartialFunction[Int, T]

Inherited from (Int) => T

Inherited from Iterable[T]

Inherited from Iterable[T]

Inherited from IterableFactoryDefaults[T, [x]IndexedSeq[x]]

Inherited from IterableOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from IterableOnceOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from IterableOnce[T]

Inherited from AnyRef

Inherited from Any

SourceInfoTransformMacro

Ungrouped

Packages

VecLike

trait VecLike[T <: Data] extends IndexedSeq[T] with HasId with SourceInfoDoc

Abstract Value Members

Concrete Value Members

Deprecated Value Members

Inherited from SourceInfoDoc

Inherited from HasId

Inherited from InstanceId

Inherited from IndexedSeq[T]

Inherited from IndexedSeqOps[T, IndexedSeq, IndexedSeq[T]]

Inherited from IndexedSeq[T]

Inherited from IndexedSeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from Seq[T]

Inherited from SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from Seq[T]

Inherited from Equals

Inherited from SeqOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from PartialFunction[Int, T]

Inherited from (Int) => T

Inherited from Iterable[T]

Inherited from Iterable[T]

Inherited from IterableFactoryDefaults[T, [x]IndexedSeq[x]]

Inherited from IterableOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from IterableOnceOps[T, [_]IndexedSeq[_], IndexedSeq[T]]

Inherited from IterableOnce[T]

Inherited from AnyRef

Inherited from Any

SourceInfoTransformMacro

Ungrouped

VecLike