|
Boost : |
Subject: Re: [boost] AlRangeExandrescu?
From: Stewart, Robert (Robert.Stewart_at_[hidden])
Date: 2009-07-23 11:31:39
Mathias Gaunard wrote:
>
> First-class ranges would still need to be convertible to
> iterator pairs, since iterators are useful on their own as a
> mean to express positions.
>
> For example, let's say I write a simple algorithm that takes
> three bidirectional iterators: the begin of the sequence, the
> end of the sequence, and a position anywhere in between. That
> algorithm then returns whether the position in between lies on
> a word boundary by reading what is left and right of it.
>
> How would I express such an algorithm with ranges only?
Ranges can be collapsed to represent a single element or no
elements.
_____
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