Awesome! I'll definitely check this out :)
Would there be any chance of additional contributions, such as an
ISAAC RNG implementation, being accepted? I wouldn't go as far as
to guarantee it for crypto purposes, but I've been messing around
with an implementation recently and wouldn't mind
Ali Cehreli:
I wonder what bearophile's response will be. ;)
Despite looking like a silly sequence of optimizations, I do have
some general comments on that text. Thanks to Kenji
(https://github.com/D-Programming-Language/dmd/pull/3650 ) this
code is now valid:
void foo(size_t N)(ref
On Tuesday, 10 June 2014 at 06:53:46 UTC, Chris Cain wrote:
Awesome! I'll definitely check this out :)
Thanks, that would be great!
Would there be any chance of additional contributions, such as
an ISAAC RNG implementation, being accepted? I wouldn't go as
far as to guarantee it for crypto
Really nice. I watched it twice.
Bastiaan.
Joseph Rushton Wakeling:
Thanks in advance for all testing and feedback.
I have appreciated to use this generator (but I am not yet sure
how much good it is. I have seen it's fast and sufficiently good
for some of my simpler purposes):
http://en.literateprograms.org/R250/521_%28C%29
Pass it by reference, I see no reason why MT can't be pure.
Kagamin:
Pass it by reference, I see no reason why MT can't be pure.
I meant strongly pure :-)
Bye,
bearophile
On Tuesday, 10 June 2014 at 10:21:39 UTC, bearophile wrote:
I have appreciated to use this generator (but I am not yet sure
how much good it is. I have seen it's fast and sufficiently
good for some of my simpler purposes):
http://en.literateprograms.org/R250/521_%28C%29
Should be
Joseph Rushton Wakeling:
However, I don't see any reason why one couldn't have a
strongly pure function that purely transforms state, which
could be wrapped by an RNG class
So can you can generate random values in strongly pure functions
with this? You can allocate the RNG class inside the
Andrei's D Talk (Day 2) is up:
http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2014/D
Matheus.
Watch, discuss, upvote!
https://news.ycombinator.com/newest
https://twitter.com/D_Programming/status/476386465166135296
https://www.facebook.com/dlang.org/posts/863635576983458
http://www.reddit.com/r/programming/comments/27sjxf/dconf_2014_day_1_talk_4_inside_the_regular/
Andrei
On 6/10/14, 6:28 AM, Mattcoder wrote:
Andrei's D Talk (Day 2) is up:
http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2014/D
Matheus.
Topics overlap a tad with NDC's so if you watched that you may want to
skip over the portion between 7:41 and 15:42.
Andrei
Leverage - my talk at Lang.NEXT.
http://www.reddit.com/r/programming/comments/27sp6r/langnext_2014_leverage_by_andrei_alexandrescu/
https://news.ycombinator.com/newest
https://twitter.com/D_Programming/status/476400279160885248
https://www.facebook.com/dlang.org/posts/863665863647096
Andrei
On Wednesday, 4 June 2014 at 06:13:39 UTC, Andrei Alexandrescu
wrote:
Of possible interest.
http://www.reddit.com/r/programming/comments/278twt/panel_systems_programming_in_2014_and_beyond/
Andrei
IMHO, the coolest thing was when Rob Pike told about the tool
they made for automatically
On Tuesday, 10 June 2014 at 15:37:11 UTC, Andrei Alexandrescu
wrote:
Watch, discuss, upvote!
https://news.ycombinator.com/newest
https://twitter.com/D_Programming/status/476386465166135296
https://www.facebook.com/dlang.org/posts/863635576983458
On Friday, 30 May 2014 at 11:48:57 UTC, Chris wrote:
There's _always_ something you can learn, even if you think you
know it all.
Like the fact that you can @disable this() for a struct, even
though you can't implement it. I didn't know that, but I have the
perfect use case for it (and it's
On Monday, 9 June 2014 at 19:14:15 UTC, Jacob Carlborg wrote:
Adam, I noticed that you mentioned DStep in the book. By
reading the part about integrating with C++ I got the
impression that DStep can handle C++. Currently, that's not the
case.
blargh, I thought it could do more. Does it at
On Tuesday, 10 June 2014 at 17:31:52 UTC, Lars T. Kyllingstad
wrote:
Like the fact that you can @disable this() for a struct, even
though you can't implement it.
If my memory is working properly I actually think I was the one
who suggested that to Walter a few years ago when it was
On Tuesday, 10 June 2014 at 16:30:31 UTC, Andrei Alexandrescu
wrote:
Leverage - my talk at Lang.NEXT.
http://www.reddit.com/r/programming/comments/27sp6r/langnext_2014_leverage_by_andrei_alexandrescu/
https://news.ycombinator.com/newest
At about 40.42 in the Thoughts on static regex there is written
even compile-time printf would be awesome. There is a patch
about __ctWrite in GitHug, it should be fixed and merged.
Bye,
bearophile
On Tuesday, 10 June 2014 at 10:37:17 UTC, Kagamin wrote:
Pass it by reference, I see no reason why MT can't be pure.
For what it's worth, the Mersenne Twister in hap.random is
already weakly pure (.front and .popFront are both pure methods).
On Tuesday, 10 June 2014 at 11:32:54 UTC, bearophile wrote:
So can you can generate random values in strongly pure
functions with this? You can allocate the RNG class inside the
function... If that's right, then is this simple strongly pure
random generator worth adding to std.random2?
Joseph Rushton Wakeling:
Forgive me if I'm missing something obvious, but as it stands I
don't see how the R250/521 algorithm you pointed me to can be
strongly pure.
Sorry, the R250/521 idea and the strongly pure idea are unrelated
to each other.
but wouldn't that be a memory allocation
On Tuesday, 10 June 2014 at 21:02:54 UTC, bearophile wrote:
Sorry, the R250/521 idea and the strongly pure idea are
unrelated to each other.
Ah, good. That makes things simpler. I'll implement R250/521
for you, though.
For the strongly pure random generator we should choose a
generator
Hey again Joe,
I had an opportunity to give the entire code a good once over
read and I have a few comments.
1. Biggest thing about the new hap.random is how much nicer it is
to actually READ. The first few times I went through the current
std.random, I remember basically running out of
On 6/10/2014 1:46 AM, bearophile wrote:
I don't like D to
throw away static information that can be used to avoid run-time crashes, this
is the opposite of what is usually called a safe language.
To be pedantic, D being a safe language means memory safe, not no seg
faults of any sort.
Joseph Rushton Wakeling:
I'll implement R250/521 for you, though.
Please stop, I am not worth that, and I don't even know how much
good that generator is. So for you it's better to focus on more
important matters of the new random module. Extra generators can
be added later if needed.
It is time to begin preparations for the next release of DMD. I am aim
for a two week beta release to commence on 30 June with branching of
2.066 and end on 7 July with the release of 2.066.0.
Concurrently with this release, I would like to produce a maintenance
release for 2.065. Please
Please do not tag anything until we decide if virtual is a
keyword in D.
See: https://github.com/D-Programming-Language/dlang.org/pull/584
On 6/10/14, 10:01 PM, Brian Schott wrote:
Please do not tag anything until we decide if virtual is a keyword in D.
See: https://github.com/D-Programming-Language/dlang.org/pull/584
The branch will not be created until 30 June. I trust that this will be
sorted out by then.
30 matches
Mail list logo
