Difference between revisions of "LlListReplaceList"

From Second Life Wiki
Jump to navigation Jump to search
Line 3: Line 3:
|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|p2_type=list|p2_name=src|p3_type=integer|p3_name=start|p4_type=integer|p4_name=end
|func_footnote
|func_footnote
|func_desc=
|func_desc
|return_text=that is '''start''' through '''end''' of '''dest''' replaced with '''src'''.
|return_text=that is '''dest''' with '''start''' through '''end''' removed and '''src''' inserted at '''start'''.
|spec
|spec=<br/>
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
|constants
|constants

Revision as of 20:53, 19 April 2007

Summary

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

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

• list dest
• list src
• 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.


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.

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

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

Deep Notes

Signature

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