Bounded Bags, Maps and Sets use a bounded hash table. This reduces the space requirement considerably and means that the Available function returns the correct value. Interface changes Added BC.Containers. Quicksort , BC.Containers. Copy , BC.Containers.
Bounded forms have an Available function, returning the number of free entries.
Added Synchronized forms for Dynamic and Unbounded Maps. I think the reason I've not seen this problem is that I've never been able to get the concurrency support working with the free versions of the Aonix compiler. Containers no longer allocate their representation from the heap. I think these remove the need for BC.Containers. Copy , BC.Containers.