On 7/30/2013 11:40 PM, dennis luehring wrote:
currently the vc builded dmd is about 2 times faster in compiling
That's an old number now. Someone want to try it with the current HEAD?
Am 31.07.2013 09:00, schrieb Walter Bright:
On 7/30/2013 11:40 PM, dennis luehring wrote:
currently the vc builded dmd is about 2 times faster in compiling
That's an old number now. Someone want to try it with the current HEAD?
tried to but failed
downloaded dmd-master.zip (from github)
30-Jul-2013 22:22, Walter Bright пишет:
On 7/30/2013 11:02 AM, Dmitry Olshansky wrote:
What bothers me is that while I've been hacking at this I couldn't
shake off the
feeling that AA code assumes NO FULL HASH COLLISIONS at all?
I don't know what you mean, as it has a collision resolution
On 7/31/2013 1:49 AM, Dmitry Olshansky wrote:
Here key is 32 bits. Surely 2 strings can hash to the exact same 32 bit value.
No, they cannot. The hash value is a pointer to the string. The strings are
already inserted into another hash table, so all strings that are the same are
combined.
Russel Winder rus...@winder.org.uk writes:
The title says it all really.
Version 2.0.6 has been released. Hopefully Arch, MacPorts, Debian,
Fedora, etc. will look to package this.
Alternatively for Emacs 24+ folk use packaging, put MELPA in the path
and get the latest version from GitHub
31-Jul-2013 13:17, Walter Bright пишет:
On 7/31/2013 1:49 AM, Dmitry Olshansky wrote:
Here key is 32 bits. Surely 2 strings can hash to the exact same 32
bit value.
No, they cannot. The hash value is a pointer to the string. The
strings are already inserted into another hash table,
The
31-Jul-2013 19:04, Dmitry Olshansky пишет:
31-Jul-2013 13:17, Walter Bright пишет:
On 7/31/2013 1:49 AM, Dmitry Olshansky wrote:
[snip]
so all strings
that are the same are combined. Therefore, all unique strings hash to
unique values.
Now that sets things straight ... if they ain't hashes
On 7/30/13 2:48 PM, Bill Baxter wrote:
On Tue, Jul 30, 2013 at 12:05 PM, Andrei Alexandrescu
seewebsiteforem...@erdani.org mailto:seewebsiteforem...@erdani.org
wrote:
On 7/30/13 11:13 AM, Walter Bright wrote:
On 7/30/2013 2:59 AM, Leandro Lucarella wrote:
I just want
On Wed, Jul 31, 2013 at 10:12 AM, Andrei Alexandrescu
seewebsiteforem...@erdani.org wrote:
On 7/30/13 2:48 PM, Bill Baxter wrote:
On Tue, Jul 30, 2013 at 12:05 PM, Andrei Alexandrescu
seewebsiteforem...@erdani.org
mailto:SeeWebsiteForEmail@**erdani.orgseewebsiteforem...@erdani.org
On 7/31/2013 8:26 AM, Dmitry Olshansky wrote:
Ouch... to boot it's always aligned by word size, so
key % sizeof(size_t) == 0
...
rendering lower 2-3 bits useless, that would make straight slice lower bits
approach rather weak :)
Yeah, I realized that, too. Gotta shift it right 3 or 4 bits.
Any chance of you turning this into a daemon? Something likt margo or
gocode?
On 29 Jul 2013 11:05, qznc q...@web.de wrote:
On Saturday, 27 July 2013 at 22:27:35 UTC, Brian Schott wrote:
DScanner is a tool for analyzing D source code. It has the following
features:
* Prints out a complete
On 7/31/2013 11:13 AM, Bill Baxter wrote:
That's more analogous to something like MIPS than inverse program run time.
If you increase the speed 100%, then the elapsed time is cut by 50%.
This is a grammar school concept. It does not require an ivy league physics
degree to understand. It is
On Wed, 31 Jul 2013 20:30:17 +0200, Rory McGuire wrote:
Any chance of you turning this into a daemon? Something likt margo or
gocode?
The author has another project here: https://github.com/Hackerpilot/DCD
On Wednesday, 31 July 2013 at 18:41:17 UTC, Justin Whear wrote:
On Wed, 31 Jul 2013 20:30:17 +0200, Rory McGuire wrote:
Any chance of you turning this into a daemon? Something likt
margo or
gocode?
The author has another project here:
https://github.com/Hackerpilot/DCD
I wouldn't bother
On 31.07.2013 09:00, Walter Bright wrote:
On 7/30/2013 11:40 PM, dennis luehring wrote:
currently the vc builded dmd is about 2 times faster in compiling
That's an old number now. Someone want to try it with the current HEAD?
I have just tried yesterdays dmd to build Visual D (it builds
Are you serious that you can't fathom how it could be confusing to someone
than talking about differences in run times?
If you say something is faster than something else you want the two numbers
to be something you can relate to. Like MPH. Everyone has a clear concept
of what MPH is. We use it
On 7/31/2013 2:40 PM, Bill Baxter wrote:
Are you serious that you can't fathom how it could be confusing to someone than
talking about differences in run times?
Yes.
And no, I'm not talking about confusing to someone who lives in an undiscovered
stone age tribe in the Amazon. I'm talking
On Wednesday, 31 July 2013 at 21:40:45 UTC, Bill Baxter wrote:
Are you serious that you can't fathom how it could be confusing
to someone
than talking about differences in run times?
If you say something is faster than something else you want the
two numbers
to be something you can relate to.
On 7/31/2013 3:58 PM, John Colvin wrote:
It's a quite impressively unbalanced education that provides understanding of
memory allocation strategies, hashing and the performance pitfalls of integer
division, but not something as basic as a speed.
Have you ever seen those cards that some
Thanks for doing this, this is good information.
On 7/31/2013 2:24 PM, Rainer Schuetze wrote:
I have just tried yesterdays dmd to build Visual D (it builds some libraries and
contains a few short non-compiling tasks in between):
Debug build dmd_dmc: 23 sec, std new 43 sec
Debug build dmd_msc:
Am 31.07.2013 23:24, schrieb Rainer Schuetze:
On 31.07.2013 09:00, Walter Bright wrote:
On 7/30/2013 11:40 PM, dennis luehring wrote:
currently the vc builded dmd is about 2 times faster in compiling
That's an old number now. Someone want to try it with the current HEAD?
I have just
21 matches
Mail list logo
