Re: New newsgroup: digitalmars.D.ldc

2013-01-24 Thread Joseph Rushton Wakeling
On Sunday, 16 December 2012 at 10:27:05 UTC, David Nadlinger wrote: For everyone wondering why it does not show up in the web interface (forum.dlang.org) yet What about mailing-list access? I see nothing on lists.puremagic.com.

Re: DConf 2013 Day 1 Talk 5: Using D Alongside a Game Engine by Manu Evans

2013-05-17 Thread Joseph Rushton Wakeling
Really exciting to see how D is being used in this context, and the C++ binding examples are inspiring. Just one niggle -- the word postmortem makes it sound like a study of how something died, whereas this seems to be work that is very much alive and kicking!

Re: DConf 2013 Day 1 Talk 5: Using D Alongside a Game Engine by Manu Evans

2013-05-18 Thread Joseph Rushton Wakeling
On Friday, 17 May 2013 at 22:52:19 UTC, Adam D. Ruppe wrote: The last question in the video was if it would work in Linux too, and idk about the rest of their setup, but the C++ binding is something I've done before, and the code is virtually identical to what Manu did. That's good to know,

Re: DConf 2013 Day 1 Talk 7: Panel with Walter Bright and Andrei Alexandrescu

2013-05-23 Thread Joseph Rushton Wakeling
On Wednesday, 22 May 2013 at 13:44:10 UTC, Dicebot wrote: Eh, official definition of breaking change keeps breaking my heart. But I guess this is a mindset set in stone now and changing it is close to impossible. Can you elaborate a little bit? I felt personally that what the discussion

Re: DConf 2013 Day 2 Talk 1: GDC by Iain Buclaw

2013-05-25 Thread Joseph Rushton Wakeling
Wonderful talk, Iain. :-) One question about the copyright assignment issue. How does this operate in practice? Is it going to be that the D frontend will simply go forward as copyright (c) FSF (which isn't a problem DMD-wise as their assignment agreement immediately licenses the code back

Re: DConf 2013 Day 3 Talk 4: LDC by David Nadlinger

2013-06-17 Thread Joseph Rushton Wakeling
On Monday, 17 June 2013 at 15:19:27 UTC, Andrej Mitrovic wrote: There seems to be some audio glitching every couple of seconds (at the beginning). I've noticed this in other videos as well. It's mostly minimal though, not much harm done. https://www.youtube.com/watch?v=m6jsXQm5IrM#t=106s

Re: DConf 2013 Day 3 Talk 4: LDC by David Nadlinger

2013-06-18 Thread Joseph Rushton Wakeling
... slightly more serious response: really nice talk, David, and thanks for the mention of Dregs. :-)

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-06-25 Thread Joseph Rushton Wakeling
On Tuesday, 25 June 2013 at 15:44:02 UTC, Joakim wrote: Just finished watching Andrei's talk, it was up to his usual high standard. I found the bits about professionalism a bit weird though: can we really expect that from a volunteer effort? I'm pretty sure the A/V guys at the conference

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-06-26 Thread Joseph Rushton Wakeling
On Tuesday, 25 June 2013 at 21:38:01 UTC, Joakim wrote: I don't know the views of the key contributors, but I wonder if they would have such a knee-jerk reaction against any paid/closed work. The current situation would seem much more of a kick in the teeth to me: spending time trying to be

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-06-26 Thread Joseph Rushton Wakeling
On Wednesday, 26 June 2013 at 12:39:05 UTC, Jacob Carlborg wrote: On 2013-06-26 12:16, Leandro Lucarella wrote: Yeah, right, probably Python and Ruby have only 5k users... There are companies backing those languages, at least Ruby, to some extent. They don't own them, though -- they

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-06-26 Thread Joseph Rushton Wakeling
On Wednesday, 26 June 2013 at 15:52:33 UTC, Joakim wrote: I suggest you read my original post more carefully. I have not suggested closing up the entire D toolchain, as you seem to imply. I have suggested working on optimization patches in a closed-source manner and providing two versions of

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-06-26 Thread Joseph Rushton Wakeling
On Wednesday, 26 June 2013 at 19:26:37 UTC, Iain Buclaw wrote: I can't be bothered to read all points the both of you have mentioned thus far, but I do hope to add a voice of reason to calm you down. ;) Quick, nurse, the screens! ... or perhaps, Someone throw a bucket of water over them? :-P

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-06-26 Thread Joseph Rushton Wakeling
On Wednesday, 26 June 2013 at 19:01:42 UTC, Joakim wrote: Why are they guaranteed such patches? They have advantages because they use different compiler backends. If they think their backends are so great, let them implement their own optimizations and compete. I could respond at greater

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-06-26 Thread Joseph Rushton Wakeling
On Wednesday, 26 June 2013 at 21:29:12 UTC, Iain Buclaw wrote: Don't call be Shirley... Serious? :-) By the way, I hope you didn't feel I was trying to speak on behalf of GDC -- wasn't my intention. :-) I did, and it hurt. :o) Oh no. 50 shades of #DD ? :-)

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-06-27 Thread Joseph Rushton Wakeling
On Thursday, 27 June 2013 at 08:21:12 UTC, Joakim wrote: I'm familiar with its arguments from a summary, not particularly interested in reading the whole thing. You know, I think I see what your problem is ... :-)

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-06-29 Thread Joseph Rushton Wakeling
On Saturday, 29 June 2013 at 08:37:48 UTC, Walter Bright wrote: The bottom line was the open source movement was not a very significant force in the 1980's when C++ gained traction. Open source really exploded around 2000, along with the internet. I wonder if open source perhaps needed the

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-07-01 Thread Joseph Rushton Wakeling
On Sunday, 30 June 2013 at 19:45:06 UTC, Joakim wrote: OK, glad to hear that you wouldn't be against it. You'd be surprised how many who use permissive licenses still go nuts when you propose to do exactly what the license allows, ie close up parts of the source. Because people don't just

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-07-02 Thread Joseph Rushton Wakeling
On Sunday, 30 June 2013 at 03:29:06 UTC, Walter Bright wrote: On 6/29/2013 5:08 AM, Joseph Rushton Wakeling wrote: True, distribution was mainly by physical mail. There was some via BBS's and Usenet, but these were severely limited by bandwidth. I'd receive bug reports by fax, paper listings

