I dunno. I got pretty badly burned by splice trying to compete using a heap, and that didn't require managing references, just index math. How do you intend to set this up?
Makeshifts last the longest.
In reply to Re^2: Designing a cache data structure (linked list)
by Aristotle
in thread Designing a cache data structure
by spurperl
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |