On 3/15/12 10:39 AM, Andrei Alexandrescu wrote:
> Hello,
>
>
> Somewhat unexpectedly even to me, I'll be in Seattle for the Lang.NEXT
> conference together with Walter. Both of us will give talks.
>
> http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012
>
> Would be glad to redo a D Seattle meeting. Regardless, the conference is
> interesting and free so it's worth joining if time allows.

Slides are online:

http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/Three-Unlikely-Successful-Features-of-D

Talk will be up in due time, probably Monday. Philippe and Dmitry, you have a lot of work to do :o).


Andrei

On 4/7/12, Andrei Alexandrescu <SeeWebsiteForEmail@erdani.org> wrote:
> Slides are online:
>
> http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/Three-Unlikely-Successful-Features-of-D

I don't know if Walter opened another thread for his presentation, but his slides are online now too:

http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/The-D-Programming-Language

On 4/7/12, Andrej Mitrovic <andrej.mitrovich@gmail.com> wrote:
> I don't know if Walter opened another thread for his presentation, but his slides are online now too:
>
> http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/The-D-Programming-Language

Heheh, I've noticed Walter is using FIle.byLine to demonstrate RAII on page 24. I guess he didn't run into this yet: http://d.puremagic.com/issues/show_bug.cgi?id=7022

Andrei Alexandrescu:

> Slides are online: http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/Three-Unlikely-Successful-Features-of-D

Putting the slides online before the talk is a very good idea, thank you.

Page 31: the title of this slide is "D array = pointer + length", but the image shows two pointers inside the array struct/fat pointer. Walter has said several times his desire to replace the pointer + length with two pointers. Are those desires going to produce a change?
And even if this is a bit OT: why aren't D array fat references composed by 3 fields: pointer + length + capacity? I think Go slices are like this.


Page 34, "Convenient": I don't know how well DMD will optimize this code, but it's one of the simplest to read array-twiddling palindrome functions I've seen.
But probably I write:
!a.empty
Instead of:
a.length


Page 36, "Palindrome generalized": unfortunately D doesn't map syntaxes like a[1..$-1] to range functions :-)


Page 51: An horizontal line needs to be at 1.0 too. But I prefer a graph that shows run-time seconds.

Very nice slides pack.
Bye,
bearophile

On 4/8/12 11:31 AM, bearophile wrote:
> Andrei Alexandrescu:
>
>> Slides are online:
>> http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/Three-Unlikely-Successful-Features-of-D
>
>>
> Putting the slides online before the talk is a very good idea, thank
> you.
>
> Page 31: the title of this slide is "D array = pointer + length", but
> the image shows two pointers inside the array struct/fat pointer.

I mention during the talk that the concept is the same regardless of that representation detail.

Andrei

On Saturday, 7 April 2012 at 06:33:03 UTC, Andrei Alexandrescu wrote:
> Slides are online:
>
> http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/Three-Unlikely-Successful-Features-of-D

In C# you rethrow using throw; statement: throw e; loses stack trace.

On Saturday, 7 April 2012 at 06:33:03 UTC, Andrei Alexandrescu wrote:
> Slides are online:
>
> http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/Three-Unlikely-Successful-Features-of-D

rollback1 seems to be missing on slide 15. You probably need 3 of them there.

And you probably need to check if error==nil instead of error!=nil... Sorry, if I say nonsense, I don't know Go.