On Sunday, 10 March 2019 at 17:04:20 UTC, Sebastiaan Koppe wrote:
On Sunday, 10 March 2019 at 16:46:43 UTC, Basile B. wrote:
Yes I see. I've refined a bit the test case and maybe I'll
took a look this week.
Cool. Is it normal to create a testcase that doesn't depend on
phobos? I suppose it
On Sunday, 10 March 2019 at 16:46:43 UTC, Basile B. wrote:
Yes I see. I've refined a bit the test case and maybe I'll took
a look this week.
Cool. Is it normal to create a testcase that doesn't depend on
phobos? I suppose it is needed for it to be included in dmd's
testcases.
On Sunday, 10 March 2019 at 16:05:19 UTC, Sebastiaan Koppe wrote:
On Sunday, 10 March 2019 at 13:41:32 UTC, Basile B. wrote:
It looks like a bug, a "reject-valid" one.
Try the same code with
enum A = 0;
and it work, despite of B being still opaque. The problem may
be related to the fact
On Sunday, 10 March 2019 at 14:25:56 UTC, spir wrote:
There is a typo in this instruction:
T* ptr = this.list.getFisrtFreeOrAdd(memViewLen).getPtr!T();
^^
rs
(may this explain your null? the compiler should complain)
diniz
Good catch! But I
On Sunday, 10 March 2019 at 13:41:32 UTC, Basile B. wrote:
It looks like a bug, a "reject-valid" one.
Try the same code with
enum A = 0;
and it work, despite of B being still opaque. The problem may
be related to the fact the enum A in the orginal code is opaque
and has not type.
On 09/03/2019 19:11, Jacob Shtokolov via Digitalmars-d-learn wrote:
The thing is that in PHP, for example, I would do
The thing is php needs to be able to "lexify" raw input data at runtime, while
in D this is done at compile-time. The ompiler has the lexer to do that.
But I agree that, for
On 09/03/2019 21:10, ANtlord via Digitalmars-d-learn wrote:
On Saturday, 9 March 2019 at 20:04:53 UTC, Paul Backus wrote:
You can end up with a null `this` reference if you dereference a null pointer
to a struct and then call a method on the result. For example:
I can but my reference is
On Sunday, 10 March 2019 at 13:20:12 UTC, Sebastiaan Koppe wrote:
The compiler complains about `cannot form tuple of tuples`
whenever I try to put an AliasSeq in a UDA and try to use it.
You would expect the compiler to expand it. Is this a bug?
---
import std.meta;
enum A; enum B;
On Sunday, 10 March 2019 at 13:41:32 UTC, Basile B. wrote:
On Sunday, 10 March 2019 at 13:20:12 UTC, Sebastiaan Koppe
wrote:
The compiler complains about `cannot form tuple of tuples`
whenever I try to put an AliasSeq in a UDA and try to use it.
You would expect the compiler to expand it. Is
The compiler complains about `cannot form tuple of tuples`
whenever I try to put an AliasSeq in a UDA and try to use it.
You would expect the compiler to expand it. Is this a bug?
---
import std.meta;
enum A; enum B;
@AliasSeq!(A,B) // <-- Error: cannot form tuple of tuples
struct Foo {}
On Saturday, 9 March 2019 at 09:12:13 UTC, Dennis wrote:
On Friday, 8 March 2019 at 11:42:11 UTC, Simon wrote:
Thanks, this works flawlessly. Out of interest: what is the
"enum" doing there? I had the exact same behaviour in a
function before, that I only called at compile-time, so why
did it
On Friday, 8 March 2019 at 09:24:25 UTC, Vasyl Teliman wrote:
I've tried to use Mallocator in BetterC but it seems it's not
available there:
https://run.dlang.io/is/pp3HDq
This produces a linker error.
I'm wondering why Mallocator is not available in this mode (it
would be intuitive to
On Sunday, 10 March 2019 at 09:43:59 UTC, Dennis wrote:
On Sunday, 10 March 2019 at 08:59:59 UTC, kerdemdemir wrote:
Can I avoid for loops and solve my problem with std algorithms
or ranges ?
Try slide: https://dlang.org/phobos/std_range.html#slide
And then use map.
I think that will work
On Sunday, 10 March 2019 at 08:59:59 UTC, kerdemdemir wrote:
Can I avoid for loops and solve my problem with std algorithms
or ranges ?
Try slide: https://dlang.org/phobos/std_range.html#slide
And then use map.
I have an array like(In my real problem my data structs is more
complex ) :
auto a = [2,3,4,5,6,7];
I want to apply a operation in a fashion like :
[ 2 , 3 ] --> apply foo and get return result -1
[ 3 , 4 ] ---> -1
[ 4 , 5 ] ---> -1
and so on...
operation
15 matches
Mail list logo
