object
quickSelectImpl extends UFunc
Type Members
-
-
type
Impl2[V1, V2, VR] = UImpl2[quickSelectImpl.this.type, V1, V2, VR]
-
type
Impl3[V1, V2, V3, VR] = UImpl3[quickSelectImpl.this.type, V1, V2, V3, VR]
-
type
Impl4[V1, V2, V3, V4, VR] = UImpl4[quickSelectImpl.this.type, V1, V2, V3, V4, VR]
-
-
-
-
-
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
apply[V1, V2, V3, V4, VR](v1: V1, v2: V2, v3: V3, v4: V4)(implicit impl: Impl4[V1, V2, V3, V4, VR]): VR
-
final
def
apply[V1, V2, V3, VR](v1: V1, v2: V2, v3: V3)(implicit impl: Impl3[V1, V2, V3, VR]): VR
-
final
def
apply[V1, V2, VR](v1: V1, v2: V2)(implicit impl: Impl2[V1, V2, VR]): VR
-
final
def
apply[V, VR](v: V)(implicit impl: Impl[V, VR]): VR
-
final
def
asInstanceOf[T0]: T0
-
implicit
def
canZipMapValuesImpl[T, V1, VR, U](implicit handhold: ScalarOf[T, V1], impl: Impl2[V1, V1, VR], canZipMapValues: CanZipMapValues[T, V1, VR, U]): Impl2[T, T, U]
-
def
clone(): AnyRef
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
-
-
-
-
final
def
inPlace[V, V2, V3](v: V, v2: V2, v3: V3)(implicit impl: generic.UFunc.InPlaceImpl3[quickSelectImpl.this.type, V, V2, V3]): V
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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
-
quickSelectImpl does not clone the input array before doing a quickSelect-sort but instead swaps in place, and therefore, allows other functions to access the intermediate results of the sorting procedure.
After quickSelectImpl is run, it is guaranteed that the input array will be swapped around such that every number left of position will be equal or smaller than the element at position, and every number right of position will be equal or larger than the element at position.
This can be useful when further using the intermediate results downstream. For example, appending an element or updating an element to an array which has already been through
quickSelectImpland then re-calculatingquickSelectImplwill be faster than applying quickSelectImpl de-novo to the original unsorted array.(Since version 0.12) use quickSelect.inPlace instead