On Thursday, 22 June 2017 at 19:19:20 UTC, Ecstatic Coder wrote:
class TOTO
...I think that trying to
make the website very appealing to inexperienced programmers as
well could significantly broaden its user base.
Although I am admittedly an LOB kind of person who cares little
for games or
On Monday, 22 May 2017 at 10:49:08 UTC, Quentin Ladeveze wrote:
The article has been posted on hackernews 10 minutes ago btw
https://news.ycombinator.com/item?id=14392395
I'm printing out some handy copies that I can give to people I
meet whom I think would be interested in the benefits of
Hi,
I can't find video for Andrei's talk at
https://www.youtube.com/playlist?list=PL3jwVPmk_PRxo23yyoc0Ip_cP3-rCm7eB
Can you provide a link? I'm looking forward to watching it!
Thanks!
Luis,
It's available at Safari Books Online, if you can access that.
Great for cut & paste, too!
On Friday, 24 March 2017 at 17:48:35 UTC, H. S. Teoh wrote:
(In my case, though, B-trees may not represent much of an
improvement, because I'm dealing with high-dimensional data
that cannot be easily linearized to take maximum advantage of
B-tree locality. So at some level I still need some
On Friday, 24 March 2017 at 06:30:25 UTC, H. S. Teoh wrote:
You have to keep in mind that one downside of hashtables is
that they tend to be unfriendly towards caching hierarchies
...
For certain applications, where key lookups are more-or-less
random, this is the best you could do, but for
On Thursday, 23 March 2017 at 10:27:36 UTC, Ola Fosheim Grøstad
wrote:
Increasing the size of a hash table would be prohibitively
expensive. You need a data-structure that can grow gracefully.
Hi Ola,
Are the hash tables you refer to the ones that D uses in the
background to implement
On Thursday, 23 March 2017 at 20:09:46 UTC, Nordlöw wrote:
...
Where can this be read? Is there a naming for this particular
implementation of an AA?
Hi Nordlow,
Associative Arrays are introduced in Ali Çehreli's great book,
Programming in D – Tutorial and Reference, Ch. 28; and in Section
Hello to all! As a (D, and coding and forum) newbie I'm learning
about D's associative arrays (AAs), and their tiny latency
regardless of AA size. Cool!
One practical limitation on the practical maximum AA size is
memory/disk paging. But maybe this limit could be overcome with
the latest
