delete package:unordered-containers

delete :: (Eq k, Hashable k) => k -> HashMap k v -> HashMap k v

unordered-containers Data.HashMap.Internal Data.HashMap.Internal.Strict Data.HashMap.Lazy Data.HashMap.Strict

Remove the mapping for the specified key from this map if present.

delete :: Array e -> Int -> Array e

unordered-containers Data.HashMap.Internal.Array

Delete an element at the given position in this array, decreasing its size by one.

delete :: (Eq a, Hashable a) => a -> HashSet a -> HashSet a

unordered-containers Data.HashSet Data.HashSet.Internal

Remove the specified value from this set if present.

>>> HashSet.delete 1 (HashSet.fromList [1,2,3])
fromList [2,3]

>>> HashSet.delete 1 (HashSet.fromList [4,5,6])
fromList [4,5,6]

delete' :: Eq k => Hash -> k -> HashMap k v -> HashMap k v

unordered-containers Data.HashMap.Internal

deleteKeyExists :: Int -> Hash -> k -> HashMap k v -> HashMap k v

unordered-containers Data.HashMap.Internal

Delete optimized for the case when we know the key is in the map. It is only valid to call this when the key exists in the map and you know the hash collision position if there was one. This information can be obtained from lookupRecordCollision. If there is no collision, pass (-1) as collPos.

deleteBy :: (a -> b -> Bool) -> a -> [b] -> Maybe [b]

unordered-containers Data.HashMap.Internal.List