KollFlitzSeqLike

Value Members

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

   Definition Classes

   Any

2. final def ##(): Int

   Definition Classes

   Any

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

   Definition Classes

   Any

4. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5. def differentiate[To](implicit num: Numeric[A], cbf: CanBuildFrom[Repr, A, To]): To

   Differentiates the collection by calculating the pairwise difference of the elements.

   Differentiates the collection by calculating the pairwise difference of the elements.

   To

   the result collection type

   num

   the numerical view of the elements

   cbf

   the result type builder factory

   returns

   a new collection having a size one less than the input collection. the first element will be the different of the second and first element of the input sequence, etc.

6. def foreachPair(fun: (A, A) ⇒ Unit): Unit

7. def getClass(): Class[_ <: AnyVal]

   Definition Classes

   AnyVal → Any

8. def groupWith[To](p: (A, A) ⇒ Boolean)(implicit cbf: CanBuildFrom[Repr, A, To]): Iterator[To]

   Clumps the collection into groups based on a predicate which determines if successive elements belong to the same group.

   Clumps the collection into groups based on a predicate which determines if successive elements belong to the same group.

   For example: {{ val x = List("a", "a", "b", "a", "b", "b") x.groupWith(_ == _).to[Vector] }}

   produces Vector(List("a", "a"), List("b"), List("a"), List("b", "b")).

   To

   the group type

   p

   a function which is evaluated with successive pairs of the input collection. As long as the predicate holds (the function returns true), elements are lumped together. When the predicate becomes false, a new group is started.

   cbf

   a builder factory for the group type

   returns

   an iterator over the groups.

9. def integrate[To](implicit num: Numeric[A], cbf: CanBuildFrom[Repr, A, To]): To

   Integrates the collection by aggregating the elements step by step.

   Integrates the collection by aggregating the elements step by step.

   To

   the result collection type

   num

   the numerical view of the elements

   cbf

   the result type builder factory

   returns

   a new collection having the same size as the input collection. the first element will be identical to the first element in the input sequence, the second element will be the sum of the first and second element of the input sequence, etc.

10. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

11. def isSorted[B >: A](implicit ord: Ordering[B]): Boolean

12. def isSortedBy[B](fun: (A) ⇒ B)(implicit ord: Ordering[B]): Boolean

13. def mapPairs[B, To](fun: (A, A) ⇒ B)(implicit cbf: CanBuildFrom[Repr, B, To]): To

14. val self: SeqLike[A, Repr] with Repr

15. def sortByT[B](f: (A) ⇒ B)(implicit ord: Ordering[B]): @@[Repr, Sorted]

16. def sortWithT(lt: (A, A) ⇒ Boolean): @@[Repr, Sorted]

17. def sortedT[B >: A](implicit ord: Ordering[B]): @@[Repr, Sorted]

18. def toString(): String

    Definition Classes

    Any