An optimized 1-dimensional array of fixnums that automatically re-adjusts in size.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
Michael Fiano c1eae16cdb
First commit.
4 months ago
src First commit. 4 months ago
LICENSE First commit. 4 months ago
README.md First commit. 4 months ago
dynamic-array.asd First commit. 4 months ago

README.md

dynamic-array

An implementation of the AVL tree data structure.

An optimized 1-dimensional array of fixnums that automatically re-adjusts in size.

Overview

An optimized 1-dimensional array type that can only store fixnums, and which is able to automatically grow when pushing new elements to the end. It is not very useful in most situations, as it doesn't implement the Common Lisp sequences protocol, nor does it conform to the usual interface of Common Lisp arrays for PUSH and POP.

Install

(ql:quickload :dynamic-array)

License

Copyright © 2019-2022 Michael Fiano mail@mfiano.net

Licensed under the MIT License.