FSTraversable

Value Members

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

   

   Definition Classes

   Any

2. final def ##(): Int

   

   Definition Classes

   Any

3. def ---(ys: Traversable[T]): Repr

   

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

   

   Definition Classes

   Any

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def collectFirstOpt[U](f: (T) ⇒ Option[U]): Option[U]

   

7. def countDistinctBy[U](f: (T) ⇒ U): Int

   

8. def crowd[K](limit: Int, p: (T) ⇒ K): CC[T]

   

   Return a sublist of items where at most N items for any given predicate value are included.

   Return a sublist of items where at most N items for any given predicate value are included. Preserves order within a group, but not the order of predicates (yet!).

9. def distinctBy[U](f: (T) ⇒ U): CC[T]

   

10. def distinctCounts: Map[T, Int]

    

    Return a Map whose keys are the items in this Iterable, and whose values are the number of times that item occurred in the list

11. def flatDistinctBy[U](f: (T) ⇒ Option[U]): CC[T]

    

12. def flatGroupBy[S](f: (T) ⇒ Option[S]): Map[S, Repr]

    

13. def flatMapAccum[A, B](a: A)(f: (A, T) ⇒ (A, TraversableOnce[B])): (A, CC[B])

    

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

    

    Definition Classes

    AnyVal → Any

15. def groupWhile(f: (T, T) ⇒ Boolean): CC[CC[T]]

    

    Return a list of lists divided by the provided predicate.

16. def has(e: T): Boolean

    

17. def histogramBy[U](f: (T) ⇒ U): Vector[(U, Int)]

    

    Return a histogram (sequence of (item, count) elements) by a given function.

    Return a histogram (sequence of (item, count) elements) by a given function.

    Usage: Seq("Do", "Re", "Mi", "Fa", "So", "La", "Ti", "Do").histogramBy(_.last) // returns: Vector((o,3), (a,2), (i,2), (e,1))

18. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

19. def mapAccum[A, B](a: A)(f: (A, T) ⇒ (A, B)): (A, CC[B])

    

20. def maxByOption[U](f: (T) ⇒ U)(implicit ord: Ordering[U]): Option[T]

    

21. def maxOption(implicit ord: Ordering[T]): Option[T]

    

22. def minByOption[U](f: (T) ⇒ U)(implicit ord: Ordering[U]): Option[T]

    

    Return the smallest element from the Seq according to the supplied sort function.

23. def minOption(implicit ord: Ordering[T]): Option[T]

    

24. def mkJoin[S >: T](sep: S): CC[S]

    

    Create a new collection which separates the elements of the original collection by sep

25. def newBuilder[A]: Builder[A, CC[A]]

    

26. def partitionN(fs: (T) ⇒ Boolean*): Seq[Seq[T]]

    

    Partition a list by an arbitrary set of predicates.

    Partition a list by an arbitrary set of predicates. The output is a list of lists, where the index in that list indicates which predicate the element passed. The remainder (those elements that did not pass any test) is stored at index fs.size.

    Example: (0 to 10).partitionN((x: Int) => x % 3 =? 0, (x: Int) => x % 5 =? 0) // returns: Vector(Vector(0, 3, 6, 9), Vector(5, 10), Vector(1, 2, 4, 7, 8))

27. def tailOption: Option[Repr]

    

28. def toString(): String

    

    Definition Classes

    Any

29. val xs: TraversableLike[T, Repr] with GenericTraversableTemplate[T, CC]