Sort[A: Seq[B] ref, B: Comparable[B] #read]

Implementation of dual-pivot quicksort.

primitive val Sort[A: Seq[B] ref, B: Comparable[B] #read]

Constructors

create

new val create()
: Sort[A, B] val^

Returns


Public Functions

apply

Sort the given seq.

fun box apply(
  a: A)
: A^

Parameters

  • a: A

Returns

  • A^

eq

fun box eq(
  that: Sort[A, B] val)
: Bool val

Parameters

  • that: Sort[A, B] val

Returns


ne

fun box ne(
  that: Sort[A, B] val)
: Bool val

Parameters

  • that: Sort[A, B] val

Returns


Private Functions

_sort

fun box _sort(
  a: A,
  lo: ISize val,
  hi: ISize val)
: None val ?

Parameters

Returns


_swap

fun box _swap(
  a: A,
  i: ISize val,
  j: ISize val)
: None val ?

Parameters

Returns