LlListSort

Template:Needs Translation/LSL/de Template:Needs Translation/LSL/es Template:Needs Translation/LSL/el Template:Needs Translation/LSL/he Template:Needs Translation/LSL/it Template:Needs Translation/LSL/nl Template:Needs Translation/LSL/hu Template:Needs Translation/LSL/no Template:Needs Translation/LSL/da Template:Needs Translation/LSL/sv Template:Needs Translation/LSL/tr Template:Needs Translation/LSL/pl Template:Needs Translation/LSL/pt Template:Needs Translation/LSL/ru Template:Needs Translation/LSL/th Template:Needs Translation/LSL/uk Template:Needs Translation/LSL/zh-Hans Template:Needs Translation/LSL/zh-Hant

/LSL

ListSort

llListSort

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

A bubble sort is a sorting algorithm with a Big O of N*N. Why Linden Labs did not use a N*log(N) sorting algorithm such as Heap Sort or Merge Sort is unkown...

All Issues ~ Search JIRA for related Bugs

Examples

Deep Notes

Search JIRA for related Issues

Source

lsa_bubble_sort(): 'linden\indra\lscript\lscript_alloc.h'

Signature
function list llListSort( list src, integer stride, integer ascending );