SPVM::Sort(3)
π¦ SPVM::Sort(3) β Sorting Functions π¦
bestie, welcome to SPVM::Sort(3), aka the SPVM sorting-functions page. It's giving stable merge sort, in-place glow-ups, and a whole lot of comparator energy. I'm obsessed. π
β¨ Name β¨
SPVM::Sort β Sorting Functions. That's the whole vibe.
πΈ Usage πΈ
okay so here's the full demo dump, exactly as written β every example, every comment, every little crumb. π
# Sort a byte array in-place by asc order
my $array = [(byte)2, 3, 1];
Sort->sort_byte($array, method : int ($a : int, $b : int) {
return $a <=> $b;
});
# Sort short array in-place by asc order
my $array = [(short)2, 3, 1];
Sort->sort_short($array, method : int ($a : int, $b : int) {
return $a <=> $b;
});
# Sort int array in-place by asc order
my $array = [2, 3, 1];
Sort->sort_int($array, method : int ($a : int, $b : int) {
return $a <=> $b;
});
# Sort long array in-place by asc order
my $array = [(long)2, 3, 1];
Sort->sort_long($array, method : int ($a : long, $b : long) {
return $a <=> $b;
});
# Sort float array in-place by asc order
my $array = [(float)2, 3, 1];
Sort->sort_float($array, method : int ($a : float, $b : float) {
return $a <=> $b;
});
# Sort double array in-place by asc order
my $array = [(double)2, 3, 1];
Sort->sort_double($array, method : int ($a : double, $b : double) {
return $a <=> $b;
});
# Sort string array in-place by asc order
my $array = ["11", "1", "2", undef, ""];
Sort->sort_string($array, method : int ($a : string, $b : string) {
return $a cmp $b;
});
# Sort object array in-place by asc order
my $minimals = new TestCase::Minimal[3];
$minimals->[0] = TestCase::Minimal->new;
$minimals->[0]{x} = 3;
$minimals->[0]{y} = 5;
$minimals->[1] = TestCase::Minimal->new;
$minimals->[1]{x} = 3;
$minimals->[1]{y} = 7;
$minimals->[2] = TestCase::Minimal->new;
$minimals->[2]{x} = 2;
$minimals->[2]{y} = 9;
Sort->sort_object($minimals, method : int ($object1 : object, $object2 : object) {
my $minimal1 = (TestCase::Minimal)$object1;
my $minimal2 = (TestCase::Minimal)$object2;
return $minimal1->{x} <=> $minimal2->{x} || $minimal1->{y} <=> $minimal2->{y};
});
π Description π
Sort provides sorting functions, and the sorting algorithm is a stable merge sort. Yes bestie, stable β equal elements don't get chaotic. Iconic behavior. β¨
π Class Methods π
π sort_byte π
static method sort_byte : void ($array : byte[], $comparator : Comparator::Int, $offset : int = 0, $length : int = -1);
Sorts the range of the elements of byte $array in-place. The sorted range is from $offset to the position proceeded by $length.
If the length is less than 0, the length to the end of the string is calculated from the length of the array and the offset.
The Comparator::Int comparator is used to compare each element.
Exceptions:
$arraymust be defined.$offsetmust be greater than or equal to0.$comparatormust be defined.$offset + lengthmust be less than or equal to the length of$elements.
π sort_byte_asc π
method sort_byte_asc : void ($array : byte[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_byte:
Sort->sort_byte($array, method : int ($a : int, $b : int) { return $a <=> $b; }, $offset, $length);
π¦ sort_byte_desc π¦
static method sort_byte_desc : void ($array : byte[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_byte:
Sort->sort_byte($array, method : int ($a : int, $b : int) { return $b <=> $a; }, $offset, $length);
β sort_double β
static method sort_double : void ($array : double[], $comparator : Comparator::Double, $offset : int = 0, $length : int = -1);
Sorts the range of the elements of double $array in-place. The sorted range is from $offset to the position proceeded by $length.
If the length is less than 0, the length to the end of the string is calculated from the length of the array and the offset.
The Comparator::Double comparator is used to compare each element.
Exceptions:
$arraymust be defined.$offsetmust be greater than or equal to0.$comparatormust be defined.$offset + lengthmust be less than or equal to the length of$elements.
π sort_double_asc π
static method sort_double_asc : void ($array : double[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_double:
Sort->sort_double($array, method : int ($a : double, $b : double) { return $a <=> $b; }, $offset, $length);
πΈ sort_double_desc πΈ
static method sort_double_desc : void ($array : double[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_double:
Sort->sort_double($array, method : int ($a : double, $b : double) { return $b <=> $a; }, $offset, $length);
π§ sort_float π§
static method sort_float : void ($array : float[], $comparator : Comparator::Float, $offset : int = 0, $length : int = -1);
Sorts the range of the elements of float $array in-place. The sorted range is from $offset to the position proceeded by $length.
If the length is less than 0, the length to the end of the string is calculated from the length of the array and the offset.
The Comparator::Float comparator is used to compare each element.
Exceptions:
$arraymust be defined.$offsetmust be greater than or equal to0.$comparatormust be defined.$offset + lengthmust be less than or equal to the length of$elements.
π sort_float_asc π
static method sort_float_asc : void ($array : float[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_float:
Sort->sort_float($array, method : int ($a : float, $b : float) { return $a <=> $b; }, $offset, $length);
π sort_float_desc π
static method sort_float_desc : void ($array : float[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_float:
Sort->sort_float($array, method : int ($a : float, $b : float) { return $b <=> $a; }, $offset, $length);
π§ sort_float π§
static method sort_float : void ($array : float[], $comparator : Comparator::Float, $offset : int = 0, $length : int = -1);
Sorts the range of the elements of float $array in-place. The sorted range is from $offset to the position proceeded by $length.
If the length is less than 0, the length to the end of the string is calculated from the length of the array and the offset.
The Comparator::Float comparator is used to compare each element.
Exceptions:
$arraymust be defined.$offsetmust be greater than or equal to0.$comparatormust be defined.$offset + lengthmust be less than or equal to the length of$elements.
π sort_float_asc π
static method sort_float_asc : void ($array : float[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_float:
Sort->sort_float($array, method : int ($a : float, $b : float) { return $a <=> $b; }, $offset, $length);
π sort_float_desc π
static method sort_float_desc : void ($array : float[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_float:
Sort->sort_float($array, method : int ($a : float, $b : float) { return $b <=> $a; }, $offset, $length);
π₯ sort_int π₯
static method sort_int : void ($array : int[], $comparator : Comparator::Int, $offset : int = 0, $length : int = -1);
Sorts the range of the elements of int $array in-place. The sorted range is from $offset to the position proceeded by $length.
If the length is less than 0, the length to the end of the string is calculated from the length of the array and the offset.
The Comparator::Int comparator is used to compare each element.
Exceptions:
$arraymust be defined.$offsetmust be greater than or equal to0.$comparatormust be defined.$offset + lengthmust be less than or equal to the length of$elements.
β¨ sort_int_asc β¨
static method sort_int_asc : void ($array : int[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_int:
Sort->sort_int($array, method : int ($a : int, $b : int) { return $a <=> $b; }, $offset, $length);
π sort_int_desc π
static method sort_int_desc : void ($array : int[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_int:
Sort->sort_int($array, method : int ($a : int, $b : int) { return $b <=> $a; }, $offset, $length);
π sort_long π
static method sort_long : void ($array : long[], $comparator : Comparator::Long, $offset : int = 0, $length : int = -1);
Sorts the range of the elements of long $array in-place. The sorted range is from $offset to the position proceeded by $length.
If the length is less than 0, the length to the end of the string is calculated from the length of the array and the offset.
The Comparator::Long comparator is used to compare each element.
Exceptions:
$arraymust be defined.$offsetmust be greater than or equal to0.$comparatormust be defined.$offset + lengthmust be less than or equal to the length of$elements.
π«Ά sort_long_asc π«Ά
method sort_long_asc : void ($array : long[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_long:
Sort->sort_long($array, method : int ($a : long, $b : long) { return $a <=> $b; }, $offset, $length);
π sort_long_desc π
static method sort_long_desc : void ($array : long[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_long:
Sort->sort_long($array, method : int ($a : long, $b : long) { return $b <=> $a; }, $offset, $length);
π sort_object π
static method sort_object : void ($array : object[], $comparator : Comparator, $offset : int = 0, $length : int = -1);
Sorts the range of the elements of object array in-place. The sorted range is from $offset to the position proceeded by $length.
If the length is less than 0, the length to the end of the string is calculated from the length of the array and the offset.
The Comparator comparator is used to compare each element.
Exceptions:
$offsetmust be greater than or equal to0.$comparatormust be defined.$offset + lengthmust be less than or equal to the length of$elements.
π sort_short π
static method sort_short : void ($array : short[], $comparator : Comparator::Int, $offset : int = 0, $length : int = -1);
Sorts the range of the elements of short $array in-place. The sorted range is from $offset to the position proceeded by $length.
If the length is less than 0, the length to the end of the string is calculated from the length of the array and the offset.
The Comparator::Int comparator is used to compare each element.
Exceptions:
$arraymust be defined.$offsetmust be greater than or equal to0.$comparatormust be defined.$offset + lengthmust be less than or equal to the length of$elements.
β¨ sort_short_asc β¨
static method sort_short_asc : void ($array : short[], $offset : int = 0, $length : int = -1);
This is the alias for the following code using sort_short, bestie β yes, itβs giving βshortcut with main character energyβ:
Sort->sort_short($array, method : int ($a : short, $b : short) { return $a <=> $b; }, $offset, $length);
π
sort_short_desc π
static method sort_short_desc : void ($array : short[], $offset : int = 0, $length : int = -1);
This is the alias for the following code using sort_short β descending order, no cap:
Sort->sort_short($array, method : int ($a : int, $b : int) { return $b <=> $a; }, $offset, $length);
π¦ sort_string π¦
static method sort_string : void ($array : string[], $comparator : Comparator::String, $offset : int = 0, $length : int = -1);
Sorts the range of the elements of string $array in-place. Literally sorting the string array right where it lives, okay?
The sorted range is from $offset to the position proceeded by $length.
If the length is less than 0, the length to the end of the string is calculated from the length of the array and the offset.
The Comparator::Int comparator is used to compare each element.
Exceptions β the vibe check π:
$arraymust be defined.$offsetmust be greater than or equal to 0.$comparatormust be defined.$offset + lengthmust be less than or equal to the length of$elements.
πΈ sort_string_asc πΈ
static method sort_string_asc : void ($array : string[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_string β ascending string energy:
Sort->sort_string($array, method : int ($a : string, $b : string) { return $a cmp $b; }, $offset, $length);
π sort_string_desc π
static method sort_string_desc : void ($array : string[], $offset : int = 0, $length : int = -1);
The alias for the following code using sort_string β descending string energy:
Sort->sort_string($array, method : int ($a : string, $b : string) { return $b cmp $a; }, $offset, $length);
π sort_options_asc π
static method sort_options_asc : void ($options : object[]);
Sorts $options by the dictionary asc order of the key. Iconic little options sorter, fr fr.
Exceptions β bestie, respect the rules π:
$optionsmust be defined. Otherwise an exception is thrown.- The length of
$optionsmust be an even number. Otherwise an exception is thrown. - The key of
$optionsmust be defined. Otherwise an exception is thrown. - The key of
$optionsmust bestringtype. Otherwise an exception is thrown.
Examples β copy this energy β¨:
Sort->sort_options({key2 => 1, key3 => 2, key1 => 3});
π Copyright & License π
Copyright (c) 2023 Yuki Kimoto
MIT License
π Thatβs the whole SPVM::Sort(3) page, bestie β perl v5.42.2, dated 2026-02-03. Go sort something gorgeous. Byeee! π
π¦ where this page comes from
- alpine 3.24: spvm-doc 0.990125-r0 Β· MIT
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms