trait SelectLike extends Select
Given a function for finding approximate medians, this will create an exact median finder.
- Alphabetic
- By Inheritance
- SelectLike
- Select
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
##(): Int
- Definition Classes
- Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def equalSpan[A](data: Array[A], offset: Int, stride: Int)(implicit o: Order[A]): Int
-
def
equals(arg0: Any): Boolean
- Definition Classes
- Any
-
def
hashCode(): Int
- Definition Classes
- Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def partition[A](data: Array[A], left: Int, right: Int, stride: Int)(m: A)(implicit o: Order[A]): Int
-
final
def
select[A](data: Array[A], left: Int, right: Int, stride: Int, k: Int)(implicit arg0: Order[A]): Unit
- Attributes
- protected
- Annotations
- @tailrec()
-
final
def
select[A](data: Array[A], k: Int)(implicit arg0: Order[A], arg1: ClassTag[A]): Unit
Puts the k-th element of data, according to some Order, in the k-th position.
Puts the k-th element of data, according to some Order, in the k-th position. All values before k are less than or equal to data(k) and all values above k are greater than or equal to data(k).
This is an in-place algorithm and is not stable and it WILL mess up the order of equal elements.
- Definition Classes
- SelectLike → Select
- final def sort[A](data: Array[A], left: Int, right: Int, stride: Int)(implicit o: Order[A]): Unit
-
def
toString(): String
- Definition Classes
- Any