mrocklin / dask / 534

94%

master: 94%

push

travis-ci

Add dask.array.bincount

The implementation is fairly simple.  We call np.bincount on each chunk
followed by a sum on the result.  We also support the `weights=` kwarg
and **require** the `minlength=` kwarg.

Example
-------

In [1]: import dask.array as da

In [2]: x = da.random.binomial(100, 0.2, size=10000000, chunks=100000)

In [3]: %time da.bincount(x, minlength=100).compute()
CPU times: user 2.26 s, sys: 44.2 ms, total: 2.31 s
Wall time: 2.24 s
Out[3]:
array([     0,      0,      0,      6,     44,    136,    584,   2064,
         5938,  14772,  33084,  68568, 127704, 215525, 336015, 479691,
       637366, 790564, 911322, 979063, 993400, 944096, 849693, 719470,
       576965, 438738, 315740, 217278, 141412,  87920,  51906,  29428,
        15835,   8183,   4072,   1899,    878,     383,    164,    51,
           26,     12,      5,      0,      0,       0,      0,     0,
            0,      0,      0,      0,      0,       0,      0,     0,
            0,      0,      0,      0,      0,       0,      0,     0,
            0,      0,      0,      0,      0,       0,      0,     0,
            0,      0,      0,      0,      0,       0,      0,     0,
            0,      0,      0,      0,      0,       0,      0,     0,
            0,      0,      0,      0,      0,       0,      0,     0,
            0,      0,      0,      0])

21 of 21 new or added lines in 1 file covered. (100.0%)

4796 of 5118 relevant lines covered (93.71%)

0.94 hits per line