Re: DConf 2013 Closing Keynote: Quo Vadis by Andrei Alexandrescu

2013-07-02 Thread Joseph Rushton Wakeling
On Monday, 1 July 2013 at 21:20:39 UTC, Walter Bright wrote: On 7/1/2013 2:04 PM, Brad Roberts wrote: Actually, Boost was specifically chosen because it didn't require attribution when redistributing. If BSD hadn't had that clause we probably would be using it instead. That was indeed

Re: Is this D or is it Javascript?

2013-07-06 Thread Joseph Rushton Wakeling
On Saturday, 6 July 2013 at 00:27:45 UTC, Adam D. Ruppe wrote: I really should either finish it or just give in and use a third party service or something (the closest I've come is this newsgroup!), since at least blog blabbing would be *some* documentation for half my random stuff, but

Re: My first email to Walter, ever

2013-07-08 Thread Joseph Rushton Wakeling
On Sunday, 7 July 2013 at 22:03:17 UTC, Walter Bright wrote: On 7/7/2013 5:09 AM, Andrej Mitrovic wrote: That's a cool teaser, but how did the discussion continue? :) Generally along these lines: And you, Scarecrow, have the effrontery to ask for a brain, you billowing bale of bovine

Re: A very basic blog about D

2013-07-08 Thread Joseph Rushton Wakeling
On Monday, 8 July 2013 at 17:39:46 UTC, Baz wrote: On Sunday, 7 July 2013 at 15:00:43 UTC, That's interesting...but I'm not a big fan of collecting hundreds of links...I think that someone should create something like http://www.delphifeeds.com/ but for D... blogs.dlang.org ... ? There'd

Re: A very basic blog about D

2013-07-08 Thread Joseph Rushton Wakeling
On Monday, 8 July 2013 at 18:54:30 UTC, Baz wrote: You're wrong, there's a real need for promoting D worldwide. Did I say otherwise? I am not sure you are reacting to what I actually wrote. Just for example, this mainstream (french) programming site has (had?) a forum for D which is not

Complex networks in D

2013-07-15 Thread Joseph Rushton Wakeling
Following the discussion on digitalmars.D, I've put together a little (... er, long ...) blog post discussing the basics of my D graph library: http://braingam.es/2013/07/complex-networks-in-d/ The main slant of this post is the ease of writing this stuff in D. Later posts will follow up on

Re: Complex networks in D

2013-07-16 Thread Joseph Rushton Wakeling
On Tuesday, 16 July 2013 at 08:27:07 UTC, Paulo Pinto wrote: On Tuesday, 16 July 2013 at 07:17:59 UTC, Walter Bright wrote: https://news.ycombinator.com/item?id=6050404 http://www.reddit.com/r/programming/comments/1iegj9/complex_networks_in_d/ Thanks! :-)

Re: Complex networks in D

2013-07-16 Thread Joseph Rushton Wakeling
On Tuesday, 16 July 2013 at 14:18:02 UTC, bearophile wrote: size_t vertexCount() @property const pure nothrow { assert(_sumHead.length == _sumTail.length); return _sumHead.length - 1; } Is that better written in a struct/class invariant? Nice thought -- probably;

Re: Complex networks in D

2013-07-16 Thread Joseph Rushton Wakeling
On Tuesday, 16 July 2013 at 18:22:31 UTC, Walter Bright wrote: People are much more likely to read your article from links in reddit and hackernews if you put in as a comment some description of it. Don't wait for others to do it for you! They may mischaracterize it, or worse, the opportunity

Re: Complex networks in D

2013-07-16 Thread Joseph Rushton Wakeling
On Tuesday, 16 July 2013 at 15:57:06 UTC, bearophile wrote: For such kind of code I suggest to use UFCS chains. Can you explain in a little more detail? It's not an aspect of programming I'm familiar with. auto r1 = iota(_sumHead[v], _sumHead[v + 1]).map!(a = _tail[_indexHead[a]]); auto

Re: monarch dodra granted write access to phobos, druntime, and tools

2013-07-23 Thread Joseph Rushton Wakeling
On Monday, 22 July 2013 at 18:08:36 UTC, Andrei Alexandrescu wrote: Please join me in congratulating monarch dodra for his admission among our github committers. We're starting with phobos, druntime, and tools access, and if all goes well, we'll extend write rights to dmd also.

Re: monarch dodra granted write access to phobos, druntime, and tools

2013-07-27 Thread Joseph Rushton Wakeling
On Tuesday, 23 July 2013 at 19:24:10 UTC, Andrei Alexandrescu wrote: I'm very surprised by your outlook. My perception is that the long queue of pending pull requests not being reviewed is the single most important bottleneck at this point in history in the path of D. By my estimates I think

Re: echo: -n, the next installment

2013-07-27 Thread Joseph Rushton Wakeling
On Saturday, 27 July 2013 at 12:19:44 UTC, John Colvin wrote: I'm pretty sure it wouldn't work ideally for echo as the behaviour depends on the order of the arguments. It also has some odd little niggles -- e.g. it's not nice that with a short option you can have --t 5 and --t=5 but not -t 5

Re: New malloc() for win32 that should produce faster DMD's and faster D code that uses malloc()

2013-08-04 Thread Joseph Rushton Wakeling
On Sunday, 4 August 2013 at 06:07:54 UTC, dennis luehring wrote: ever tested nedmalloc (http://www.nedprod.com/programs/portable/nedmalloc/) or other malloc allocators? Windows 7, Linux 3.x, FreeBSD 8, Mac OS X 10.6 all contain state-of-the-art allocators and no third party allocator is

Re: D reaches 1000 questions on stackoverflow

2013-08-15 Thread Joseph Rushton Wakeling
On Thursday, 15 August 2013 at 00:23:16 UTC, Andrei Alexandrescu wrote: You can define a filter that emails you whenever there are new questions on the D tag. Why not set up D.learn (or a new mailing list) to track that filter? That should help prompt the community here to engage with any

Re: GHC 2013 in Paris

2013-08-20 Thread Joseph Rushton Wakeling
On Tuesday, 20 August 2013 at 07:31:29 UTC, Iain Buclaw wrote: Will be arriving in Paris tomorrow. Is it only you two who will be around? Sad to say I can't make it. :-( Will the talk be videoed?

Re: GHC 2013 in Paris

2013-08-20 Thread Joseph Rushton Wakeling
On Tuesday, 20 August 2013 at 08:35:57 UTC, Iain Buclaw wrote: I don't know, will certainly ask... In any case, have fun (and look out for the Space Invaders...:-)

Updates to D graph library

2013-09-12 Thread Joseph Rushton Wakeling
Hello all, Today I pushed a number of major (and breaking) changes to the master repository of the D graph library. I've provided a brief summary on my blog, which also describes how to revise any programs to work with the new code: http://braingam.es/2013/09/d-graph-library-updates/ I

Re: [OT] My C++ talk at GoingNative 2013

2013-09-12 Thread Joseph Rushton Wakeling
On Tuesday, 10 September 2013 at 13:08:29 UTC, Iain Buclaw wrote: All class methods are virtual by default in D, unless declared 'final'. There was an intense discussion a while back which ended in (I think) a decision by Walter to switch to final-by-default, but there has so far been no

Re: Updates to D graph library

2013-09-13 Thread Joseph Rushton Wakeling
On Friday, 13 September 2013 at 07:49:49 UTC, ilya-stromberg wrote: Do you have any plans to change license from GPLv3 to something more liberal like Boost, MIT or BSD? Without this it's impossible to use your library for commercial purposes. The licence is GPLv3+ because the code is closely

Re: Updates to D graph library

2013-09-13 Thread Joseph Rushton Wakeling
On Friday, 13 September 2013 at 08:45:45 UTC, ilya-stromberg wrote: I see. You can use Boost Graph Library (BGL) as a initial point. It's under Boost license that allows commercial usage. http://www.boost.org/doc/libs/1_54_0/libs/graph/doc/index.html I'm aware of the BGL, but I didn't find it

Implementing and optimizing a simple graph metric

2013-09-18 Thread Joseph Rushton Wakeling
Hello all, I thought I'd do a writeup of the process of implementing and optimizing one of the graph metrics in Dgraph, starting from a fairly straight copy of pseudo-code in a research paper all through the various incremental tweaks that improve performance.

Re: Implementing and optimizing a simple graph metric

2013-09-18 Thread Joseph Rushton Wakeling
On Wednesday, 18 September 2013 at 13:39:29 UTC, bearophile wrote: Just for a test, try to allocate all those arrays in a different way: - First try a std.array.Array using the LDC2 compiler; - Another thing to try is to allocate them on the stack using core.stdc.stdlib.alloca: auto p =

Re: Implementing and optimizing a simple graph metric

2013-09-18 Thread Joseph Rushton Wakeling
On Wednesday, 18 September 2013 at 15:22:51 UTC, bearophile wrote: Joseph Rushton Wakeling: I haven't yet tried alloca or other manual memory management -- I felt a bit resistant to this as I'd prefer to keep the code simple and readable -- but I'll give that a go too just to see how it goes

Re: Implementing and optimizing a simple graph metric

2013-09-18 Thread Joseph Rushton Wakeling
On Wednesday, 18 September 2013 at 15:17:25 UTC, Joseph Rushton Wakeling wrote: I think I did give std.array.Array a trial when trying to speed up its performance, and I don't remember it making any difference (if anything it may have slowed things down). But I'll give it a second look

Re: Implementing and optimizing a simple graph metric

2013-09-18 Thread Joseph Rushton Wakeling
On Wednesday, 18 September 2013 at 13:39:29 UTC, bearophile wrote: - Try to optionally accept the buffers from outside. Does this look good to you? / auto ref betweenness(T = double, Graph)(ref Graph g, bool[] ignore = null) if

Re: Implementing and optimizing a simple graph metric

2013-09-19 Thread Joseph Rushton Wakeling
On Wednesday, 18 September 2013 at 17:13:28 UTC, bearophile wrote: How many times or how often do you need to call betweenness()? If it's called only few times or once in a while then using the GC is good enough. But if you have to call it many millions of times, all those GC array allocations

Re: Implementing and optimizing a simple graph metric

2013-09-24 Thread Joseph Rushton Wakeling
On Wednesday, 18 September 2013 at 13:39:29 UTC, bearophile wrote: auto centrality = minimallyInitializedArray!(typeof(return))(g.vertexCount); centrality[] = T0; auto stack = new size_t[g.vertexCount]; auto sigma = minimallyInitializedArray!T(g.vertexCount); sigma[] = T0;

Re: Implementing and optimizing a simple graph metric

2013-09-26 Thread Joseph Rushton Wakeling
On Tuesday, 24 September 2013 at 22:14:30 UTC, bearophile wrote: minimallyInitializedArray is not stupid, if the specified type has no indirections, it's equivalent to using uninitializedArray, but it's safer if you later change the type. So in general it's not a good idea to use

Re: Implementing and optimizing a simple graph metric

2013-09-26 Thread Joseph Rushton Wakeling
On Thursday, 26 September 2013 at 20:56:39 UTC, bearophile wrote: Joseph Rushton Wakeling: I have not found this -- using minimallyInitializedArray for the arrays of built-in types is slower than if I use uninitializedArray. Then minimallyInitializedArray should be improved :-) It's odd

Re: Implementing and optimizing a simple graph metric

2013-09-26 Thread Joseph Rushton Wakeling
On Thursday, 26 September 2013 at 21:29:42 UTC, bearophile wrote: You also have arrays of T. Someday T could be something with indirections :-) So minimallyInitializedArray is safer regarding future changes in your code. T is qualified via isFloatingPoint :-)

