llListSort
Revision as of 17:38, 20 February 2007 by Strife Onizuka (talk | contribs) (LSL llListSort moved to LlListSort: removing prefix)
LSL Portal | Functions | Events | Types | Operators | Constants | Flow Control | Script Library | Categorized Library | Tutorials |
Summary
Function: list llListSort( list src, integer stride, integer ascending );0.0 | Forced Delay |
10.0 | Energy |
Returns a list that is src sorted by stride.
• list | src | – | List to be sorted. | |
• integer | stride | – | number of entries per stride, if less then 1 it is assumed to be 1. | |
• integer | ascending | – | if FALSE then the sort order is desending, otherwise the order is assending. |
Specification
A bubble sort is employed to perform the sort.
The sort order is effected by type.
Each type is sorted individually and then feathered to have the same order of types.
llListSort([1, "C", 3, "A", 2, "B"], 1, TRUE) == [1, "A", 2, "B", 3, "C"] llListSort([1, 3, 2, "C", "A", "B"], 1, TRUE) == [1, 2, 3, "A", "B", "C"] llListSort([1, "C", 3, "A", 2, "B"], 2, TRUE) == [1, "C", 2, "B", 3, "A"]