final class SizedVector[N <: Dense, +T] extends AnyRef
Sequantially indexed immutable collection of fixed size in which all elements are of the same type. Uses scala.collection.immutable.Vector as a backing datastructure.
Author:
Harshad Deo
- N
Size of the collection
- T
Element type of the collection
- Since
0.1
- Alphabetic
- By Inheritance
- SizedVector
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from SizedVector[N, T] toany2stringadd[SizedVector[N, T]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ++[N1 <: Dense, U >: T](that: SizedVector[N1, U]): SizedVector[+[N1, N], U]
Appends the argument to this
Appends the argument to this
Author:
Harshad Deo
- N1
Size of the argument
- U
Element type of the argument
- Since
0.1
- def +:[U >: T](elem: U): SizedVector[+[N, _1], U]
Prepends the element to this
Prepends the element to this
Author:
Harshad Deo
- U
Type of the element being prepended
- Since
0.1
- def ->[B](y: B): (SizedVector[N, T], B)
- Implicit
- This member is added by an implicit conversion from SizedVector[N, T] toArrowAssoc[SizedVector[N, T]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- def :+[U >: T](elem: U): SizedVector[+[N, _1], U]
Appends an element to this
Appends an element to this
Author:
Harshad Deo
- U
Type of the element being appended
- Since
0.1
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply(i: LiteralHash[Int])(implicit ev0: TrueConstraint[<[ValueHash, N]]): T
Fetches the element at the index
Fetches the element at the index
Author:
Harshad Deo
- Since
0.1
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val backing: Vector[T]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def drop[D <: Dense](i: LiteralHash[Int])(implicit ev0: DenseDiff[N, ValueHash, D], ev1: TrueConstraint[>[D, _0]], ev2: TrueConstraint[>[ValueHash, _0]]): SizedVector[D, T]
Drops the first i elements from this
Drops the first i elements from this
Author:
Harshad Deo
- D
Size of the resultant collection
- Since
0.1
- def dropRight[D <: Dense](i: LiteralHash[Int])(implicit ev0: DenseDiff[N, ValueHash, D], ev1: TrueConstraint[>[D, _0]], ev2: TrueConstraint[>[ValueHash, _0]]): SizedVector[D, T]
Drops the last i elements from this
Drops the last i elements from this
Author:
Harshad Deo
- D
Size of the resultant collection
- Since
0.1
- def ensuring(cond: (SizedVector[N, T]) => Boolean, msg: => Any): SizedVector[N, T]
- Implicit
- This member is added by an implicit conversion from SizedVector[N, T] toEnsuring[SizedVector[N, T]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (SizedVector[N, T]) => Boolean): SizedVector[N, T]
- Implicit
- This member is added by an implicit conversion from SizedVector[N, T] toEnsuring[SizedVector[N, T]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): SizedVector[N, T]
- Implicit
- This member is added by an implicit conversion from SizedVector[N, T] toEnsuring[SizedVector[N, T]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): SizedVector[N, T]
- Implicit
- This member is added by an implicit conversion from SizedVector[N, T] toEnsuring[SizedVector[N, T]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(other: Any): Boolean
- Definition Classes
- SizedVector → AnyRef → Any
- Annotations
- @SuppressWarnings()
- def flatten[D <: Dense, U](implicit ev: <:<[T, SizedVector[D, U]]): SizedVector[*[D, N], U]
If the element type of this is a SizedVector, the operation converts this (a SizedVector of SizedVectors) into a simple SizedVector
If the element type of this is a SizedVector, the operation converts this (a SizedVector of SizedVectors) into a simple SizedVector
Author:
Harshad Deo
- D
Size of the element
- U
Element type of the element
- Since
0.1
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from SizedVector[N, T] toStringFormat[SizedVector[N, T]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- SizedVector → AnyRef → Any
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def length(implicit ev: DenseIntRep[N]): Int
Value level length of this
Value level length of this
Author:
Harshad Deo
- Since
0.1
- def map[U](f: (T) => U): SizedVector[N, U]
Straightforward map operation
Straightforward map operation
Author:
Harshad Deo
- U
Element type of the resultant collection
- Since
0.1
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def reverse: SizedVector[N, T]
Reverses this
Reverses this
Author:
Harshad Deo
- Since
0.1
- def slice[ST <: Dense, SZ <: Dense](implicit ev0: TrueConstraint[>[SZ, _0]], ev2: TrueConstraint[<=[+[ST, SZ], N]], ev3: DenseIntRep[ST], ev4: DenseIntRep[SZ]): SizedVector[SZ, T]
Subsequence between the two type indices
Subsequence between the two type indices
Author:
Harshad Deo
- ST
Starting point of the slice
- SZ
Size of the slice
- Since
0.6.4
- def slice[D <: Dense](start: LiteralHash[Int], end: LiteralHash[Int])(implicit ev0: TrueConstraint[<[ValueHash, ValueHash]], ev1: TrueConstraint[<=[ValueHash, N]], ev2: DenseDiff[ValueHash, ValueHash, D], ev3: TrueConstraint[===[TypeHash, PositiveIntegerTypeHash]], ev4: TrueConstraint[===[TypeHash, PositiveIntegerTypeHash]]): SizedVector[D, T]
Subsequence between the two indices
Subsequence between the two indices
Author:
Harshad Deo
- D
Length of the resulting sequence
- Since
0.1
- def sortBy[B](f: (T) => B)(implicit ev: Ordering[B]): SizedVector[N, T]
Sorts according to the transformation function
Sorts according to the transformation function
Author:
Harshad Deo
- B
Element type according to which the sorting executed
- Since
0.1
- def sortWith(lt: (T, T) => Boolean): SizedVector[N, T]
Sorts according to the comparator
Sorts according to the comparator
Author:
Harshad Deo
- Since
0.1
- def sorted[B >: T](implicit ev: Ordering[B]): SizedVector[N, T]
Sorts according to the implicit ordering defined on B
Sorts according to the implicit ordering defined on B
Author:
Harshad Deo
- B
Type on which the sorting is defined
- Since
0.1
- def splitAt[D <: Dense](i: LiteralHash[Int])(implicit ev0: TrueConstraint[<[ValueHash, N]], ev1: TrueConstraint[>[ValueHash, _0]], ev2: DenseDiff[N, ValueHash, D]): (SizedVector[ValueHash, T], SizedVector[D, T])
Splits the collection at the specified inded
Splits the collection at the specified inded
Author:
Harshad Deo
- D
Size of the subcollection to the right of the split index
- Since
0.1
- def symzip[U](that: SizedVector[N, U]): SizedVector[N, (T, U)]
Zips with a SizedVector of the same size
Zips with a SizedVector of the same size
Author:
Harshad Deo
- U
Element type of the argument
- Since
0.6.3
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def take(i: LiteralHash[Int])(implicit ev0: TrueConstraint[>[ValueHash, _0]], ev1: TrueConstraint[<[ValueHash, N]]): SizedVector[ValueHash, T]
Takes the first i elements
Takes the first i elements
Author:
Harshad Deo
- Since
0.1
- def takeRight(i: LiteralHash[Int])(implicit ev0: TrueConstraint[>[ValueHash, _0]], ev1: TrueConstraint[<[ValueHash, N]]): SizedVector[ValueHash, T]
Takes the last i elements
Takes the last i elements
Author:
Harshad Deo
- Since
0.1
- def toString(): String
- Definition Classes
- SizedVector → AnyRef → Any
- def transpose[D <: Dense, U](implicit ev: <:<[T, SizedVector[D, U]]): SizedVector[D, SizedVector[N, U]]
If the element type is another SizedVector, transposes the collection
If the element type is another SizedVector, transposes the collection
Author:
Harshad Deo
- D
Size of the element
- U
Element type of the element
- Since
0.6.3
- def traverse[U, V, R](f: (T) => Either[U, V])(acc: (U, Iterable[U]) => R): Either[R, SizedVector[N, V]]
- def unzip[U, V](implicit ev: <:<[T, (U, V)]): (SizedVector[N, U], SizedVector[N, V])
Unzips the collection, if the element type is a Tuple2
Unzips the collection, if the element type is a Tuple2
Author:
Harshad Deo
- U
Element type of the first collection produced by unzipping
- V
Element type of the second collection produced by unzipping
- Since
0.1
- def updated[B >: T](i: LiteralHash[Int], b: B)(implicit ev: TrueConstraint[<[ValueHash, N]]): SizedVector[N, B]
Updates the element at the index
Updates the element at the index
Author:
Harshad Deo
- B
Type of the replacement element
- Since
0.1
- 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 zip[U, N1 <: Dense](that: SizedVector[N1, U]): SizedVector[Min[N, N1], (T, U)]
Zips with the other SizedVector.
Zips with the other SizedVector. The size of the resultant collection is equal to the minimum of the sizes of the input collections
Author:
Harshad Deo
- U
Element type of the argument
- N1
Size of the argument
- Since
0.1
- def zipWithIndex: SizedVector[N, (T, Int)]
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
- Deprecated
(Since version ) see corresponding Javadoc for more information.
- def →[B](y: B): (SizedVector[N, T], B)
- Implicit
- This member is added by an implicit conversion from SizedVector[N, T] toArrowAssoc[SizedVector[N, T]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->
instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.