Data.Functor.Graph

description starting at first column

Documentation

class GFunctor f where

Graph indexed functor.

Minimal complete definition

gmap

Associated Types

type Fmap f (i :: p) :: p

The fmap operation (fmap) on the graph index.

Default instance: Fmap f i = i

type Replace f (i :: p) :: p

The Replace operation (<$) on the graph index.

Default instance: Replace f i = Fmap f i

type EfficientReplace f :: Bool

Methods

gmap :: (a -> b) -> f i a -> f (Fmap f i) b

Map a function over over the functor (fmap).

greplace :: a -> f i b -> f (Replace f i) a

Replace all values with a constant (<$).

Default implementation requires the default instance of Replace.

greplace :: Replace f i ~ Fmap f i => a -> f i b -> f (Replace f i) a

Replace all values with a constant (<$).

Default implementation requires the default instance of Replace.

Instances

Functor f => GFunctor * (GWrapped f)

Associated Types

type Fmap (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) :: p

type Replace (GWrapped f) (f :: GWrapped f -> * -> *) (i :: GWrapped f) :: p

type EfficientReplace (GWrapped f) (f :: GWrapped f -> * -> *) :: Bool

Methods

gmap :: (a -> b) -> f i a -> f (Fmap (GWrapped f) f i) b

greplace :: a -> f i b -> f (Replace (GWrapped f) f i) a

IxFunctor * * f => GFunctor (*, *) (WrappedIx f)

Associated Types

type Fmap (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) :: p

type Replace (WrappedIx f) (f :: WrappedIx f -> * -> *) (i :: WrappedIx f) :: p

type EfficientReplace (WrappedIx f) (f :: WrappedIx f -> * -> *) :: Bool

Methods

gmap :: (a -> b) -> f i a -> f (Fmap (WrappedIx f) f i) b

greplace :: a -> f i b -> f (Replace (WrappedIx f) f i) a

class GFunctorReplace f

This should only be implemented when the replace operation has a more efficient greplace than gmap . const.