Words from neighbour ones: Difference between revisions
m
→{{header|J}}: rephrase and document
m (→{{header|J}}: rephrase and document) |
|||
Line 791:
=={{header|J}}==
<lang J> >(([-.-.)9 <@((=i.9)
applicate
architect
Line 816:
transport
transpose</lang>
In other words: find the set intersection (<code>([-.-.)</code>) between the sequences of 9 ascending position characters (<code>9 <@((=i.9)#&,])\</code> ...) from extracting the first 9 characters (<code>9{.&></code> ...) of words with more than 8 characters (<code>(#~ 8<#@>)</code>) from unixdict.txt (( ... )<code>cutLF fread 'unixdict.txt'</code>)
=={{header|Java}}==
| |||