3 ms·
> you have a tree with the metainformation, and every time you de-allocate and allocate you have to search trough one or more trees Don't use a tree in that ca
by maccard 10y ago
> you have a tree with the metainformation, and every time you de-allocate and allocate you have to search trough one or more trees
Don't use a tree in that case? I don't see why you using a tree to store allocation info means that allocations are slow.
- faragon 10y agoWhatever other data structure you use is not going to be simple, and will have even worse drawbacks: e.g. using hash tables for handling allocation pools and free blocks could be even worse.