HybridHashMap.rehashingRemoveN

Remove all elements matching keys followed by a rehash.

struct HybridHashMap(K, V = void, alias hasher = hashOf, string keyEqualPred = defaultKeyEqualPredOf!(K), Allocator = Mallocator, BorrowCheckFlag borrowCheckFlag = BorrowCheckFlag.no, uint linearSearchMaxSize = 64, PrimeCapacityFlag primeCapacityFlag = PrimeCapacityFlag.no)
version(none)
size_t
rehashingRemoveN
(
Keys
)
(
const scope Keys keys
)
if (
isRefIterable!Keys &&
is(typeof(Keys.front == K.init))
)
if (
isAllocator!Allocator
)

Return Value

Type: size_t

number of elements that were removed.

Meta