On 10/5/06, Leopold Toetsch <[EMAIL PROTECTED]> wrote:
Am Donnerstag, 5. Oktober 2006 01:49 schrieb Karl Forner:
>
> Whare the requirements/constraints of a ResizableBooleanArray ? e.g are
> unshift to be less frequent that shift ?
shift and unshift are both more unlikely than push/pop I presum
Yes, I've always why ResizableBooleanArray extends FixedBooleanArray and
why
FixedBooleanArray is not simply a special case of ResizableBooleanArray.
Because a FixedBooleanArray is simpler, so that it may use less memory and
be implemented more efficiently I suppose.
Is there a real differenc
Am Donnerstag, 5. Oktober 2006 01:49 schrieb Karl Forner:
>
> Whare the requirements/constraints of a ResizableBooleanArray ? e.g are
> unshift to be less frequent that shift ?
shift and unshift are both more unlikely than push/pop I presume. OTOH if a
user wants a bit queue, you have to deal wit
Karl Forner schrieb:
So in my opinion too this pmc should be rewritten. I'm ready to do it,
based
on my fixedbooleanarray implementation,
but before doing it I need some answers :
Yes, I've always why ResizableBooleanArray extends FixedBooleanArray and why
FixedBooleanArray is not simply a sp
Hello,
I need some advices.
I've worked on fixedbooleanarray and resizablebooleanarray.
From #40066 it is said that both need to be rewritten.
So I've cleaned up fixedbooleanarray that should be a lot cleaner, somewhat
faster and more understandable, and I've added some tests. But of course
be
