@numba.jit(nopython=True)<EOL>def nblik2_build(ustacks):
<EOL>tots = np.empty((ustacks.shape[<NUM_LIT:0>], <NUM_LIT:1>))<EOL>twos = np.empty((ustacks.shape[<NUM_LIT:0>], <NUM_LIT:6>))<EOL>thrs = np.empty((ustacks.shape[<NUM_LIT:0>], <NUM_LIT:6>, <NUM_LIT:2>))<EOL>for idx in xrange(ustacks.shape[<NUM_LIT:0>]):<EOL><INDENT>ust = ustacks[idx]<EOL>tot = ust.sum()<EOL>tots[idx] = tot<EOL>i = <NUM_LIT:0><EOL>for jdx in xrange(<NUM_LIT:4>):<EOL><INDENT>for kdx in xrange(<NUM_LIT:4>):<EOL><INDENT>if jdx < kdx:<EOL><INDENT>twos[idx][i] = tot - ust[jdx] - ust[kdx]<EOL>thrs[idx][i] = ust[jdx], ust[jdx] + ust[kdx]<EOL>i += <NUM_LIT:1><EOL><DEDENT><DEDENT><DEDENT><DEDENT>return tots, twos, thrs<EOL>
JIT'd function builds large array that can be used to calc binom pmf