On 2015-12-21 23:50:17 +, bachmeier said:
All Packt ebooks are currently only $5.00, including pre-order of D Web
Development, Learning D, and D Cookbook.
https://www.packtpub.com/web-development/d-web-development
https://www.packtpub.com/application-development/learning-d
https://www.pack
On Monday, 21 December 2015 at 17:28:51 UTC, Andrei Alexandrescu
wrote:
https://www.reddit.com/r/programming/comments/3xq2ul/codedive_2015_talk_three_cool_things_about_d/
Great motivation as always! Thx!
On Wednesday, 16 December 2015 at 09:47:35 UTC, Jakob Jenkov
wrote:
Since we are rather new to D, would anyone be interested in
helping us a bit out making such a library? We can probably do
the coding ourselves, but might need some tips about how to
pack it nicely into a D library which can
On Monday, 21 December 2015 at 17:28:51 UTC, Andrei Alexandrescu
wrote:
https://www.reddit.com/r/programming/comments/3xq2ul/codedive_2015_talk_three_cool_things_about_d/
By the way, even though I wholeheartedly share your sentiment
regarding those "functional" examples, I found it to be an
i
On 12/22/15 1:29 PM, David Nadlinger wrote:
---
ulong factorial(this n) {
return n <= 1 ? 1 : n * factorial(n - 1);
}
---
Am I missing some new feature here? What does the 'this' mean?
-Steve
On Tuesday, 22 December 2015 at 19:07:55 UTC, Steven
Schveighoffer wrote:
Am I missing some new feature here? What does the 'this' mean?
I have no idea, this must have been some sort of weird copy/paste
or auto-correct mistake on my side. It's supposed to be "uint",
as in Andrei's talk.
—
On 12/21/2015 09:28 AM, Andrei Alexandrescu wrote:
https://www.reddit.com/r/programming/comments/3xq2ul/codedive_2015_talk_three_cool_things_about_d/
https://www.facebook.com/dlang.org/posts/1192267587453587
https://twitter.com/D_Programming/status/678989872367988741
Andrei
Two unnecessary
On 12/22/2015 10:29 AM, David Nadlinger wrote:
Not sure about how it arrives at the crazily unrolled loop, but no recursion in
sight anymore.
It's doing tail recursion optimization, which turns the recursion into a loop.
Then the loop is unrolled 8 times.
On Wednesday, 23 December 2015 at 01:07:57 UTC, Walter Bright
wrote:
On 12/22/2015 10:29 AM, David Nadlinger wrote:
Not sure about how it arrives at the crazily unrolled loop,
but no recursion in
sight anymore.
It's doing tail recursion optimization, which turns the
recursion into a loop.
