Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell98 |
Happy.Tabular.NameSet
Documentation
Instances
Data IntSet | |
Defined in Data.IntSet.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IntSet -> c IntSet gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IntSet dataTypeOf :: IntSet -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IntSet) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IntSet) gmapT :: (forall b. Data b => b -> b) -> IntSet -> IntSet gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IntSet -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IntSet -> r gmapQ :: (forall d. Data d => d -> u) -> IntSet -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> IntSet -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> IntSet -> m IntSet gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IntSet -> m IntSet gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IntSet -> m IntSet | |
Monoid IntSet | |
Semigroup IntSet | |
IsList IntSet | |
Read IntSet | |
Defined in Data.IntSet.Internal | |
Show IntSet | |
NFData IntSet | |
Defined in Data.IntSet.Internal | |
Eq IntSet | |
Ord IntSet | |
Lift IntSet | |
type Item IntSet | |
Defined in Data.IntSet.Internal |
deleteFindMax :: IntSet -> (Key, IntSet) #
deleteFindMin :: IntSet -> (Key, IntSet) #
difference :: IntSet -> IntSet -> IntSet #
dropWhileAntitone :: (Key -> Bool) -> IntSet -> IntSet #
fromAscList :: [Key] -> IntSet #
fromDistinctAscList :: [Key] -> IntSet #
intersection :: IntSet -> IntSet -> IntSet #
isProperSubsetOf :: IntSet -> IntSet -> Bool #
isSubsetOf :: IntSet -> IntSet -> Bool #
showTreeWith :: Bool -> Bool -> IntSet -> String #
takeWhileAntitone :: (Key -> Bool) -> IntSet -> IntSet #
toDescList :: IntSet -> [Key] #