Re: Definition of table.insert

[GrayFace <sergroj@...>]

On 09.01.2011 12:52, GrayFace wrote:
> 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?

To clarify: I only see nil assignments when an element is taken out of 
the queue and no uses of table.insert(t, n, nil)

--
Best regards,
Sergey Rozhenko                 mailto:sergroj@mail.ru