【24h】

Recycle Your Arrays!

机译:回收阵列!

获取原文
获取原文并翻译 | 示例

摘要

Purely functional arrays are notoriously difficult to implement and use efficiently due to the absence of destructive updates and the resultant frequent copying. Deforestation frameworks such as stream fusion achieve signficant improvements here but fail for a number of important operations which can nevertheless benefit from elimination of temporaries. To mitigate this problem, we extend stream fusion with support for in-place execution of array operations. This optimisation, which we call recycling, is easy to implement and can significantly reduce array allocation and copying in purely functional array algorithms.
机译:由于缺乏破坏性的更新以及由此导致的频繁复制,纯功能阵列很难实现和有效使用。诸如流融合之类的森林砍伐框架虽然在这里取得了显着的进步,但未能进行许多重要的操作,但这些操作仍然可以从消除临时人员中受益。为了缓解此问题,我们扩展了流融合,并支持就地执行数组操作。这种优化(我们称为回收)很容易实现,并且可以显着减少纯功能阵列算法中的阵列分配和复制。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号