Re: Implementing and optimizing a simple graph metric

2013-09-27 Thread Joseph Rushton Wakeling
On Thursday, 26 September 2013 at 22:03:12 UTC, bearophile wrote: Joseph Rushton Wakeling: T is qualified via isFloatingPoint :-) I know, but that qualification could change in future evolutions of your code. Strong type safety means that if you change a type in your code, with a localized

Re: Facebook is using D in production starting today

2013-10-10 Thread Joseph Rushton Wakeling
On Friday, 11 October 2013 at 00:36:12 UTC, Andrei Alexandrescu wrote: Today I committed the first 5112 lines of D code to Facebook's repository. The project is in heavy daily use at Facebook. Compared to the original version (written in C++) we've measured massive wins in all of source code

Re: Facebook is using D in production starting today

2013-10-11 Thread Joseph Rushton Wakeling
On Friday, 11 October 2013 at 05:11:49 UTC, Walter Bright wrote: It's the first battle signaling the end of Middle Earth, and the rise of the Age of D. The old guard will be sailing to the Grey Havens soon. Hmmm, dodgy metaphor. The departure of the ringbearers heralds the new age, but it's

Re: Facebook is using D in production starting today

2013-10-17 Thread Joseph Rushton Wakeling
On Saturday, 12 October 2013 at 12:08:03 UTC, Todor wrote: On Friday, 11 October 2013 at 05:11:49 UTC, Walter Bright wrote: On 10/10/2013 10:05 PM, Nick Sabalausky wrote: Awesome! Great bragging rights for D :) It's the first battle signaling the end of Middle Earth, and the rise of the Age

