Skip to content

typing: define SortFunction protocol for benchmark sorts #15558

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
satyaharendrarushidayaka-sudo wants to merge 1 commit into from
Closed

typing: define SortFunction protocol for benchmark sorts #15558

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 7 additions & 2 deletions sorts/benchmark_sorts.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@

import random
import sys
from collections.abc import Callable, Sequence
from collections.abc import Sequence
from itertools import pairwise
from timeit import timeit
from typing import Protocol
Expand All @@ -37,8 +37,13 @@
from sorts.shell_sort import shell_sort
from sorts.tim_sort import tim_sort


class SortFunction(Protocol):
def __call__[T](self, collection: list[T], /) -> Sequence[T]: ...


# name -> callable. Every callable accepts a list and returns the sorted list.
SORTS: dict[str, Callable[[list[int]], Sequence[int]]] = {
SORTS: dict[str, SortFunction] = {
"bubble_sort": bubble_sort_iterative,
"cocktail_shaker_sort": cocktail_shaker_sort,
"comb_sort": comb_sort,
Expand Down
Loading