Simplest "high performance" version of that would be to pre-compute each of the possible answers for each possible X.
-- Raul On Thu, Oct 13, 2016 at 9:33 PM, Michal Dobrogost < michal.dobrog...@gmail.com> wrote: > Yes, you can rewrite (+./@:*.) as (+./ . *.). > > Hehe, in terms of peculiar ways and unknown reasons, I invite you to think > about how you might go about implementing a high-performance version of > this operation where X and Y are restricted to boolean elements, Y is > static and X dynamically changes. > > On Thu, Oct 13, 2016 at 10:32 AM, Erling Hellenäs < > erl...@erlinghellenas.se> > wrote: > > > It is this operation +./ . *. we rewrite in peculiar ways for unknown > > reasons? > > > > [ x=: 1 0 1 1 0 > > > > 1 0 1 1 0 > > > > [ y=: 5 6 $1 0 0 0 0 0 0 1 0 1 1 0 0 1 0 0 0 1 0 0 0 0 1 1 0 1 1 1 0 1 > > > > 1 0 0 0 0 0 > > > > 0 1 0 1 1 0 > > > > 0 1 0 0 0 1 > > > > 0 0 0 0 1 1 > > > > 0 1 1 1 0 1 > > > > x +./ . *. y > > > > 1 1 0 0 1 1 > > > > > > /Erling > > > > > > > > ---------------------------------------------------------------------- > > For information about J forums see http://www.jsoftware.com/forums.htm > > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
