Question

TDictionary<TKey,TValue> uses an internal array that is doubled if it is full:

newCap := Length(FItems) * 2;
if newCap = 0 then
  newCap := 4;
Rehash(newCap);

This performs well with medium number of items, but if one gets to the upper limit it is very unfortunate, because it might throw an EOutOfMemory exception even if there is almost half of the memory still available.

Is there any way to influence this behaviour? How do other collection classes deal with this scenario?

Answer 1

You need to understand how a Dictionary works. A dictionary contains a list of “hash buckets” where the items you insert are placed. That’s a finite number, so once you fill it up you need to allocate more buckets, there’s no way around it. Since the assignment of objects-to-buckets is based on the result of a hash function, you can’t simply add buckets to the end of the array and put stuff in there, you need to re-allocate the whole list of blocks, re-hash everything and put it in the (new) corresponding buckets.

Given this behavior, the only way to make the dictionary not re-allocate once full is to make sure it never gets full. If you know the number of items you’ll insert in the dictionary pass it as a parameter to the constructor and you’ll be done, no more dictionary reallocations.

If you can’t do that (you don’t know the number of items you’ll have in the dictionary) you’ll need to reconsider what made you select the TDictionary in the first place and select a data structure that offers better compromise for your particular algorithm. For example you could use binary search trees, as they do the balancing by rotating information in existing nodes, no need for re-allocations ever.