Copyright | (C) 2012-2016 Edward Kmett |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Stability | experimental |
Portability | non-portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Synopsis
- data Magma i t b a where
- runMagma :: Magma i t a a -> t
- newtype Molten i a b t = Molten {}
- data Mafic a b t = Mafic Int (Int -> Magma Int t b a)
- runMafic :: Mafic a b t -> Magma Int t b a
- data TakingWhile (p :: Type -> Type -> Type) (g :: Type -> Type) a b t = TakingWhile Bool t (Bool -> Magma () t b (Corep p a))
- runTakingWhile :: forall (p :: Type -> Type -> Type) (f :: Type -> Type) a b t. TakingWhile p f a b t -> Magma () t b (Corep p a)
Magma
data Magma i t b a where Source #
This provides a way to peek at the internal structure of a
Traversal
or IndexedTraversal
MagmaAp :: forall i x t b a. Magma i (x -> t) b a -> Magma i x b a -> Magma i t b a | |
MagmaPure :: forall t i b a. t -> Magma i t b a | |
MagmaFmap :: forall x t i b a. (x -> t) -> Magma i x b a -> Magma i t b a | |
Magma :: forall i a t. i -> a -> Magma i t t a |
Instances
FoldableWithIndex i (Magma i t b) Source # | |
Defined in Control.Lens.Internal.Magma ifoldMap :: Monoid m => (i -> a -> m) -> Magma i t b a -> m # ifoldMap' :: Monoid m => (i -> a -> m) -> Magma i t b a -> m # ifoldr :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # ifoldl :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # ifoldr' :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # ifoldl' :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # | |
FunctorWithIndex i (Magma i t b) Source # | |
Defined in Control.Lens.Internal.Magma | |
TraversableWithIndex i (Magma i t b) Source # | |
Defined in Control.Lens.Internal.Magma itraverse :: Applicative f => (i -> a -> f b0) -> Magma i t b a -> f (Magma i t b b0) # | |
Foldable (Magma i t b) Source # | |
Defined in Control.Lens.Internal.Magma fold :: Monoid m => Magma i t b m -> m # foldMap :: Monoid m => (a -> m) -> Magma i t b a -> m # foldMap' :: Monoid m => (a -> m) -> Magma i t b a -> m # foldr :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # foldr' :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # foldl :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # foldl' :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # foldr1 :: (a -> a -> a) -> Magma i t b a -> a # foldl1 :: (a -> a -> a) -> Magma i t b a -> a # toList :: Magma i t b a -> [a] # null :: Magma i t b a -> Bool # length :: Magma i t b a -> Int # elem :: Eq a => a -> Magma i t b a -> Bool # maximum :: Ord a => Magma i t b a -> a # minimum :: Ord a => Magma i t b a -> a # | |
Traversable (Magma i t b) Source # | |
Defined in Control.Lens.Internal.Magma | |
Functor (Magma i t b) Source # | |
(Show i, Show a) => Show (Magma i t b a) Source # | |
runMagma :: Magma i t a a -> t Source #
Run a Magma
where all the individual leaves have been converted to the
expected type
Molten
newtype Molten i a b t Source #
This is a a non-reassociating initially encoded version of Bazaar
.
Instances
IndexedComonad (Molten i) Source # | |
IndexedFunctor (Molten i) Source # | |
Bizarre (Indexed i) (Molten i) Source # | |
Defined in Control.Lens.Internal.Magma | |
Sellable (Indexed i) (Molten i) Source # | |
Applicative (Molten i a b) Source # | |
Defined in Control.Lens.Internal.Magma pure :: a0 -> Molten i a b a0 # (<*>) :: Molten i a b (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 # liftA2 :: (a0 -> b0 -> c) -> Molten i a b a0 -> Molten i a b b0 -> Molten i a b c # (*>) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b b0 # (<*) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b a0 # | |
Functor (Molten i a b) Source # | |
a ~ b => Comonad (Molten i a b) Source # | |
Apply (Molten i a b) Source # | |
Defined in Control.Lens.Internal.Magma |
Mafic
This is used to generate an indexed magma from an unindexed source
By constructing it this way we avoid infinite reassociations in sums where possible.
Instances
IndexedFunctor Mafic Source # | |
Bizarre (Indexed Int) Mafic Source # | |
Defined in Control.Lens.Internal.Magma | |
Applicative (Mafic a b) Source # | |
Defined in Control.Lens.Internal.Magma | |
Functor (Mafic a b) Source # | |
Apply (Mafic a b) Source # | |
Sellable (->) Mafic Source # | |
Defined in Control.Lens.Internal.Magma |
TakingWhile
data TakingWhile (p :: Type -> Type -> Type) (g :: Type -> Type) a b t Source #
This is used to generate an indexed magma from an unindexed source
By constructing it this way we avoid infinite reassociations where possible.
In
, TakingWhile
p g a b tg
has a nominal
role to avoid exposing an illegal _|_ via Contravariant
,
while the remaining arguments are degraded to a nominal
role by the invariants of Magma
TakingWhile Bool t (Bool -> Magma () t b (Corep p a)) |