------=_Part_1439_84200747.1458289767419
Content-Type: multipart/alternative;
 boundary="----=_Part_1440_1583829194.1458289767419"

------=_Part_1440_1583829194.1458289767419
Content-Type: text/plain; charset=UTF-8

Hi Everyone,
Does there exist a reference implementation of the proposed std::variant
that implements the compromise solution with the special state? I am
interested in measuring performance differences between boost::variant
(with strong guarantee on assignment) and the proposed std::variant (that
is supposed to be as fast as a union and a tag).

Regards,
&rzej

--
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.
To view this discussion on the web visit https://groups.google.com/a/isocpp.org/d/msgid/std-proposals/8e3e8fe1-459a-4185-a7b4-89a41e881c5e%40isocpp.org.

------=_Part_1440_1583829194.1458289767419
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Hi Everyone,<br>Does there exist a reference implementatio=
n of the proposed std::variant that implements the compromise solution with=
 the special state? I am interested in measuring performance differences be=
tween boost::variant (with strong guarantee on assignment) and the proposed=
 std::variant (that is supposed to be as fast as a union and a tag).<br><br=
>Regards,<br>&amp;rzej <br></div>

<p></p>

-- <br />
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals&quot; 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 />
To view this discussion on the web visit <a href=3D"https://groups.google.c=
om/a/isocpp.org/d/msgid/std-proposals/8e3e8fe1-459a-4185-a7b4-89a41e881c5e%=
40isocpp.org?utm_medium=3Demail&utm_source=3Dfooter">https://groups.google.=
com/a/isocpp.org/d/msgid/std-proposals/8e3e8fe1-459a-4185-a7b4-89a41e881c5e=
%40isocpp.org</a>.<br />

------=_Part_1440_1583829194.1458289767419--
------=_Part_1439_84200747.1458289767419--

.

On 18/03/16 08:29, Andrzej Krzemie=C5=84ski wrote:
> Hi Everyone,
> Does there exist a reference implementation of the proposed std::variant
> that implements the compromise solution with the special state? I am
> interested in measuring performance differences between boost::variant
> (with strong guarantee on assignment) and the proposed std::variant
> (that is supposed to be as fast as a union and a tag).

My implementation at https://bitbucket.org/anthonyw/variant is trying to
be as close as possible to the current proposal.

It's not a blessed "reference implementation", and it's possible I've
missed something, but you can give it a try. I haven't done any
benchmarks myself.

Anthony
--=20
Author of C++ Concurrency in Action     http://www.stdthread.co.uk/book/
just::thread C++11 thread library             http://www.stdthread.co.uk
Just Software Solutions Ltd       http://www.justsoftwaresolutions.co.uk
15 Carrallack Mews, St Just, Cornwall, TR19 7UL, UK. Company No. 5478976

--=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.
To view this discussion on the web visit https://groups.google.com/a/isocpp=
..org/d/msgid/std-proposals/56EBBF62.3050403%40gmail.com.

.

------=_Part_1428_584611613.1458291814195
Content-Type: multipart/alternative;
 boundary="----=_Part_1429_2033922293.1458291814195"

------=_Part_1429_2033922293.1458291814195
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable



W dniu pi=C4=85tek, 18 marca 2016 09:42:14 UTC+1 u=C5=BCytkownik Anthony Wi=
lliams=20
napisa=C5=82:
>
> On 18/03/16 08:29, Andrzej Krzemie=C5=84ski wrote:=20
> > Hi Everyone,=20
> > Does there exist a reference implementation of the proposed std::varian=
t=20
> > that implements the compromise solution with the special state? I am=20
> > interested in measuring performance differences between boost::variant=
=20
> > (with strong guarantee on assignment) and the proposed std::variant=20
> > (that is supposed to be as fast as a union and a tag).=20
>
> My implementation at https://bitbucket.org/anthonyw/variant is trying to=
=20
> be as close as possible to the current proposal.=20
>
> It's not a blessed "reference implementation", and it's possible I've=20
> missed something, but you can give it a try. I haven't done any=20
> benchmarks myself.=20
>
> =20
Exactly what I needed.

Thanks,
&rzej=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.
To view this discussion on the web visit https://groups.google.com/a/isocpp=
..org/d/msgid/std-proposals/f54ffade-ed2e-4297-ac12-8148cfcc2064%40isocpp.or=
g.

------=_Part_1429_2033922293.1458291814195
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><br><br>W dniu pi=C4=85tek, 18 marca 2016 09:42:14 UTC+1 u=
=C5=BCytkownik Anthony Williams napisa=C5=82:<blockquote class=3D"gmail_quo=
te" style=3D"margin: 0;margin-left: 0.8ex;border-left: 1px #ccc solid;paddi=
ng-left: 1ex;">On 18/03/16 08:29, Andrzej Krzemie=C5=84ski wrote:
<br>&gt; Hi Everyone,
<br>&gt; Does there exist a reference implementation of the proposed std::v=
ariant
<br>&gt; that implements the compromise solution with the special state? I =
am
<br>&gt; interested in measuring performance differences between boost::var=
iant
<br>&gt; (with strong guarantee on assignment) and the proposed std::varian=
t
<br>&gt; (that is supposed to be as fast as a union and a tag).
<br>
<br>My implementation at <a href=3D"https://bitbucket.org/anthonyw/variant"=
 target=3D"_blank" rel=3D"nofollow" onmousedown=3D"this.href=3D&#39;https:/=
/www.google.com/url?q\75https%3A%2F%2Fbitbucket.org%2Fanthonyw%2Fvariant\46=
sa\75D\46sntz\0751\46usg\75AFQjCNE8yBmc8elrYR3VAntb1yyKrbEdeA&#39;;return t=
rue;" onclick=3D"this.href=3D&#39;https://www.google.com/url?q\75https%3A%2=
F%2Fbitbucket.org%2Fanthonyw%2Fvariant\46sa\75D\46sntz\0751\46usg\75AFQjCNE=
8yBmc8elrYR3VAntb1yyKrbEdeA&#39;;return true;">https://bitbucket.org/<wbr>a=
nthonyw/variant</a> is trying to
<br>be as close as possible to the current proposal.
<br>
<br>It&#39;s not a blessed &quot;reference implementation&quot;, and it&#39=
;s possible I&#39;ve
<br>missed something, but you can give it a try. I haven&#39;t done any
<br>benchmarks myself.
<br>
<br></blockquote><div>=C2=A0</div><div>Exactly what I needed.<br><br>Thanks=
,<br>&amp;rzej <br></div></div>

<p></p>

-- <br />
You received this message because you are subscribed to the Google Groups &=
quot;ISO C++ Standard - Future Proposals&quot; 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 />
To view this discussion on the web visit <a href=3D"https://groups.google.c=
om/a/isocpp.org/d/msgid/std-proposals/f54ffade-ed2e-4297-ac12-8148cfcc2064%=
40isocpp.org?utm_medium=3Demail&utm_source=3Dfooter">https://groups.google.=
com/a/isocpp.org/d/msgid/std-proposals/f54ffade-ed2e-4297-ac12-8148cfcc2064=
%40isocpp.org</a>.<br />

------=_Part_1429_2033922293.1458291814195--
------=_Part_1428_584611613.1458291814195--

.