Dear All,<br><br>I would like to share with you an Ocaml implementation of extensible arrays.&nbsp; The implementation is functional, based on balanced trees (and on the code for Set and Map); I called the module Vec (for vector - I like
<br>short names).&nbsp; You can find it at <a href="http://www.dealfaro.com/home/vec.html">http://www.dealfaro.com/home/vec.html</a><br>Module Vec provides, in log-time:<br><ul><li>&nbsp;Access and modification to arbitrary elements (
<span style="font-family: courier new,monospace;">Vec.put n el v</span> puts  element el in position n of vector v, for instance).</li><li>Concatenation</li><li>Insertion and removal of elements from arbitrary positions (auto-enlarging and auto-shrinking the vector).
<br></li></ul>as well as:<br><ul><li>All kind of iterators and some visitor functions.</li><li>Efficient translation to/from lists and arrays.<br></li></ul>An advantage of Vec over List, for very large data structures, is that iterating over a Vec of size n requires always stack depth bounded by log n: with lists, non-tail-recursive functions can cause stack overflows.
<br><br>I have been using this data structure for some months, and it has been very handy in a large number of occasions.&nbsp; I hope it can be as useful to you.<br><br>I would appreciate all advice and feedback.&nbsp; Also, is there a repository where I should upload it?&nbsp; Do you think it is worth it?
<br><br>All the best,<br><br>Luca<br><br><br>