Difference between revisions of "ListXorY"
Jump to navigation
Jump to search
Ugleh Ulrik (talk | contribs) |
Void Singer (talk | contribs) m (examples should at least compile) |
||
Line 29: | Line 29: | ||
list l1 = ["a","b","c","d"]; | list l1 = ["a","b","c","d"]; | ||
list l2 = ["a","1","b","2","c","3"]; | list l2 = ["a","1","b","2","c","3"]; | ||
list ListXorY(list lx, list ly){ // add the lists eliminating duplicates | |||
list lz = []; integer x; | |||
for (x = 0; x < llGetListLength(ly); ++x){ | |||
if (~llListFindList(lx,llList2List(ly,x,x))){ | |||
; | |||
} | |||
else { | |||
lz = lz + llList2List(ly,x,x); | |||
} | |||
} | |||
return lx + lz; | |||
} | |||
default{ | default{ |
Revision as of 22:33, 25 June 2010
LSL Portal | Functions | Events | Types | Operators | Constants | Flow Control | Script Library | Categorized Library | Tutorials |
Function: list ListXorY(list lx, list ly);
Join two lists to make one new combined list, while also eliminating any resulting duplicates in the new list.
See also: Lists
<lsl> list ListXorY(list lx, list ly){ // add the lists eliminating duplicates
list lz = []; integer x; for (x = 0; x < llGetListLength(ly); ++x){ if (~llListFindList(lx,llList2List(ly,x,x))){ ; } else { lz = lz + llList2List(ly,x,x); } } return lx + lz;
} </lsl>
Example:
<lsl> list l1 = ["a","b","c","d"]; list l2 = ["a","1","b","2","c","3"];
list ListXorY(list lx, list ly){ // add the lists eliminating duplicates
list lz = []; integer x; for (x = 0; x < llGetListLength(ly); ++x){ if (~llListFindList(lx,llList2List(ly,x,x))){ ; } else { lz = lz + llList2List(ly,x,x); } } return lx + lz;
}
default{
state_entry() { llSay(0, "The new combined list is: " + llList2CSV(ListXorY(l1,l2)) ); //will say: a, b, c, d, 1, 2, 3 }
} </lsl>
Posted with the kind permission of Very Keynes, who originated this script June 2007 in the SL scripters forum http://forums-archive.secondlife.com/54/e4/194138/1.html