{-# LANGUAGE CPP, TypeFamilies, FlexibleContexts #-}
module Data.Graph.Class.EdgeEnumerable
( EdgeEnumerableGraph(..)
, module Data.Graph.Class
) where
import qualified Control.Monad.Trans.State.Strict as Strict
import qualified Control.Monad.Trans.State.Lazy as Lazy
import qualified Control.Monad.Trans.Writer.Strict as Strict
import qualified Control.Monad.Trans.Writer.Lazy as Lazy
import qualified Control.Monad.Trans.RWS.Strict as Strict
import qualified Control.Monad.Trans.RWS.Lazy as Lazy
import Control.Monad.Trans.Reader
import Control.Monad.Trans.Identity
import Control.Monad.Trans.Maybe
#if !(MIN_VERSION_transformers(0,6,0))
import Control.Monad.Trans.Error
#endif
import Control.Monad.Trans.Class
import Data.Functor.Identity
#if __GLASGOW_HASKELL__ < 710
import Data.Monoid
#endif
import Data.Graph.Class
class Graph g => EdgeEnumerableGraph g where
edges :: g [Edge g]
instance EdgeEnumerableGraph g => EdgeEnumerableGraph (Strict.StateT s g) where
edges :: StateT s g [Edge (StateT s g)]
edges = g [Edge g] -> StateT s g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
instance EdgeEnumerableGraph g => EdgeEnumerableGraph (Lazy.StateT s g) where
edges :: StateT s g [Edge (StateT s g)]
edges = g [Edge g] -> StateT s g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
instance (EdgeEnumerableGraph g, Monoid m) => EdgeEnumerableGraph (Strict.WriterT m g) where
edges :: WriterT m g [Edge (WriterT m g)]
edges = g [Edge g] -> WriterT m g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
instance (EdgeEnumerableGraph g, Monoid m) => EdgeEnumerableGraph (Lazy.WriterT m g) where
edges :: WriterT m g [Edge (WriterT m g)]
edges = g [Edge g] -> WriterT m g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
instance (EdgeEnumerableGraph g, Monoid m) => EdgeEnumerableGraph (Strict.RWST r m s g) where
edges :: RWST r m s g [Edge (RWST r m s g)]
edges = g [Edge g] -> RWST r m s g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
instance (EdgeEnumerableGraph g, Monoid m) => EdgeEnumerableGraph (Lazy.RWST r m s g) where
edges :: RWST r m s g [Edge (RWST r m s g)]
edges = g [Edge g] -> RWST r m s g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
instance EdgeEnumerableGraph g => EdgeEnumerableGraph (MaybeT g) where
edges :: MaybeT g [Edge (MaybeT g)]
edges = g [Edge g] -> MaybeT g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
instance EdgeEnumerableGraph g => EdgeEnumerableGraph (IdentityT g) where
edges :: IdentityT g [Edge (IdentityT g)]
edges = g [Edge g] -> IdentityT g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
#if !(MIN_VERSION_transformers(0,6,0))
instance (EdgeEnumerableGraph g, Error e) => EdgeEnumerableGraph (ErrorT e g) where
edges :: ErrorT e g [Edge (ErrorT e g)]
edges = g [Edge g] -> ErrorT e g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
#endif
instance EdgeEnumerableGraph g => EdgeEnumerableGraph (ReaderT e g) where
edges :: ReaderT e g [Edge (ReaderT e g)]
edges = g [Edge g] -> ReaderT e g [Edge g]
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift g [Edge g]
forall (g :: * -> *). EdgeEnumerableGraph g => g [Edge g]
edges
instance EdgeEnumerableGraph Identity where
edges :: Identity [Edge Identity]
edges = [Void] -> Identity [Void]
forall a. a -> Identity a
Identity []