Difference between revisions of "LinksetIndexing"
Jump to navigation
Jump to search
Kireji Haiku (talk | contribs) m (→One Name - One Link: 0 >> FALSE) |
m (<lsl> tag to <source>) |
||
Line 10: | Line 10: | ||
Searches for multiple prims that share a common specific name and returns a list of linkset numbers. Otherwise an empty list if none found. | Searches for multiple prims that share a common specific name and returns a list of linkset numbers. Otherwise an empty list if none found. | ||
< | <source lang="lsl2"> | ||
list LinkedList(string Needle) { | list LinkedList(string Needle) { | ||
list Needles; | list Needles; | ||
Line 18: | Line 18: | ||
return Needles; | return Needles; | ||
} | } | ||
</ | </source> | ||
{|cellspacing="0" cellpadding="6" border="1" style="border: 1px solid #aaaaaa; margin: 1em 1em 1em 0pt; background-color: #e0e0ff; border-collapse: collapse" | {|cellspacing="0" cellpadding="6" border="1" style="border: 1px solid #aaaaaa; margin: 1em 1em 1em 0pt; background-color: #e0e0ff; border-collapse: collapse" | ||
Line 46: | Line 46: | ||
Searches for a single prim that has a specific name. Returns 0 if not found. | Searches for a single prim that has a specific name. Returns 0 if not found. | ||
< | <source lang="lsl2"> | ||
integer Linked(string Needle) { | integer Linked(string Needle) { | ||
integer Prims = llGetNumberOfPrims()+1; | integer Prims = llGetNumberOfPrims()+1; | ||
Line 52: | Line 52: | ||
return FALSE; | return FALSE; | ||
} | } | ||
</ | </source> | ||
{|cellspacing="0" cellpadding="6" border="1" style="border: 1px solid #aaaaaa; margin: 1em 1em 1em 0pt; background-color: #e0e0ff; border-collapse: collapse" | {|cellspacing="0" cellpadding="6" border="1" style="border: 1px solid #aaaaaa; margin: 1em 1em 1em 0pt; background-color: #e0e0ff; border-collapse: collapse" | ||
Line 81: | Line 81: | ||
Searches and replaces all strings in Needles list with integer linkset numbers, where the strings exactly match a prim name. | Searches and replaces all strings in Needles list with integer linkset numbers, where the strings exactly match a prim name. | ||
< | <source lang="lsl2"> | ||
list ListLinked(list Needles) { | list ListLinked(list Needles) { | ||
integer Prims = llGetNumberOfPrims()+1; | integer Prims = llGetNumberOfPrims()+1; | ||
Line 90: | Line 90: | ||
return Needles; | return Needles; | ||
} | } | ||
</ | </source> | ||
{|cellspacing="0" cellpadding="6" border="1" style="border: 1px solid #aaaaaa; margin: 1em 1em 1em 0pt; background-color: #e0e0ff; border-collapse: collapse" | {|cellspacing="0" cellpadding="6" border="1" style="border: 1px solid #aaaaaa; margin: 1em 1em 1em 0pt; background-color: #e0e0ff; border-collapse: collapse" |
Revision as of 22:35, 24 January 2015
LSL Portal | Functions | Events | Types | Operators | Constants | Flow Control | Script Library | Categorized Library | Tutorials |
By Exact Name
One Name - Multiple Links | ||||||||
---|---|---|---|---|---|---|---|---|
Searches for multiple prims that share a common specific name and returns a list of linkset numbers. Otherwise an empty list if none found. list LinkedList(string Needle) {
list Needles;
integer Hay = 1;
integer Stacks = llGetNumberOfPrims();
for(; Hay <= Stacks; ++Hay ) if(llGetLinkName(Hay) == Needle) Needles += Hay;
return Needles;
}
Released into public domain. By Nexii Malthus.
|
One Name - One Link | ||||||||
---|---|---|---|---|---|---|---|---|
Searches for a single prim that has a specific name. Returns 0 if not found. integer Linked(string Needle) {
integer Prims = llGetNumberOfPrims()+1;
while(--Prims) if(llGetLinkName(Prims) == Needle) return Prims;
return FALSE;
}
Released into public domain. By Nexii Malthus.
|
Multiple Names - One Link each | ||||||||
---|---|---|---|---|---|---|---|---|
Searches and replaces all strings in Needles list with integer linkset numbers, where the strings exactly match a prim name. list ListLinked(list Needles) {
integer Prims = llGetNumberOfPrims()+1;
while(--Prims) {
integer Ptr = llListFindList(Needles,[llGetLinkName(Prims)]);
if(~Ptr) Needles = llListReplaceList(Needles,[Prims],Ptr,Ptr);
}
return Needles;
}
Released into public domain. By Nexii Malthus.
|