final
class
ArrayOps[A] extends AnyRef
Instance Constructors
-
new
ArrayOps(arr: Array[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
-
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
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
qsampled(n: Int)(implicit gen: Generator, ct: ClassTag[A]): Array[A]
-
def
qsearch(a: A)(implicit ev: Order[A]): Int
-
def
qselect(k: Int)(implicit ev: Order[A], ct: ClassTag[A]): Unit
-
def
qselected(k: Int)(implicit ev: Order[A], ct: ClassTag[A]): Array[A]
-
def
qshuffle()(implicit gen: Generator): Unit
-
def
qshuffled(implicit gen: Generator): Array[A]
-
def
qsort(implicit ev: Order[A], ct: ClassTag[A]): Unit
-
def
qsortBy[B](f: (A) ⇒ B)(implicit ev: Order[B], ct: ClassTag[A]): Unit
-
def
qsortWith(f: (A, A) ⇒ Int)(implicit ct: ClassTag[A]): Unit
-
def
qsorted(implicit ev: Order[A], ct: ClassTag[A]): Array[A]
-
def
qsortedBy[B](f: (A) ⇒ B)(implicit ev: Order[B], ct: ClassTag[A]): Array[A]
-
def
qsortedWith(f: (A, A) ⇒ Int)(implicit ct: ClassTag[A]): Array[A]
-
def
qsum(implicit ev: AdditiveMonoid[A]): 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
