 |
lua-l archive |
|
|
||
|
On 09.01.2011 11:47, Alexander Gladysh wrote:
This way new task will get to the first hole available, and the table will not be resized grow without need. Task processing algorithm should be aware about nils in the queue though (maybe it uses pairs(), that may explain why order does not matter).
No, it will insert into any hole or after the last number, so it may grow. And even with this strange scheme, where's the need to insert nil's?
-- Best regards, Sergey Rozhenko mailto:sergroj@mail.ru