Difference between revisions of "LlDeleteSubList"

From Second Life Wiki
Jump to navigation Jump to search
m
 
(5 intermediate revisions by 4 users not shown)
Line 1: Line 1:
{{LSL_Function/negative index|true|start|end}}{{LSL_Function
{{LSL_Function
|inject-2={{LSL_Function/negative index|true|start|end}}
|func=llDeleteSubList
|func=llDeleteSubList
|func_id=193|func_sleep=0.0|func_energy=10.0
|func_id=193|func_sleep=0.0|func_energy=10.0
Line 6: Line 7:
|p2_type=integer|p2_name=start
|p2_type=integer|p2_name=start
|p3_type=integer|p3_name=end
|p3_type=integer|p3_name=end
|func_footnote=While the function result is different then '''src''', '''src''' is not modified, remember to use or store the result of this function.<br/>
|func_footnote=While the function result is different than {{LSLP|src}}, {{LSLP|src}} is not modified, remember to use or store the result of this function.<br/>
The opposite function would be [[llListInsertList]].
The opposite function would be [[llListInsertList]].
|return_text=that is a copy of '''src''' but with the slice from '''start''' to '''end''' removed.
|return_text=that is a copy of {{LSLP|src}} but with the slice from {{LSLP|start}} to {{LSLP|end}} removed.
|spec
|spec
|caveats
|caveats
|constants
|constants
|examples=
|examples=
<lsl>src = llDeleteSubList( src, start, end )</lsl>
<source lang="lsl2">src = llDeleteSubList( src, start, end )</source>


<lsl>default
<source lang="lsl2">default
{
{
     state_entry()
     state_entry()
     {
     {
         // Create a list of names
         // Create a list of names
         list names = ["Anthony", "Bob", "Charlie", "Dan", "Edgar", "Gerald"];
         list names = ["Anthony", "Bob", "Charlie", "Diane", "Edgar", "Gabriela"];
          
          
         // Now let's remove values at position 1 through 2.
         // Now let's remove values at position 1 through 2.
Line 26: Line 27:


         // Result:
         // Result:
         // list names = ["Anthony", "Dan", "Edgar", "Gerald"];
         // list names = ["Anthony", "Diane", "Edgar", "Gabriela"];
          
          
         // Now let's use an start number higher then our end number
         // Now let's use an start number higher then our end number
Line 33: Line 34:
         // Result:
         // Result:
         // list names = ["Edgar"];
         // list names = ["Edgar"];
        // If start number higher then our end number, then we should imagine that the start and the end are missing before start and end.
        // Imagine it should be FROM_THE_LISTSTART_CUT: start, AND_FROM_THE_LISTEND_CUT: end ... more or less :))
        // names = llDeleteSubList(names, 3 -> , <- 1);
     }
     }
}</lsl>
}</source>


|helpers
|helpers

Latest revision as of 23:43, 21 January 2015

Summary

Function: list llDeleteSubList( list src, integer start, integer end );
0.0 Forced Delay
10.0 Energy

Returns a list that is a copy of src but with the slice from start to end removed.

• list src source
• integer start start index
• integer end end index

start & end support negative indexes. While the function result is different than src, src is not modified, remember to use or store the result of this function.
The opposite function would be llListInsertList.

Specification

Index Positive Negative
First 0 -length
Last length - 1 -1

Indexes

  • Positive indexes count from the beginning, the first item being indexed as 0, the last as (length - 1).
  • Negative indexes count from the far end, the first item being indexed as -length, the last as -1.

Caveats

  • If either start or end are out of bounds the script continues to execute without an error message.
  • start & end will form an exclusion range when start is past end (Approximately: start > end).

Examples

src = llDeleteSubList( src, start, end )
default
{
    state_entry()
    {
        // Create a list of names
        list names = ["Anthony", "Bob", "Charlie", "Diane", "Edgar", "Gabriela"];
        
        // Now let's remove values at position 1 through 2.
        names = llDeleteSubList(names, 1, 2);

        // Result:
        // list names = ["Anthony", "Diane", "Edgar", "Gabriela"];
        
        // Now let's use an start number higher then our end number
        names = llDeleteSubList(names, 3, 1);
        
        // Result:
        // list names = ["Edgar"];
        // If start number higher then our end number, then we should imagine that the start and the end are missing before start and end.
        // Imagine it should be FROM_THE_LISTSTART_CUT: start, AND_FROM_THE_LISTEND_CUT: end ... more or less :))
        // names = llDeleteSubList(names, 3 -> , <- 1);

    }
}

Notes

Ranges & Indexes

The easiest way to explain how ranges work is to make all indexes positive. Negative indexes are just a way of counting from the tail end instead of the beginning, all negative indexes have a corresponding equivalent positive index (assuming they are in range). Positive indexes past length (after the last index), or negative indexes past the beginning (before the first index) are valid and the effects are predictable and reliable: the entries are treated as if they were there but were removed just before output.

  • If start <= end then the range operated on starts at start and ends at end. [start, end]
  • Exclusion range: If start > end then the range operated on starts at 0 and goes to end and then starts again at start and goes to -1. [0, end] + [start, -1]
    • If end is a negative index past the beginning, then the operating range would be [start, -1].
    • If end is a positive index past the end, then the operating range would be [0, end].
    • If both start and end are out of bounds then the function would have no operating range (effectively inverting what the function is supposed to do).

See negative indexes for more information.

See Also

Functions

•  llListInsertList
•  llListReplaceList
•  llList2List

Articles

•  Negative Index

Deep Notes

Signature

function list llDeleteSubList( list src, integer start, integer end );