Subject: Re: [boost] Review Request: Creasing (Sequence Properties)
From: Stewart, Robert (Robert.Stewart_at_[hidden])
Date: 2010-01-28 08:44:11
Joachim Faulhaber wrote:
> 2010/1/27 Stewart, Robert <Robert.Stewart_at_[hidden]>:
> > Joachim Faulhaber wrote:
> >> Are there criteria to be fulfilled to maintain the minimality
> >> of a set of free algorithms?
> > I understand the desire to keep the set small enough to
> > be manageable,
> I think the clearness of the library interfaces is very important
> and the quest for criteria and guidelines is helpful.
I wasn't discounting your quest. I was contributing to it, or so I intended. Among the goals are to ensure the set is as small as possible, to keep documentation, testing, and maintenance burdens as low as possible, while ensuring the set provides complete coverage. The former I considered part of "manageable." The latter covers this part:
> > but it should be large enough to avoid the need to repeat
> > (and rediscover) common recipes.
> > Are those four
> > predicates sufficiently useful to justify being documented,
> > tested, and maintained in Boost? If not, they can be
> > illustrated as examples for use of is_sorted.
> I'd prefer the latter.
I'm in no position to argue otherwise. I hope we get broader input for the decision, though. Lacking that, when is_sorted is made a first class predicate, there should be a (fast track?) review in which the question of including is_strictly_decreasing, etc., can be posed. That, perhaps, will get a broader response.
I don't know whether the N3000 version differs, but it should be the one we use, if so, even at the cost of having to change existing Boost code. In order to provide backward compatibility, with automatic use of C++1x implementations when available, something akin to Boost.TR1 is needed. That implies more than a fast track review.
Rob Stewart robert.stewart_at_[hidden]
Software Engineer, Core Software using std::disclaimer;
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.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk