Re: [boost] [Containers] How about a list with O(1) splice?

Subject: Re: [boost] [Containers] How about a list with O(1) splice?
From: Stewart, Robert (Robert.Stewart_at_[hidden])
Date: 2011-10-06 07:50:50

Vicente Botet wrote:
> Dave Abrahams wrote:
> > on Wed Oct 05 2011, "Vicente J. Botet Escriba"
> > <vicente.botet-AT-wanadoo.fr> wrote:
> >
> >> I think that it is better to have the freedom to choose the
> >> implementation more adapted to each context.
> >
> > I think the amount of interface and documentation
> > complication needed to achieve that isn't worth the gains
> > over a "usually O(1) size implementation."  If you really
> > want the next size() to be O(1) after a splice all you need
> > to do is... call size().
>
> How the call to size() make later call to size() O(1)?

I think he was referring to your amortized constant time size().  The first call notices the dirty flag and computes the size in linear time.  The second, and subsequent calls, will be constant time.

_____
Rob Stewart                           robert.stewart_at_[hidden]
Software Engineer                     using std::disclaimer;
Dev Tools & Components
Susquehanna International Group, LLP  http://www.sig.com

________________________________

IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.