On 2016-01-04 17:56, Martin Tschierschke wrote:
Oh, thats interesting. When I tried to run the compiled "prime" on my
notebook,
with the "same" Ubuntu release, I got an error, may be its 32 not 64 Bit?
Any hint?
You can run the "file" command to see which architecture an executable
is built f
On Monday, 4 January 2016 at 14:01:18 UTC, Basile B. wrote:
On Monday, 4 January 2016 at 13:49:03 UTC, Martin Tschierschke
wrote:
[...]
- if debug info are generated this increases the size.
- if bounds checking is turned off there is some code generated
for each array operation
- if contracts
On Monday, 4 January 2016 at 16:56:15 UTC, Martin Tschierschke
with the "same" Ubuntu release, I got an error, may be its 32
not 64 Bit?
Any hint?
Yeah, probably.
On Monday, 4 January 2016 at 14:51:59 UTC, Adam D. Ruppe wrote:
On Monday, 4 January 2016 at 13:49:03 UTC, Martin Tschierschke
wrote:
When I was writing a small speed test - D versus Ruby
The smallest possible ruby program has about ~5 MB of
dependencies, outside the operating system (the rub
On Monday, 4 January 2016 at 14:16:54 UTC, Marc Schütz wrote:
On Monday, 4 January 2016 at 13:49:03 UTC, Martin Tschierschke
wrote:
When I was writing a small speed test - D versus Ruby,
calculating the first n prime numbers, I realized, that for
small n
Ruby may be faster, than compiling and
On Monday, 4 January 2016 at 13:49:03 UTC, Martin Tschierschke
wrote:
When I was writing a small speed test - D versus Ruby
The smallest possible ruby program has about ~5 MB of
dependencies, outside the operating system (the ruby runtime
itself).
The D program has none. It carries its runt
On Monday, 4 January 2016 at 13:49:03 UTC, Martin Tschierschke
wrote:
When I was writing a small speed test - D versus Ruby,
calculating the first n prime numbers, I realized, that for
small n
Ruby may be faster, than compiling and executing with D.
But for n = 1,000,000 D outperforms Ruby by a
On Monday, 4 January 2016 at 13:49:03 UTC, Martin Tschierschke
wrote:
When I was writing a small speed test - D versus Ruby,
calculating the first n prime numbers, I realized, that for
small n
Ruby may be faster, than compiling and executing with D.
But for n = 1,000,000 D outperforms Ruby by a
When I was writing a small speed test - D versus Ruby,
calculating the first n prime numbers, I realized, that for small
n
Ruby may be faster, than compiling and executing with D.
But for n = 1,000,000 D outperforms Ruby by app. 10x.
Looking at the size of my prime executable, it was around 800
