Topic: New implementation for __inplace_stable_sort
Author: BonzaiThePenguin <mike@bonzaiapps.com>
Date: Fri, 7 Mar 2014 16:00:02 -0800 (PST)
Raw View
------=_Part_1100_7970592.1394236802389
Content-Type: text/plain; charset=UTF-8
stable_sort is nice and speedy when there's enough memory available, but
when it fails to allocate the required buffer it calls
__inplace_stable_sort instead. This part seems to be based on a rather old
in-place merge algorithm. There's been a lot of recent progress in this
area, to the point where it can be 3x faster while also reducing the stack
requirements from O(log n) to O(1).
I have a self-contained implementation up and running here:
https://github.com/BonzaiThePenguin/WikiSort
In order to adapt it to the STL, I'd recommend removing the cache and the
floating-point multiplication hack. The hack was profiled and found to be
10% faster than a standard bottom-up merge sort, but it's also not
mathematically "pure" and is guaranteed to fail well before reaching the
2^64 limit. I only tested it for up to 17 billion items.
Anyway, it seems like a no-brainer to me, although it could certainly use a
little vetting. If there's interest I can make a version that's a bit
closer to what an STL version might look like.
--
---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.
------=_Part_1100_7970592.1394236802389
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
<div dir=3D"ltr"><div><div>stable_sort is nice and speedy when there's enou=
gh memory available, but when it fails to allocate the required buffer it c=
alls __inplace_stable_sort instead. This part seems to be based on a rather=
old in-place merge algorithm. There's been a lot of recent progress in thi=
s area, to the point where it can be 3x faster while also reducing the stac=
k requirements from O(log n) to O(1).</div><div><br></div><div>I have a sel=
f-contained implementation up and running here:</div><div>https://github.co=
m/BonzaiThePenguin/WikiSort</div><div><br></div><div>In order to adapt it t=
o the STL, I'd recommend removing the cache and the floating-point multipli=
cation hack. The hack was profiled and found to be 10% faster than a standa=
rd bottom-up merge sort, but it's also not mathematically "pure" and is gua=
ranteed to fail well before reaching the 2^64 limit. I only tested it for u=
p to 17 billion items.</div></div><div><br></div><div>Anyway, it seems like=
a no-brainer to me, although it could certainly use a little vetting. If t=
here's interest I can make a version that's a bit closer to what an STL ver=
sion might look like.</div>
</div>
<p></p>
-- <br />
<br />
--- <br />
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals" group.<br />
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org">std-proposa=
ls+unsubscribe@isocpp.org</a>.<br />
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org">std-proposals@isocpp.org</a>.<br />
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/">http://groups.google.com/a/isocpp.org/group/std-proposals/<=
/a>.<br />
------=_Part_1100_7970592.1394236802389--
.
Author: "Billy O'Neal" <billy.oneal@gmail.com>
Date: Fri, 7 Mar 2014 16:04:52 -0800
Raw View
--001a1134850003377104f40d216a
Content-Type: text/plain; charset=UTF-8
That implementation is not correct because it copies around Ts using
memcpy. You too can have faster results if you give up correctness. :)
Billy O'Neal
https://github.com/BillyONeal/ <https://bitbucket.org/BillyONeal/>
http://stackoverflow.com/users/82320/billy-oneal
On Fri, Mar 7, 2014 at 4:00 PM, BonzaiThePenguin <mike@bonzaiapps.com>wrote:
> stable_sort is nice and speedy when there's enough memory available, but
> when it fails to allocate the required buffer it calls
> __inplace_stable_sort instead. This part seems to be based on a rather old
> in-place merge algorithm. There's been a lot of recent progress in this
> area, to the point where it can be 3x faster while also reducing the stack
> requirements from O(log n) to O(1).
>
> I have a self-contained implementation up and running here:
> https://github.com/BonzaiThePenguin/WikiSort
>
> In order to adapt it to the STL, I'd recommend removing the cache and the
> floating-point multiplication hack. The hack was profiled and found to be
> 10% faster than a standard bottom-up merge sort, but it's also not
> mathematically "pure" and is guaranteed to fail well before reaching the
> 2^64 limit. I only tested it for up to 17 billion items.
>
> Anyway, it seems like a no-brainer to me, although it could certainly use
> a little vetting. If there's interest I can make a version that's a bit
> closer to what an STL version might look like.
>
> --
>
> ---
> You received this message because you are subscribed to the Google Groups
> "ISO C++ Standard - Future Proposals" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to std-proposals+unsubscribe@isocpp.org.
> To post to this group, send email to std-proposals@isocpp.org.
> Visit this group at
> http://groups.google.com/a/isocpp.org/group/std-proposals/.
>
--
---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.
--001a1134850003377104f40d216a
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
<div dir=3D"ltr">That implementation is not correct because it copies aroun=
d Ts using memcpy. You too can have faster results if you give up correctne=
ss. :)<br></div><div class=3D"gmail_extra"><br clear=3D"all"><div><div dir=
=3D"ltr">
<div>Billy O'Neal</div><div><a href=3D"https://bitbucket.org/BillyONeal=
/" target=3D"_blank">https://github.com/BillyONeal/</a></div><div><a href=
=3D"http://stackoverflow.com/users/82320/billy-oneal" target=3D"_blank">htt=
p://stackoverflow.com/users/82320/billy-oneal</a></div>
</div></div>
<br><br><div class=3D"gmail_quote">On Fri, Mar 7, 2014 at 4:00 PM, BonzaiTh=
ePenguin <span dir=3D"ltr"><<a href=3D"mailto:mike@bonzaiapps.com" targe=
t=3D"_blank">mike@bonzaiapps.com</a>></span> wrote:<br><blockquote class=
=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1px #ccc solid;padd=
ing-left:1ex">
<div dir=3D"ltr"><div><div>stable_sort is nice and speedy when there's =
enough memory available, but when it fails to allocate the required buffer =
it calls __inplace_stable_sort instead. This part seems to be based on a ra=
ther old in-place merge algorithm. There's been a lot of recent progres=
s in this area, to the point where it can be 3x faster while also reducing =
the stack requirements from O(log n) to O(1).</div>
<div><br></div><div>I have a self-contained implementation up and running h=
ere:</div><div><a href=3D"https://github.com/BonzaiThePenguin/WikiSort" tar=
get=3D"_blank">https://github.com/BonzaiThePenguin/WikiSort</a></div><div>
<br>
</div><div>In order to adapt it to the STL, I'd recommend removing the =
cache and the floating-point multiplication hack. The hack was profiled and=
found to be 10% faster than a standard bottom-up merge sort, but it's =
also not mathematically "pure" and is guaranteed to fail well bef=
ore reaching the 2^64 limit. I only tested it for up to 17 billion items.</=
div>
</div><div><br></div><div>Anyway, it seems like a no-brainer to me, althoug=
h it could certainly use a little vetting. If there's interest I can ma=
ke a version that's a bit closer to what an STL version might look like=
..</div>
<span class=3D"HOEnZb"><font color=3D"#888888">
</font></span></div><span class=3D"HOEnZb"><font color=3D"#888888">
<p></p>
-- <br>
<br>
--- <br>
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals" group.<br>
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org" target=3D"_=
blank">std-proposals+unsubscribe@isocpp.org</a>.<br>
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org" target=3D"_blank">std-proposals@isocpp.org</a>.<br>
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/" target=3D"_blank">http://groups.google.com/a/isocpp.org/gro=
up/std-proposals/</a>.<br>
</font></span></blockquote></div><br></div>
<p></p>
-- <br />
<br />
--- <br />
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals" group.<br />
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org">std-proposa=
ls+unsubscribe@isocpp.org</a>.<br />
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org">std-proposals@isocpp.org</a>.<br />
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/">http://groups.google.com/a/isocpp.org/group/std-proposals/<=
/a>.<br />
--001a1134850003377104f40d216a--
.
Author: BonzaiThePenguin <mike@bonzaiapps.com>
Date: Fri, 7 Mar 2014 16:09:48 -0800 (PST)
Raw View
------=_Part_1102_30971139.1394237388060
Content-Type: text/plain; charset=UTF-8
Eh? The memcpy calls are only used for the cache, which I recommended
removing anyway. The 3x speedup is from the new algorithm.
--
---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.
------=_Part_1102_30971139.1394237388060
Content-Type: text/html; charset=UTF-8
<div dir="ltr">Eh? The memcpy calls are only used for the cache, which I recommended removing anyway. The 3x speedup is from the new algorithm.</div>
<p></p>
-- <br />
<br />
--- <br />
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.<br />
To unsubscribe from this group and stop receiving emails from it, send an email to <a href="mailto:std-proposals+unsubscribe@isocpp.org">std-proposals+unsubscribe@isocpp.org</a>.<br />
To post to this group, send email to <a href="mailto:std-proposals@isocpp.org">std-proposals@isocpp.org</a>.<br />
Visit this group at <a href="http://groups.google.com/a/isocpp.org/group/std-proposals/">http://groups.google.com/a/isocpp.org/group/std-proposals/</a>.<br />
------=_Part_1102_30971139.1394237388060--
.
Author: Jeffrey Yasskin <jyasskin@google.com>
Date: Fri, 7 Mar 2014 16:11:22 -0800
Raw View
AFAICS there's no need to change the standard to get these speedups;
it's just a better implementation of the current contract? If so, this
is probably better accomplished by sending patches to the libc++
and/or libstdc++ maintainers.
On Fri, Mar 7, 2014 at 4:00 PM, BonzaiThePenguin <mike@bonzaiapps.com> wrote:
> stable_sort is nice and speedy when there's enough memory available, but
> when it fails to allocate the required buffer it calls __inplace_stable_sort
> instead. This part seems to be based on a rather old in-place merge
> algorithm. There's been a lot of recent progress in this area, to the point
> where it can be 3x faster while also reducing the stack requirements from
> O(log n) to O(1).
>
> I have a self-contained implementation up and running here:
> https://github.com/BonzaiThePenguin/WikiSort
>
> In order to adapt it to the STL, I'd recommend removing the cache and the
> floating-point multiplication hack. The hack was profiled and found to be
> 10% faster than a standard bottom-up merge sort, but it's also not
> mathematically "pure" and is guaranteed to fail well before reaching the
> 2^64 limit. I only tested it for up to 17 billion items.
>
> Anyway, it seems like a no-brainer to me, although it could certainly use a
> little vetting. If there's interest I can make a version that's a bit closer
> to what an STL version might look like.
>
> --
>
> ---
> You received this message because you are subscribed to the Google Groups
> "ISO C++ Standard - Future Proposals" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to std-proposals+unsubscribe@isocpp.org.
> To post to this group, send email to std-proposals@isocpp.org.
> Visit this group at
> http://groups.google.com/a/isocpp.org/group/std-proposals/.
--
---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.
.
Author: BonzaiThePenguin <mike@bonzaiapps.com>
Date: Fri, 7 Mar 2014 16:27:38 -0800 (PST)
Raw View
------=_Part_1055_15947711.1394238458703
Content-Type: text/plain; charset=UTF-8
Hm, you appear to be right. I checked my Google search results and it turns
out I thought this was the C++ STL proposal forum, but it actually gave me
C++ ST*D* proposal results. I'll go poke around a bit more.
(if anyone's curious, the no-cache no-hack version is 2x faster rather than
3x faster)
--
---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.
------=_Part_1055_15947711.1394238458703
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
<div dir=3D"ltr">Hm, you appear to be right. I checked my Google search res=
ults and it turns out I thought this was the C++ STL proposal forum, but it=
actually gave me C++ ST<b>D</b> proposal results. I'll go poke around=
a bit more.<div><br></div><div>(if anyone's curious, the no-cache no-hack =
version is 2x faster rather than 3x faster)</div></div>
<p></p>
-- <br />
<br />
--- <br />
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals" group.<br />
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org">std-proposa=
ls+unsubscribe@isocpp.org</a>.<br />
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org">std-proposals@isocpp.org</a>.<br />
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/">http://groups.google.com/a/isocpp.org/group/std-proposals/<=
/a>.<br />
------=_Part_1055_15947711.1394238458703--
.
Author: Richard Smith <richard@metafoo.co.uk>
Date: Fri, 7 Mar 2014 16:30:18 -0800
Raw View
--bcaec51a77fa93e32304f40d7989
Content-Type: text/plain; charset=ISO-8859-1
On Fri, Mar 7, 2014 at 4:27 PM, BonzaiThePenguin <mike@bonzaiapps.com>wrote:
> Hm, you appear to be right. I checked my Google search results and it
> turns out I thought this was the C++ STL proposal forum, but it actually
> gave me C++ ST*D* proposal results. I'll go poke around a bit more.
>
As far as I can tell, you're not looking to make a proposal for the C++ STL
(or the standard library), you're looking to change GCC's libstdc++
implementation. You can probably find some pointers at http://gcc.gnu.org.
> (if anyone's curious, the no-cache no-hack version is 2x faster rather
> than 3x faster)
>
> --
>
> ---
> You received this message because you are subscribed to the Google Groups
> "ISO C++ Standard - Future Proposals" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to std-proposals+unsubscribe@isocpp.org.
> To post to this group, send email to std-proposals@isocpp.org.
> Visit this group at
> http://groups.google.com/a/isocpp.org/group/std-proposals/.
>
--
---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.
--bcaec51a77fa93e32304f40d7989
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
<div dir=3D"ltr"><div class=3D"gmail_extra"><div class=3D"gmail_quote">On F=
ri, Mar 7, 2014 at 4:27 PM, BonzaiThePenguin <span dir=3D"ltr"><<a href=
=3D"mailto:mike@bonzaiapps.com" target=3D"_blank">mike@bonzaiapps.com</a>&g=
t;</span> wrote:<br>
<blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1p=
x #ccc solid;padding-left:1ex"><div dir=3D"ltr">Hm, you appear to be right.=
I checked my Google search results and it turns out I thought this was the=
C++ STL proposal forum, but it actually gave me C++ ST<b>D</b>=A0proposal =
results. I'll go poke around a bit more.</div>
</blockquote><div><br></div><div>As far as I can tell, you're not looki=
ng to make a proposal for the C++ STL (or the standard library), you're=
looking to change GCC's libstdc++ implementation. You can probably fin=
d some pointers at <a href=3D"http://gcc.gnu.org">http://gcc.gnu.org</a>.</=
div>
<div>=A0</div><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;=
border-left:1px #ccc solid;padding-left:1ex"><div dir=3D"ltr"><div>(if anyo=
ne's curious, the no-cache no-hack version is 2x faster rather than 3x =
faster)</div>
</div><div class=3D"HOEnZb"><div class=3D"h5">
<p></p>
-- <br>
<br>
--- <br>
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals" group.<br>
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org" target=3D"_=
blank">std-proposals+unsubscribe@isocpp.org</a>.<br>
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org" target=3D"_blank">std-proposals@isocpp.org</a>.<br>
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/" target=3D"_blank">http://groups.google.com/a/isocpp.org/gro=
up/std-proposals/</a>.<br>
</div></div></blockquote></div><br></div></div>
<p></p>
-- <br />
<br />
--- <br />
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals" group.<br />
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:std-proposals+unsubscribe@isocpp.org">std-proposa=
ls+unsubscribe@isocpp.org</a>.<br />
To post to this group, send email to <a href=3D"mailto:std-proposals@isocpp=
..org">std-proposals@isocpp.org</a>.<br />
Visit this group at <a href=3D"http://groups.google.com/a/isocpp.org/group/=
std-proposals/">http://groups.google.com/a/isocpp.org/group/std-proposals/<=
/a>.<br />
--bcaec51a77fa93e32304f40d7989--
.
Author: Jeffrey Yasskin <jyasskin@google.com>
Date: Fri, 7 Mar 2014 16:46:25 -0800
Raw View
You probably want to send a patch for
http://llvm.org/viewvc/llvm-project/libcxx/trunk/include/algorithm?view=markup
to http://llvm.org/bugs/enter_bug.cgi?product=libc%2B%2B and/or send a
patch for http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/include/bits/stl_algo.h?view=markup
according to the instructions at
http://gcc.gnu.org/contribute.html#patches.
This is a good place to propose changes to the STL interfaces, just
not the implementations.
On Fri, Mar 7, 2014 at 4:27 PM, BonzaiThePenguin <mike@bonzaiapps.com> wrote:
> Hm, you appear to be right. I checked my Google search results and it turns
> out I thought this was the C++ STL proposal forum, but it actually gave me
> C++ STD proposal results. I'll go poke around a bit more.
>
> (if anyone's curious, the no-cache no-hack version is 2x faster rather than
> 3x faster)
>
> --
>
> ---
> You received this message because you are subscribed to the Google Groups
> "ISO C++ Standard - Future Proposals" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to std-proposals+unsubscribe@isocpp.org.
> To post to this group, send email to std-proposals@isocpp.org.
> Visit this group at
> http://groups.google.com/a/isocpp.org/group/std-proposals/.
--
---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.
.
Author: BonzaiThePenguin <mike@bonzaiapps.com>
Date: Fri, 7 Mar 2014 16:48:39 -0800 (PST)
Raw View
------=_Part_1119_21572644.1394239719600
Content-Type: text/plain; charset=UTF-8
Alright, thank you for the clarification and info!
--
---
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an email to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposals/.
------=_Part_1119_21572644.1394239719600
Content-Type: text/html; charset=UTF-8
<div dir="ltr">Alright, thank you for the clarification and info!</div>
<p></p>
-- <br />
<br />
--- <br />
You received this message because you are subscribed to the Google Groups "ISO C++ Standard - Future Proposals" group.<br />
To unsubscribe from this group and stop receiving emails from it, send an email to <a href="mailto:std-proposals+unsubscribe@isocpp.org">std-proposals+unsubscribe@isocpp.org</a>.<br />
To post to this group, send email to <a href="mailto:std-proposals@isocpp.org">std-proposals@isocpp.org</a>.<br />
Visit this group at <a href="http://groups.google.com/a/isocpp.org/group/std-proposals/">http://groups.google.com/a/isocpp.org/group/std-proposals/</a>.<br />
------=_Part_1119_21572644.1394239719600--
.
Author: Thiago Macieira <thiago@macieira.org>
Date: Fri, 07 Mar 2014 17:05:40 -0800
Raw View
Em sex 07 mar 2014, =E0s 16:27:38, BonzaiThePenguin escreveu:
> Hm, you appear to be right. I checked my Google search results and it tur=
ns
> out I thought this was the C++ STL proposal forum, but it actually gave m=
e
> C++ ST*D* proposal results. I'll go poke around a bit more.
You're not too far.
This is the place where the API of the Standard Library gets defined. We ju=
st=20
don't do the implementation.
--=20
Thiago Macieira - thiago (AT) macieira.info - thiago (AT) kde.org
Software Architect - Intel Open Source Technology Center
PGP/GPG: 0x6EF45358; fingerprint:
E067 918B B660 DBD1 105C 966C 33F5 F005 6EF4 5358
--=20
---=20
You received this message because you are subscribed to the Google Groups "=
ISO C++ Standard - Future Proposals" group.
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to std-proposals+unsubscribe@isocpp.org.
To post to this group, send email to std-proposals@isocpp.org.
Visit this group at http://groups.google.com/a/isocpp.org/group/std-proposa=
ls/.
.