Difference between revisions of "LlGetListLength"
Jump to navigation
Jump to search
(Added link to intro on how to iterate over a list.) |
m |
||
| Line 9: | Line 9: | ||
|constants | |constants | ||
|examples= | |examples= | ||
< | <source lang="lsl2"> | ||
//Basic usage | //Basic usage | ||
default | default | ||
| Line 20: | Line 20: | ||
} | } | ||
} | } | ||
</ | </source> | ||
|notes= | |notes= | ||
| Line 26: | Line 26: | ||
When using list length to help you loop through a list, it is better to determine the length first, then start your loop: | When using list length to help you loop through a list, it is better to determine the length first, then start your loop: | ||
< | <source lang="lsl2"> | ||
integer length = llGetListLength(mylist); | integer length = llGetListLength(mylist); | ||
| Line 35: | Line 35: | ||
++index; | ++index; | ||
} | } | ||
</ | </source> | ||
The following example is to illustrate what not to do, it calculates the length in the "for" loop and is inefficient because the length gets recalculated at each pass through the loop. This should only ever be done if the list is in fact changing (in length) with each iteration of the loop{{Footnote|Recalculating the length is slow because the VM duplicates the entire list (including the values) when it is pushed on the stack (so it can be popped off the stack when the length is calculated).}}. | The following example is to illustrate what not to do, it calculates the length in the "for" loop and is inefficient because the length gets recalculated at each pass through the loop. This should only ever be done if the list is in fact changing (in length) with each iteration of the loop{{Footnote|Recalculating the length is slow because the VM duplicates the entire list (including the values) when it is pushed on the stack (so it can be popped off the stack when the length is calculated).}}. | ||
< | <source lang="lsl2"> | ||
integer index;// default is 0 | integer index;// default is 0 | ||
while (index < llGetListLength(mylist)) | while (index < llGetListLength(mylist)) | ||
| Line 46: | Line 46: | ||
++index; | ++index; | ||
} | } | ||
</ | </source> | ||
{{LSL Tip|Please read [[User:Kireji_Haiku/How_to_deal_with_lists_in_LSL|this intro of how to iterate over a list in LSL]].}} | {{LSL Tip|Please read [[User:Kireji_Haiku/How_to_deal_with_lists_in_LSL|this intro of how to iterate over a list in LSL]].}} | ||
===LSO Optimizations=== | ===LSO Optimizations=== | ||
A faster and lighter (in bytecode) way to determine the length of a list is to do a not-equals compare with a null list. This works because the list not-equals compare returns the difference between the lengths, meaning that it returns the same result as <code>llGetListLength()</code>, minus the overhead in bytecode, and performance penalty of calling a non-native function. Note: This optimization is much less beneficial time-wise in Mono as Mono's llGetListLength function is almost twice as fast, however the bytecode saving is still about 30 bytes. | A faster and lighter (in bytecode) way to determine the length of a list is to do a not-equals compare with a null list. This works because the list not-equals compare returns the difference between the lengths, meaning that it returns the same result as <code>llGetListLength()</code>, minus the overhead in bytecode, and performance penalty of calling a non-native function. Note: This optimization is much less beneficial time-wise in Mono as Mono's llGetListLength function is almost twice as fast, however the bytecode saving is still about 30 bytes. | ||
< | <source lang="lsl2"> | ||
list in; | list in; | ||
integer len_in = llGetListLength(in); | integer len_in = llGetListLength(in); | ||
| Line 60: | Line 60: | ||
integer fneg_len_in = ([] != in); | integer fneg_len_in = ([] != in); | ||
//fneg_len_in and neg_len_in will be the same | //fneg_len_in and neg_len_in will be the same | ||
</ | </source> | ||
|helpers | |helpers | ||
|also_functions= | |also_functions= | ||
Latest revision as of 01:10, 22 January 2015
| LSL Portal | Functions | Events | Types | Operators | Constants | Flow Control | Script Library | Categorized Library | Tutorials |
Summary
Function: integer llGetListLength( list src );| 0.0 | Forced Delay |
| 10.0 | Energy |
Returns an integer that is the number of elements in the list src.
| • list | src |
Examples
//Basic usage
default
{
state_entry()
{
list testList = ["one", "two", "three"];
integer length = llGetListLength(testList);
llOwnerSay("There are " + (string)length + " entries in the list.");
}
}
Notes
Best Practices
When using list length to help you loop through a list, it is better to determine the length first, then start your loop:
integer length = llGetListLength(mylist);
integer index;// default is 0
while (index < length)
{
llSay(0, llList2String(mylist, index));
++index;
}
The following example is to illustrate what not to do, it calculates the length in the "for" loop and is inefficient because the length gets recalculated at each pass through the loop. This should only ever be done if the list is in fact changing (in length) with each iteration of the loop[1].
integer index;// default is 0
while (index < llGetListLength(mylist))
{
llSay(0, llList2String(mylist, index));
++index;
}
 |
Important: Please read this intro of how to iterate over a list in LSL. |
LSO Optimizations
A faster and lighter (in bytecode) way to determine the length of a list is to do a not-equals compare with a null list. This works because the list not-equals compare returns the difference between the lengths, meaning that it returns the same result as llGetListLength(), minus the overhead in bytecode, and performance penalty of calling a non-native function. Note: This optimization is much less beneficial time-wise in Mono as Mono's llGetListLength function is almost twice as fast, however the bytecode saving is still about 30 bytes.
list in;
integer len_in = llGetListLength(in);
integer flen_in = (in != []);
//flen_in and len_in will be the same
integer neg_len_in = -llGetListLength(in);
integer fneg_len_in = ([] != in);
//fneg_len_in and neg_len_in will be the same
See Also
Functions
| • | llListStatistics | – | LIST_STAT_NUM_COUNT – Returns the number of integers and floats in the list | |
| • | llStringLength | – | Returns the number of characters in a string. |
Deep Notes
Source
'linden\indra\lscript\lscript_library\lscript_alloc.cpp' @ lsa_cmp_lists
'linden\indra\lscript\lscript_execute\lscript_execute.cpp' @ list_list_operation
Footnotes
- ^ Recalculating the length is slow because the VM duplicates the entire list (including the values) when it is pushed on the stack (so it can be popped off the stack when the length is calculated).
Signature |
|---|
function integer llGetListLength( list src ); |