Re: Performance issue related to implementation of slap_op_add

[Arnaud Sahuguet <sahuguet@gradient.cis.upenn.edu>]

Glen Coakley wrote:
> 
> If this condition is indeed the case, all that is needed to make it the code
> constant time is to save a pointer to the tail of the list. A double linked
> list is only needed if you need to traverse a list forwards and backwards.

Absolutely. But when you remove the tail (the last item), how do you
know where the new tail is.
Having a double-linked list seems to me to be the easiest solution,
compatible with what already exists.

Arnaud