Re: LDC 0.12.0 has been released

2013-10-23 Thread Joseph Rushton Wakeling
On Tuesday, 22 October 2013 at 22:42:14 UTC, David Nadlinger wrote: LDC 0.12.0, the LLVM-based D compiler, is available for download! It is built on the 2.063.2 frontend and standard library and supports LLVM 3.1-3.3 (OS X: 3.2 only). Congratulations David and team :-)

Re: Programming in D book is about 95% translated

2013-11-02 Thread Joseph Rushton Wakeling
On Saturday, 2 November 2013 at 00:03:51 UTC, Ali Çehreli wrote: I have continued with the translation of the book. There are 36 of the 727 pages still to be translated. (However, I still need to write the UDA chapter.) In addition to many corrections and additions throughout the book, there

Re: Programming in D book is about 95% translated

2013-11-02 Thread Joseph Rushton Wakeling
On Saturday, 2 November 2013 at 20:36:39 UTC, Andrei Alexandrescu wrote: Converse? (Haven't read the section discussed.) Could also work. The range in question wraps an input range r and sets front to return -r.front.

Re: Programming in D book is about 95% translated

2013-11-03 Thread Joseph Rushton Wakeling
On Saturday, 2 November 2013 at 22:45:13 UTC, Ali Çehreli wrote: I spent considerable amount of time on those names. Like you, I am not happy with Inverse. :) I wanted to say struct Negate and function negate(). But ! is the negation operator. I like opposite better but the Wikipedia

