Class

io.fsq.common.scala

FSSeq

Related Doc: package scala

Permalink

final class FSSeq[CC[X] <: Seq[X], T, Repr <: SeqLike[T, Repr] with GenericTraversableTemplate[T, CC]] extends AnyVal

Linear Supertypes
AnyVal, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. FSSeq
  2. AnyVal
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new FSSeq(xs: SeqLike[T, Repr] with GenericTraversableTemplate[T, CC])

    Permalink

Value Members

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

    Permalink
    Definition Classes
    Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def getClass(): Class[_ <: AnyVal]

    Permalink
    Definition Classes
    AnyVal → Any
  6. def has(e: T): Boolean

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

    Permalink

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

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

    Permalink

    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]

    Permalink

    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

    Permalink
    Definition Classes
    Any
  11. def newBuilder[A]: Builder[A, CC[A]]

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

    Permalink

    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

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

    Permalink

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

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

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

    Permalink

    Returns n randomly selected elements from the given list

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

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

    Permalink
  18. def toString(): String

    Permalink
    Definition Classes
    Any
  19. val xs: SeqLike[T, Repr] with GenericTraversableTemplate[T, CC]

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

    Permalink

Inherited from AnyVal

Inherited from Any

Ungrouped