HashMap.containsPair

Time complexity: O(1) average; O(n) worst.

class HashMap(K, V, alias Hash = Container.hash, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
final
bool
containsPair
(
K key
,)

Meta