On Monday, 16 September 2019 at 13:13:50 UTC, Adam D. Ruppe wrote:
On Monday, 16 September 2019 at 07:02:04 UTC, Max Samukha wrote:
[...]
Well, sort of, your code is perfectly legal and has worked
since the beginning of D. The thing in the spec is referring to
the assumption the compiler
On Sunday, 15 September 2019 at 08:17:20 UTC, sytnax wrote:
So, the question is: should I share this somehow (despite the
limitations listed below)?
Considering the circumstances you mentioned, I'd say either don't
publish it or simply make it a public GitHub repository with
these
or simply make it a public GitHub repository with these
limitations stated in the readme.
Yeah, that sounds good.
On the one hand I'd like to share code, and on the other hand it
kinda stresses me out. I should probably just learn a bit more
about D, and then come back to the idea.
Thanks
How does one get return values?
https://matplotlib.org/3.1.0/gallery/statistics/hist.html
Shows that python uses return values to set properties of the plot
https://github.com/koji-kojiro/matplotlib-d/blob/master/examples/source/app.d
Does not give any examples of return values and when
Many times I have to get statistical info which is simply compute
statistics on a data set that may be generating or already
generated.
The code usually is
M = max(M, v);
m = min(m, v);
but other things like standard deviation, mean, etc might need to
be computed.
This may need to be done
Please consider a project:
src/p2/
|---a.d
|---b.d
in which it is desirable that the logical package tree does not
fully correspond to the filesystem subtree:
src/p2/a.d:
module p1.p2.a;
...
src/p2/b.d:
module p1.p2.b;
import p1.p2.a;
...
dmd compiles the above structure
On Saturday, 14 September 2019 at 20:24:41 UTC, Andre Pany wrote:
On Saturday, 14 September 2019 at 14:22:40 UTC, DMan wrote:
Dear all,
I need to keep the project root clean from build artifact, how
I can tell DUB to store the '.dub' directory in a sibling
directory of my project root
Anyone have a better way to accomplish the following task:
An algorithm computes various values for a graph structure. The
graph contains many loops and nested loops. Each node has a chain
associated with it, which is how it is connected to the rest of
the graph.
The problem is to save
On Monday, 16 September 2019 at 07:02:04 UTC, Max Samukha wrote:
Is the spec wrong?
Well, sort of, your code is perfectly legal and has worked since
the beginning of D. The thing in the spec is referring to the
assumption the compiler uses to find files not explicitly
referenced on the
