Data.Parameterized.TraversableFC

This module declares classes for working with structures that accept a parametric type parameter followed by some fixed kind.

Documentation

class TestEqualityFC (t :: (k -> *) -> l -> *) where

A parameterized class for types which can be tested for parameterized equality, when given an equality test for subterms.

Minimal complete definition

testEqualityFC

Methods

testEqualityFC :: forall f. (forall x y. f x -> f y -> Maybe (x :~: y)) -> forall x y. t f x -> t f y -> Maybe (x :~: y)

Instances

TestEqualityFC k (Ctx k) (Assignment k)

Methods

testEqualityFC :: (forall (x :: Assignment k) (y :: Assignment k). f x -> f y -> Maybe ((Assignment k :~: x) y)) -> forall (x :: l) (y :: l). t f x -> t f y -> Maybe ((l :~: x) y)

TestEqualityFC k (Ctx k) (Assignment k)

Methods

testEqualityFC :: (forall (x :: Assignment k) (y :: Assignment k). f x -> f y -> Maybe ((Assignment k :~: x) y)) -> forall (x :: l) (y :: l). t f x -> t f y -> Maybe ((l :~: x) y)

class TestEqualityFC t => OrdFC (t :: (k -> *) -> l -> *) where

A parameterized class for types which can be tested for parameterized ordering, when given an comparison test for subterms.

Minimal complete definition

compareFC

Methods

compareFC :: forall f. (forall x y. f x -> f y -> OrderingF x y) -> forall x y. t f x -> t f y -> OrderingF x y

Instances

OrdFC k (Ctx k) (Assignment k)

Methods

compareFC :: (forall (x :: Assignment k) (y :: Assignment k). f x -> f y -> OrderingF (Assignment k) x y) -> forall (x :: l) (y :: l). t f x -> t f y -> OrderingF l x y

OrdFC k (Ctx k) (Assignment k)

Methods

compareFC :: (forall (x :: Assignment k) (y :: Assignment k). f x -> f y -> OrderingF (Assignment k) x y) -> forall (x :: l) (y :: l). t f x -> t f y -> OrderingF l x y

class ShowFC (t :: (k -> *) -> l -> *) where

A parameterized class for types which can be shown, when given functions to show parameterized subterms.

Minimal complete definition

showFC | showsPrecFC

Methods

showFC :: forall f. (forall x. f x -> String) -> forall x. t f x -> String

showsPrecFC :: forall f. (forall x. Int -> f x -> ShowS) -> forall x. Int -> t f x -> ShowS

class HashableFC (t :: (k -> *) -> l -> *) where

A parameterized class for types which can be hashed, when given functions to hash parameterized subterms.

Minimal complete definition

hashWithSaltFC

Methods

hashWithSaltFC :: forall f. (forall x. Int -> f x -> Int) -> forall x. Int -> t f x -> Int

class FunctorFC m where

A parameterized type that is a function on all instances.

Minimal complete definition

fmapFC

Methods

fmapFC :: forall f g. (forall x. f x -> g x) -> forall x. m f x -> m g x

Instances

FunctorFC k [k] (List k)

Methods

fmapFC :: (forall (x :: List k). f x -> g x) -> forall (x :: k). m f x -> m g x

FunctorFC k (Ctx k) (Assignment k)

Methods

fmapFC :: (forall (x :: Assignment k). f x -> g x) -> forall (x :: k). m f x -> m g x

FunctorFC k (Ctx k) (Assignment k)

Methods

fmapFC :: (forall (x :: Assignment k). f x -> g x) -> forall (x :: k). m f x -> m g x

class FoldableFC (t :: (k -> *) -> l -> *) where

This is a generalization of the Foldable class to structures over parameterized terms.

Minimal complete definition

foldMapFC | foldrFC

Methods

foldMapFC :: Monoid m => (forall s. e s -> m) -> t e c -> m

Map each element of the structure to a monoid, and combine the results.

foldrFC :: (forall s. e s -> b -> b) -> b -> t e c -> b

Right-associative fold of a structure.

foldlFC :: (forall s. b -> e s -> b) -> b -> t e c -> b

Left-associative fold of a structure.

foldrFC' :: (forall s. e s -> b -> b) -> b -> t e c -> b

