Difference between revisions of "ListXequY"
Jump to navigation
Jump to search
Omei Qunhua (talk | contribs) (Yep, examples should compile. And I couldn't see the point in the llList2CSV) |
m (<lsl> tag to <source>) |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Line 14: | Line 14: | ||
See also: [[List|Lists]] | See also: [[List|Lists]] | ||
< | <source lang="lsl2"> | ||
integer ListXequY(list lx, list ly) { | integer ListXequY(list lx, list ly) | ||
return | { | ||
if(lx == ly) | |||
return ListXnotY(lx,ly) == []; | |||
return FALSE; | |||
} | } | ||
</ | </source> | ||
Example:<br /> | Example:<br /> | ||
< | <source lang="lsl2"> | ||
list l1 = ["a","b","c", 1,2,3]; | list l1 = ["a","b","c", 1,2,3]; | ||
list l2 = ["a",1,"b",3,"c",3]; | list l2 = ["a",1,"b",3,"c",3]; | ||
integer ListXequY(list lx, list ly) { | integer ListXequY(list lx, list ly) | ||
return ( ListXnotY(lx, 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) {// return elements in X list that are not in Y list | ||
list lz | list lz; | ||
integer i | integer i = llGetListLength(lx); | ||
while(i--) | |||
if ( !~llListFindList(ly,llList2List(lx,i,i)) ) | |||
lz += llList2List(lx,i,i); | lz += llList2List(lx,i,i); | ||
return lz; | return lz; | ||
| Line 48: | Line 51: | ||
} | } | ||
} | } | ||
</ | </source> | ||
</div> | </div> | ||
Latest revision as of 15:24, 22 January 2015
| LSL Portal | Functions | Events | Types | Operators | Constants | Flow Control | Script Library | Categorized Library | Tutorials |
Function: integer ListXequY(list lx, list ly);
Answers the question: is list X identical to list Y?
Returns the number 1 if true, 0 if false
Note: requires also the function ListXnotY .
The opposite function is ListXneqY .
See also: Lists
integer ListXequY(list lx, list ly)
{
if(lx == ly)
return ListXnotY(lx,ly) == [];
return FALSE;
}
Example:
list l1 = ["a","b","c", 1,2,3];
list l2 = ["a",1,"b",3,"c",3];
integer ListXequY(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 i = llGetListLength(lx);
while(i--)
if ( !~llListFindList(ly,llList2List(lx,i,i)) )
lz += llList2List(lx,i,i);
return lz;
}
default{
state_entry() {
llSay(0, "Are we the same lists? " + (string)ListXequY(l1,l2));
//will say in this example: 0 , meaning No
}
}
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