sort: Difference between revisions

Latest revision as of 01:23, 2 February 2024

1.44

Hover & click on the images for description

Description

Description:: Attempts to sort given array either in ascending (true) or descending (false) order.
⚠
This will modify the original array!
Groups:: Arrays

Syntax

Syntax:

array sort order

Parameters:

array: Array - array to be sorted, can also be a nested array.

All array elements should be one of the following types:

String - Array of strings ["a","b","c"...]
Number - Array of numbers [1,2,3...]
Array - Array of subarrays [["a",1,2],["b",3,4],["c",5,6]...]. Subarrays should be of the same structure. Subarray elements other than String or Number will be ignored during sorting.

Mixed arrays ["a",1,[true], ...] are not supported and results are undefined.

order: Boolean - sorting order.

true: ascending
false: descending

Return Value:

Nothing

Examples

Example 1:: _arr = [5.21725,1.30859,4,5.03028,1]; _arr sort true; hint str _arr; //[1,1.30859,4,5.03028,5.21725]
Example 2:: _dev = ["ja","pa","pa","tram","tara"]; _dev sort false; hint str _dev; //["tram","tara","pa","pa","ja"]
Example 3:: #define ASC true #define DESC false _scores = [[123,"bob",15],[123,"bill",20],[200,"dave",21],[200,"steve",11]]; _scores sort DESC; hint str _scores; //[[200,"steve",11],[200,"dave",21],[123,"bob",15],[123,"bill",20]]
Example 4:: Sort buildings by distance and return position of the most distant building:
_buildings = player nearObjects ["Land_Cargo_Patrol_V1_F", 500]; _buildings = _buildings apply { [_x distance player, _x] }; _buildings sort false; hint format [ "Most distant building is at %1, distance %2 m", getPos (_buildings select 0 select 1), round (_buildings select 0 select 0) ];

Additional Information

See also:: lbSortBy lnbSortBy BIS_fnc_sortAlphabetically BIS_fnc_sortBy BIS_fnc_sortNum

Notes

: Report bugs on the Feedback Tracker and/or discuss them on the Arma Discord or on the Forums.
Only post proven facts here! Add Note

Killzone_Kid - c: Posted on Apr 16, 2015 - 18:14 (UTC)
: The algorithm for sorting subarrays: compare 1st element, if equal compare 2nd, if equal compare 3rd...etc.

@@ Line 6: / Line 6: @@
 |gr1= Arrays
-|descr= Attempts to sort given array either in ascending ([[true]]) or descending ([[false]]) order. {{Feature|Important|This will '''modify''' the original array!}}
+|descr= Attempts to sort given array either in ascending ([[true]]) or descending ([[false]]) order. {{Feature|important|This will '''modify''' the original array!}}
 |s1= array [[sort]] order
-|p1= array: [[Array]] - Array to be sorted, can also be a nested array.<br><br>
+|p1= array: [[Array]] - array to be sorted, can also be a nested array.<br><br>
 All array elements should be one of the following types:
-* [[String]] - Array of strings {{ic|["a","b","c"...]}}
+* [[String]] - Array of strings {{hl|["a","b","c"...]}}
-* [[Number]] - Array of numbers {{ic|[1,2,3...]}}
+* [[Number]] - Array of numbers {{hl|[1,2,3...]}}
-* [[Array]] - Array of subarrays {{ic|<nowiki>[</nowiki>["a",1,2],["b",3,4],["c",5,6]...]}}. Subarrays should be of the same structure. Subarray elements other than [[String]] or [[Number]] will be ignored during sorting.
+* [[Array]] - Array of subarrays {{hl|[<nowiki/>["a",1,2],["b",3,4],["c",5,6]...]}}. Subarrays should be of the same structure. Subarray elements other than [[String]] or [[Number]] will be ignored during sorting.
-Mixed arrays {{ic|["a",1,[true], ...]}} are not supported and results are undefined.<br><br>
+Mixed arrays {{hl|["a",1,[true], ...]}} are not supported and results are undefined.<br><br>
-|p2= order: [[Boolean]] - Sorting order.
+|p2= order: [[Boolean]] - sorting order.
 * [[true]]: ascending
 * [[false]]: descending
