mad-props-0.2.1.0: Monadic DSL for building constraint solvers using basic propagators.
Props.Internal.Graph
data Graph Source #
Defined in Props.Internal.Graph
Methods
showsPrec :: Int -> Graph -> ShowS #
show :: Graph -> String #
showList :: [Graph] -> ShowS #
valueAt :: Vertex -> Lens' Graph Quantum Source #
imAsList :: Iso' (IntMap v) [(Vertex', v)] Source #
edgesFrom :: Vertex -> Traversal' Graph (Vertex, DFilter) Source #
edges :: Vertex -> Lens' Graph (IntMap DFilter) Source #
vertices :: Lens' Graph (IntMap (Quantum, IntMap DFilter)) Source #
newtype Vertex Source #
Constructors
(==) :: Vertex -> Vertex -> Bool #
(/=) :: Vertex -> Vertex -> Bool #
compare :: Vertex -> Vertex -> Ordering #
(<) :: Vertex -> Vertex -> Bool #
(<=) :: Vertex -> Vertex -> Bool #
(>) :: Vertex -> Vertex -> Bool #
(>=) :: Vertex -> Vertex -> Bool #
max :: Vertex -> Vertex -> Vertex #
min :: Vertex -> Vertex -> Vertex #
showsPrec :: Int -> Vertex -> ShowS #
show :: Vertex -> String #
showList :: [Vertex] -> ShowS #
data Quantum Source #
Fields
showsPrec :: Int -> Quantum -> ShowS #
show :: Quantum -> String #
showList :: [Quantum] -> ShowS #
data SuperPos f a where Source #
showsPrec :: Int -> SuperPos f a -> ShowS #
show :: SuperPos f a -> String #
showList :: [SuperPos f a] -> ShowS #
_Observed :: Foldable f => Prism' (SuperPos f a) a Source #
_Unknown :: Foldable f => Prism' (SuperPos f a) (f a) Source #
type DFilter = Dynamic Source #
type DChoice = Dynamic Source #
forceDyn :: forall a. Typeable a => Dynamic -> a Source #
values :: Traversal' Graph (Vertex, Quantum) Source #
entropyOfQ :: Quantum -> Maybe Int Source #
emptyGraph :: Graph Source #
edgeBetween :: Vertex -> Vertex -> Lens' Graph (Maybe DFilter) Source #
vertexCount :: Lens' Graph Int Source #
superPos :: (Typeable f, Typeable a) => Traversal' Quantum (SuperPos f a) Source #