On Thursday, 19 June 2014 at 21:27:17 UTC, Joseph Rushton
Wakeling wrote:
I realized that it ought to be possible to allow a more direct
drop-in replacement for std.random by adding static opCalls to
the classes which were previously structs.
Thoughts on this, in favour, against ... ?
I'd
On Wednesday, 11 June 2014 at 16:35:31 UTC, Kagamin wrote:
In some scenarios impredictability is not enough. For example,
when you generate a session id, an attacker doesn't have to
predict it ahead of time, he can guess it at any time later.
And if they listen to radio waves - that's an open
On Wednesday, 11 June 2014 at 06:41:34 UTC, Joseph Rushton
Wakeling wrote:
Done :) ... if I get a response, I'll make sure to incorporate
everything said.
Great, let me know how that goes. :-)
Well, the ultimate conclusion of the conversation with the guy is
that:
1. ISAAC probably isn't
On Thursday, 12 June 2014 at 17:35:39 UTC, Nick Sabalausky wrote:
Naturally, it doesn't yet exist in hap.random because, as
Joseph said, hap.random's step one is to match the current
std.random as closely as possible. I'd be happy to put together
a PR to adapt my RNG stuff above to hap.random
On Wednesday, 11 June 2014 at 06:41:34 UTC, Joseph Rushton
Wakeling wrote:
That would be very cool. Can you point me at your code
examples?
It's written in Nimrod (in a way that someone who learned Nimrod
the day before would write them, because I learned Nimrod the day
before and worked on
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
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 Monday, 27 January 2014 at 09:19:25 UTC, Kagamin wrote:
On Thursday, 23 January 2014 at 10:24:23 UTC, Chris wrote:
A good example are headlines. A classic is Driver refused
license. Now, everybody will assume that it was not the
driver who refused the license (default assumption or the
On Sunday, 22 December 2013 at 08:06:30 UTC, Marco Leise wrote:
Can you elaborate a bit? How do you know that the Java LCG
can produce every 32-bit integer once? If that's true then
the problem with the Java code was something different and I
was just biased, because I was already expecting the
On Friday, 20 December 2013 at 16:20:44 UTC, marcpmichel wrote:
On Friday, 20 December 2013 at 15:05:07 UTC, bearophile wrote:
marcpmichel:
Here is the ugly thing :
https://github.com/jbrains/trivia/tree/master/d
And wrong:
if (rand.front() % 9 == 7) {
Bye,
bearophile
Do you mean I
On Saturday, 23 March 2013 at 10:01:19 UTC, Moritz Maxeiner wrote:
No problem at all. There is an example quoted in the README and
how to compile it, so without further information form your
side I don't know what the problem is. To get the example from
the README working:
- Download/Clone the
On Saturday, 23 March 2013 at 21:19:14 UTC, Moritz Maxeiner wrote:
TLDR: Your example should now work, provided you fix what I
previously mentioned. You can also look at sample/fibonacci.d
which I used instead of your fac to confirm that you gist now
works.
- Moritz
Awesome. Indeed, it
On Friday, 15 March 2013 at 17:40:36 UTC, Moritz Maxeiner wrote:
Hi, I would like to announce llvm-d, which provides LLVM
bindings for D.
Greetings,
I hope you don't mind a bit of a support request, but I'm having
difficulties getting it to work:
On Thursday, 30 August 2012 at 23:18:34 UTC, Nick Sabalausky
wrote:
I can usually identify speed readers when emailing because
they're the
ones whose responses clearly indicate they totally missed at
least half
--snip--
Look, I'm sure you've just met some poor speed readers. And your
point
14 matches
Mail list logo
