digitalmars.D.announce - Beta D 2.068.2-b2
- Martin Nowak (5/5) Sep 14 2015 The second beta for the 2.068.2 point release fixes an regression with
- Meta (26/31) Sep 15 2015 I believe I've found a compiler performance bug (or regression, I
- Rory McGuire via Digitalmars-d-announce (9/44) Sep 21 2015 That takes forever on 2.068.0 as well. Even as:
- Meta (3/11) Sep 21 2015 I haven't had the chance to test it with anything earlier than
The second beta for the 2.068.2 point release fixes an regression with destroy that could result in a memory leak [¹]. http://downloads.dlang.org/pre-releases/2.x/2.068.2/ -Martin [¹]: https://issues.dlang.org/show_bug.cgi?id=15044
Sep 14 2015
On Monday, 14 September 2015 at 21:05:42 UTC, Martin Nowak wrote:The second beta for the 2.068.2 point release fixes an regression with destroy that could result in a memory leak [¹]. http://downloads.dlang.org/pre-releases/2.x/2.068.2/ -Martin [¹]: https://issues.dlang.org/show_bug.cgi?id=15044I believe I've found a compiler performance bug (or regression, I don't have any other compiler versions to test on right now). The following programming takes an abnormally long times to compile on 2.068.1 and 2.068.2: import std.range; import std.array; import std.conv; import std.algorithm; import std.string; import std.stdio; enum Instructions: ushort { add = 123, sub = 124, } uint[ushort.max] inst; void initInst() { //Removing this line drastically reduces compile time alias InstElem = ElementType!(typeof(inst)); } void main() { } https://issues.dlang.org/show_bug.cgi?id=15062
Sep 15 2015
On Tue, Sep 15, 2015 at 7:37 PM, Meta via Digitalmars-d-announce < digitalmars-d-announce puremagic.com> wrote:On Monday, 14 September 2015 at 21:05:42 UTC, Martin Nowak wrote:That takes forever on 2.068.0 as well. Even as: import std.range; uint[ushort.max] inst; alias InstElem =3D ElementType!(typeof(inst)); even weirder (to me at least) its related to the number of items in "inst". uint[1] is quick. uint[10000] takes about 1.5s, uint[20000] takes about 5s. On which compiler did this run quickly?The second beta for the 2.068.2 point release fixes an regression with destroy that could result in a memory leak [=C2=B9]. http://downloads.dlang.org/pre-releases/2.x/2.068.2/ -Martin [=C2=B9]: https://issues.dlang.org/show_bug.cgi?id=3D15044I believe I've found a compiler performance bug (or regression, I don't have any other compiler versions to test on right now). The following programming takes an abnormally long times to compile on 2.068.1 and 2.068.2: import std.range; import std.array; import std.conv; import std.algorithm; import std.string; import std.stdio; enum Instructions: ushort { add =3D 123, sub =3D 124, } uint[ushort.max] inst; void initInst() { //Removing this line drastically reduces compile time alias InstElem =3D ElementType!(typeof(inst)); } void main() { } https://issues.dlang.org/show_bug.cgi?id=3D15062
Sep 21 2015
On Monday, 21 September 2015 at 13:23:21 UTC, Rory McGuire wrote:That takes forever on 2.068.0 as well. Even as: import std.range; uint[ushort.max] inst; alias InstElem = ElementType!(typeof(inst)); even weirder (to me at least) its related to the number of items in "inst". uint[1] is quick. uint[10000] takes about 1.5s, uint[20000] takes about 5s. On which compiler did this run quickly?I haven't had the chance to test it with anything earlier than 2.068 yet.
Sep 21 2015