Data.Traversable.Constrained

Documentation

class (CFunctor f, CFoldable f) => CTraversable f where

Like Traversable but allows elements to have constraints on them. Laws are the same:

ctraverse pure == pure
ctraverse (f <=< g) == ctraverse f <=< ctraverse g

NB There's no aplicative version because Vectors from the http://hackage.haskell.org/package/vector package only support monadic traversals. Since they're one of the main motivation for this package, Applicative version of traversals will not exist.

Minimal complete definition

Nothing

Methods

ctraverse :: (Constraints f a, Constraints f b, Monad m) => (a -> m b) -> f a -> m (f b)

csequence :: (Constraints f a, Constraints f (m a), Monad m) => f (m a) -> m (f a)

ctraverse :: (Constraints f a, Constraints f b, Monad m, Traversable f) => (a -> m b) -> f a -> m (f b)

Instances

CTraversable []

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints [] a, Constraints [] b, Monad m) => (a -> m b) -> [a] -> m [b]

csequence :: (Constraints [] a, Constraints [] (m a), Monad m) => [m a] -> m [a]

CTraversable Maybe

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints Maybe a, Constraints Maybe b, Monad m) => (a -> m b) -> Maybe a -> m (Maybe b)

csequence :: (Constraints Maybe a, Constraints Maybe (m a), Monad m) => Maybe (m a) -> m (Maybe a)

CTraversable Min

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints Min a, Constraints Min b, Monad m) => (a -> m b) -> Min a -> m (Min b)

csequence :: (Constraints Min a, Constraints Min (m a), Monad m) => Min (m a) -> m (Min a)

CTraversable Max

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints Max a, Constraints Max b, Monad m) => (a -> m b) -> Max a -> m (Max b)

csequence :: (Constraints Max a, Constraints Max (m a), Monad m) => Max (m a) -> m (Max a)

CTraversable First

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints First a, Constraints First b, Monad m) => (a -> m b) -> First a -> m (First b)

csequence :: (Constraints First a, Constraints First (m a), Monad m) => First (m a) -> m (First a)

CTraversable Last

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints Last a, Constraints Last b, Monad m) => (a -> m b) -> Last a -> m (Last b)

csequence :: (Constraints Last a, Constraints Last (m a), Monad m) => Last (m a) -> m (Last a)

CTraversable ZipList

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints ZipList a, Constraints ZipList b, Monad m) => (a -> m b) -> ZipList a -> m (ZipList b)

csequence :: (Constraints ZipList a, Constraints ZipList (m a), Monad m) => ZipList (m a) -> m (ZipList a)

CTraversable Identity

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints Identity a, Constraints Identity b, Monad m) => (a -> m b) -> Identity a -> m (Identity b)

csequence :: (Constraints Identity a, Constraints Identity (m a), Monad m) => Identity (m a) -> m (Identity a)

CTraversable Dual

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints Dual a, Constraints Dual b, Monad m) => (a -> m b) -> Dual a -> m (Dual b)

csequence :: (Constraints Dual a, Constraints Dual (m a), Monad m) => Dual (m a) -> m (Dual a)

CTraversable Sum

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints Sum a, Constraints Sum b, Monad m) => (a -> m b) -> Sum a -> m (Sum b)

csequence :: (Constraints Sum a, Constraints Sum (m a), Monad m) => Sum (m a) -> m (Sum a)

CTraversable Product

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints Product a, Constraints Product b, Monad m) => (a -> m b) -> Product a -> m (Product b)

csequence :: (Constraints Product a, Constraints Product (m a), Monad m) => Product (m a) -> m (Product a)

CTraversable NonEmpty

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints NonEmpty a, Constraints NonEmpty b, Monad m) => (a -> m b) -> NonEmpty a -> m (NonEmpty b)

csequence :: (Constraints NonEmpty a, Constraints NonEmpty (m a), Monad m) => NonEmpty (m a) -> m (NonEmpty a)

CTraversable (Either a)

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints (Either a) a0, Constraints (Either a) b, Monad m) => (a0 -> m b) -> Either a a0 -> m (Either a b)

csequence :: (Constraints (Either a) a0, Constraints (Either a) (m a0), Monad m) => Either a (m a0) -> m (Either a a0)

CTraversable ((,) a)

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints ((,) a) a0, Constraints ((,) a) b, Monad m) => (a0 -> m b) -> (a, a0) -> m (a, b)

csequence :: (Constraints ((,) a) a0, Constraints ((,) a) (m a0), Monad m) => (a, m a0) -> m (a, a0)

CTraversable (Const a :: Type -> Type)

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints (Const a) a0, Constraints (Const a) b, Monad m) => (a0 -> m b) -> Const a a0 -> m (Const a b)

csequence :: (Constraints (Const a) a0, Constraints (Const a) (m a0), Monad m) => Const a (m a0) -> m (Const a a0)

CTraversable f => CTraversable (Ap f)

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints (Ap f) a, Constraints (Ap f) b, Monad m) => (a -> m b) -> Ap f a -> m (Ap f b)

