If that's an actual issue, it's possible to solve, but note that there
are several possible variations of that kind of issue (consider what
might happen if duplicate values in the three wide table were
significant information in this context), so we would need a good
description (with good disambig
Note this doesn't work if duplicates are 'consumed'; depends on the exact
problem constraints is an issue ('any two' is somewhat ambiguous). E.G.
if r contains a row 'abcabc', this routine will consider that row a match
even if l only contains one 'abc' row.
On Fri, 8 Apr 2022, Henry Rich wro
This approach is efficient because it is checking the "2 halves" of the 6char
list on existence in the 3 char list, instead of permuting all combinations of
3-list items.
On Friday, April 8, 2022, 10:32:51 a.m. EDT, Henry Rich
wrote:
l =. 'abc','def',:'ghi'
l
abc
def
ghi
r
yes I’m stupid :)
Am 08.04.22 um 16:32 schrieb Henry Rich:
2 3&$"1
--
--
mail written using NEO
neo-layout.org
--
For information about J forums see http://www.jsoftware.com/forums.htm
not too efficient but something to start with
one =: 3 3 $ 'abcdefghi'
other =: 5 6 $ 'abceeedefabcabcdefghidef'
find =: #~ one *./"1@:e.~ , $~ 2 3 ,~ */@:$ % 6:
find other
defabc
abcdef
ghidef
Am 08.04.22 um 16:21 schrieb Richard Donovan:
Hi J programmers
I need help to discover t
l =. 'abc','def',:'ghi'
l
abc
def
ghi
r =. 'abceee','defabc','mmmxxx','abcdef',:'ghidef'
r
abceee
defabc
mmmxxx
abcdef
ghidef
l (] #~ [: *./"1 (e.~ 2 3&$"1)) r
defabc
abcdef
ghidef
Henry Rich
On 4/8/2022 10:21 AM, Richard Donovan wrote:
Hi J programmers
I need help to disco
Hi J programmers
I need help to discover the most efficient way of doing the following :-
I have two tables, on of n three-character items, and a second of m
six-character items such as…
abc,def,ghi
abceee,defabc,mmmxxx,abcdef,ghidef
I need to know which six-character items can be composed of
