mirror of
https://github.com/Sei-Lisa/LSL-PyOptimizer
synced 2025-07-01 23:58:20 +00:00
Update behaviour of llListFindList for LSO.
This commit is contained in:
parent
aad73fb71d
commit
d8629f9200
1 changed files with 3 additions and 1 deletions
|
@ -1099,7 +1099,9 @@ def llListFindList(lst, elems):
|
|||
if L2 > L1:
|
||||
return -1 # can't find a sublist longer than the original list
|
||||
if L2 == 0:
|
||||
return 0 # empty list is always found at position 0
|
||||
# empty list is always found at position 0 in Mono,
|
||||
# and in LSO if the first list isn't empty
|
||||
return -1 if lslcommon.LSO and L1 == 0 else 0
|
||||
for i in xrange(L1-L2+1):
|
||||
for j in xrange(L2):
|
||||
e1 = lst[i+j]
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue