insert package:unordered-containers

insert :: (Eq k, Hashable k) => k -> v -> HashMap k v -> HashMap k v
unordered-containers Data.HashMap.Internal Data.HashMap.Internal.Strict Data.HashMap.Lazy Data.HashMap.Strict
Associate the specified value with the specified key in this map. If this map previously contained a mapping for the key, the old value is replaced.
insert :: Array e -> Int -> e -> Array e
unordered-containers Data.HashMap.Internal.Array
Insert an element at the given position in this array, increasing its size by one.
insert :: (Eq a, Hashable a) => a -> HashSet a -> HashSet a
unordered-containers Data.HashSet Data.HashSet.Internal
Add the specified value to this set. 
>>> HashSet.insert 1 HashSet.empty
fromList [1]
insert' :: Eq k => Hash -> k -> v -> HashMap k v -> HashMap k v
unordered-containers Data.HashMap.Internal
insertKeyExists :: Int -> Hash -> k -> v -> HashMap k v -> HashMap k v
unordered-containers Data.HashMap.Internal
insertModifying :: (Eq k, Hashable k) => v -> (v -> (# v #)) -> k -> HashMap k v -> HashMap k v
unordered-containers Data.HashMap.Internal
insertModifying is a lot like insertWith; we use it to implement alterF. It takes a value to insert when the key is absent and a function to apply to calculate a new value when the key is present. Thanks to the unboxed unary tuple, we avoid introducing any unnecessary thunks in the tree.
insertNewKey :: Hash -> k -> v -> HashMap k v -> HashMap k v
unordered-containers Data.HashMap.Internal
insertWith :: (Eq k, Hashable k) => (v -> v -> v) -> k -> v -> HashMap k v -> HashMap k v
unordered-containers Data.HashMap.Internal Data.HashMap.Internal.Strict Data.HashMap.Lazy Data.HashMap.Strict
Associate the value with the key in this map. If this map previously contained a mapping for the key, the old value is replaced by the result of applying the given function to the new and old value. Example: 
insertWith f k v map
where f new old = new + old
insertM :: Array e -> Int -> e -> ST s (Array e)
unordered-containers Data.HashMap.Internal.Array
Insert an element at the given position in this array, increasing its size by one.
unsafeInsert :: (Eq k, Hashable k) => k -> v -> HashMap k v -> HashMap k v
unordered-containers Data.HashMap.Internal
In-place update version of insert