Re: Programming in D book is about 95% translated

2013-11-03 Thread Joseph Rushton Wakeling
On Sunday, 3 November 2013 at 22:42:37 UTC, Tove wrote: I'm not a native English speaker, but FWIW I would have chosen: http://en.wiktionary.org/wiki/numeric_complement I knew there was another term out there somewhere :-)

Re: DConf 2014 Call for Submissions is now open

2013-11-27 Thread Joseph Rushton Wakeling
On Wednesday, 27 November 2013 at 05:44:36 UTC, Jonathan M Davis wrote: And now I have to wrack my brain for ideas. :) I could probably answer questions about D all day, but coming up with something useful to talk about on my own never seems to be as easy as it should be... Well, you have

Re: DConf 2014 Call for Submissions is now open

2013-11-27 Thread Joseph Rushton Wakeling
On Wednesday, 27 November 2013 at 14:37:11 UTC, Dicebot wrote: I had some until I have started to think about Credentials: What qualifies you to talk on the topic of choice?. The fact that you are curious about the topic in question, have given it some thought and come up with something

Re: Range-Based Graph Search in D (blog post)

2014-01-10 Thread Joseph Rushton Wakeling
On Friday, 10 January 2014 at 11:07:13 UTC, John Colvin wrote: Nice :) I presume you are aware of https://github.com/WebDrake/Dgraph Good inspiration for me to get back to work on that :-) @Peter -- this is really exciting to see and I will be looking into your work with great interest.

