happy-lib-2.0.2: Happy is a parser generator for Haskell implemented using this library
Safe HaskellSafe-Inferred
LanguageHaskell98

Happy.Tabular.NameSet

Documentation

elems :: IntSet -> [Key] #

data IntSet #

Instances

Instances details
Data IntSet 
Instance details

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

toConstr :: IntSet -> Constr

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 
Instance details

Defined in Data.IntSet.Internal

Semigroup IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

(<>) :: IntSet -> IntSet -> IntSet

sconcat :: NonEmpty IntSet -> IntSet

stimes :: Integral b => b -> IntSet -> IntSet

IsList IntSet 
Instance details

Defined in Data.IntSet.Internal

Associated Types

type Item IntSet 
Instance details

Defined in Data.IntSet.Internal

type Item IntSet = Key

Methods

fromList :: [Item IntSet] -> IntSet

fromListN :: Int -> [Item IntSet] -> IntSet

toList :: IntSet -> [Item IntSet]

Read IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

readsPrec :: Int -> ReadS IntSet

readList :: ReadS [IntSet]

readPrec :: ReadPrec IntSet

readListPrec :: ReadPrec [IntSet]

Show IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

showsPrec :: Int -> IntSet -> ShowS

show :: IntSet -> String

showList :: [IntSet] -> ShowS

NFData IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

rnf :: IntSet -> ()

Eq IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

(==) :: IntSet -> IntSet -> Bool

(/=) :: IntSet -> IntSet -> Bool

Ord IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

compare :: IntSet -> IntSet -> Ordering

(<) :: IntSet -> IntSet -> Bool

(<=) :: IntSet -> IntSet -> Bool

(>) :: IntSet -> IntSet -> Bool

(>=) :: IntSet -> IntSet -> Bool

max :: IntSet -> IntSet -> IntSet

min :: IntSet -> IntSet -> IntSet

Lift IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

lift :: Quote m => IntSet -> m Exp

liftTyped :: forall (m :: Type -> Type). Quote m => IntSet -> Code m IntSet

type Item IntSet 
Instance details

Defined in Data.IntSet.Internal

type Item IntSet = Key

foldl' :: (a -> Key -> a) -> a -> IntSet -> a #

foldl :: (a -> Key -> a) -> a -> IntSet -> a #

foldr :: (Key -> b -> b) -> b -> IntSet -> b #

null :: IntSet -> Bool #

map :: (Key -> Key) -> IntSet -> IntSet #

filter :: (Key -> Bool) -> IntSet -> IntSet #

type Key = Int #

alterF :: Functor f => (Bool -> f Bool) -> Key -> IntSet -> f IntSet #

disjoint :: IntSet -> IntSet -> Bool #

dropWhileAntitone :: (Key -> Bool) -> IntSet -> IntSet #

fold :: (Key -> b -> b) -> b -> IntSet -> b #

foldr' :: (Key -> b -> b) -> b -> IntSet -> b #

isSubsetOf :: IntSet -> IntSet -> Bool #

lookupGE :: Key -> IntSet -> Maybe Key #

lookupGT :: Key -> IntSet -> Maybe Key #

lookupLE :: Key -> IntSet -> Maybe Key #

lookupLT :: Key -> IntSet -> Maybe Key #

maxView :: IntSet -> Maybe (Key, IntSet) #

member :: Key -> IntSet -> Bool #

minView :: IntSet -> Maybe (Key, IntSet) #

notMember :: Key -> IntSet -> Bool #

partition :: (Key -> Bool) -> IntSet -> (IntSet, IntSet) #

showTree :: IntSet -> String #

showTreeWith :: Bool -> Bool -> IntSet -> String #

size :: IntSet -> Int #

spanAntitone :: (Key -> Bool) -> IntSet -> (IntSet, IntSet) #

splitMember :: Key -> IntSet -> (IntSet, Bool, IntSet) #

takeWhileAntitone :: (Key -> Bool) -> IntSet -> IntSet #

toList :: IntSet -> [Key] #

unions :: Foldable f => f IntSet -> IntSet #