Safe Haskell	Safe-Inferred
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

Instances details

Bitraversable Of Source #	Since: 0.2.4.0
Instance details Defined in Data.Functor.Of Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Of a b -> f ( Of c d) Source #
Bifoldable Of Source #	Since: 0.2.4.0
Instance details Defined in Data.Functor.Of Methods bifold :: Monoid m => Of m m -> m Source # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Of a b -> m Source # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Of a b -> c Source # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Of a b -> c Source #
Bifunctor Of Source #
Instance details Defined in Data.Functor.Of Methods bimap :: (a -> b) -> (c -> d) -> Of a c -> Of b d Source # first :: (a -> b) -> Of a c -> Of b c Source # second :: (b -> c) -> Of a b -> Of a c Source #
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 Source #
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 Source #
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 Source # liftShowList2 :: ( Int -> a -> ShowS ) -> ([a] -> ShowS ) -> ( Int -> b -> ShowS ) -> ([b] -> ShowS ) -> [ Of a b] -> ShowS Source #
Monoid a => Monad ( Of a) Source #
Instance details Defined in Data.Functor.Of Methods (>>=) :: Of a a0 -> (a0 -> Of a b) -> Of a b Source # (>>) :: Of a a0 -> Of a b -> Of a b Source # return :: a0 -> Of a a0 Source #
Functor ( Of a) Source #
Instance details Defined in Data.Functor.Of Methods fmap :: (a0 -> b) -> Of a a0 -> Of a b Source # (<$) :: a0 -> Of a b -> Of a a0 Source #
Monoid a => Applicative ( Of a) Source #
Instance details Defined in Data.Functor.Of Methods pure :: a0 -> Of a a0 Source # (<>) :: Of a (a0 -> b) -> Of a a0 -> Of a b Source # liftA2 :: (a0 -> b -> c) -> Of a a0 -> Of a b -> Of a c Source # (>) :: Of a a0 -> Of a b -> Of a b Source # (<*) :: Of a a0 -> Of a b -> Of a a0 Source #
Foldable ( Of a) Source #
Instance details Defined in Data.Functor.Of Methods fold :: Monoid m => Of a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Of a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Of a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Of a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Of a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Of a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Of a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Of a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Of a a0 -> a0 Source # toList :: Of a a0 -> [a0] Source # null :: Of a a0 -> Bool Source # length :: Of a a0 -> Int Source # elem :: Eq a0 => a0 -> Of a a0 -> Bool Source # maximum :: Ord a0 => Of a a0 -> a0 Source # minimum :: Ord a0 => Of a a0 -> a0 Source # sum :: Num a0 => Of a a0 -> a0 Source # product :: Num a0 => Of a a0 -> a0 Source #
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) Source # sequenceA :: Applicative f => Of a (f a0) -> f ( Of a a0) Source # mapM :: Monad m => (a0 -> m b) -> Of a a0 -> m ( Of a b) Source # sequence :: Monad m => Of a (m a0) -> m ( Of a a0) Source #
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 Source #
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 Source #
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 Source # liftShowList :: ( Int -> a0 -> ShowS ) -> ([a0] -> ShowS ) -> [ Of a a0] -> ShowS Source #
Generic1 ( Of a :: Type -> Type ) Source #
Instance details Defined in Data.Functor.Of Associated Types type Rep1 ( Of a) :: k -> Type Source # Methods from1 :: forall (a0 :: k). Of a a0 -> Rep1 ( Of a) a0 Source # to1 :: forall (a0 :: k). Rep1 ( Of a) a0 -> Of a a0 Source #
( Eq a, Eq b) => Eq ( Of a b) Source #
Instance details Defined in Data.Functor.Of Methods (==) :: Of a b -> Of a b -> Bool Source # (/=) :: Of a b -> Of a b -> Bool Source #
( 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) Source # gunfold :: ( forall b0 r. Data b0 => c (b0 -> r) -> c r) -> ( forall r. r -> c r) -> Constr -> c ( Of a b) Source # toConstr :: Of a b -> Constr Source # dataTypeOf :: Of a b -> DataType Source # dataCast1 :: Typeable t => ( forall d. Data d => c (t d)) -> Maybe (c ( Of a b)) Source # dataCast2 :: Typeable t => ( forall d e. ( Data d, Data e) => c (t d e)) -> Maybe (c ( Of a b)) Source # gmapT :: ( forall b0. Data b0 => b0 -> b0) -> Of a b -> Of a b Source # gmapQl :: (r -> r' -> r) -> r -> ( forall d. Data d => d -> r') -> Of a b -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> ( forall d. Data d => d -> r') -> Of a b -> r Source # gmapQ :: ( forall d. Data d => d -> u) -> Of a b -> [u] Source # gmapQi :: Int -> ( forall d. Data d => d -> u) -> Of a b -> u Source # gmapM :: Monad m => ( forall d. Data d => d -> m d) -> Of a b -> m ( Of a b) Source # gmapMp :: MonadPlus m => ( forall d. Data d => d -> m d) -> Of a b -> m ( Of a b) Source # gmapMo :: MonadPlus m => ( forall d. Data d => d -> m d) -> Of a b -> m ( Of a b) Source #
( 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 Source # (<) :: Of a b -> Of a b -> Bool Source # (<=) :: Of a b -> Of a b -> Bool Source # (>) :: Of a b -> Of a b -> Bool Source # (>=) :: Of a b -> Of a b -> Bool Source # max :: Of a b -> Of a b -> Of a b Source # min :: Of a b -> Of a b -> Of a b Source #
( Read a, Read b) => Read ( Of a b) Source #
Instance details Defined in Data.Functor.Of Methods readsPrec :: Int -> ReadS ( Of a b) Source # readList :: ReadS [ Of a b] Source # readPrec :: ReadPrec ( Of a b) Source # readListPrec :: ReadPrec [ Of a b] Source #
( Show a, Show b) => Show ( Of a b) Source #
Instance details Defined in Data.Functor.Of Methods showsPrec :: Int -> Of a b -> ShowS Source # show :: Of a b -> String Source # showList :: [ Of a b] -> ShowS Source #
Generic ( Of a b) Source #
Instance details Defined in Data.Functor.Of Associated Types type Rep ( Of a b) :: Type -> Type Source # Methods from :: Of a b -> Rep ( Of a b) x Source # to :: Rep ( Of a b) x -> Of a b Source #
( 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 Source # sconcat :: NonEmpty ( Of a b) -> Of a b Source # stimes :: Integral b0 => b0 -> Of a b -> Of a b Source #
( Monoid a, Monoid b) => Monoid ( Of a b) Source #
Instance details Defined in Data.Functor.Of Methods mempty :: Of a b Source # mappend :: Of a b -> Of a b -> Of a b Source # mconcat :: [ Of a b] -> Of a b Source #
type Rep1 ( Of a :: Type -> Type ) Source #
Instance details Defined in Data.Functor.Of type Rep1 ( Of a :: Type -> Type ) = D1 (' MetaData "Of" "Data.Functor.Of" "streaming-0.2.3.1-3gWNnnaywYgIAjY6UdiTPf" ' 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.3.1-3gWNnnaywYgIAjY6UdiTPf" ' 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)))