sorts.adaptive_merge_sort

Classes

Comparable

Base class for protocol classes.

Functions

adaptive_merge_sort(→ list[T])
adaptive_merge_sort_helper(→ None)
merge(→ None)

Module Contents

class sorts.adaptive_merge_sort.Comparable

Bases: Protocol

Base class for protocol classes.

Protocol classes are defined as:

class Proto(Protocol):
    def meth(self) -> int:
        ...

Such classes are primarily used with static type checkers that recognize structural subtyping (static duck-typing).

For example:

class C:
    def meth(self) -> int:
        return 0

def func(x: Proto) -> int:
    return x.meth()

func(C())  # Passes static type check

See PEP 544 for details. Protocol classes decorated with @typing.runtime_checkable act as simple-minded runtime protocols that check only the presence of given attributes, ignoring their type signatures. Protocol classes can be generic, they are defined as:

class GenProto[T](Protocol):
    def meth(self) -> T:
        ...

__lt__(other: object, /) → bool

sorts.adaptive_merge_sort.adaptive_merge_sort[T: Comparable](sequence: list[T]) → list[T]

sorts.adaptive_merge_sort.adaptive_merge_sort_helper[T: Comparable](array: list[T], aux: list[T], low: int, high: int) → None

sorts.adaptive_merge_sort.merge[T: Comparable](array: list[T], aux: list[T], low: int, mid: int, high: int) → None