SortedMap.cache

Configure the assigned allocator with the size of each allocation block (number of nodes allocated at one time) and the number of nodes to pre-populate the cache with.

Time complexity: O(n)

class SortedMap(K, V, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
final
cache
(
size_t chunk
,
size_t count = 0
)

Meta