|
Boost : |
Subject: Re: [boost] [Containers] Marshalling deques
From: Ion Gaztañaga (igaztanaga_at_[hidden])
Date: 2011-08-24 15:33:23
El 24/08/2011 20:06, Brian Wood escribió:
> Ion Gazta?aga:
> >
> >El 22/08/2011 19:44, Brian Wood escribi?:
> >> Would you be willing to add a function that gives that? Tia.
> >
> > Yes, I think we need to think about a useful interface for that, maybe
> > something like local_iterator in unordered containers or something like
> > segmented iterator described by Matt Austern in his "Segmented Iterators
> > and Hierarchical Algorithms" paper
>
> If I could get the number of elements in the first chunk and the
> size of the chunks, that would be sufficient. (I believe the size
> of the chunks is constant within a deque instance.)
Not necessarily, but I think all implementations do that. The question
is whether we should have a standard-friendly and implementation
agnostic interface or an interface just for boost::deque implementation.
Best,
Ion
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk