|
Data.Set | Portability | portable | Stability | provisional | Maintainer | libraries@haskell.org |
|
|
|
|
Contents |
- The Set type
- Construction
- Inspection
- Operations
|
|
Description |
An implementation of sets, based on the Data.FiniteMap.
|
|
Synopsis |
|
|
|
|
The Set type |
|
data Set a |
|
|
Construction |
|
emptySet :: Set a |
|
mkSet :: (Ord a) => [a] -> Set a |
|
setToList :: Set a -> [a] |
|
unitSet :: a -> Set a |
|
Inspection |
|
elementOf :: (Ord a) => a -> Set a -> Bool |
|
isEmptySet :: Set a -> Bool |
|
cardinality :: Set a -> Int |
|
Operations |
|
union :: (Ord a) => Set a -> Set a -> Set a |
|
unionManySets :: (Ord a) => [Set a] -> Set a |
|
minusSet :: (Ord a) => Set a -> Set a -> Set a |
|
mapSet :: (Ord a) => (b -> a) -> Set b -> Set a |
|
intersect :: (Ord a) => Set a -> Set a -> Set a |
|
addToSet :: (Ord a) => Set a -> a -> Set a |
|
delFromSet :: (Ord a) => Set a -> a -> Set a |
|
Produced by Haddock version 0.3 |