Right-associative fold of a structure, but with strict application of the operator.

foldlFC' :: (forall s. b -> e s -> b) -> b -> t e c -> b

Left-associative fold of a parameterized structure with a strict accumulator.

toListFC :: (forall tp. f tp -> a) -> t f c -> [a]

Convert structure to list.

Instances

FoldableFC k [k] (List k)

Methods

foldMapFC :: Monoid m => (forall (s :: List k). e s -> m) -> t e c -> m

foldrFC :: (forall (s :: List k). e s -> b -> b) -> b -> t e c -> b

foldlFC :: (forall (s :: List k). b -> e s -> b) -> b -> t e c -> b

foldrFC' :: (forall (s :: List k). e s -> b -> b) -> b -> t e c -> b

foldlFC' :: (forall (s :: List k). b -> e s -> b) -> b -> t e c -> b

toListFC :: (forall (tp :: List k). f tp -> a) -> t f c -> [a]

FoldableFC k (Ctx k) (Assignment k)

Methods

foldMapFC :: Monoid m => (forall (s :: Assignment k). e s -> m) -> t e c -> m

foldrFC :: (forall (s :: Assignment k). e s -> b -> b) -> b -> t e c -> b

foldlFC :: (forall (s :: Assignment k). b -> e s -> b) -> b -> t e c -> b

foldrFC' :: (forall (s :: Assignment k). e s -> b -> b) -> b -> t e c -> b

foldlFC' :: (forall (s :: Assignment k). b -> e s -> b) -> b -> t e c -> b

toListFC :: (forall (tp :: Assignment k). f tp -> a) -> t f c -> [a]

FoldableFC k (Ctx k) (Assignment k)

Methods

foldMapFC :: Monoid m => (forall (s :: Assignment k). e s -> m) -> t e c -> m

foldrFC :: (forall (s :: Assignment k). e s -> b -> b) -> b -> t e c -> b

foldlFC :: (forall (s :: Assignment k). b -> e s -> b) -> b -> t e c -> b

foldrFC' :: (forall (s :: Assignment k). e s -> b -> b) -> b -> t e c -> b

foldlFC' :: (forall (s :: Assignment k). b -> e s -> b) -> b -> t e c -> b

toListFC :: (forall (tp :: Assignment k). f tp -> a) -> t f c -> [a]

class (FunctorFC t, FoldableFC t) => TraversableFC t where

Minimal complete definition

traverseFC

Methods

traverseFC :: Applicative m => (forall s. e s -> m (f s)) -> t e c -> m (t f c)

Instances

TraversableFC k [k] (List k)

Methods

traverseFC :: Applicative m => (forall (s :: List k). e s -> m (f s)) -> t e c -> m (t f c)

TraversableFC k (Ctx k) (Assignment k)

Methods

traverseFC :: Applicative m => (forall (s :: Assignment k). e s -> m (f s)) -> t e c -> m (t f c)

TraversableFC k (Ctx k) (Assignment k)

Methods

traverseFC :: Applicative m => (forall (s :: Assignment k). e s -> m (f s)) -> t e c -> m (t f c)

traverseFC_ :: (FoldableFC t, Applicative f) => (forall s. e s -> f ()) -> t e c -> f ()

Map each element of a structure to an action, evaluate these actions from left to right, and ignore the results.

forMFC_ :: (FoldableFC t, Applicative f) => t e c -> (forall s. e s -> f ()) -> f ()

Map each element of a structure to an action, evaluate these actions from left to right, and ignore the results.

fmapFCDefault :: TraversableFC t => (forall s. e s -> f s) -> t e c -> t f c

This function may be used as a value for fmapF in a FunctorF instance.

foldMapFCDefault :: (TraversableFC t, Monoid m) => (forall s. e s -> m) -> t e c -> m

This function may be used as a value for foldMap in a Foldable instance.

allFC :: FoldableFC t => (forall tp. f tp -> Bool) -> t f c -> Bool

Return True if all values satisfy predicate.

anyFC :: FoldableFC t => (forall tp. f tp -> Bool) -> t f c -> Bool

Return True if any values satisfy predicate.

lengthFC :: FoldableFC t => t e c -> Int

Return number of elements in list.