On Sunday, 30 April 2017 at 22:03:02 UTC, Kevin Balbas wrote:
On Sunday, 30 April 2017 at 21:31:22 UTC, jkpl wrote:
On Sunday, 30 April 2017 at 21:13:07 UTC, Kevin Balbas wrote:
On Sunday, 30 April 2017 at 20:58:36 UTC, jkpl wrote:
On Sunday, 30 April 2017 at 20:05:59 UTC, Kevin Balbas wrote:
On Sunday, 30 April 2017 at 21:13:07 UTC, Kevin Balbas wrote:
On Sunday, 30 April 2017 at 20:58:36 UTC, jkpl wrote:
On Sunday, 30 April 2017 at 20:05:59 UTC, Kevin Balbas wrote:
Strangely enough, it does work fine in the test snippet,
As well if you import the snippet in another module.
On Sunday, 30 April 2017 at 20:05:59 UTC, Kevin Balbas wrote:
I've got the following code snippet, which almost does what I
want.
struct TaggedType {}
@TaggedType
struct Foo {}
@TaggedType
struct Bar {}
string GenerateTypeEnum()
{
string enumString = "enum TypeEnum {";
foreach
On Thursday, 9 February 2017 at 15:00:21 UTC, angel wrote:
On Thursday, 9 February 2017 at 14:39:41 UTC, angel wrote:
On Thursday, 9 February 2017 at 13:30:07 UTC, jkpl wrote:
I'm looking for a better way to do this, if possible:
Or actually, maybe this will suite your case better:
```
I'm looking for a better way to do this, if possible:
```
class Tool
{
string name;
}
T namedTool(alias Variable, T)()
{
T result = new T;
result.name = Variable.stringof;
return result;
}
void main()
{
Tool grep;
grep = namedTool!(grep,Tool);
assert(grep.name ==
On Thursday, 9 February 2017 at 12:16:26 UTC, jkpl wrote:
On Thursday, 9 February 2017 at 11:22:28 UTC, Suliman wrote:
Docs says that:
"The total size of a static array cannot exceed 16Mb."
But when I am creation array of:
int [1000_000] x; // 1000_000 is equal ~ 0,95MB
app crush on start.
On Thursday, 9 February 2017 at 11:22:28 UTC, Suliman wrote:
Docs says that:
"The total size of a static array cannot exceed 16Mb."
But when I am creation array of:
int [1000_000] x; // 1000_000 is equal ~ 0,95MB
app crush on start.
Should it's reserve this memory with guaranty? I mean that
On Friday, 23 December 2016 at 06:18:02 UTC, Suliman wrote:
I would like to visualize how GC works and display free/not
free memory segments.
How I can understand which of them are used and which not?
Could anybody explain what dangerous of memory fragmentation in
languages without GC? Am I
On Monday, 22 August 2016 at 04:52:40 UTC, Cauterite wrote:
On Monday, 22 August 2016 at 04:37:50 UTC, stunaep wrote:
I made a union to convert between int bits and floats, but the
values are coming out wrong sometimes.
I can already tell what this is going to be...
The problem is almost
On Monday, 22 August 2016 at 04:37:50 UTC, stunaep wrote:
I made a union to convert between int bits and floats, but the
values are coming out wrong sometimes. This is working without
issue in other languages so I'm really stumped. Here's an
example:
union test { int i; float f; }
test t =
On Thursday, 7 April 2016 at 21:36:37 UTC, Alex Parrill wrote:
On Thursday, 7 April 2016 at 20:31:12 UTC, jmh530 wrote:
I've been playing around with __traits and I find myself
confused on one aspect. In the code below, I was testing
whether some templates would compile given types. For the
On Thursday, 7 April 2016 at 05:23:47 UTC, Yuxuan Shui wrote:
On Thursday, 7 April 2016 at 04:36:02 UTC, Yuxuan Shui wrote:
On Thursday, 7 April 2016 at 04:24:48 UTC, Yuxuan Shui wrote:
[...]
Looks like _d_arrayappendcTX asked for a enormous amount of
memory and it fails, can't figure out
On Saturday, 2 April 2016 at 18:32:03 UTC, Steven Schveighoffer
wrote:
I honestly think you are better off just generating random
arrays, even if it results in some overlap (unlikely to be
relevant).
-Steve
Yes I know, I've realized how it's silly. just foreach(xn; 0 ..
range) foreach(xn;
gives: core.exception.OutOfMemoryError@src/core/exception.d(693):
Memory allocation failed
On Saturday, 2 April 2016 at 09:11:34 UTC, jkpl wrote:
On Saturday, 2 April 2016 at 08:48:10 UTC, rikki cattermole
wrote:
On 02/04/2016 9:36 PM, jkpl wrote:
On Saturday, 2 April 2016 at 08:27:07 UTC, rikki cattermole
wrote:
Okay that is a problem then.
Yes clearly!
Maybe this, a bit
On Saturday, 2 April 2016 at 08:48:10 UTC, rikki cattermole wrote:
On 02/04/2016 9:36 PM, jkpl wrote:
On Saturday, 2 April 2016 at 08:27:07 UTC, rikki cattermole
wrote:
Okay that is a problem then.
Yes clearly!
Maybe this, a bit better:
foreach (b0; randomCover(iota(0,256)))
On Saturday, 2 April 2016 at 08:27:07 UTC, rikki cattermole wrote:
On 02/04/2016 9:20 PM, jkpl wrote:
Let's say I have a ubyte[256]. I want to test all the possible
values
this array can have on a function.
Actually I'd use a hex string.
So:
static ubyte[256] DATA = cast(ubyte[256])x"00 01
Let's say I have a ubyte[256]. I want to test all the possible
values this array can have on a function.
Currently I fill it for each new test with std.random.uniform but
I'm sure that I loose some time with randomizing and with the
tests that are repeated. Is there a simple way to do this ?
On Wednesday, 16 March 2016 at 20:24:38 UTC, data pulverizer
wrote:
Hi D gurus,
is there a way to obtain parameter names within the function
body? I am particularly interested in variadic functions.
Something like:
void myfun(T...)(T x){
foreach(i, arg; x)
writeln(i, " : ",
On Saturday, 13 February 2016 at 19:24:44 UTC, ishwar wrote:
I am stumped on need finding interval between two events in a
program execution in nanoseconds. Any sample code will be
appreciated (along with imports needed to make it work):
- time in nanoseconds-now
- do-some processing
- time
On Sunday, 27 December 2015 at 16:00:34 UTC, jkpl wrote:
On Sunday, 27 December 2015 at 15:53:55 UTC, TheDGuy wrote:
Any idea what i am doing wrong?
https://www.youtube.com/watch?v=j_VCa-5VeP8
You could post the code also, personnaly I'm always almost at 2
meters from my screen, with zoom,
On Monday, 28 December 2015 at 18:02:53 UTC, jkpl wrote:
On Monday, 28 December 2015 at 15:50:06 UTC, Basile B. wrote:
On Monday, 28 December 2015 at 15:07:08 UTC, jkpl wrote:
On Sunday, 27 December 2015 at 16:00:34 UTC, jkpl wrote:
On Sunday, 27 December 2015 at 15:53:55 UTC, TheDGuy wrote:
On Monday, 28 December 2015 at 15:50:06 UTC, Basile B. wrote:
On Monday, 28 December 2015 at 15:07:08 UTC, jkpl wrote:
On Sunday, 27 December 2015 at 16:00:34 UTC, jkpl wrote:
On Sunday, 27 December 2015 at 15:53:55 UTC, TheDGuy wrote:
Any idea what i am doing wrong?
On Monday, 28 December 2015 at 18:33:16 UTC, jkpl wrote:
On Monday, 28 December 2015 at 18:12:24 UTC, jkpl wrote:
On Monday, 28 December 2015 at 18:02:53 UTC, jkpl wrote:
On Monday, 28 December 2015 at 15:50:06 UTC, Basile B. wrote:
On Monday, 28 December 2015 at 15:07:08 UTC, jkpl wrote:
On
On Monday, 28 December 2015 at 18:12:24 UTC, jkpl wrote:
On Monday, 28 December 2015 at 18:02:53 UTC, jkpl wrote:
On Monday, 28 December 2015 at 15:50:06 UTC, Basile B. wrote:
On Monday, 28 December 2015 at 15:07:08 UTC, jkpl wrote:
On Sunday, 27 December 2015 at 16:00:34 UTC, jkpl wrote:
On
On Monday, 28 December 2015 at 19:22:00 UTC, jkpl wrote:
On Monday, 28 December 2015 at 18:33:16 UTC, jkpl wrote:
On Monday, 28 December 2015 at 18:12:24 UTC, jkpl wrote:
On Monday, 28 December 2015 at 18:02:53 UTC, jkpl wrote:
On Monday, 28 December 2015 at 15:50:06 UTC, Basile B. wrote:
On
On Sunday, 27 December 2015 at 15:53:55 UTC, TheDGuy wrote:
Any idea what i am doing wrong?
https://www.youtube.com/watch?v=j_VCa-5VeP8
You could post the code also, personnaly I'm always almost at 2
meters from my screen, with zoom, so I can't read the code...
On Tuesday, 23 June 2015 at 05:16:23 UTC, Assembly wrote:
What's a fast way to insert an element at index 0 of array? now
that the code is working I want to clean this:
void push(T val)
{
T[] t = new T[buffer.length + 1];
t[0] = val;
t[1
On Wednesday, 22 April 2015 at 09:26:37 UTC, jkpl wrote:
On Wednesday, 22 April 2015 at 07:57:40 UTC, Jeremiah DeHaan
wrote:
Just curious, but I was wondering if there was a 2.067 DDMD
available for download somewhere for Windows. If not, then are
there any special build instructions I need to
On Wednesday, 22 April 2015 at 15:06:17 UTC, Jeremiah DeHaan
wrote:
On Wednesday, 22 April 2015 at 09:26:37 UTC, jkpl wrote:
On Wednesday, 22 April 2015 at 07:57:40 UTC, Jeremiah DeHaan
wrote:
Just curious, but I was wondering if there was a 2.067 DDMD
available for download somewhere for
On Wednesday, 22 April 2015 at 07:57:40 UTC, Jeremiah DeHaan
wrote:
Just curious, but I was wondering if there was a 2.067 DDMD
available for download somewhere for Windows. If not, then are
there any special build instructions I need to build it? I kind
of just want to try a couple of things,
Another try
E)---
struct StaticRegister {
static private uint _value;
@property static uint value() { return _value; }
@property static void value(uint v) { _value = v; }
static uint opCall(){return _value;}
alias _value this;
}
void
Everything is in the Q. I ask this because those functions are
hidden behind symbols and keywords (+=, ~, in, etc.). It's not
that obvious for a user who would write a custom type.
e.g:
---
struct myType
{
@safe nothrow opIndexAssign(t1 paramValue,t2 paramIndex){}
}
---
On Saturday, 25 October 2014 at 18:38:12 UTC, John Colvin wrote:
On Saturday, 25 October 2014 at 17:14:51 UTC, Jkpl wrote:
Everything is in the Q. I ask this because those functions are
hidden behind symbols and keywords (+=, ~, in, etc.). It's not
that obvious for a user who would write a
34 matches
Mail list logo
