FlatHashMap.rehashingRemoveN

Remove all elements matching keys followed by a rehash.

struct FlatHashMap(K, V = void, alias hasher = hashOf, string keyEqualPred = defaultKeyEqualPredOf!(K), Allocator = Mallocator, bool borrowChecked = false, bool useSmallLinearSearch = true, bool usePrimeCapacity = false)

version(none)

size_t

rehashingRemoveN

(

Keys

)

(

const scope Keys keys

)

if (

isRefIterable!Keys &&

is(typeof(Keys.front == K.init))

)

if (

isNullable!K &&

isAllocator!Allocator

)

Return Value

Type: size_t

number of elements that were removed.

FlatHashMap.rehashingRemoveN

Return Value

Meta

Source