mad-props-0.2.1.0: Monadic DSL for building constraint solvers using basic propagators.

Safe HaskellNone
LanguageHaskell2010

Props.Internal.Graph

Documentation

data Graph Source #

Instances
Show Graph Source # 
Instance details

Defined in Props.Internal.Graph

Methods

showsPrec :: Int -> Graph -> ShowS #

show :: Graph -> String #

showList :: [Graph] -> ShowS #

imAsList :: Iso' (IntMap v) [(Vertex', v)] Source #

newtype Vertex Source #

Constructors

Vertex Int 
Instances
Eq Vertex Source # 
Instance details

Defined in Props.Internal.Graph

Methods

(==) :: Vertex -> Vertex -> Bool #

(/=) :: Vertex -> Vertex -> Bool #

Ord Vertex Source # 
Instance details

Defined in Props.Internal.Graph

Show Vertex Source # 
Instance details

Defined in Props.Internal.Graph

data Quantum Source #

Constructors

(Show (SuperPos f a), Typeable f, Typeable a, Foldable f) => Quantum 

Fields

Instances
Show Quantum Source # 
Instance details

Defined in Props.Internal.Graph

data SuperPos f a where Source #

Constructors

Observed :: Foldable f => a -> SuperPos f a 
Unknown :: Foldable f => f a -> SuperPos f a 
Instances
Show (SuperPos f a) Source # 
Instance details

Defined in Props.Internal.Graph

Methods

showsPrec :: Int -> SuperPos f a -> ShowS #

show :: SuperPos f a -> String #

showList :: [SuperPos f a] -> ShowS #

_Unknown :: Foldable f => Prism' (SuperPos f a) (f a) Source #

forceDyn :: forall a. Typeable a => Dynamic -> a Source #