'use one array x(65535)'
that would be faster, but you have to have a large array always loaded
with a tree, you can store Keys; 1, 99, 65535 | very little memory
this was an experimental tree with limited use
if it does happen to fill a need:
- it's way faster than a hash or binary tree
- always in key order
i needed something; i'd call an aging stack
the last item accessed, key gets changed to highest key in tree
it requires several different trees to keep track of everything
that would be faster, but you have to have a large array always loaded
with a tree, you can store Keys; 1, 99, 65535 | very little memory
this was an experimental tree with limited use
if it does happen to fill a need:
- it's way faster than a hash or binary tree
- always in key order
i needed something; i'd call an aging stack
the last item accessed, key gets changed to highest key in tree
it requires several different trees to keep track of everything
Comment