Subject: Re: [boost] New algorithm in Boost.Algorithm: "gather" -- looking for comments
From: Rob Stewart (robertstewart_at_[hidden])
Date: 2013-01-26 17:53:02
On Jan 26, 2013, at 4:18 PM, Sean Parent <sparent_at_[hidden]> wrote:
> gather() takes a sequence of objects and moves the objects that satisfy a predicate to a position within the sequence.
gather() takes a sequence of objects and moves the objects in that sequence satisfying a predicate to a specified position within that sequence.
> The algorithm is stable, meaning that the relative position of items satisfying the predicate, and
"as well as" rather than "and" seems less likely to suggest the two sets are interleaved in any way.
> those not satisfying the predicate are not changed. gather() returns the range of objects satisfying the predicate.
> Post-condition: The position
The specified position
> is within the returned range.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk