KDB Gurus,I want to limit the number of "fills" to n time. I came up
with: { i::0; { $[not[null[z]] | i>=x;[i::0;z];[i::i+1;
y]]}[x]\[y;z]}[2][1;2 0N 0N 0N 3 0N 0N 0N 4 5], which is taking more
than 3 times the "fills" operation.Can anyone please sha...
Hi KDB gurus, can anyone please explain the meaning of the expression:
x('[min;+])/: x, especially the function composition '[min;+] and its
use with /:, here x is a matrix. TIA!
Thanks Nick, Jason for your explanations! I was trying to understand
composition of functions, since the left side of the 2 functions should
be a monadic/unary, I randomly picked min. Even for - 0 (min+)\ x, I was
expecting the result to be same as (...
sorry! I was in a bit hurry. Thanks for sharing smart questions link.So,
the question is:For sample input, x::-1 2 3 4 -1 6 7 8 9 -1, I am
expecting same output for both the following expressions,1) 0
(min+)\xoutput -> -1 2 3 4 -1 6 7 8 9 -12) (min+\...
Thanks a lot for explaining with the alternate forms of the expression.
It is indeed min plus matrix multiplication used in finding the shortest
distance between nodes(ref: https://code.kx.com/q/kb/lp/). I am more
interested in understanding the idea...
