FSSeq

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 getClass(): Class[_ <: AnyVal]

   

   Definition Classes

   AnyVal → Any

6. def has(e: T): Boolean

   

7. def indexOfOption(target: T): Option[Int]

   

   Like indexOf but returns None instead of -1 if the element is not in the list

8. def indexWhereOption(pred: (T) ⇒ Boolean): Option[Int]

   

   Like findIndexOf but returns None instead of -1 if the element is not in the list

9. def insertAfter(predicateFn: (T) ⇒ Boolean, newElement: T): CC[T]

   

   Inserts a new element into the sequence after the first element which matches the predicate.

   Inserts a new element into the sequence after the first element which matches the predicate. If the predicate isn't matched then the newElement will not be inserted.

   predicateFn

   function for determining which element to insert after

   newElement

   new element to be added

   returns

   a new sequence with the element inserted

10. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

11. def median(implicit ord: Ordering[T]): T

    

    Finds the median value in an unsorted list in O(n) expected time.

    Finds the median value in an unsorted list in O(n) expected time. Will throw if the list is empty.

12. def medianOpt(implicit ord: Ordering[T]): Option[T]

    

    Finds the median value in an unsorted list in O(n) expected time.

    Finds the median value in an unsorted list in O(n) expected time. Does not throw if the list is empty as you probably don't want that.

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

    

14. final def nth(target: Int)(implicit ord: Ordering[T]): Option[T]

    

    Finds the nth smallest value in an unsorted list in O(n) time and O(1) space ie List(3,2,4,1).nth(0) => 1 and List(3,2,4,1).nth(2) => 3

15. final def pth[S](target: Double)(implicit ev: (T) ⇒ (S, Double), ord: Ordering[S]): Option[S]

    

    Finds the item at the target cumulative weight in an unsorted weighted list in O(n) time.

16. def sample(p: Double): CC[T]

    

17. def sample(n: Int): CC[T]

    

    Returns n randomly selected elements from the given list

18. def sortByDesc[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): Repr

    

19. def sortedDesc[B >: T](implicit ord: Ordering[B]): Repr

    

20. def toString(): String

    

    Definition Classes

    Any

21. val xs: SeqLike[T, Repr] with GenericTraversableTemplate[T, CC]

    

22. def yankToIndex(index: Int, pred: (T) ⇒ Boolean): CC[T]