Safe Haskell	Safe
Language	Haskell2010

Data.Functor.Of

Synopsis

data Of a b = !a :> b

Documentation

data Of a b Source #

A left-strict pair; the base functor for streams of individual elements.

Constructors

!a :> b infixr 5

Instances

Bifunctor Of Source #
Instance details Defined in Data.Functor.Of Methods bimap :: (a -> b) -> (c -> d) -> Of a c -> Of b d # first :: (a -> b) -> Of a c -> Of b c # second :: (b -> c) -> Of a b -> Of a c #
Eq2 Of Source #
Instance details Defined in Data.Functor.Of Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Of a c -> Of b d -> Bool #
Ord2 Of Source #
Instance details Defined in Data.Functor.Of Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Of a c -> Of b d -> Ordering #
Show2 Of Source #
Instance details Defined in Data.Functor.Of Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> Of a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Of a b] -> ShowS #
Monoid a => Monad (Of a) Source #
Instance details Defined in Data.Functor.Of Methods (>>=) :: Of a a0 -> (a0 -> Of a b) -> Of a b # (>>) :: Of a a0 -> Of a b -> Of a b # return :: a0 -> Of a a0 # fail :: String -> Of a a0 #
Functor (Of a) Source #
Instance details Defined in Data.Functor.Of Methods fmap :: (a0 -> b) -> Of a a0 -> Of a b # (<$) :: a0 -> Of a b -> Of a a0 #
Monoid a => Applicative (Of a) Source #
Instance details Defined in Data.Functor.Of Methods pure :: a0 -> Of a a0 # (<>) :: Of a (a0 -> b) -> Of a a0 -> Of a b # liftA2 :: (a0 -> b -> c) -> Of a a0 -> Of a b -> Of a c # (>) :: Of a a0 -> Of a b -> Of a b # (<*) :: Of a a0 -> Of a b -> Of a a0 #
Foldable (Of a) Source #
Instance details Defined in Data.Functor.Of Methods fold :: Monoid m => Of a m -> m # foldMap :: Monoid m => (a0 -> m) -> Of a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Of a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Of a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Of a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Of a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Of a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Of a a0 -> a0 # toList :: Of a a0 -> [a0] # null :: Of a a0 -> Bool # length :: Of a a0 -> Int # elem :: Eq a0 => a0 -> Of a a0 -> Bool # maximum :: Ord a0 => Of a a0 -> a0 # minimum :: Ord a0 => Of a a0 -> a0 # sum :: Num a0 => Of a a0 -> a0 # product :: Num a0 => Of a a0 -> a0 #
Traversable (Of a) Source #
Instance details Defined in Data.Functor.Of Methods traverse :: Applicative f => (a0 -> f b) -> Of a a0 -> f (Of a b) # sequenceA :: Applicative f => Of a (f a0) -> f (Of a a0) # mapM :: Monad m => (a0 -> m b) -> Of a a0 -> m (Of a b) # sequence :: Monad m => Of a (m a0) -> m (Of a a0) #
Eq a => Eq1 (Of a) Source #
Instance details Defined in Data.Functor.Of Methods liftEq :: (a0 -> b -> Bool) -> Of a a0 -> Of a b -> Bool #
Ord a => Ord1 (Of a) Source #
Instance details Defined in Data.Functor.Of Methods liftCompare :: (a0 -> b -> Ordering) -> Of a a0 -> Of a b -> Ordering #
Show a => Show1 (Of a) Source #
Instance details Defined in Data.Functor.Of Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Of a a0 -> ShowS # liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Of a a0] -> ShowS #
Generic1 (Of a :: * -> *) Source #
Instance details Defined in Data.Functor.Of Associated Types type Rep1 (Of a) :: k -> * # Methods from1 :: Of a a0 -> Rep1 (Of a) a0 # to1 :: Rep1 (Of a) a0 -> Of a a0 #
(Eq a, Eq b) => Eq (Of a b) Source #
Instance details Defined in Data.Functor.Of Methods (==) :: Of a b -> Of a b -> Bool # (/=) :: Of a b -> Of a b -> Bool #
(Data a, Data b) => Data (Of a b) Source #
Instance details Defined in Data.Functor.Of Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Of a b -> c (Of a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Of a b) # toConstr :: Of a b -> Constr # dataTypeOf :: Of a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Of a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Of a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Of a b -> Of a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Of a b -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Of a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Of a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Of a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Of a b -> m (Of a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Of a b -> m (Of a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Of a b -> m (Of a b) #
(Ord a, Ord b) => Ord (Of a b) Source #
Instance details Defined in Data.Functor.Of Methods compare :: Of a b -> Of a b -> Ordering # (<) :: Of a b -> Of a b -> Bool # (<=) :: Of a b -> Of a b -> Bool # (>) :: Of a b -> Of a b -> Bool # (>=) :: Of a b -> Of a b -> Bool # max :: Of a b -> Of a b -> Of a b # min :: Of a b -> Of a b -> Of a b #
(Read a, Read b) => Read (Of a b) Source #
Instance details Defined in Data.Functor.Of Methods readsPrec :: Int -> ReadS (Of a b) # readList :: ReadS [Of a b] # readPrec :: ReadPrec (Of a b) # readListPrec :: ReadPrec [Of a b] #
(Show a, Show b) => Show (Of a b) Source #
Instance details Defined in Data.Functor.Of Methods showsPrec :: Int -> Of a b -> ShowS # show :: Of a b -> String # showList :: [Of a b] -> ShowS #
Generic (Of a b) Source #
Instance details Defined in Data.Functor.Of Associated Types type Rep (Of a b) :: * -> * # Methods from :: Of a b -> Rep (Of a b) x # to :: Rep (Of a b) x -> Of a b #
(Semigroup a, Semigroup b) => Semigroup (Of a b) Source #
Instance details Defined in Data.Functor.Of Methods (<>) :: Of a b -> Of a b -> Of a b # sconcat :: NonEmpty (Of a b) -> Of a b # stimes :: Integral b0 => b0 -> Of a b -> Of a b #
(Monoid a, Monoid b) => Monoid (Of a b) Source #
Instance details Defined in Data.Functor.Of Methods mempty :: Of a b # mappend :: Of a b -> Of a b -> Of a b # mconcat :: [Of a b] -> Of a b #
type Rep1 (Of a :: * -> *) Source #
Instance details Defined in Data.Functor.Of type Rep1 (Of a :: * -> ) = D1 (MetaData "Of" "Data.Functor.Of" "streaming-0.2.2.0-KusZaaLX4INHa0lJM6sdvx" False) (C1 (MetaCons ":>" (InfixI RightAssociative 5) False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a) :: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))
type Rep (Of a b) Source #
Instance details Defined in Data.Functor.Of type Rep (Of a b) = D1 (MetaData "Of" "Data.Functor.Of" "streaming-0.2.2.0-KusZaaLX4INHa0lJM6sdvx" False) (C1 (MetaCons ":>" (InfixI RightAssociative 5) False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b)))