Re: DIP1000: Scoped Pointers

2016-08-10 Thread Bill Baxter via Digitalmars-d-announce
This bit seems odd: T func(T* t) { return t; // ok } Is there an implicit conversion from T* to T? On Wed, Aug 10, 2016 at 10:05 PM, rikki cattermole via Digitalmars-d-announce wrote: > On 11/08/2016 8:35 AM, Dicebot wrote: > >> The first DIP has just

Re: DIP1000: Scoped Pointers

2016-08-10 Thread rikki cattermole via Digitalmars-d-announce
On 11/08/2016 8:35 AM, Dicebot wrote: The first DIP has just landed into the new queue. It is a proposal from language authors and thus it bypasses usual nitpicking process and proceeds straight to requesting community (your!) feedback. Essentially, it is an attempt to solve reference lifetime

Re: DIP1000: Scoped Pointers

2016-08-10 Thread Walter Bright via Digitalmars-d-announce
On 8/10/2016 4:56 PM, Nicholas Wilson wrote: How will the infinite lifetime of ArrayLiteral and ArrayLiteral[constant] interact with LDC's GC to stack promotion pass? I don't know about how that works in LDC, but general such a promotion can only be done if the compiler can prove there are no

Re: DIP1000: Scoped Pointers

2016-08-10 Thread Nicholas Wilson via Digitalmars-d-announce
On Wednesday, 10 August 2016 at 20:35:23 UTC, Dicebot wrote: The first DIP has just landed into the new queue. It is a proposal from language authors and thus it bypasses usual nitpicking process and proceeds straight to requesting community (your!) feedback. [...] How will the infinite

DIP1000: Scoped Pointers

2016-08-10 Thread Dicebot via Digitalmars-d-announce
The first DIP has just landed into the new queue. It is a proposal from language authors and thus it bypasses usual nitpicking process and proceeds straight to requesting community (your!) feedback. Essentially, it is an attempt to solve reference lifetime problem by extending implementation

Re: Autotesting dub packages with dmd nightly

2016-08-10 Thread Seb via Digitalmars-d-announce
On Wednesday, 10 August 2016 at 18:35:03 UTC, Sebastiaan Koppe wrote: Yes, but from past experience we know that people don't look at results, if you don't make it part of PR acceptance. So true. Then I will do PR's first. Thinking about it, you could also opt for integrating it with the

Re: Autotesting dub packages with dmd nightly

2016-08-10 Thread Sebastiaan Koppe via Digitalmars-d-announce
On Wednesday, 10 August 2016 at 10:32:24 UTC, Martin Nowak wrote: We want better ranking of dub packages (mostly by download, but for sure also showing CI results [ยน]). I was also thinking about integrating results from CI builds that packages do themselves. But there is some 'impedance

Re: August Boston D users meetup

2016-08-10 Thread Andrei Alexandrescu via Digitalmars-d-announce
On 08/10/2016 01:12 PM, Steven Schveighoffer wrote: On 8/1/16 10:11 AM, Steven Schveighoffer wrote: I posted this a while ago, forgot to announce. Please join us if you are in the area! Already 5 going. http://www.meetup.com/Boston-area-D-Programming-Language-Meetup/events/232865668/

Re: Beta D 2.071.2-b2

2016-08-10 Thread Johan Engelen via Digitalmars-d-announce
On Tuesday, 9 August 2016 at 15:37:27 UTC, Martin Nowak wrote: Please report any bugs at https://issues.dlang.org I'd appreciate it if someone could have a look at this regression: https://issues.dlang.org/show_bug.cgi?id=16369

Re: D on exercism.io

2016-08-10 Thread Martin Nowak via Digitalmars-d-announce
On 08/09/2016 09:43 AM, celavek wrote: > If anyone has ideas for new exercises please contribute or if the time > is an issue send me > a message with a clear problem statement and a set of unit tests. > > I would like to say that for me the sit worked quite well and it helped > me get started >

Re: Autotesting dub packages with dmd nightly

2016-08-10 Thread Martin Nowak via Digitalmars-d-announce
On 08/08/2016 09:54 AM, Sebastiaan Koppe wrote: > On Sunday, 7 August 2016 at 23:08:34 UTC, Martin Nowak wrote: >> I actually don't think this makes sense. You're not in the position to >> maintain 1K+ packages, it's the library owners that need to test their >> code. > Thanks for taking the time