Re: Facebook open sources flint, a C++ linter written in D

2014-02-25 Thread Joseph Rushton Wakeling
On Wednesday, 26 February 2014 at 00:57:55 UTC, deadalnix wrote: Usually, I understand XXX evangelist as My job is to use twitter. Oh, so _that's_ why the text of the Bible comes in individual numbered verses of less than 140 characters each!

1st draft of complete class-based std.random successor

2014-03-19 Thread Joseph Rushton Wakeling
Hello all, As some of you may already know, monarch_dodra and I have spent quite a lot of time over the last year discussing the state of std.random. To cut a long story short, there are significant problems that arise because the current RNGs are value types rather than reference types.

Re: 1st draft of complete class-based std.random successor

2014-03-19 Thread Joseph Rushton Wakeling
On Wednesday, 19 March 2014 at 23:58:36 UTC, Rikki Cattermole wrote: Out of interest but, shouldn't in the device module have a static assert(0, Not implemented yet) type of deal with the version(Posix) block? Not really. There's still usable functionality in there for all architectures

Re: 1st draft of complete class-based std.random successor

2014-03-19 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 00:09:51 UTC, bearophile wrote: Do you have a simple but very fast function that generates uniforms in [0.0, 1.0]? :-) No, but it's planned. Jerro wrote quite a nice one in the course of his work on the Ziggurat algorithm, and I'm sure he'd be happy for me to

Re: 1st draft of complete class-based std.random successor

2014-03-19 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 00:05:20 UTC, Joseph Rushton Wakeling wrote: Not really. There's still usable functionality in there for all architectures (although I'm not sure how practically useful). Just to expand on that remark: my impression is that individual random devices

Re: 1st draft of complete class-based std.random successor

2014-03-19 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 00:09:51 UTC, bearophile wrote: Please don't use stuttering names like std.random2.randomShuffle. std.random2.shuffle is enough. I don't object to rewriting the names if there's a valid case for it, but it does seem to me to be important to try and match as much

Re: 1st draft of complete class-based std.random successor

2014-03-19 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 00:39:43 UTC, bearophile wrote: Note: I meant a simple but very fast function that generates just one value in [0.0, 1.0] (not a range). There will be both. :-) Off the top of my head I'm not sure whether the interval will be [0.0, 1.0], [0.0, 1.0) or whether it

Re: 1st draft of complete class-based std.random successor

2014-03-20 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 01:07:54 UTC, bearophile wrote: In Bugzilla probably there are many bug reports/enhancement requests about std.random, so I suggest you to read them. Some of them can be useful, while other are probably already addressed in the current (or planned) std.random2.

Re: 1st draft of complete class-based std.random successor

