On Fri, Feb 1, 2013 at 7:16 PM, Dave Abrahams <dave@boostpro.com> wrote:
on Fri Feb 01 2013, Paul Smith <pl.smith.mail-AT-gmail.com> wrote:
On Fri, Feb 1, 2013 at 6:06 PM, Larry Evans <cppljevans@suddenlink.net> wrote:
On 02/01/13 09:20, Paul Smith wrote:
On Fri, Feb 1, 2013 at 4:57 PM, Dave Abrahams <dave@boostpro.com> wrote:
There's the post: http://boost.2283326.n4.nabble.com/variant-Please-vote-for-behavior-Was-Basi...
And there's the quote:
I don't want to read into what Dave said too much, because he's here and he can clarify it. But I believe what he said is that specific algorithms, in their own localized context, practically only require destructibility and assignability. And even then,
I was disavowing this part because I don't claim to know it for sure:
Anyway, I'm not sure my exposition of that was very clear either. That's why I'd like Dave to explain it in more detail (ignore what I said you said), instead of me trying to interpret it.
The colon is meant to indicate that the statement applies to what follows, not what comes before.
Ofcourse. Missed it :-P Thanks! -- Paul Smith