Difference between revisions of "LlListReplaceList"

From Second Life Wiki
Jump to navigation Jump to search
m
m (<lsl> tag to <source>)
 
(15 intermediate revisions by 6 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_id=296|func_sleep=0.0|func_energy=10.0
|func_id=296|func_sleep=0.0|func_energy=10.0
|func=llListReplaceList|return_type=list|p1_type=list|p1_name=dest|p2_type=list|p2_name=src|p3_type=integer|p3_name=start|p4_type=integer|p4_name=end
|func=llListReplaceList|return_type=list
|p1_type=list|p1_name=dest|p1_desc=destination
|p2_type=list|p2_name=src|p2_desc=source
|p3_type=integer|p3_name=start
|p4_type=integer|p4_name=end
|func_footnote
|func_footnote
|func_desc
|func_desc
|return_text=that is '''dest''' with '''start''' through '''end''' removed and '''src''' inserted at '''start'''.
|return_text=that is a copy of {{LSLP|dest}} with {{LSLP|start}} through {{LSLP|end}} removed and {{LSLP|src}} inserted at {{LSLP|start}}.
|spec=<br/>
|spec
If '''start''' is past the end of '''dest''', then '''src''' is appended to '''dest''', it will not add null entries.  To avoid this, create empty elements in the list first. A similar outcome occurs when using {{LSLGC|Negative Index|negative indexes}}.
|caveats=
|caveats=*Just calling the function will not update the variable. You must store it.  
*If {{LSLP|start}} is past the end of {{LSLP|dest}}, then {{LSLP|src}} is appended to {{LSLP|dest}}, it will not add null entries.  To avoid this, create empty elements in the list first. A similar outcome occurs when using {{LSLGC|Negative Index|negative indexes}}.
*Just calling the function will not update the variable. You must store it (unless of course you are planning to act on the results straightway.)
:{{{!}}
:{{{!}}
{{LSL DefineRow|'''Bad:'''|<code>llListReplaceList(a, ["c"], 2, 2)</code>}}
{{LSL DefineRow|'''Bad:'''|<code>llListReplaceList(MyList, ["New Item"], 2, 2)</code>}}
{{LSL DefineRow|'''Good:'''|<code>a {{=}} llListReplaceList(a, ["c"], 2, 2)</code>}}
{{LSL DefineRow|'''Good:'''|<code>MyList {{=}} llListReplaceList(MyList, ["New Item"], 2, 2)</code>}}
{{!}}}
{{!}}}
*In [[LSO]] ONLY (not [[Mono]]): if you are storing to the same list, it can be more memory effective to clear the list before you store.
:{{{!}}
{{LSL DefineRow|'''Good:'''| <code>MyList {{=}} llListReplaceList(MyList, ["New Item"], 2, 2)</code>}}
{{LSL DefineRow|'''Better:'''|<code>MyList {{=}} llListReplaceList((MyList {{=}} []) + MyList, ["New Item"], 2, 2)</code>}}
{{!}}}
|constants
|constants
|examples=
|examples=
<lsl>default
<source lang="lsl2">default
{
{
     state_entry()
     state_entry()
     {
     {
         list a = ["a", "b", "e", "d"];
         list MyOldList = ["a", "b", "e", "d"];
         list b = llListReplaceList(a, ["c"], 2, 2);//replace the range starting and ending at index 2 with ["c"] and store it into b
         list MyNewList = llListReplaceList(MyOldList, ["c"], 2, 2);//replace the range starting and ending at  
                                                  //index 2 with ["c"] and store it into MyNewList


         llOwnerSay("\""+llList2CSV(a) + "\"  ->  \"" + llList2CSV(b)+"\"");//display the change
         llOwnerSay("\""+llList2CSV(MyOldList) + "\"  ->  \"" + llList2CSV(MyNewList)+"\"");//display the change
         //Will say: "a, b, e, d"  ->  "a, b, c, d"
         //Will say: "a, b, e, d"  ->  "a, b, c, d"
     }
     }
}</lsl>
}</source>
 
<source lang="lsl2">
// More commonly, you will be updating an existing list, replacing 1 or more items
// Here we replace entries 2 and 3 and over-write our original list
default
{
    state_entry()
    {
        list MyList = ["a", "b", "x", "y"];
        MyList = llListReplaceList(MyList, ["c", "d"], 2, 3);  // Over-write MyList, with the modified list (having replaced entries 2 & 3) 
                                                 
 
        llOwnerSay("\"" + llList2CSV(MyList) + "\"");    // display the modified list
        // Will say: "a, b, c, d"
    }
}</source>
 
|helpers
|helpers
|also_functions=
|also_functions=
Line 31: Line 61:
{{LSL DefineRow|[[llList2List]]|}}
{{LSL DefineRow|[[llList2List]]|}}
|also_events
|also_events
|also_tests
|also_tests=
{{LSL DefineRow|[[llListReplaceList Test]]|}}
|also_articles
|also_articles
|notes
|notes=
To be clear, the list you are replacing in doesn't have to actually be a list of many elements. It can be a single item that you make into a single element list just by placing square brackets around it.
 
<source lang="lsl2">list TargetList = ["a", "b", "c", "z", "e"];
list InsertList = ["d"];</source>
 
To act on a single element in a list, just quote its place in the list as both start and end. For instance, 0, 0 would act only on the first element in the list; 7,7 would act only on the 8th element.
 
For a function that will operate as llListReplaceList does, but work on strided lists, see [[ListStridedUpdate]].
|permission
|permission
|sort=ListReplaceList
|sort=ListReplaceList

Latest revision as of 11:16, 22 January 2015

Summary

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

Returns a list that is a copy of dest with start through end removed and src inserted at start.

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

start & end support negative indexes.

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).
  • If start is past the end of dest, then src is appended to dest, it will not add null entries. To avoid this, create empty elements in the list first. A similar outcome occurs when using negative indexes.
  • Just calling the function will not update the variable. You must store it (unless of course you are planning to act on the results straightway.)