2014-03-20 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 01:32:41 UTC, Chris Williams wrote: Any chance that you could describe them? I was about to resume porting the dcrypt library into Phobos, and had intended to flip the classes into structs, to match what the rest of the library was doing. I think there's a good

Re: 1st draft of complete class-based std.random successor

2014-03-20 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 08:30:09 UTC, ponce wrote: Related: please consider using parts of SimpleRNG the excellent work of John D. Cook which provides many random distributions in a compact and documented way. https://github.com/p0nce/gfm/blob/master/math/gfm/math/simplerng.d (here a

Re: 1st draft of complete class-based std.random successor

2014-03-20 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 08:51:08 UTC, monarch_dodra wrote: Agreed. There is consensus it seems. I will make the fix ;-) I think there is 0 doubt that reference semantics is the way to go. An advantage of using class is that it is still *possible* to place them on the stack with

Re: 1st draft of complete class-based std.random successor

2014-03-20 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 21:42:13 UTC, Chris Williams wrote: To be certain that the implementation doesn't have any security holes? Yes. Of course, in the current climate one might fear that they'd be the ones introducing them ... :-)

Re: 1st draft of complete class-based std.random successor

2014-03-20 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 18:43:49 UTC, Chris Williams wrote: That's only completely true if structs are referred to by pointer. ref parameters/returns aren't quite sufficient to keep a struct acting as a reference for all purposes. As far as I can tell, you're thinking of _passing_

Re: 1st draft of complete class-based std.random successor

2014-03-21 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 00:39:43 UTC, bearophile wrote: It's the best chance to improve naming, so do not throw it away for nothing: https://d.puremagic.com/issues/show_bug.cgi?id=9106 I think the following patch should fix that for you:

Re: 1st draft of complete class-based std.random successor

2014-03-22 Thread Joseph Rushton Wakeling
Latest patches rename randomSample = sample, again offering a documented alias to assist migration. It would be nice to complete the set and eliminate randomCover, but in this case cover seems too vague a name to use. Any suggestions for alternatives? I wasn't able to readily find an

Re: 1st draft of complete class-based std.random successor

2014-03-22 Thread Joseph Rushton Wakeling
On Saturday, 22 March 2014 at 20:09:00 UTC, bearophile wrote: Perhaps it's better to not document this alias. For now it will be documented, for clarity if nothing else. Whether that documentation makes it into a Phobos submission, I think should depend on formal review. I'd like a

Re: 1st draft of complete class-based std.random successor

2014-03-22 Thread Joseph Rushton Wakeling
Latest patches just pushed to repo make the randomSample = sample change and introduce a fast uniform01 and uniform01Distribution :-)

Re: 1st draft of complete class-based std.random successor

2014-03-23 Thread Joseph Rushton Wakeling
On Saturday, 22 March 2014 at 23:56:35 UTC, bearophile wrote: They seem good. Excellent! There may need to be some attention to the internals of uniform01. Its correctness depends on whether one can always trust a float-based RNG to return values in [min, max) or whether [min, max] is

Re: 1st draft of complete class-based std.random successor

2014-03-23 Thread Joseph Rushton Wakeling
On Sunday, 23 March 2014 at 10:15:32 UTC, bearophile wrote: Is the issue is already fixed in std.random you can close it :-) Well, your request for a choice method is still open ... :-) The best thing is to add an efficient choice() function, so no efficiency mistake happens :-) Sure, I'm

Re: 1st draft of complete class-based std.random successor

2014-03-24 Thread Joseph Rushton Wakeling
On Thursday, 20 March 2014 at 00:09:51 UTC, bearophile wrote: Do you have a simple but very fast function that generates uniforms in [0.0, 1.0]? :-) On that note: https://github.com/D-Programming-Language/phobos/pull/2050 Hope you don't mind me jumping ahead of your existing PR on this --

Re: 1st draft of complete class-based std.random successor

2014-03-25 Thread Joseph Rushton Wakeling
On Tuesday, 25 March 2014 at 00:08:27 UTC, bearophile wrote: I don't mind, I am happy :-) Thank you for adding a sorely needed function. You are very kind, and far too modest. :-)

Re: 1st draft of complete class-based std.random successor

2014-04-03 Thread Joseph Rushton Wakeling
On Tuesday, 25 March 2014 at 00:08:27 UTC, bearophile wrote: I don't mind, I am happy :-) Thank you for adding a sorely needed function. It's been merged :-)

