insert -containers -bytestring

insert :: HashTable key val -> key -> val -> IO ()
base Data.HashTable
Inserts a key/value mapping into the hash table. Note that insert doesn't remove the old entry from the table - the behaviour is like an association list, the most-recently-inserted mapping for a key in the table. The reason for this is to keep insert as efficient as possible. If you need to update a mapping, then we provide update.
insert :: Ord a => a -> [a] -> [a]
base Data.List
The insert function takes an element and a list and inserts the element into the list at the last position or equal to the next element. In particular, if the list is sorted before the call, the result will also be sorted. It is a special case of insertBy, which allows the programmer to supply their own comparison function.
insert :: Ord a => (a, b) -> Heap a b -> Heap a b
fgl Data.Graph.Inductive.Internal.Heap
insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]
base Data.List
The non-overloaded version of insert.
insertHeader :: HasHeaders a => HeaderSetter a
HTTP Network.HTTP.Headers
insertHeader hdr val x inserts a header with the given header name and value. Does not check for existing headers with same name, allowing duplicates to be introduce (use replaceHeader if you want to avoid this.)
insertHeaderIfMissing :: HasHeaders a => HeaderSetter a
HTTP Network.HTTP.Headers
insertHeaderIfMissing hdr val x adds the new header only if no previous header with name hdr exists in x.
insertHeaders :: HasHeaders a => [Header] -> a -> a
HTTP Network.HTTP.Headers
insertHeaders hdrs x appends multiple headers to x's existing set.
KeyInsert :: SpecialKey
GLUT Graphics.UI.GLUT.Callbacks.Window