Re: lists.texi

[David Kastrup]

Luc Teirlinck <address@hidden> writes:

> Actually, if we have to do all of that to get the correct return
> value, we could quite as well use the following function, which does
> get the order correct:
>
> (defun ring-elements (ring)
>   "Return a list of the elements of RING in order, newest first."
>   (let (lst)
>     (dotimes (var (ring-length ring))
>       (push (ring-ref ring var) lst))
>     (nreverse lst)))

Looks like O(n^2) complexity to me.

-- 
David Kastrup, Kriemhildstr. 15, 44793 Bochum