insert module:Data.Set is:exact

insert :: Ord a => a -> Set a -> Set a

Insert an element in a set. If the set already contains an element equal to the given value, it is replaced with the new value.

insert :: (Ord k, Ord a) => k -> a -> SetMap k a -> SetMap k a

Insert a new key and value in the map.

insert :: Ord a => a -> NESet a -> NESet a

O(log n). Insert an element in a set. If the set already contains an element equal to the given value, it is replaced with the new value.

insert :: Keyed a => a -> Set a % 1 -> Set a

insert :: HasInsert a s => a -> s -> s

insert :: Ord a => a -> OMSet a -> OMSet a

O(n)

insert :: (Ord k, HasUnion (c a), HasSingleton a (c a)) => a -> SetsWith k c a -> SetsWith k c a

insert :: Ord a => a -> FiniteSet a -> FiniteSet a

O(log n)

insert :: Ord k => a -> SetWith k a -> SetWith k a

insert :: a -> UMSet a -> UMSet a

O(1)

insert :: Eq a => a -> UUSet a -> UUSet a

O(n)

insert :: (Ord a) => a -> Set a -> Set a