My wife has surgery tomorrow, so I won't be quick I'm afraid. I wouldn't have
guessed that k2 was even a primitive, but I thought that about &.: too.
I like the none-of-the-above result; I'm not sure my 64^3 universe of possible
values would be a good fit.
But I'm eager to learn from it. Than
What you described is a different adverb K2 where
x u K2 y ←→ ((~.x)i.y) u/. y
(If x has no duplicates, then it's just (x i.y) u/. y .) Please try it
and tell us whether it does what you want.
This is an interesting computation where the left argument x does not
specify keys for the right
One more comment re group by:
Don't know k or the connection machine (and struggle with take always, and
goezinta's) but "group by" maybe helps me understand something. Implicit in a
"group by" is that the grouping isn't by the referenced columns, it is by the
unique, or distinct values in those
Just to explain my confusion, and with apologies for my terminology...
Since iota (and i.) return an "off the scale" index to mean "not found", I
assumed that a "not found", or "none of the above" category would return a
count (in the case of #) in the final (1+$nub) item of the result. My
uned
Oh no, it's not because I said so. As I said, it's because this particular
definition, the current definition, says so. If you think the definition
should be / could be something else, we can discuss it. Truth be told, I
don't understand how you can have keys that don't have corresponding data,
And only you, Roger, well deserve the right to answer "Because I said so!"
I was only considering the case of u=#, and remembering that #/. was described
as in the i. family, and seeing that...
Well never mind. Sorry.
> On Oct 13, 2019, at 7:50 PM, Roger Hui wrote:
>
>
>>
>> why do the s
> why do the sizes of the x and y argument to Key need to match?
Because the x u/. y key adverb is _defined_ so that
- items of x specify keys for _corresponding_ items of y and
- u is applied to each collection of y having identical keys.
You can argue that the definition should be someth
Does this help?
1 2 1 3 2 4 (,) 'abcdef’ NB. sizes of set-ids and text match
6 6
1 2 1 3 2 4 ( On 13 Oct 2019, at 23:58, 'Jim Russell' via Programming
> wrote:
>
> Rick: My ability to read tacit expressions is so poor that I overlooked the
> fact that the your quoted output did not co
Rick: My ability to read tacit expressions is so poor that I overlooked the
fact that the your quoted output did not come directly from the Key expression;
silly me, I thought there was some form of the modifiers/arguments to Key that
yielded the results of two inputs.
(In contrast to your ski
Ok, have you determined?
> On Oct 13, 2019, at 11:03 AM, 'Mike Day' via Programming
> wrote:
--
For information about J forums see http://www.jsoftware.com/forums.htm
Never conclu...
M
On 13/10/2019 15:23, 'Jim Russell' via Programming wrote:
So, have you concluded:
• A pre-filter is worthwhile?
• Why eliminating spaces had such an effect?
• Bacon was the author after all?
--
For information
So, have you concluded:
• A pre-filter is worthwhile?
• Why eliminating spaces had such an effect?
• Bacon was the author after all?
--
For information about J forums see http://www.jsoftware.com/forums.htm
Wasn't doubting Mike, just expressing how much diversity arises from only 4
letters. Imagine if God had used the whole alphabet. (Guess the other 22
letters hasn't been invented yet. )
> On Oct 13, 2019, at 3:09 AM, Ric Sherlock wrote:
>
> Confirming Mike's assertion...
>
> load 'stats'
>
No, 64 for trigrams in the case of the 4-letter DNA base alphabet, 'acgt'.
The number of possible trigrams in English text is at least 26^3 =
17576, if you
admit impossible triples. Worse if you include punctuation and
differentiate
upper case from lower ...
FWIW, I've just copied and past
Confirming Mike's assertion...
load 'stats'
$'acgt' {~ 3 permrep 4
64 3
On Sun, 13 Oct 2019, 11:59 'Jim Russell' via Programming, <
programm...@jsoftware.com> wrote:
> Only 64? So worst case ascii text summaries would be 64^ 3 rows?
>
> > On Oct 12, 2019, at 6:36 PM, 'Mike Day' via Progr
15 matches
Mail list logo