FSIterable

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 chunkFlatMap[V](size: Int)(f: (Repr) ⇒ TraversableOnce[V]): CC[V]

   

   Break a big list into smaller chunks and map each chunk

6. def chunkMap[V](size: Int)(f: (Repr) ⇒ V): CC[V]

   

7. def exactlyOne: Option[T]

   

8. def filterOutWith(pred: (T) ⇒ Boolean, f: (T) ⇒ Unit): CC[T]

   

   Filter out elements that match the predicate, applying the supplied function to each filtered out element, and returning the remaining elements.

9. def flatMapFind[U](f: (T) ⇒ Option[U]): Option[U]

   

   Applies f to each item in the collection until the first Some[U] is found and return it, or None otherwise

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

    

    Definition Classes

    AnyVal → Any

11. def groupByKeyValue[K, V](f: (T) ⇒ (K, V)): Map[K, Seq[V]]

    

    Groups the given sequence by a function that transforms the sequence into keys and values.

    Groups the given sequence by a function that transforms the sequence into keys and values. For example. Seq(1 -> "a", 2 -> "a", "1" -> "b").groupByKeyValue(x => x) will return Map(1 -> List(a, b), 2 -> List(a))

12. def groupByKeyValueSet[K, V](f: (T) ⇒ (K, V)): Map[K, Set[V]]

    

    Groups the given sequence by a function that transforms the sequence into keys and values.

    Groups the given sequence by a function that transforms the sequence into keys and values. For example. Seq(1 -> "a", 2 -> "a", "1" -> "b").groupByKeyValue(x => x) will return Map(1 -> List(a, b), 2 -> List(a))

13. def hasOverlap(ys: Iterable[T]): Boolean

    

14. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

16. def slidingOptPairs: CC[(T, Option[T])]

    

17. def slidingPairs: CC[(T, T)]

    

    Convenience wrapper for Iterable.sliding(2) that gives you #exactlywhatyouwant: tuples instead of Lists

18. def toMapAccumValueSet[K, V](implicit ev: <:<[T, (K, V)]): Map[K, Set[V]]

    

    Like toMap, but accumulates the values into a Set, rather than discarding the values of duplicated keys.

19. def toMapAccumValues[K, V](implicit ev: <:<[T, (K, V)]): Map[K, Seq[V]]

    

    Like toMap, but accumulates the values into a Seq, rather than discarding the values of duplicated keys.

20. def toString(): String

    

    Definition Classes

    Any

21. def topNPartition(size: Int)(implicit ord: Ordering[T]): (CC[T], CC[T])

    

    Returns the top N elements in the Iterable.

    Returns the top N elements in the Iterable. They'll come back in no particular order.

22. def topNSorted(size: Int)(implicit ord: Ordering[T]): Seq[T]

    

    Returns the top N elements in the Iterable.

    Returns the top N elements in the Iterable. They'll come back sorted :)

23. def topNUnsorted(size: Int)(implicit ord: Ordering[T]): CC[T]

    

    Returns the top N elements in the Iterable.

    Returns the top N elements in the Iterable. They'll come back in no particular order.

24. val xs: IterableLike[T, Repr] with GenericTraversableTemplate[T, CC]

    

25. def zipLeftOption[U](ys: Iterable[U]): CC[(T, Option[U])]

    

    Like zip, but continues even after the second iterable has been exhausted.

26. def zipOption[U](ys: Iterable[U]): CC[(Option[T], Option[U])]

    

    Like zip, but doesn't stop until *both* iterables are exhausted.

    Like zip, but doesn't stop until *both* iterables are exhausted. The length of the result will be max(firstList.size, secondList.size).

27. def zipRightOption[U](ys: Iterable[U]): CC[(Option[T], U)]

    

    Like zip, but continues even after the first iterable has been exhausted.