On Monday, 11 April 2016 at 22:06:00 UTC, ag0aep6g wrote:
mixin template multipleEdgeProperties (EdgePropertyList...)
{
static if (EdgePropertyList.length >= 1)
{
mixin singleEdgeProperty!(EdgePropertyList[0]);
mixin multipleEdgeProperties!(EdgePropertyList[1 .. $]);
On 10.04.2016 20:45, Joseph Rushton Wakeling wrote:
One very basic idea is to allow graph edges to have arbitrary
properties, and to do that, I've tried to come up with a basic data
structure that can be extended via variadic template arguments.
However, I'm not entirely satisfied with the
Hello all,
I've been playing around recently with some new ideas for a
reworking of my Dgraph library:
https://github.com/WebDrake/Dgraph
... and particularly, considering how to use D's metaprogramming
techniques to best allow the fundamental graph data structures to
be extended
