On Wednesday, 27 April 2016 at 06:59:22 UTC, cym13 wrote:
On Tuesday, 26 April 2016 at 14:32:59 UTC, Alex wrote:
IMHO, if you are to parse them from strings then you need a
parser in order to build an abstract tree, a simpler
intermediary language to restrict the possible patterns
expressing
On Tuesday, 26 April 2016 at 14:32:59 UTC, Alex wrote:
Hi all!
Not sure, if this belongs directly to the D language, or it is
rather maths, but:
given to delegate generating functions and a main
auto func1(int arg)
{
bool delegate(int x) dg;
dg = (x) => arg * x;
return dg;
}
auto
There's no way to do this in D. There have been several proposals
but nothing implemented as of yet.
Hi all!
Not sure, if this belongs directly to the D language, or it is
rather maths, but:
given to delegate generating functions and a main
auto func1(int arg)
{
bool delegate(int x) dg;
dg = (x) => arg * x;
return dg;
}
auto func2(int arg)
{
bool delegate(int x) dg;
dg =