Software developer/data scientist positions at Sociomantic

2014-05-07 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
Hello all, Sociomantic has some new D developer positions open. This time, we're particularly interested in those of you whose background covers things like machine learning, data science, and other fun and related topics. Perfect for people with research backgrounds who want to get

Re: Software developer/data scientist positions at Sociomantic

2014-05-07 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Wednesday, 7 May 2014 at 15:09:05 UTC, Andrei Alexandrescu wrote: (you’ll be programming in D1) ಠ_ಠ I refer you to my colleague's excellent talk, soon to be presented at DConf :-) http://dconf.org/2014/talks/clugston.html

Re: Livestreaming DConf?

2014-05-09 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Friday, 9 May 2014 at 19:48:20 UTC, Andrei Alexandrescu wrote: We at Facebook are very excited about the upcoming DConf 2014. In fact, so excited we're considering livestreaming the event for the benefit of the many of us who can't make it to Menlo Park, CA. Livestreaming entails additional

hap.random: a new random number library for D

2014-06-09 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
Hello all, Some of you may remember my earlier draft of a class-based std.random successor: http://forum.dlang.org/thread/cyytvhixkqlbwkmiu...@forum.dlang.org Following revisions made in response to feedback, and some further development, I decided that it would be best to release the

Re: hap.random: a new random number library for D

2014-06-09 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Monday, 9 June 2014 at 18:51:53 UTC, Ryan Voots wrote: It definitely looks interesting. The 64bit MT is definitely something I'm after. I have a particularly strange need with PRNGs though. I need to easily make a bunch of child RNGs based off a master RNG. Nothing cryptographic about

Re: hap.random: a new random number library for D

2014-06-10 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
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

Re: hap.random: a new random number library for D

2014-06-10 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
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

Re: hap.random: a new random number library for D

2014-06-10 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
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).

Re: hap.random: a new random number library for D

2014-06-10 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
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?

Re: hap.random: a new random number library for D

2014-06-10 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
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

Re: hap.random: a new random number library for D

2014-06-11 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Tuesday, 10 June 2014 at 23:08:33 UTC, Chris Cain wrote: I had an opportunity to give the entire code a good once over read and I have a few comments. Thanks! :-) 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

Re: hap.random: a new random number library for D

2014-06-11 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Tuesday, 10 June 2014 at 23:48:09 UTC, bearophile wrote: 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. After all

Re: hap.random: a new random number library for D

2014-06-11 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Monday, 9 June 2014 at 18:09:21 UTC, Joseph Rushton Wakeling wrote: Hello all, Incidentally, would it be a good idea to post a link to the blog post on r/programming? Haven't done so yet, as generally I prefer to leave decisions about D publicity to others, but can do so if people would

Re: hap.random: a new random number library for D

2014-06-11 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Wednesday, 11 June 2014 at 07:42:10 UTC, Andrea Fontana wrote: Have you any plan to implement CMWC? http://en.wikipedia.org/wiki/Multiply-with-carry#Complementary-multiply-with-carry_generators I hadn't made any concrete plans about that particular family of generators (my impression was

Re: hap.random: a new random number library for D

2014-06-11 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Wednesday, 11 June 2014 at 07:24:11 UTC, Chris Cain wrote: I almost always like all the D posts I see on r/programming, but in general if any language highlighted the efforts in the RNG part of the standard library, I would like it. Too many languages get it wrong or don't care enough about

Re: hap.random: a new random number library for D

2014-06-12 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Thursday, 12 June 2014 at 08:49:45 UTC, Chris Cain wrote: Well, the ultimate conclusion of the conversation with the guy is that: 1. ISAAC probably isn't cryptographically secure. Despite not having found any attacks, it just isn't proof of security. It's not been looked at enough to really

Re: hap.random: a new random number library for D

2014-06-12 Thread Joseph Rushton Wakeling via Digitalmars-d-announce
On Monday, 9 June 2014 at 18:09:21 UTC, Joseph Rushton Wakeling wrote: I think that hap.random fixes certain fundamental design issues with std.random. However, this needs to be put to the test in the wild, so I'd really appreciate it if as many people as possible could try it out

  1   2   3   >