Hello, I'm a professional furniture maker and hobbyist programmer. I'm looking to calculate some basic paths to victory analysis on a series of x games with n players, each placing 1-n in any given game, with the ultimate number of outcomes being n!^...
Awesome Q is a community-curated list of useful or interesting libraries for using kdb+, modelled on similar collections for other languages (e.g. Rust, Go, PHP, Python). http://awesome-q.org
suppose i have a table t: ([]isMatched: (1b,1b,0b,0b;1b,1b,0b,0b;0b,0b,1b,1b); index:((0,1,2,3);(0,1,2,3);(0,1,2,3));id: ((`a,`b,`c,`d);(`a,`b,`c,`d);(`a,`b,`c,`d))) so each row will find use the first element in idx which the corresponding element i...
suppose i have a table with three columns first one denotes the sequence of items to pick each person allowed to pick (here only two and same seq, the front ones will have higher dollar reward) whenever available, rewards is the dollar amount corresp...
Table Example start_date val ---------------------------------------- 2022.05.02D07:36:35.901000000 0.01 2022.05.02D07:36:36.341000000 0.0125 2022.05.02D07:36:36.756000000 0.01234568 2022.05.02D07:36:37.204000000 0.9999 2022.05.02D07:36:37.636000000 ...
