Re: master 3e5298f: Improve performance of seq-union

[Lars Ingebrigtsen]

Robert Pluim <rpluim@gmail.com> writes:

> Utterly idle thought: would packages that tend to generate long lists
> and reverse them, such as Gnus, benefit from a builtin-in queue data
> type that supported efficient appending?

A new data structure that has both head and a tail pointer?  I think
you'd be hard pressed to get that to be faster than push+nreverse unless
you implement it in C -- nreverse is very fast.

But I could be wrong.

-- 
(domestic pets only, the antidote for overdose, milk.)
   bloggy blog: http://lars.ingebrigtsen.no