Data.FullList.Internal

Documentation

newtype FullList a

Constructors

FullList [a]

Instances

Functor FullList

Methods

fmap :: (a -> b) -> FullList a -> FullList b

(<$) :: a -> FullList b -> FullList a

Listable FullList

Methods

(!:) :: a -> FullList a -> FullList a

Eq a => Eq (FullList a)

Methods

(==) :: FullList a -> FullList a -> Bool

(/=) :: FullList a -> FullList a -> Bool

Data a => Data (FullList a)

Methods

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)

Ord a => Ord (FullList a)

Methods

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

Show a => Show (FullList a)

Methods

showsPrec :: Int -> FullList a -> ShowS

show :: FullList a -> String

showList :: [FullList a] -> ShowS

Binary a => Binary (FullList a)

Methods

put :: FullList a -> Put

get :: Get (FullList a)

putList :: [FullList a] -> Put

NFData a => NFData (FullList a)

Methods

rnf :: FullList a -> ()

fromFL :: FullList a -> [a]

indeedFL :: [a] -> w -> (FullList a -> w) -> w

head :: FullList a -> a

tail :: FullList a -> [a]

(++) :: FullList a -> FullList a -> FullList a

sortNub :: (Eq a, Ord a) => FullList a -> FullList a

class Listable l where

Minimal complete definition

(!:)

Methods

(!:) :: a -> l a -> FullList a infixr 5

Instances

Listable []

Methods

(!:) :: a -> [a] -> FullList a

Listable FullList

Methods

(!:) :: a -> FullList a -> FullList a