csequence :: (Constraints (Ap f) a, Constraints (Ap f) (m a), Monad m) => Ap f (m a) -> m (Ap f a)

CTraversable f => CTraversable (Alt f)

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints (Alt f) a, Constraints (Alt f) b, Monad m) => (a -> m b) -> Alt f a -> m (Alt f b)

csequence :: (Constraints (Alt f) a, Constraints (Alt f) (m a), Monad m) => Alt f (m a) -> m (Alt f a)

(CTraversable f, CTraversable g) => CTraversable (Product f g)

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints (Product f g) a, Constraints (Product f g) b, Monad m) => (a -> m b) -> Product f g a -> m (Product f g b)

csequence :: (Constraints (Product f g) a, Constraints (Product f g) (m a), Monad m) => Product f g (m a) -> m (Product f g a)

(CTraversable f, CTraversable g) => CTraversable (Sum f g)

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints (Sum f g) a, Constraints (Sum f g) b, Monad m) => (a -> m b) -> Sum f g a -> m (Sum f g b)

csequence :: (Constraints (Sum f g) a, Constraints (Sum f g) (m a), Monad m) => Sum f g (m a) -> m (Sum f g a)

(CTraversable f, CTraversable g) => CTraversable (Compose f g)

Defined in Data.Traversable.Constrained

Methods

ctraverse :: (Constraints (Compose f g) a, Constraints (Compose f g) b, Monad m) => (a -> m b) -> Compose f g a -> m (Compose f g b)

csequence :: (Constraints (Compose f g) a, Constraints (Compose f g) (m a), Monad m) => Compose f g (m a) -> m (Compose f g a)

cfor :: (CTraversable f, Constraints f a, Constraints f b, Monad m) => f a -> (a -> m b) -> m (f b)

ctraverse with araguments flipped.

class Constrained (f :: k2 -> k1)

Specification of constrains that a functor might impose on its elements. For example, sets typically require that their elements are ordered and unboxed vectors require elements to have an instance of special class that allows them to be packed in memory.

NB The Constraints type family is associated with a typeclass in order to improve type inference. Whenever a typeclass constraint will be present, instance is guaranteed to exist and typechecker is going to take advantage of that.

Associated Types

type Constraints (f :: k2 -> k1) :: k2 -> Constraint

Instances

Constrained f => Constrained (Alt f :: k2 -> Type)

Defined in Data.Constrained

Associated Types

type Constraints (Alt f) :: k2 -> Constraint

Constrained f => Constrained (Ap f :: k2 -> Type)

Defined in Data.Constrained

Associated Types

type Constraints (Ap f) :: k2 -> Constraint

Constrained (Const a :: k2 -> Type)

Defined in Data.Constrained

Associated Types

type Constraints (Const a) :: k2 -> Constraint

(Constrained f, Constrained g) => Constrained (Sum f g :: k2 -> Type)

Defined in Data.Constrained

Associated Types

type Constraints (Sum f g) :: k2 -> Constraint

(Constrained f, Constrained g) => Constrained (Product f g :: k2 -> Type)

Defined in Data.Constrained

Associated Types

type Constraints (Product f g) :: k2 -> Constraint

(Constrained f, Constrained g) => Constrained (Compose f g :: k2 -> Type)

Defined in Data.Constrained

Associated Types

type Constraints (Compose f g) :: k2 -> Constraint

Constrained []

Defined in Data.Constrained

Associated Types

type Constraints [] :: k2 -> Constraint

Constrained Maybe

Defined in Data.Constrained

Associated Types

type Constraints Maybe :: k2 -> Constraint

Constrained Min

Defined in Data.Constrained

Associated Types

type Constraints Min :: k2 -> Constraint

Constrained Max

Defined in Data.Constrained

Associated Types

type Constraints Max :: k2 -> Constraint

Constrained First

Defined in Data.Constrained

Associated Types

type Constraints First :: k2 -> Constraint

Constrained Last

Defined in Data.Constrained

Associated Types

type Constraints Last :: k2 -> Constraint

Constrained ZipList

Defined in Data.Constrained

Associated Types

type Constraints ZipList :: k2 -> Constraint

Constrained Identity

Defined in Data.Constrained

Associated Types

type Constraints Identity :: k2 -> Constraint

Constrained Dual

Defined in Data.Constrained

Associated Types

type Constraints Dual :: k2 -> Constraint

Constrained Sum

Defined in Data.Constrained

Associated Types

type Constraints Sum :: k2 -> Constraint

Constrained Product

Defined in Data.Constrained

Associated Types

type Constraints Product :: k2 -> Constraint

Constrained NonEmpty

Defined in Data.Constrained

Associated Types

type Constraints NonEmpty :: k2 -> Constraint

Constrained (Either a :: Type -> Type)

Defined in Data.Constrained

Associated Types

type Constraints (Either a) :: k2 -> Constraint

Constrained ((,) a :: Type -> Type)

Defined in Data.Constrained

Associated Types

type Constraints ((,) a) :: k2 -> Constraint