numpy.sorting
insertionsort(start: Ptr[T], n: int, T: type)
ainsertionsort(v: Ptr[T], tosort: Ptr[int], n: int, T: type)
heapsort(start: Ptr[T], n: int, T: type)
aheapsort(vv: Ptr[T], tosort: Ptr[int], n: int, T: type)
PYA_QS_STACK: Literal[int] = 100
SMALL_QUICKSORT: Literal[int] = 15
SMALL_MERGESORT: Literal[int] = 20
SMALL_STRING: Literal[int] = 16
mergesort(start: Ptr[T], num: int, T: type)
amergesort(v: Ptr[T], tosort: Ptr[int], num: int, T: type)
INSERTION_SORT_THRESHOLD: Literal[int] = 24
NINTHER_THRESHOLD: Literal[int] = 128
PARTIAL_INSERTION_SORT_LIMIT: Literal[int] = 8
quicksort(start: Ptr[T], n: int, T: type)
aquicksort(start: Ptr[T], tosort: Ptr[int], n: int, T: type)
key_of(x: UT, T: type, UT: type)
nth_byte(key: T, l: int, T: type)
radixsort(start: Ptr[T], num: int, T: type)
aradixsort(start: Ptr[T], tosort: Ptr[int], num: int, T: type)
TIMSORT_STACK_SIZE: Literal[int] = 128
class Buffer[T]
Fields
3
pw
Ptr[T]
size
int
T
type
Constructors
1
Methods
2
timsort(start: Ptr[T], num: int, T: type)
atimsort(start: Ptr[T], tosort: Ptr[int], num: int, T: type)
stablesort(start: Ptr[T], num: int, T: type)
astablesort(start: Ptr[T], tosort: Ptr[int], num: int, T: type)
MAX_PIVOT_STACK: Literal[int] = 50
class Sortee[T]
Fields
2
v
Ptr[T]
T
type
Methods
1
Special methods
1
class ArgSortee
Fields
1
tosort
Ptr[int]
Methods
1
Special methods
1
class ArgIdx
Fields
1
tosort
Ptr[int]
Special methods
1
partition(a, kth, axis = -1, kind: str = "introselect")
argpartition(a: ndarray, kth, axis = -1, kind: str = "introselect")
lexsort(keys, axis: int = -1)
sort(a, axis = -1, kind: Optional[str] = None)
argsort(a, axis = -1, kind: Optional[str] = None)
sort_complex(a)