On Wednesday, November 7, 2018 10:50:29 PM MST Michelle Long via
Digitalmars-d-learn wrote:
> On Thursday, 8 November 2018 at 02:22:42 UTC, Jonathan M Davis
>
> wrote:
> > On Wednesday, November 7, 2018 1:03:47 PM MST Michelle Long via
> >
> > Digitalmars- d-learn wrote:
> >> Don't let their
On Wednesday, November 7, 2018 10:45:07 PM MST Jonathan M Davis via
Digitalmars-d-learn wrote:
> On Wednesday, November 7, 2018 9:28:19 PM MST Codifies via Digitalmars-d-
>
> learn wrote:
> > I noticed that opOpAsign allows you to return a value...
> >
> > this means I can do this (return a node
On Thursday, 8 November 2018 at 02:22:42 UTC, Jonathan M Davis
wrote:
On Wednesday, November 7, 2018 1:03:47 PM MST Michelle Long via
Digitalmars- d-learn wrote:
Don't let their psychobabble fool you. They are wrong and you
were right from the start.
...
Case A:
{
if (true) goto X;
On Wednesday, November 7, 2018 9:28:19 PM MST Codifies via Digitalmars-d-
learn wrote:
> I noticed that opOpAsign allows you to return a value...
>
> this means I can do this (return a node from my list class when
> adding a new node)
> ```
> anode = alist ~=
> ```
> to me this looks a little
I noticed that opOpAsign allows you to return a value...
this means I can do this (return a node from my list class when
adding a new node)
```
anode = alist ~=
```
to me this looks a little unusual (but to be fair I can live with
it)
being as when its used like this:
```
alist ~=
```
you
On Wednesday, November 7, 2018 1:03:47 PM MST Michelle Long via Digitalmars-
d-learn wrote:
> Don't let their psychobabble fool you. They are wrong and you
> were right from the start.
...
> Case A:
> {
> if (true) goto X;
> int x;
> }
> X:
>
>
> Case B:
> {
> if (true) goto X;
>
On Wednesday, 7 November 2018 at 14:22:43 UTC, lithium iodate
wrote:
On Wednesday, 7 November 2018 at 13:05:49 UTC, test wrote:
I am confused about the bitfields order.
The bitfields start with the least significant bits:
fin -> 1
rsv1 -> 0
rsv2 -> 0
rsv3 -> 0
opcode -> 1000 = 8
mask -> 1
On Wednesday, 7 November 2018 at 19:40:57 UTC, 9il wrote:
On Wednesday, 7 November 2018 at 19:09:50 UTC, Alex wrote:
Ok... sorry for being penetrant, but there is still something
strange. Having dependencies as you had,
[...]
Well, fixed in v2.1.3
Thanks again!
Works for now.
On Wed, Nov 07, 2018 at 10:01:15PM +, Per Nordlöw via Digitalmars-d-learn
wrote:
> Opposite to run-time checking via
>
> if (__ctfe)
> {
> //
> }
It's actually not a "run-time" check, because the backend optimizer will
optimize out the true branch (check the emitted asm to confirm
Opposite to run-time checking via
if (__ctfe)
{
//
}
is there no way of checking at compile-time whether the current
scope of a function is being executed in CTFE?
On Tuesday, 6 November 2018 at 21:29:17 UTC, Stanislav Blinov
wrote:
On Tuesday, 6 November 2018 at 21:19:29 UTC, Peter Campbell
wrote:
Given your second example that makes me think that, because
object functions are provided by the runtime without me
explicitly importing it, this is likely
On Wednesday, 7 November 2018 at 20:03:47 UTC, Michelle Long
wrote:
Case A:
int x;
{
if (true) goto X;
//int x;
}
~x;
X:
That is not "Case A". This one is:
{
if (true) goto X;
T x;
X:
} // x.__dtor
That should error as an easy cop-out, nothing wrong with that
approach.
On Tuesday, 6 November 2018 at 13:53:41 UTC, MatheusBN wrote:
On Tuesday, 6 November 2018 at 05:46:40 UTC, Jonathan M Davis
wrote:
On Monday, November 5, 2018 7:55:46 PM MST MatheusBN via
Digitalmars-d-learn wrote:
On Tuesday, 6 November 2018 at 01:55:04 UTC, Jonathan M Davis
wrote:
>> And I
On Wednesday, 7 November 2018 at 19:09:50 UTC, Alex wrote:
Ok... sorry for being penetrant, but there is still something
strange. Having dependencies as you had,
[...]
Well, fixed in v2.1.3
On 07.11.2018 22:09, Alex wrote:
Ok... sorry for being penetrant, but there is still something strange.
Having dependencies as you had,
´´´
import mir.random.algorithm;
import mir.algorithm.iteration;
import mir.ndslice;
import mir.random;
void fun(size_t s){}
void main()
{
size_t[]
Ok... sorry for being penetrant, but there is still something
strange. Having dependencies as you had,
´´´
import mir.random.algorithm;
import mir.algorithm.iteration;
import mir.ndslice;
import mir.random;
void fun(size_t s){}
void main()
{
size_t[] arr;
arr.length = 42;
On Wednesday, 7 November 2018 at 17:05:31 UTC, 9il wrote:
I have updated template constraints.
http://docs.random.dlang.io/latest/mir_random_algorithm.html#.sample
The problem that looks like Phobos map does not define all
required primitives like popFrontExactly.
Ok... didn't have this on
On Wednesday, 7 November 2018 at 14:46:17 UTC, Alex wrote:
On Wednesday, 7 November 2018 at 14:07:32 UTC, 9il wrote:
This is a regression. It is fixed in mir-random v2.1.2.
Thanks. But I have another one:
´´´
import mir.random.algorithm;
import std.experimental.all;
void main()
{
On Wednesday, 7 November 2018 at 14:07:32 UTC, 9il wrote:
This is a regression. It is fixed in mir-random v2.1.2.
Thanks. But I have another one:
´´´
import mir.random.algorithm;
import std.experimental.all;
void main()
{
S[] arr;
arr.length = 42;
arr.each!((i, ref
On Wednesday, 7 November 2018 at 01:37:29 UTC, Chris M. wrote:
On Tuesday, 29 May 2018 at 07:47:07 UTC, Begah wrote:
[...]
This works fine on my home Win10 machine, dmd 2.082/2.083 + dub
1.11.0, installed using the executable from the downloads page.
However I've had this same issue on my
On Wednesday, 7 November 2018 at 13:05:49 UTC, test wrote:
I am confused about the bitfields order.
mixin(bitfields!(
bool, "fin",1,
bool, "rsv1", 1,
bool, "rsv2", 1,
bool, "rsv3", 1,
Opcode, "opcode", 4,
On Wednesday, 7 November 2018 at 09:33:32 UTC, Alex wrote:
I'm referring to the example
http://docs.random.dlang.io/latest/mir_random_algorithm.html#.sample
[...]
This is a regression. It is fixed in mir-random v2.1.2.
I am confused about the bitfields order.
mixin(bitfields!(
bool, "fin",1,
bool, "rsv1", 1,
bool, "rsv2", 1,
bool, "rsv3", 1,
Opcode, "opcode", 4,
bool, "mask", 1,
ubyte,
I'm referring to the example
http://docs.random.dlang.io/latest/mir_random_algorithm.html#.sample
Could somebody tell me, why
´´´
import mir.random.algorithm;
import std.range; //import mir.range;
void main()
{ // line 5
size_t[] arr;
arr.length = 42;
arr =
24 matches
Mail list logo
