Blosc / Blosc/python-blosc2

Optimise fancy indexing further

未关闭
#441 1 条评论 0 个 reaction 已指派 1 人 已被 @lshaw8317 认领 在 GitHub 查看
主要语言
Python
星标
211
派生
58
平均合并
1 天 17 小时
30 天内合并 PR
6

描述

Continue to fine tune functionality and performance of fancy indexing according to outline suggested in #437

- [ ] work around for ndindex not supporting array indices separated by slices e.g. arr[0, :, [0, 1]]
- [ ] pure boolean indexing can definitely be optimised to work more like LazyExpr where for more general shapes (not just key.shape = array.shape)
- [ ] implement vindex (for numpy and blosc array return types)
- [ ] finish implementation of oindex (return blosc array)
- [ ] optimise fancy indexing for broadcasted index arrays
- [ ] implement (optimised) setitem for fancy indexing
- [ ] implement fancy indexing in slice (i.e. return blosc array not numpy array)
- [x] ~~optimise fancy indexing to avoid recalculating _slice/chunk_slice intersections every loop~~ (PR #459)

贡献指南

打开贡献指南

评估

这个 Issue 还没有评估数据。

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。