Alexey Kuleshevich
Alexey Kuleshevich
Whenever there is a lambda with it's first argument being strict (bang pattern), and the body of a lambda function starts with a `do`, hindent removes a space between lambda...
From what I gather `_paletteSize` is an unnecessary field in `Palette'`, since it can be deduced from the size of `_paletteData` and the type of pixel, which is exactly the...
@ekmett mentioned on [reddit](https://www.reddit.com/r/haskell/comments/ezl9e2/ann_color_library/fgo4n8u/) that he'd like some [color distance](https://en.wikipedia.org/wiki/Color_difference) computation added to `Color`: > One thing I'd really like to have would be DIN99o color distance computations It seems...
* [x] Bump up the version in cabal file * [x] Any changes that could be relevant to users have been recorded in the `CHANGELOG.md` * [x] The documentation has...
* [x] - `slength` * [x] - `maxLinearSize` * [x] - `size` * [x] - `snull` * [x] - `(!?)` * [x] - `(!)` * [x] - `index` * [x]...
I believe it is almost a requirement for an array library to have support for sparse matrices, so they need to be implemented in `massiv` as well. With a little...
https://github.com/lehins/massiv/blob/c07f14744acee5aab012d8a838c83cb4942e84cf/massiv/src/Data/Massiv/Vector/Stream.hs#L263-L274 Either improve `unstreamIntoM` or add a separate function that can also: * return the number of elements that have been loaded * grow the array with Max and Exact...
Implement `sliceFromTo` for vectors and `extractFromTo` for higher dimensions that do not fail and wraparound on negative indices, much like numpy does it.
Recently there was a request on [dataHaskell gitter](https://gitter.im/dataHaskell/Lobby?at=5dd832ed55bbed7ade27f207) about creating an array in parallel, where generation of an array element depends on some of its neighbors. Here is a solution...
Similar to `deleteRegionM`, but more general function. Also will need some benchmarks. ```haskell deleteM :: (MonadThrow m, Extract r ix e, Source (EltRepr r ix) ix e, Foldable f) =>...