Difference between revisions of "LlListSort"
Jump to navigation
Jump to search
Search JIRA for related Issues
| Line 2: | Line 2: | ||
|func_id=184|func_sleep=0.0|func_energy=10.0 | |func_id=184|func_sleep=0.0|func_energy=10.0 | ||
|func=llListSort|return_type=list | |func=llListSort|return_type=list | ||
|p1_type=list|p1_name=src | |p1_type=list|p1_name=src|p1_desc=List to be sorted. | ||
|p2_type=integer|p2_name=stride|p2_desc=number of entries per stride, if less then 1 it is assumed to be 1. | |p2_type=integer|p2_name=stride|p2_desc=number of entries per stride, if less then 1 it is assumed to be 1. | ||
|p3_type=integer|p3_name=ascending|p3_desc=if {{LSLG|FALSE}} then the sort order is desending, otherwise the order is assending. | |p3_type=integer|p3_name=ascending|p3_desc=if {{LSLG|FALSE}} then the sort order is desending, otherwise the order is assending. | ||
| Line 8: | Line 8: | ||
|func_desc | |func_desc | ||
|return_text=that is '''src''' sorted by '''stride'''. | |return_text=that is '''src''' sorted by '''stride'''. | ||
|spec=The sort order is effected by type.<br/> | |spec=A bubble sort is employed to perform the sort.<br/> | ||
The sort order is effected by type.<br/> | |||
Each type is sorted individually and then feathered to have the same order of types. | Each type is sorted individually and then feathered to have the same order of types. | ||
<pre>llListSort([1, "C", 3, "A", 2, "B"], 1, TRUE) == [1, "A", 2, "B", 3, "C"] | <pre>llListSort([1, "C", 3, "A", 2, "B"], 1, TRUE) == [1, "A", 2, "B", 3, "C"] | ||
| Line 30: | Line 31: | ||
|cat3 | |cat3 | ||
|cat4 | |cat4 | ||
|location=lsa_bubble_sort(): 'linden\indra\lscript\lscript_alloc.h' | |||
}} | }} | ||
Revision as of 09:52, 13 February 2007
| LSL Portal | Functions | Events | Types | Operators | Constants | Flow Control | Script Library | Categorized Library | Tutorials |
Summary
Function: list llListSort( list src, integer stride, integer ascending );| 184 | Function ID |
| 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"]
Caveats
Examples
Deep Notes
Source
lsa_bubble_sort(): 'linden\indra\lscript\lscript_alloc.h'
Signature |
|---|
function list llListSort( list src, integer stride, integer ascending ); |