• Bad: llListReplaceList(MyList, ["New Item"], 2, 2)
• Good: MyList = llListReplaceList(MyList, ["New Item"], 2, 2)
  • In LSO ONLY (not Mono): if you are storing to the same list, it can be more memory effective to clear the list before you store.
• Good: MyList = llListReplaceList(MyList, ["New Item"], 2, 2)
• Better: MyList = llListReplaceList((MyList = []) + MyList, ["New Item"], 2, 2)

Examples

default
{
    state_entry()
    {
        list MyOldList = ["a", "b", "e", "d"];
        list MyNewList = llListReplaceList(MyOldList, ["c"], 2, 2);//replace the range starting and ending at 
                                                   //index 2 with ["c"] and store it into MyNewList

        llOwnerSay("\""+llList2CSV(MyOldList) + "\"  ->  \"" + llList2CSV(MyNewList)+"\"");//display the change
        //Will say: "a, b, e, d"  ->  "a, b, c, d"
    }
}
// More commonly, you will be updating an existing list, replacing 1 or more items
// Here we replace entries 2 and 3 and over-write our original list
default
{
    state_entry()
    {
        list MyList = ["a", "b", "x", "y"];
        MyList = llListReplaceList(MyList, ["c", "d"], 2, 3);   // Over-write MyList, with the modified list (having replaced entries 2 & 3)  
                                                   

        llOwnerSay("\"" + llList2CSV(MyList) + "\"");     // display the modified list
        // Will say: "a, b, c, d"
    }
}

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. To be clear, the list you are replacing in doesn't have to actually be a list of many elements. It can be a single item that you make into a single element list just by placing square brackets around it.

list TargetList = ["a", "b", "c", "z", "e"];
list InsertList = ["d"];

To act on a single element in a list, just quote its place in the list as both start and end. For instance, 0, 0 would act only on the first element in the list; 7,7 would act only on the 8th element.

For a function that will operate as llListReplaceList does, but work on strided lists, see ListStridedUpdate.

See Also

Functions

• llDeleteSubList
• llListInsertList
• llList2List

Articles

•  Negative Index

Deep Notes

Tests

• llListReplaceList Test

Signature

function list llListReplaceList( list dest, list src, integer start, integer end );