GNU ELPA - myers


Random-access singly-linked lists
myers-0.1.el, 2016-Jun-11, 6.46kB
Home page
Browse repository
CGit or Gitweb

To install this package, run in Emacs:

M-x package-install RET myers RET

Full description

This package implements Eugene W. Myers's "stacks" which are like
standard singly-linked lists, except that they also provide efficient
lookup.  More specifically:

cons/car/cdr are O(1), while (nthcdr N L) is O(min (N, log L))

For details, see "An applicative random-access stack", Eugene W. Myers,
1983, Information Processing Letters