Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
newtype IntLikeSet x Source #
Instances
empty :: IntLikeSet x Source #
size :: IntLikeSet x -> Int Source #
null :: IntLikeSet x -> Bool Source #
insert :: Coercible x Int => x -> IntLikeSet x -> IntLikeSet x Source #
delete :: Coercible x Int => x -> IntLikeSet x -> IntLikeSet x Source #
isSubsetOf :: IntLikeSet x -> IntLikeSet x -> Bool Source #
intersection :: IntLikeSet x -> IntLikeSet x -> IntLikeSet x Source #
difference :: IntLikeSet x -> IntLikeSet x -> IntLikeSet x Source #
union :: IntLikeSet x -> IntLikeSet x -> IntLikeSet x Source #
unions :: Foldable f => f (IntLikeSet x) -> IntLikeSet x Source #
minView :: Coercible x Int => IntLikeSet x -> Maybe (x, IntLikeSet x) Source #
disjoint :: IntLikeSet x -> IntLikeSet x -> Bool Source #
map :: (Coercible x Int, Coercible y Int) => (x -> y) -> IntLikeSet x -> IntLikeSet y Source #
filter :: Coercible x Int => (x -> Bool) -> IntLikeSet x -> IntLikeSet x Source #
insertState :: Coercible x Int => (Bool -> b) -> x -> IntLikeSet x -> (b, IntLikeSet x) Source #
orderedPairs :: Coercible x Int => IntLikeSet x -> [(x, x)] Source #
unorderedPairs :: Coercible x Int => IntLikeSet x -> [(x, x)] Source #