Are there other fast-access data structures with no such limitations, on
LispWorks?
Thank you again,
Priyadarshan
I have created something called ’N-Dimensional Sparse Spaces’ as a solution to the large array allocation problem.
This initial implementation is one to replace a set of random points within an N-Dimensional Sparse Grid addressed using integers, hence the use of #’= in #’make-space.
It is more generallized using other equals functions such as #’eql (so you can use symbols, and hence make an addressable symbol space), #’equals and #equalp letting you use S-Expressions as your addresses.
I have a more general implementation somewhere in my code, but the above image is the code I initially wrote that can be springboarded off of to create your own implementation.
One trick I have thought of is to, after you have completed your work with the space, is to compile it to a more suituable data structure for read-only access.
The sparce space is for editing and loading of the data you want to work with. A complied space is for reading data from the space, giving up generality.
Feel free to write me to discuss this data structure further if you have any questions or comments on its usefulness and generality and applicability to your problem.
Burton Samograd
BusFactor1 Inc.