SizedVector

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def +(other: String): String

   

   Implicit information

   This member is added by an implicit conversion from SizedVector[N, T] to any2stringadd[SizedVector[N, T]] performed by method any2stringadd in scala.Predef.

   Definition Classes

   any2stringadd

4. 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

5. 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

6. def ->[B](y: B): (SizedVector[N, T], B)

   

   Implicit information

   This member is added by an implicit conversion from SizedVector[N, T] to ArrowAssoc[SizedVector[N, T]] performed by method ArrowAssoc in scala.Predef.

   Definition Classes

   ArrowAssoc

   Annotations

   @inline()

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

8. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

9. 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

10. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

11. val backing: Vector[T]

    

12. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

13. 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

14. 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

15. def ensuring(cond: (SizedVector[N, T]) ⇒ Boolean, msg: ⇒ Any): SizedVector[N, T]

    

    Implicit information

    This member is added by an implicit conversion from SizedVector[N, T] to Ensuring[SizedVector[N, T]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

16. def ensuring(cond: (SizedVector[N, T]) ⇒ Boolean): SizedVector[N, T]

    

    Implicit information

    This member is added by an implicit conversion from SizedVector[N, T] to Ensuring[SizedVector[N, T]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

17. def ensuring(cond: Boolean, msg: ⇒ Any): SizedVector[N, T]

    

    Implicit information

    This member is added by an implicit conversion from SizedVector[N, T] to Ensuring[SizedVector[N, T]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

18. def ensuring(cond: Boolean): SizedVector[N, T]

    

    Implicit information

    This member is added by an implicit conversion from SizedVector[N, T] to Ensuring[SizedVector[N, T]] performed by method Ensuring in scala.Predef.

    Definition Classes

    Ensuring

19. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

20. def equals(other: Any): Boolean

    

    Definition Classes

    SizedVector → AnyRef → Any

21. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

22. 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

23. def formatted(fmtstr: String): String

    

    Implicit information

    This member is added by an implicit conversion from SizedVector[N, T] to StringFormat[SizedVector[N, T]] performed by method StringFormat in scala.Predef.

    Definition Classes

    StringFormat

    Annotations

    @inline()

24. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

25. def hashCode(): Int

    

    Definition Classes

    SizedVector → AnyRef → Any

26. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

27. def length(implicit ev: DenseIntRep[N]): Int

    

    Value level length of this

    Value level length of this

    Author:

    Harshad Deo

    Since

    0.1

28. 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

29. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

30. final def notify(): Unit

    

    Definition Classes

    AnyRef

31. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

32. def parmap[U](f: (T) ⇒ U): SizedVector[N, U]

    

    Parallel map operation

    Parallel map operation

    Author:

    Harshad Deo

    U

    Element type of resultant collection

    Since

    0.6.2

33. def reverse: SizedVector[N, T]

    

    Reverses this

    Reverses this

    Author:

    Harshad Deo

    Since

    0.1

34. 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

35. 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

36. 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

37. 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

38. 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

39. 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

40. 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

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

    

    Definition Classes

    AnyRef

42. 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

43. 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

44. def toString(): String

    

    Definition Classes

    SizedVector → AnyRef → Any

45. 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

46. def traverse[U, V, R](f: (T) ⇒ Either[U, V])(acc: (U, Iterable[U]) ⇒ R): Either[R, SizedVector[N, V]]

    

47. 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

48. 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

49. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

51. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

52. 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

53. def →[B](y: B): (SizedVector[N, T], B)

    

    Implicit information

    This member is added by an implicit conversion from SizedVector[N, T] to ArrowAssoc[SizedVector[N, T]] performed by method ArrowAssoc in scala.Predef.

    Definition Classes

    ArrowAssoc