On Saturday, 30 January 2021 at 05:44:37 UTC, Ali Çehreli wrote:
On 1/24/21 2:28 AM, IGotD- wrote:
> [...]
course. Any
> [...]
not do D
> [...]
[...]
Hmm, interesting, or what you should call it
With this knowledge we have now, what changes could and/or should
be made to make this
On Friday, 29 January 2021 at 10:10:56 UTC, frame wrote:
On Friday, 29 January 2021 at 01:23:20 UTC, Siemargl wrote:
On Friday, 29 January 2021 at 00:45:12 UTC, Siemargl wrote:
Then i modify program, just removing DLL, copying TestFun()
in main module and it runs.
Same compiler -m64 target.
On Friday, 29 January 2021 at 15:34:49 UTC, H. S. Teoh wrote:
On Fri, Jan 29, 2021 at 12:45:02PM +, Imperatorn via
Digitalmars-d-learn wrote:
On Wednesday, 27 January 2021 at 15:25:17 UTC, H. S. Teoh
wrote:
> On Wed, Jan 27, 2021 at 02:39:08PM +, Adam D. Ruppe via
> Digitalmars-d-learn
I have a static array of `ubyte`s of arbitrary size:
```d
ubyte[4] x = [ // in reality, ubyte[64]
0b1000,
0b0001,
0b00010101,
0b0010,
];
```
Now I want to bit-rotate the array as if it is one big integer.
So:
```d
ubyte[n] rotateRight(size_t n)(ref const ubyte[n]
On Saturday, 30 January 2021 at 12:28:16 UTC, Ali Çehreli wrote:
I wonder whether doing something in the runtime is possible.
For example, it may be more resilient and not crash when
suspending a thread fails because the thread may be dead
already.
However, studying the runtime code around
On Saturday, 30 January 2021 at 13:30:49 UTC, burt wrote:
I have a static array of `ubyte`s of arbitrary size:
```d
ubyte[4] x = [ // in reality, ubyte[64]
0b1000,
0b0001,
0b00010101,
0b0010,
];
```
Now I want to bit-rotate the array as if it is one big integer.
On Saturday, 30 January 2021 at 14:56:14 UTC, burt wrote:
On Saturday, 30 January 2021 at 14:41:59 UTC, Afgdr wrote:
On Saturday, 30 January 2021 at 14:40:49 UTC, Afgdr wrote:
On Saturday, 30 January 2021 at 13:30:49 UTC, burt wrote:
[...]
cast as uint and shift. cast the result as
On 1/30/21 1:34 AM, Imperatorn wrote:
> With this knowledge we have now, what changes could and/or should be
> made to make this process easier? 樂
I wonder whether doing something in the runtime is possible. For
example, it may be more resilient and not crash when suspending a thread
fails
Is there a way to force the GC to re-use memory in already
existing pools?
I set maxPoolSize:1 to gain pools that can be quicker released
after there no longer in use. This already reduces memory usage
to 1:3. Sadly the application creates multiple pools that are not
necessary in my POV -
On Saturday, 30 January 2021 at 14:17:06 UTC, Paul Backus wrote:
On Saturday, 30 January 2021 at 13:30:49 UTC, burt wrote:
[...]
Now I want to bit-rotate the array as if it is one big integer.
You may find `std.bitmanip.BitArray` useful for this:
On Saturday, 30 January 2021 at 14:41:59 UTC, Afgdr wrote:
On Saturday, 30 January 2021 at 14:40:49 UTC, Afgdr wrote:
On Saturday, 30 January 2021 at 13:30:49 UTC, burt wrote:
[...]
cast as uint and shift. cast the result as ubyte[4].
obiously, that works for n=4 with uint and n=8 for
On Saturday, 30 January 2021 at 12:28:16 UTC, Ali Çehreli wrote:
On 1/30/21 1:34 AM, Imperatorn wrote:
> [...]
should be
> [...]
I wonder whether doing something in the runtime is possible.
For example, it may be more resilient and not crash when
suspending a thread fails because the thread
On Saturday, 30 January 2021 at 14:40:49 UTC, Afgdr wrote:
On Saturday, 30 January 2021 at 13:30:49 UTC, burt wrote:
I have a static array of `ubyte`s of arbitrary size:
```d
ubyte[4] x = [ // in reality, ubyte[64]
0b1000,
0b0001,
0b00010101,
0b0010,
];
```
Now I
On Saturday, 30 January 2021 at 13:30:49 UTC, burt wrote:
I have a static array of `ubyte`s of arbitrary size:
```d
ubyte[4] x = [ // in reality, ubyte[64]
0b1000,
0b0001,
0b00010101,
0b0010,
];
```
Now I want to bit-rotate the array as if it is one big integer.
On Thursday, 28 January 2021 at 23:18:21 UTC, kinke wrote:
On Thursday, 28 January 2021 at 21:15:49 UTC, vitamin wrote:
Is there reason why std.conv.emplace doesn't forward arguments
to __ctor?
Yeah, a bug in the emplace() version for classes, some missing
`forward!args` in there (it works
On Saturday, 30 January 2021 at 14:56:14 UTC, burt wrote:
On Saturday, 30 January 2021 at 14:41:59 UTC, Afgdr wrote:
On Saturday, 30 January 2021 at 14:40:49 UTC, Afgdr wrote:
On Saturday, 30 January 2021 at 13:30:49 UTC, burt wrote:
[...]
cast as uint and shift. cast the result as
Greetings all,
Many thanks for sharing your collective perspective and advice
thus far! It has been very helpful and instructive. I return
bearing live data and a minimally complete, compilable, and
executable program to experiment with and potentially optimize.
The dataset can be pulled
On Saturday, 30 January 2021 at 22:57:41 UTC, Imperatorn wrote:
On Saturday, 30 January 2021 at 16:42:35 UTC, frame wrote:
Is there a way to force the GC to re-use memory in already
existing pools?
I set maxPoolSize:1 to gain pools that can be quicker released
after there no longer in use.
On Saturday, 30 January 2021 at 23:34:50 UTC, Stefan Koch wrote:
this special version of dmd will generate a trace file which
can be read with the included printTraceHeader tool
you will want to take a look at the PhaseHist command which shows
you the compiler phase that took the most time.
On Saturday, 30 January 2021 at 22:47:39 UTC, Ahmet Sait wrote:
I'm looking for ways to figure out what parts of the code slows
down the compiler other than brute force trial.
Can I use -vtemplates switch for this?
Would -v (verbose) switch helpful in some way?
How would I know if my
On 1/30/21 6:13 PM, methonash wrote:
Greetings all,
Many thanks for sharing your collective perspective and advice thus far!
It has been very helpful and instructive. I return bearing live data and
a minimally complete, compilable, and executable program to experiment
with and potentially
On Tuesday, 26 January 2021 at 23:57:43 UTC, methonash wrote:
clip
That nested loop is an O(n^2) algorithm. Meaning it will slow
down *very* quickly as the size of the array n increases. You
might want to think about how to improve this algorithm.
Nice observation, and yes, this would
I'm looking for ways to figure out what parts of the code slows
down the compiler other than brute force trial.
Can I use -vtemplates switch for this?
Would -v (verbose) switch helpful in some way?
How would I know if my bottleneck is ctfe or templates?
How do the compiler devs approach this
On Friday, 29 January 2021 at 01:23:20 UTC, Siemargl wrote:
On Friday, 29 January 2021 at 00:45:12 UTC, Siemargl wrote:
Then i modify program, just removing DLL, copying TestFun()
in main module and it runs.
Same compiler -m64 target.
Ups. Sorry, I just forget copy test_dll.dll inside VM
On Saturday, 30 January 2021 at 19:52:09 UTC, Vitalii wrote:
On Friday, 29 January 2021 at 01:23:20 UTC, Siemargl wrote:
On Friday, 29 January 2021 at 00:45:12 UTC, Siemargl wrote:
Then i modify program, just removing DLL, copying TestFun()
in main module and it runs.
Same compiler -m64
On Saturday, 30 January 2021 at 16:42:35 UTC, frame wrote:
Is there a way to force the GC to re-use memory in already
existing pools?
I set maxPoolSize:1 to gain pools that can be quicker released
after there no longer in use. This already reduces memory usage
to 1:3. Sadly the application
26 matches
Mail list logo
