Simple and efficient purely functional queues and deques
Simple and efficient purely functional queues and deques
复制标题
简单高效的纯功能队列和双端队列
DOI：
10.1017/s0956796800001489
复制
发表时间：
1995
影响因子：
1.1
通讯作者：
Chris Okasaki
中科院分区：
文献类型：
--
作者：
Chris Okasaki
摘要我们介绍了在最坏情况下每次操作仅需要O（1）时间的队列和双层队列（DEQUES）的纯粹功能实现。我们的算法比以前具有相同界限的设计要简单得多。我们方法的灵感是懒惰列表上某些功能的增量行为。
Abstract We present purely functional implementations of queues and double-ended queues (deques) requiring only O(1) time per operation in the worst case. Our algorithms are considerably simpler than previous designs with the same bounds. The inspiration for our approach is the incremental behaviour of certain functions on lazy lists.