On Thursday, 10 September 2015 at 11:58:10 UTC, deed wrote:
On Wednesday, 9 September 2015 at 20:28:35 UTC, Laeeth Isharc
wrote:
I have a DateTime[][] arg ...
I would like to find the intersection of the dates.
A suggestion:
auto minLength = arg.map!(a => a.length).reduce!min;
auto
On Wednesday, 9 September 2015 at 20:28:35 UTC, Laeeth Isharc
wrote:
so setIntersection(arg[0],arg[1],arg[2] .. arg[$-1])
except that I don't know how many series are in arg at compile
time.
what's the most efficient way to use Phobos to find these? (I
could write a loop, but I am trying
On Wednesday, 9 September 2015 at 20:28:35 UTC, Laeeth Isharc
wrote:
I have a DateTime[][] arg ...
I would like to find the intersection of the dates.
A suggestion:
auto minLength = arg.map!(a => a.length).reduce!min;
auto minIdx = arg.map!(a =>
a.length).countUntil(minLength);
Couldn't you use setIntersection together with reduce?
Doesn't seem like the most efficient solution, but its less
typing and most likely will have no bugs.
I have a DateTime[][] arg (actually my own date type, but that
shouldnt matter). Ordered by time series ticker (eg a stock) and
then the date.
eg arg[0] might be the dates relating to IBM and arg[0][0] would
be the date of the first point in IBM time series.
I would like to find the
