From bdc65945f8d434242fdac6e8e3e4623e327bc994 Mon Sep 17 00:00:00 2001 From: Dubiousjim Date: Tue, 11 Jun 2024 21:07:15 +0200 Subject: [PATCH] rename stable_sort to stablesort --- ...nction-table-stable-sort.md => function-table-stablesort.md} | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) rename docs/{function-table-stable-sort.md => function-table-stablesort.md} (99%) diff --git a/docs/function-table-stable-sort.md b/docs/function-table-stablesort.md similarity index 99% rename from docs/function-table-stable-sort.md rename to docs/function-table-stablesort.md index 8462f74..908bb4d 100644 --- a/docs/function-table-stable-sort.md +++ b/docs/function-table-stablesort.md @@ -21,7 +21,7 @@ The best stable sorting algorithms I know of are Python's [timsort](https://en.w The proposed API would be: -`table.stable_sort : (t: {V}, lt: ((V, V) -> boolean)?, reverse: boolean?) -> ()` +`table.stablesort : (t: {V}, lt: ((V, V) -> boolean)?, reverse: boolean?) -> ()` (Or alternatively, this could replace `table.sort` but be behind a feature flag.)