@@ Line 23: / Line 23: @@
 |r1= [[Nothing]]
-|x1= <code>_arr = [5.21725,1.30859,4,5.03028,1];
+|x1= <sqf>_arr = [5.21725,1.30859,4,5.03028,1];
-_arr [[sort]] [[true]];
+_arr sort true;
-[[hint]] [[str]] _arr; //[1,1.30859,4,5.03028,5.21725]</code>
+hint str _arr; //[1,1.30859,4,5.03028,5.21725]</sqf>
-|x2= <code>_dev = ["ja","pa","pa","tram","tara"];
+|x2= <sqf>_dev = ["ja","pa","pa","tram","tara"];
-_dev [[sort]] [[false]];
+_dev sort false;
-[[hint]] [[str]] _dev; //["tram","tara","pa","pa","ja"]</code>
+hint str _dev; //["tram","tara","pa","pa","ja"]</sqf>
-|x3= <code><nowiki>#</nowiki>define ASC true
+|x3= <sqf>
-<nowiki>#</nowiki>define DESC false
+#define ASC true
-_scores = [<nowiki/>[123,"bob",15],[123,"bill",20],[200,"dave",21],[200,"steve",11]];
+#define DESC false
-_scores [[sort]] DESC;
+_scores = [[123,"bob",15],[123,"bill",20],[200,"dave",21],[200,"steve",11]];
-[[hint]] [[str]] _scores; //<nowiki>[</nowiki>[200,"steve",11],[200,"dave",21],[123,"bob",15],[123,"bill",20]]</code>
+_scores sort DESC;
+hint str _scores; //[[200,"steve",11],[200,"dave",21],[123,"bob",15],[123,"bill",20]]
+</sqf>
-|x4= Sort buildings by distance and return position of the most distant building:<code>_buildings = [[player]] [[nearObjects]] ["Land_Cargo_Patrol_V1_F", 500];
+|x4= Sort buildings by distance and return position of the most distant building:
-_buildings = _buildings [[apply]] { [_x [[distance]] [[player]], _x] };
+<sqf>
-_buildings [[sort]] [[false]];
+_buildings = player nearObjects ["Land_Cargo_Patrol_V1_F", 500];
-[[hint]] [[format]] [
+_buildings = _buildings apply { [_x distance player, _x] };
+_buildings sort false;
+hint format [
 	"Most distant building is at %1, distance %2 m",
-	[[getPos]] (_buildings [[select]] 0 [[select]] 1),
+	getPos (_buildings select 0 select 1),
-	[[round]] (_buildings [[select]] 0 [[select]] 0)
+	round (_buildings select 0 select 0)
-];</code>
+];
+</sqf>
-|seealso= [[lbSortBy]] [[lnbSortBy]] [[BIS_fnc_sortAlphabetically]] [[BIS_fnc_sortBy]], [[BIS_fnc_sortNum]]
+|seealso= [[lbSortBy]] [[lnbSortBy]] [[BIS_fnc_sortAlphabetically]] [[BIS_fnc_sortBy]] [[BIS_fnc_sortNum]]
 }}
-<dl class="command_description">
+{{Note
+|user= Killzone_Kid
-<dt></dt>
+|timestamp= 20150416181400
-<dd class="notedate">Posted on April 16, 2015 - 18:14 (UTC)</dd>
+|text= The algorithm for sorting subarrays: compare 1st element, if equal compare 2nd, if equal compare 3rd...etc.
-<dt class="note">[[User:Killzone Kid|Killzone Kid]]</dt>
+}}
-<dd class="note">
-The algorithm for sorting subarrays: compare 1st element, if equal compare 2nd, if equal compare 3rd...etc.
-</dd>
-</dl>