On Sunday, 22 May 2016 at 21:16:03 UTC, David Nadlinger wrote:
On Thursday, 19 May 2016 at 12:54:48 UTC, Jens Müller wrote:
But ldc looks so bad.
Any comments from ldc users or developers? Because I see this
in many other measurements as well.
This definitely does not match up with my
On Thursday, 19 May 2016 at 12:54:48 UTC, Jens Müller wrote:
For example what's equivalent to gdc's -ffast-math in ldc.
This is:
https://github.com/ldc-developers/ldc/pull/1472
Working on performance improvements is a lot of fun. Please feed
us with code that doesn't run as fast as it
On Thursday, 19 May 2016 at 12:54:48 UTC, Jens Müller wrote:
But ldc looks so bad.
Any comments from ldc users or developers? Because I see this
in many other measurements as well.
This definitely does not match up with my experience.
Particularly if you see this in many measurements, there
On Saturday, 21 May 2016 at 13:51:11 UTC, Manu wrote:
On 21 May 2016 at 23:20, Andrei Alexandrescu via
Digitalmars-d-announce
wrote:
On 05/21/2016 04:45 AM, Manu via Digitalmars-d-announce wrote:
[...]
I guess a lot more detail would be necessary
On 21 May 2016 at 23:20, Andrei Alexandrescu via
Digitalmars-d-announce wrote:
> On 05/21/2016 04:45 AM, Manu via Digitalmars-d-announce wrote:
>>
>> On 20 May 2016 at 18:26, Walter Bright via Digitalmars-d-announce
>>
On Friday, 20 May 2016 at 19:34:11 UTC, Walter Bright wrote:
Constraints can address behavior and relationships, concepts do
not.
Wow, TIL. That's so clear once said !
There's been several discussion here and even one phobos PR that
proposes a kind of concepts but I didn't realize before that
On 21 May 2016 at 19:55, Stefan Koch via Digitalmars-d-announce
wrote:
> On Saturday, 21 May 2016 at 08:45:45 UTC, Manu wrote:
>>
>> Constraints are a good first-step in that direction, but they're unwieldy,
>> produce the worst looking function signatures
On 05/21/2016 04:45 AM, Manu via Digitalmars-d-announce wrote:
On 20 May 2016 at 18:26, Walter Bright via Digitalmars-d-announce
wrote:
On 5/19/2016 11:50 PM, Manu via Digitalmars-d-announce wrote:
Ah. Okay, well while this is a very interesting talk, I
On Saturday, 21 May 2016 at 08:45:45 UTC, Manu wrote:
Constraints are a good first-step in that direction, but
they're unwieldy, produce the worst looking function signatures
(read: documentation) of literally any language ever conceived,
relatively awkward error feedback, and very quickly get
On 20 May 2016 at 18:26, Walter Bright via Digitalmars-d-announce
wrote:
> On 5/19/2016 11:50 PM, Manu via Digitalmars-d-announce wrote:
>>
>> Ah. Okay, well while this is a very interesting talk, I was indeed
>> hoping you were going to make a D concepts
On Friday, 20 May 2016 at 20:04:35 UTC, Andrei Alexandrescu wrote:
On 5/20/16 2:13 PM, Jens Müller wrote:
No it doesn't work because you need to break in the last case.
Consider
the case when the last element of a is equal to an element in
b. Next
iteration you overrun a.
I'm not that
On 5/20/16 2:13 PM, Jens Müller wrote:
No it doesn't work because you need to break in the last case. Consider
the case when the last element of a is equal to an element in b. Next
iteration you overrun a.
I'm not that Bright :o).
So you'd need one more test, but you still save the other test
On 5/20/2016 6:47 AM, H. S. Teoh via Digitalmars-d-announce wrote:
Not to mention inconsistency in what exactly
is being tested for: if you want to check if something is an input
range, do you use is(typeof(R.empty)), etc., or should you use
__traits(compiles, R.init.empty), or is it
On Friday, 20 May 2016 at 14:14:18 UTC, Andrei Alexandrescu wrote:
On 05/19/2016 06:50 PM, Jens Müller wrote:
What if you stomped over an index in a that has as an equal
index in b
(it could be anywhere in b).
Hmmm, you're right. So that doesn't work, or at least not
efficiently (the fixup
On 05/19/2016 06:50 PM, Jens Müller wrote:
What if you stomped over an index in a that has as an equal index in b
(it could be anywhere in b).
Hmmm, you're right. So that doesn't work, or at least not efficiently
(the fixup would entail a binary search in b).
How about this idea: arrange
On 19 May 2016 at 22:10, Andrei Alexandrescu via
Digitalmars-d-announce wrote:
> On 5/18/16 7:42 AM, Manu via Digitalmars-d-announce wrote:
>>
>> On 16 May 2016 at 23:46, Andrei Alexandrescu via
>> Digitalmars-d-announce
On Thursday, 19 May 2016 at 22:04:56 UTC, Andrei Alexandrescu
wrote:
On 05/19/2016 05:36 PM, Jens Müller wrote:
I removed the code to optimize for large gaps. Because it is
only
confusing. I may generate some benchmark data with larger gaps
later to
see whether it is worthwhile for such data.
On Thursday, 19 May 2016 at 22:02:53 UTC, Andrei Alexandrescu
wrote:
On 05/19/2016 05:36 PM, Jens Müller wrote:
I'm not seeing it. Let me explain.
Consider the input a = [1] and b = [2, 3] (I only write the
indices).
The smallest back index is 1, i.e., a.back is the chosen
sentinel.
Nonono,
On 05/19/2016 05:36 PM, Jens Müller wrote:
I removed the code to optimize for large gaps. Because it is only
confusing. I may generate some benchmark data with larger gaps later to
see whether it is worthwhile for such data.
For skipping large gaps quickly, check galloping search (google for
On 05/19/2016 05:36 PM, Jens Müller wrote:
I'm not seeing it. Let me explain.
Consider the input a = [1] and b = [2, 3] (I only write the indices).
The smallest back index is 1, i.e., a.back is the chosen sentinel.
Nonono, you stamp the largest index over the smaller index. So you
overwrite a
On Thursday, 19 May 2016 at 12:04:31 UTC, Andrei Alexandrescu
wrote:
On 5/19/16 4:12 AM, Jens Müller wrote:
---
if (a.length == 0 || b.length == 0)
return 0;
const amax = a.length - 1, bmax = b.length - 1;
size_t i,j = 0;
double sum = 0;
for (;;)
{
if (a[i].index < b[j].index) {
On Thursday, 19 May 2016 at 12:04:31 UTC, Andrei Alexandrescu
wrote:
On 5/19/16 4:12 AM, Jens Müller wrote:
What test data did you use?
An instance for benchmarking is generated as follows. Given nnz
which is the sum of non-zero indices in input vector a and b.
auto lengthA =
On 5/18/16 7:42 AM, Manu via Digitalmars-d-announce wrote:
On 16 May 2016 at 23:46, Andrei Alexandrescu via
Digitalmars-d-announce wrote:
Uses D for examples, showcases Design by Introspection, and rediscovers a
fast partition routine. It was quite well
On 5/19/16 4:12 AM, Jens Müller wrote:
The code applying the sentinel optimization assumes mutability of
the input. That needs to be checked for.
Indeed. As I mentioned after discussing find, I didn't worry about those
checks assuming they were obvious.
That's fine for partition
because
On 5/16/16 9:46 AM, Andrei Alexandrescu wrote:
Uses D for examples, showcases Design by Introspection, and rediscovers
a fast partition routine. It was quite well received.
https://www.youtube.com/watch?v=AxnotgLql0k
This talk took a big gambit and it seems to have worked well. Per
On Monday, 16 May 2016 at 13:46:11 UTC, Andrei Alexandrescu wrote:
Uses D for examples, showcases Design by Introspection, and
rediscovers a fast partition routine. It was quite well
received. https://www.youtube.com/watch?v=AxnotgLql0k
Andrei
Nice presentation.
The code applying the
On 18 May 2016 1:25 PM, "Bill Hicks via Digitalmars-d-announce" <
digitalmars-d-announce@puremagic.com> wrote:
>
> On Tuesday, 17 May 2016 at 09:34:53 UTC, Rory McGuire wrote:
>>
>>
>> As a South African, I can only say that you are talking nonsense
regarding the horse/zebra joke. If you've been
On 16 May 2016 at 23:46, Andrei Alexandrescu via
Digitalmars-d-announce wrote:
> Uses D for examples, showcases Design by Introspection, and rediscovers a
> fast partition routine. It was quite well received.
> https://www.youtube.com/watch?v=AxnotgLql0k
>
>
On Tuesday, 17 May 2016 at 17:31:21 UTC, Piotrek wrote:
If you want to be a troll please go to the Rust forums. They
need you there to protect "underrepresented minorities".
Piotrek
I'm here to expose the over-represented majority.
On Tuesday, 17 May 2016 at 09:34:53 UTC, Rory McGuire wrote:
As a South African, I can only say that you are talking
nonsense regarding the horse/zebra joke. If you've been to
Africa you will understand; there really are a lot more Zebra
than horses. Although I must admit I think of horses
On Tuesday, 17 May 2016 at 08:42:42 UTC, Bill Hicks wrote:
And here you go again with your borderline racist jokes. Not
very cool. If you honestly want to find out if it's "confusing
to Africans", I suggest you go to a black neighborhood and ask
them.
Haha, that is probably the most racist
On 05/16/2016 05:45 PM, QAston wrote:
On Monday, 16 May 2016 at 13:46:11 UTC, Andrei Alexandrescu wrote:
Uses D for examples, showcases Design by Introspection, and
rediscovers a fast partition routine. It was quite well received.
https://www.youtube.com/watch?v=AxnotgLql0k
Andrei
Funny,
On Tuesday, 17 May 2016 at 08:42:42 UTC, Bill Hicks wrote:
On Monday, 16 May 2016 at 13:46:11 UTC, Andrei Alexandrescu
wrote:
Uses D for examples, showcases Design by Introspection, and
rediscovers a fast partition routine. It was quite well
received.
On Tue, May 17, 2016 at 10:42 AM, Bill Hicks via Digitalmars-d-announce <
digitalmars-d-announce@puremagic.com> wrote:
> On Monday, 16 May 2016 at 13:46:11 UTC, Andrei Alexandrescu wrote:
>
>> Uses D for examples, showcases Design by Introspection, and rediscovers a
>> fast partition routine. It
On Monday, 16 May 2016 at 13:46:11 UTC, Andrei Alexandrescu wrote:
Uses D for examples, showcases Design by Introspection, and
rediscovers a fast partition routine. It was quite well
received. https://www.youtube.com/watch?v=AxnotgLql0k
Andrei
Funny, useful, advertises the best parts of D
On Monday, 16 May 2016 at 13:46:11 UTC, Andrei Alexandrescu wrote:
Uses D for examples, showcases Design by Introspection, and
rediscovers a fast partition routine. It was quite well
received. https://www.youtube.com/watch?v=AxnotgLql0k
Andrei
Great! Your talks are always pushedFront in my
On 5/16/2016 6:46 AM, Andrei Alexandrescu wrote:
Uses D for examples, showcases Design by Introspection, and rediscovers a fast
partition routine. It was quite well received.
https://www.youtube.com/watch?v=AxnotgLql0k
37 matches
Mail list logo