Difference between revisions of "ListXneqY"
Jump to navigation
Jump to search
Void Singer (talk | contribs) m (examples should at least compile) |
Omei Qunhua (talk | contribs) (Yep, examples should compile. Other changes as per ListXequY) |
||
| Line 15: | Line 15: | ||
<lsl> | <lsl> | ||
integer ListXneqY(list lx, list ly) { | integer ListXneqY(list lx, list ly) | ||
{ | |||
return ! ( (llGetListLength(lx) == llGetListLength(ly) ) & (ListXnotY(lx,ly) == [] ) ); | |||
} | } | ||
</lsl> | </lsl> | ||
Example:<br /> | Example:<br /> | ||
<lsl> | <lsl> | ||
list l1 = ["a","b","c","d"]; | list l1 = ["a","b","c","d", 1,2]; | ||
list l2 = ["a", | list l2 = ["a",1,"b",2,"c",3,"d"]; | ||
integer ListXneqY(list lx, list ly) { | integer ListXneqY(list lx, list ly) | ||
{ | |||
return ! ( (llGetListLength(lx) == llGetListLength(ly) ) & (ListXnotY(lx,ly) == [] ) ); | |||
} | } | ||
list ListXnotY(list lx, list ly) {// return elements in X list that are not in Y list | list ListXnotY(list lx, list ly) | ||
list lz | {// return elements in X list that are not in Y list | ||
list lz; | |||
integer n = llGetListLength(lx); | integer n = llGetListLength(lx); | ||
while(n--) | |||
if ( !~llListFindList(ly,llList2List(lx,n,n)) ) | |||
lz += llList2List(lx,n,n); | |||
return lz; | return lz; | ||
} | } | ||
| Line 45: | Line 44: | ||
default{ | default{ | ||
state_entry() { | state_entry() { | ||
llSay(0, "Are we different lists? " + (string)ListXneqY(l1,l2)) | llSay(0, "Are we different lists? " + (string)ListXneqY(l1,l2)); | ||
//will say in this example: 1 , meaning yes. | //will say in this example: 1 , meaning yes. | ||
} | } | ||
Revision as of 07:53, 21 April 2014
| LSL Portal | Functions | Events | Types | Operators | Constants | Flow Control | Script Library | Categorized Library | Tutorials |
Function: integer ListXneqY(list lx, list ly);
Answers the question: is list X different from list Y?
Returns the number 1 if true, 0 if false
Note: requires also the function ListXnotY .
The opposite function is ListXequY .
See also: Lists
<lsl> integer ListXneqY(list lx, list ly) {
return ! ( (llGetListLength(lx) == llGetListLength(ly) ) & (ListXnotY(lx,ly) == [] ) );
} </lsl>
Example:
<lsl> list l1 = ["a","b","c","d", 1,2]; list l2 = ["a",1,"b",2,"c",3,"d"];
integer ListXneqY(list lx, list ly) {
return ! ( (llGetListLength(lx) == llGetListLength(ly) ) & (ListXnotY(lx,ly) == [] ) );
}
list ListXnotY(list lx, list ly) {// return elements in X list that are not in Y list
list lz; integer n = llGetListLength(lx); while(n--)
if ( !~llListFindList(ly,llList2List(lx,n,n)) ) lz += llList2List(lx,n,n);
return lz;
}
default{
state_entry() {
llSay(0, "Are we different lists? " + (string)ListXneqY(l1,l2));
//will say in this example: 1 , meaning yes.
}
} </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