VList – a different IPersistentList

A VList is a datastructure developed by Phil Bagwell. It provides
various improvements over a „normal“ linked list implementation, eg. reduced
space requirements or O(1) random access (similar to vectors).

This project is VList implementation for Clojure. It is a drop-in replacement
for the built-in persistent list.

How to use?

The library is distributed via clojars. There is no need to build it yourself.
Just add a dependency to your favorite build tool.