OsListSortInPlace - Revision history

Ubit at 01:26, 2 June 2021

2021-06-02T01:26:49Z

2021-06-02T01:21:45Z

2021-06-02T01:15:46Z

2021-06-02T01:09:25Z

2021-06-02T01:08:21Z

2021-06-02T00:50:03Z

2021-06-02T00:47:24Z

2021-06-02T00:40:43Z

2021-06-02T00:40:08Z

2021-06-02T00:39:35Z

@@ Line 26: / Line 26: @@
          osListSortInPlace(src, 1, TRUE);
          llSay(0, "sorted in ascending order with stride 1: " + llDumpList2String(src,","));
+     }
+}

@@ Line 10: / Line 10: @@
 - Does nothing if the list length is not a multiple of stride.<br>
 - The sort considers the elements that are at indexes that are multiple of stride. The other elements between those multiples are just copied around.<br>
-i.e. if the element at [n * stride] is moved to [m * stride], elements [n * stride + i] are moved to [m * stride + i] for i = 1 to stride -1 (n m and i integers).<br>
+i.e. if the element at [n * stride] is moved to [m * stride], elements [n * stride + i] are moved to [m * stride + i] for i = 1 to stride -1 (n, m and i integers).<br>
-- if there are different object types (ie some are integer, others string, etc) at the consider indexes [n * stride], each type is considered as a sub list and each list is sorted.<br>
+- if there are different object types (ie some are integer, others string, etc) at the consider indexes [n * stride], each type is considered as a sub list and each sub list is sorted.<br>
 [1,"D",-4,"A","B"] will be [-4,"A",1,"B","D"], in ascending sort and stride 1.<br>
 - Lists with stride 1 and elements all of same type are a lot faster to sort than others, because in that case faster algorithms can be used.<br>

@@ Line 13: / Line 13: @@
 - if there are different object types (ie some are integer, others string, etc) at the consider indexes [n * stride], each type is considered as a sub list and each list is sorted.<br>
 [1,"D",-4,"A","B"] will be [-4,"A",1,"B","D"], in ascending sort and stride 1.<br>
-- Lists with stride 1 and elements all of some tipe are a lot faster to sort than others, because in that case faster algorithms can be used.<br>
+- Lists with stride 1 and elements all of same type are a lot faster to sort than others, because in that case faster algorithms can be used.<br>
 |ossl_example=<source lang="lsl">

@@ Line 7: / Line 7: @@
 * src: the list to sort
 * stride: the list stride.
-* ascending: it it is 1, sort in ascending order. If it is any other value, sort in descendent order.<br>
+* ascending: it it is 1 or TRUE, sort in ascending order. If it is any other value, sort in descendent order.<br>
 - Does nothing if the list length is not a multiple of stride.<br>
 - The sort considers the elements that are at indexes that are multiple of stride. The other elements between those multiples are just copied around.<br>
@@ Line 24: / Line 24: @@
          list src = [1,"D",-4,"A","B"];
          llSay(0, "original list: " + llDumpList2String(src,","));
-         osListSortInPlace(src, 1, 1);
+         osListSortInPlace(src, 1, TRUE);
          llSay(0, "sorted in ascending order with stride 1: " + llDumpList2String(src,","));
+     }

@@ Line 13: / Line 13: @@
 - if there are different object types (ie some are integer, others string, etc) at the consider indexes [n * stride], each type is considered as a sub list and each list is sorted.<br>
 [1,"D",-4,"A","B"] will be [-4,"A",1,"B","D"], in ascending sort and stride 1.<br>
-- Lists with stride 1 and elements all of some tipe are a lot faster to sort than others, because in that case faster algorithms can be used.
+- Lists with stride 1 and elements all of some tipe are a lot faster to sort than others, because in that case faster algorithms can be used.<br>
 |additional_info=This function was added in 0.9.2
 }}