number*
Source: /avail/Avail/Foundation/Tuples
Categories: Tuples, Sorting
Construct and answer a sorted variant of
numbers using the quicksort algorithm.
When overriding quicksort_, only target tuple types that contain at least two elements. Not only do the trivial cases of 0 and 1 elements have a simple universal implementation, the 0-element (i.e., empty tuple) case causes ambiguous resolution if multiple overrides exist that will accept it.
|
Position |
Name |
Type |
Description |
Parameters |
1 |
numbers |
number* |
A tuple of numbers.
|
Returns |
number* |
A tuple of numbers in ascending order.
|
string*
Source: /avail/Avail/Foundation/Strings
Categories: Strings, Sorting
Quicksort a tuple of strings in ascending order.
|
Position |
Name |
Type |
Description |
Parameters |
1 |
strings |
string* |
The tuple of strings to sort
|
Returns |
string* |
A sorted tuple of strings
|
tuple meta
Source: /avail/Avail/Foundation/Tuples