[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: Definition of table.insert
- From: GrayFace <sergroj@...>
- Date: Sun, 09 Jan 2011 12:52:43 +0600
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?
Sergey Rozhenko mailto:firstname.lastname@example.org