Yes... using rank 1 0 on the implementation is a good alternative to
boxing. Using the approach I had come up with (I have not done any
benchmarking here), this could be:
3 2 1((0 = #@-.~) 10&#. inv)("1 0) 230 123 111 123123132
0 1 1 1
--
Raul
On Sat, Aug 26, 2023 at 8:30 AM 'Pascal Jasmin' via Programming
<programm...@jsoftware.com> wrote:
>
>
> 3 2 1(*./@:(e.~)&~.&(/:~) 10&#. inv)("1 0) 230 123 111 123123132
>
> 0 1 1 1
>
>
> On Saturday, August 26, 2023 at 06:31:01 a.m. EDT, Richard Donovan
> <rsdono...@hotmail.com> wrote:
>
> I am trying to find out whether a series of integers y only contain a set of
> integers x
>
> That is, 1 3 5 verb 5311 10531 536 1111111
> should return 1 0 1 1
>
> NB. only 1 3 5 occur in 5311
> NB. not only 1 3 5 occur in 10531
> NB. not only 1 3 5 occur in 536
> NB. only 1 3 5 occur in 1111111
>
> NB. x only contains digits 0-9 without repeat. #x is max 10
> NB. leading zeros should be ignored in elements of y. No max for #y
>
> I have tried several methods using combinations of e. i. under< etc. but
> haven't yet found a succinct verb that achieves what I want.
>
> I hope my description is clear
>
> Help gratefully received!
> ----------------------------------------------------------------------
> 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
