FlatHashMap.withCapacity

Make with room for storing at least minimumCapacity number of elements.

struct FlatHashMap(K, V = void, alias hasher = hashOf, string keyEqualPred = defaultKeyEqualPredOf!(K), Allocator = Mallocator, bool borrowChecked = false, bool useSmallLinearSearch = true, bool usePrimeCapacity = false)
static
typeof(this)
withCapacity
()
(
in size_t minimumCapacity
)
if (
isAllocator!Allocator
)

See Also

Meta