Provisional first commit - add README describing this project.
Chris Pressey
7 months ago
0 | Collapsiv | |
1 | ========= | |
2 | ||
3 | **Collapsiv** is a methodology for allocating term data structures in a | |
4 | space-efficient manner. It implements maximal sharing in the same manner | |
5 | that hash consing does, but without the overhead of a hash table. Instead, | |
6 | terms are constructed on a stack, the bottom of which serves to persist | |
7 | term structures; this storage is searched recursively whenever a new term | |
8 | is created, and aliases (pointers into the stack) are returned when an | |
9 | existing identical term structure is found therein. | |
10 | ||
11 | Coming soon to a repository near you - an implementation of Collapsiv in | |
12 | C89 (aka ANSI C). |