HashMap.replace

Replace instances of oldElement with newElement, and returns the number of replacements

Time complexity: O(n).

class HashMap(K, V, alias Hash = Container.hash, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
final
replace
(,,
bool all = false
)

Meta