Re: Complex networks in D

2013-07-16 Thread Walter Bright
On 7/15/2013 2:32 PM, Joseph Rushton Wakeling wrote: 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

Re: Complex networks in D

2013-07-16 Thread Paulo Pinto
On Tuesday, 16 July 2013 at 07:17:59 UTC, Walter Bright wrote: On 7/15/2013 2:32 PM, Joseph Rushton Wakeling wrote: Following the discussion on digitalmars.D, I've put together a little (... er, long ...) blog post discussing the basics of my D graph library:

Re: Programming in D book is about 88% translated

2013-07-16 Thread Regan Heath
On Tue, 16 Jul 2013 00:28:36 +0100, Ali Çehreli acehr...@yahoo.com wrote: On 07/15/2013 03:26 AM, deadalnix wrote: On Saturday, 29 June 2013 at 02:35:27 UTC, Ali Çehreli wrote: Thinking that it is free enough, I had chosen this: http://creativecommons.org/licenses/by-nc-sa/3.0/us/

Re: Browsers (Was: A very basic blog about D)

2013-07-16 Thread Nick Sabalausky
On Tue, 16 Jul 2013 07:28:35 +0200 Joakim joa...@airpost.net wrote: I don't get your paranoia about the auto-updater: Paranoia has nothing to do with it. I don't want it always running in the background, I don't want it auto-updating, and I certainly don't want a program installing an always

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! :-)

GHC 2013 in Paris

2013-07-16 Thread Iain Buclaw
Hi, I have been scheduled in to do a talk about GDC at GHC 2013 next month in Paris. If anyone can make it down, would be great to see some D faces around. http://www.gnu.org/ghm/2013/paris/

Re: Complex networks in D

2013-07-16 Thread bearophile
Joseph Rushton Wakeling: http://braingam.es/2013/07/complex-networks-in-d/ 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?

Re: Browsers (Was: A very basic blog about D)

2013-07-16 Thread Adam D. Ruppe
On Tuesday, 16 July 2013 at 00:26:51 UTC, Nick Sabalausky wrote: Vista doesn't have that horrible MS Dock taskbar Worth noting you can turn that off: I have 7 on the laptop I'm on now and after a few settings changes, it is very similar to vista. To get a good taskbar you need to turn off

Re: Browsers (Was: A very basic blog about D)

2013-07-16 Thread Adam D. Ruppe
On Tuesday, 16 July 2013 at 00:28:11 UTC, Nick Sabalausky wrote: They're corporations. It's not about turning a profit. It's about being under a legal obligation to shareholders to extract *as much* money as possible. Indeed. But at this rate, they're not even staying competitive with their

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 bearophile
Joseph Rushton Wakeling: It wasn't clear to me what the benefits were, though, For this function not a lot, but it's a good habit to have. especially as I did consider making this an enforce() rather than an assert(). If you want to use enforce then don't put them in pre-conditions. But

Re: Complex networks in D

2013-07-16 Thread Walter Bright
On 7/16/2013 2:27 AM, Joseph Rushton Wakeling wrote: 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

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: Complex networks in D

2013-07-16 Thread bearophile
Joseph Rushton Wakeling: To be sure I understand what you're getting at, is it just that it's more elegant to write it this way (I agree:-), or is there a performance benefit in the iota().map!() form (or to separately generating the ranges and then chaining them)? It's just more readable.

Re: Browsers (Was: A very basic blog about D)

2013-07-16 Thread Nick Sabalausky
On Tue, 16 Jul 2013 15:11:21 +0200 Joakim joa...@airpost.net wrote: On Tuesday, 16 July 2013 at 09:02:19 UTC, Nick Sabalausky wrote: Chrome then all the better (Seriously, why the fuck does Google have two basically-identical browsers and the whole Chrome vs Chromium bullshit anyway?

Re: Browsers (Was: A very basic blog about D)

2013-07-16 Thread Nick Sabalausky
On Tue, 16 Jul 2013 16:22:46 +0200 Adam D. Ruppe destructiona...@gmail.com wrote: On Tuesday, 16 July 2013 at 00:26:51 UTC, Nick Sabalausky wrote: Vista doesn't have that horrible MS Dock taskbar Worth noting you can turn that off: I have 7 on the laptop I'm on now and after a few

Re: Browsers (Was: A very basic blog about D)

2013-07-16 Thread Adam D. Ruppe
On Tuesday, 16 July 2013 at 21:33:33 UTC, Nick Sabalausky wrote: One useful tip to minimize clicking: You can switch between tabs^H^H^H^Hribbons with the mouse's scroll wheel. cool, I'll have to try that. THAT'S POSSIBLE?!? PLEASE TELL ME HOW!!! Or is the forward/back dropdown list still