Speed of # operator (Was: ipairs in Lua 5.3.0-alpha)
[
Date Prev][
Date Next][
Thread Prev][
Thread Next]
[
Date Index]
[
Thread Index]
- Subject: Speed of # operator (Was: ipairs in Lua 5.3.0-alpha)
- From: Dirk Laurie <dirk.laurie@...>
- Date: 2014年8月14日 08:16:28 +0200
2014年08月14日 3:23 GMT+02:00 Jan Behrens <jbe-lua-l@public-software-group.org>:
>> So, by principle, this implementation should not seem inefficient.
>> (Never mind that quite probably this O(1) is slower than Lua's
>> built-in O(log n) length anyway :)
>>
>> -- Roberto
>>
>
> If Lua's built-in O(log n) length operator is really that fast, then
> caching the length might not make sense in my case.
In actual applications, finding #tbl is quite often followed shortly
by traversing tbl from 1 to #tbl soon afterwards. E.g.
for i=1.#tbl do ...
I.e. the O(log n) length operator becomes insignificant in comparison
to the O(n) table traversal.