Sorry. The result of SetPartitionsGenerateF is subset numbers, the
representation Raul shows. /Erling
Den 2017-11-14 kl. 11:42, skrev Raul Miller:
Er... ok, you could use some kind of encoding of integers in a higher
ranked array.
That would tend to become inefficient (when you exceed N partitions
you require more storage than fixed width integers, for example), but
you are right that it's possible. And, in fact, there's a direct
mapping between the integer representation and your current
suggestion.
=0 1 2 2 2
1 0 0 0 0
0 1 0 0 0
0 0 1 1 1
And, generally (where x -&# y and (/:~ -: i.@#)~.x):
(x </. y) -: (=x) <#"1 y
1
Thanks,
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
