Safe Haskell | None |
---|---|

Language | Haskell2010 |

- newtype SetWith k a = SetWith {}
- (\\) :: Ord k => SetWith k a -> SetWith k a -> SetWith k a
- null :: SetWith k a -> Bool
- size :: SetWith k a -> Int
- member :: Ord k => a -> SetWith k a -> Bool
- notMember :: Ord k => a -> SetWith k a -> Bool
- lookupLT :: Ord k => a -> SetWith k a -> Maybe a
- lookupGT :: Ord k => a -> SetWith k a -> Maybe a
- lookupLE :: Ord k => a -> SetWith k a -> Maybe a
- lookupGE :: Ord k => a -> SetWith k a -> Maybe a
- isSubsetOf :: (Eq a, Ord k) => SetWith k a -> SetWith k a -> Bool
- isProperSubsetOf :: (Eq a, Ord k) => SetWith k a -> SetWith k a -> Bool
- empty :: (a -> k) -> SetWith k a
- singleton :: Ord k => (a -> k) -> a -> SetWith k a
- insert :: Ord k => a -> SetWith k a -> SetWith k a
- delete :: Ord k => a -> SetWith k a -> SetWith k a
- union :: Ord k => SetWith k a -> SetWith k a -> SetWith k a
- unions :: Ord k => (a -> k) -> [SetWith k a] -> SetWith k a
- difference :: Ord k => SetWith k a -> SetWith k a -> SetWith k a
- intersection :: Ord k => SetWith k a -> SetWith k a -> SetWith k a
- filter :: (a -> Bool) -> SetWith k a -> SetWith k a
- partition :: (a -> Bool) -> SetWith k a -> (SetWith k a, SetWith k a)
- split :: Ord k => a -> SetWith k a -> (SetWith k a, SetWith k a)
- splitMember :: Ord k => a -> SetWith k a -> (SetWith k a, Bool, SetWith k a)
- splitRoot :: Ord k => SetWith k a -> [SetWith k a]
- lookupIndex :: Ord k => a -> SetWith k a -> Maybe Int
- findIndex :: Ord k => a -> SetWith k a -> Int
- elemAt :: Int -> SetWith k a -> a
- deleteAt :: Int -> SetWith k a -> SetWith k a
- map :: (a -> b) -> (b -> a) -> SetWith k a -> SetWith k b
- mapMaybe :: (a -> Maybe b) -> (b -> a) -> SetWith k a -> SetWith k b
- foldr :: (a -> b -> b) -> b -> SetWith k a -> b
- foldl :: (b -> a -> b) -> b -> SetWith k a -> b
- foldr' :: (a -> b -> b) -> b -> SetWith k a -> b
- foldl' :: (b -> a -> b) -> b -> SetWith k a -> b
- fold :: (a -> b -> b) -> b -> SetWith k a -> b
- findMin :: SetWith k a -> a
- findMax :: SetWith k a -> a
- deleteMin :: SetWith k a -> SetWith k a
- deleteMax :: SetWith k a -> SetWith k a
- deleteFindMin :: SetWith k a -> (a, SetWith k a)
- deleteFindMax :: SetWith k a -> (a, SetWith k a)
- minView :: SetWith k a -> Maybe (a, SetWith k a)
- maxView :: SetWith k a -> Maybe (a, SetWith k a)
- elems :: SetWith k a -> [a]
- toList :: SetWith k a -> (a -> k, [a])
- fromList :: Ord k => (a -> k) -> [a] -> SetWith k a
- toAscList :: SetWith k a -> [a]
- toDescList :: SetWith k a -> [a]
- fromAscList :: Eq k => (a -> k) -> [a] -> SetWith k a
- fromDistinctAscList :: (a -> k) -> [a] -> SetWith k a
- showTree :: (Show k, Show a) => SetWith k a -> String
- showTreeWith :: (Show k, Show a) => (k -> a -> String) -> Bool -> Bool -> SetWith k a -> String

# Documentation

# Operators

# Query

# Construction

# Combine

# Filter

# Indexed

# Map

# Folds

## Strict Folds

## Legacy Fold

# Min/Max

deleteFindMin :: SetWith k a -> (a, SetWith k a) Source

deleteFindMax :: SetWith k a -> (a, SetWith k a) Source

# Conversion

# Ordered List

toDescList :: SetWith k a -> [a] Source

fromAscList :: Eq k => (a -> k) -> [a] -> SetWith k a Source

fromDistinctAscList :: (a -> k) -> [a] -> SetWith k a Source