SeqOps

Instance Constructors

new SeqOps(as: CC[A])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fromArray(arr: Array[A])(implicit cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

Attributes
protected[this]
def fromSizeAndArray(size: Int, arr: Array[A])(implicit cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

Attributes
protected[this]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def pmax(implicit ev: PartialOrder[A]): Seq[A]

Computes the maximal elements of a partially ordered set.
Computes the maximal elements of a partially ordered set. If the posset contains multiple copies of a maximal element, the function will only return a single copy of it.
def pmin(implicit ev: PartialOrder[A]): Seq[A]

Computes the minimal elements of a partially ordered set.
Computes the minimal elements of a partially ordered set. If the poset contains multiple copies of a minimal element, the function will only return a single copy of it.
def qchoose(implicit gen: Generator): A
def qcombine(implicit ev: Monoid[A]): A
def qmax(implicit ev: Order[A]): A
def qmean(implicit ev: Field[A]): A
def qmeanWith[R](f: (A) ⇒ R)(implicit ev: Field[R]): R
def qmin(implicit ev: Order[A]): A
def qnorm(p: Int)(implicit ev: Field[A], s: Signed[A], nr: NRoot[A]): A
def qnormWith[R](p: Int)(f: (A) ⇒ R)(implicit ev: Field[R], s: Signed[R], nr: NRoot[R]): R
def qproduct(implicit ev: MultiplicativeMonoid[A]): A
def qsampled(n: Int)(implicit gen: Generator, ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]
def qselected(k: Int)(implicit ev: Order[A], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]
def qselectk(k: Int)(implicit ev: Order[A], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]
def qshuffled(implicit gen: Generator, ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]
def qsorted(implicit ev: Order[A], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]
def qsortedBy[B](f: (A) ⇒ B)(implicit ev: Order[B], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]
def qsortedWith(f: (A, A) ⇒ Int)(implicit ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]
def qsum(implicit ev: AdditiveMonoid[A]): A
def qtopk(k: Int)(implicit ev: Order[A], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package std

final class SeqOps[A, CC[A] <: Iterable[A]] extends AnyRef

Instance Constructors

new SeqOps(as: CC[A])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fromArray(arr: Array[A])(implicit cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

def fromSizeAndArray(size: Int, arr: Array[A])(implicit cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pmax(implicit ev: PartialOrder[A]): Seq[A]

def pmin(implicit ev: PartialOrder[A]): Seq[A]

def qchoose(implicit gen: Generator): A

def qcombine(implicit ev: Monoid[A]): A

def qmax(implicit ev: Order[A]): A

def qmean(implicit ev: Field[A]): A

def qmeanWith[R](f: (A) ⇒ R)(implicit ev: Field[R]): R

def qmin(implicit ev: Order[A]): A

def qnorm(p: Int)(implicit ev: Field[A], s: Signed[A], nr: NRoot[A]): A

def qnormWith[R](p: Int)(f: (A) ⇒ R)(implicit ev: Field[R], s: Signed[R], nr: NRoot[R]): R

def qproduct(implicit ev: MultiplicativeMonoid[A]): A

def qsampled(n: Int)(implicit gen: Generator, ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

def qselected(k: Int)(implicit ev: Order[A], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

def qselectk(k: Int)(implicit ev: Order[A], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

def qshuffled(implicit gen: Generator, ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

def qsorted(implicit ev: Order[A], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

def qsortedBy[B](f: (A) ⇒ B)(implicit ev: Order[B], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

def qsortedWith(f: (A, A) ⇒ Int)(implicit ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

def qsum(implicit ev: AdditiveMonoid[A]): A

def qtopk(k: Int)(implicit ev: Order[A], ct: ClassTag[A], cbf: CanBuildFrom[CC[A], A, CC[A]]): CC[A]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped