GenI-0.25.0.1: A natural language generator (specifically, an FB-LTAG surface realiser)
Data.FullList
data FullList a Source #
Instances
Methods
fmap :: (a -> b) -> FullList a -> FullList b #
(<$) :: a -> FullList b -> FullList a #
(!:) :: a -> FullList a -> FullList a Source #
(==) :: FullList a -> FullList a -> Bool #
(/=) :: FullList a -> FullList a -> Bool #
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FullList a -> c (FullList a) #
gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (FullList a) #
toConstr :: FullList a -> Constr #
dataTypeOf :: FullList a -> DataType #
dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (FullList a)) #
dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (FullList a)) #
gmapT :: (forall b. Data b => b -> b) -> FullList a -> FullList a #
gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FullList a -> r #
gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FullList a -> r #
gmapQ :: (forall d. Data d => d -> u) -> FullList a -> [u] #
gmapQi :: Int -> (forall d. Data d => d -> u) -> FullList a -> u #
gmapM :: Monad m => (forall d. Data d => d -> m d) -> FullList a -> m (FullList a) #
gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FullList a -> m (FullList a) #
gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FullList a -> m (FullList a) #
compare :: FullList a -> FullList a -> Ordering #
(<) :: FullList a -> FullList a -> Bool #
(<=) :: FullList a -> FullList a -> Bool #
(>) :: FullList a -> FullList a -> Bool #
(>=) :: FullList a -> FullList a -> Bool #
max :: FullList a -> FullList a -> FullList a #
min :: FullList a -> FullList a -> FullList a #
showsPrec :: Int -> FullList a -> ShowS #
show :: FullList a -> String #
showList :: [FullList a] -> ShowS #
put :: FullList a -> Put #
get :: Get (FullList a) #
putList :: [FullList a] -> Put #
rnf :: FullList a -> () #
fromFL :: FullList a -> [a] Source #
indeedFL :: [a] -> w -> (FullList a -> w) -> w Source #
head :: FullList a -> a Source #
tail :: FullList a -> [a] Source #
(++) :: FullList a -> FullList a -> FullList a Source #
sortNub :: (Eq a, Ord a) => FullList a -> FullList a Source #
class Listable l where Source #
Minimal complete definition
(!:)
(!:) :: a -> l a -> FullList a infixr 5 Source #
(!:) :: a -> [a] -> FullList a Source #