AriasCreations/LSL-PyOptimizer
3
0
Fork 0
mirror of https://github.com/Sei-Lisa/LSL-PyOptimizer synced 2025-07-04 12:14:36 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fix the bug detected in llListReplaceList.

Browse source
This commit is contained in:
Sei Lisa 2015-03-04 00:31:55 +01:00
parent 8ea6ae50fd
commit 87b6002b6c
1 changed files with 5 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

6
lslopt/lslbasefuncs.py
View file

@ -1120,12 +1120,16 @@ def llListReplaceList(lst, elems, start, end):
assert isinteger(start) assert isinteger(start)
assert isinteger(end) assert isinteger(end)
L = len(lst) L = len(lst)
if start < -L:
# llListReplaceList([0,1,2,3],[5],-5,-5) should return [0,1,2,3]
# llListReplaceList([0,1,2,3],[5],-5,-4) should return [1,2,3]
# llListReplaceList([0,1,2,3],[5],-5,-7) should return []
elems = []
if (start + L if start < 0 else start) > (end + L if end < 0 else end): if (start + L if start < 0 else start) > (end + L if end < 0 else end):
# Exclusion range. Appends elems at 'start' i.e. at end :) # Exclusion range. Appends elems at 'start' i.e. at end :)
if end == -1: end += L if end == -1: end += L
return lst[end+1:start] + elems return lst[end+1:start] + elems
if end == -1: end += L if end == -1: end += L
# BUG: llListReplaceList([1,2,3,4],[5],-5,-5) should return [1,2,3,4]
return lst[:start] + elems + lst[end+1:] return lst[:start] + elems + lst[end+1:]
def llListSort(lst, stride, asc): def llListSort(lst, stride, asc):