Documentation

data Relation a b #

relation :: (Ix a, Ix b, MonadState s m, HasSAT s) => ((a, b), (a, b)) -> m (Relation a b) #

symmetric_relation :: (HasSAT s, MonadState s m, Ix b) => ((b, b), (b, b)) -> m (Relation b b) #

build :: (Ix a, Ix b) => ((a, b), (a, b)) -> [((a, b), Bit)] -> Relation a b #

buildFrom :: (Ix a, Ix b) => (a -> b -> Bit) -> ((a, b), (a, b)) -> Relation a b #

identity :: Ix a => ((a, a), (a, a)) -> Relation a a #

bounds :: (Ix a, Ix b) => Relation a b -> ((a, b), (a, b)) #

(!) :: (Ix a, Ix b) => Relation a b -> (a, b) -> Bit #

indices :: (Ix a, Ix b) => Relation a b -> [(a, b)] #

assocs :: (Ix a, Ix b) => Relation a b -> [((a, b), Bit)] #

elems :: (Ix a, Ix b) => Relation a b -> [Bit] #

table :: (Enum a, Ix a, Enum b, Ix b) => Array (a, b) Bool -> String #

mirror :: (Ix a, Ix b) => Relation a b -> Relation b a #

union :: (Ix a, Ix b) => Relation a b -> Relation a b -> Relation a b #

complement :: (Ix a, Ix b) => Relation a b -> Relation a b #

difference :: (Ix a, Ix b) => Relation a b -> Relation a b -> Relation a b #

product :: (Ix a, Ix b, Ix c) => Relation a b -> Relation b c -> Relation a c #

power :: Ix a => Int -> Relation a a -> Relation a a #

intersection :: (Ix a, Ix b) => Relation a b -> Relation a b -> Relation a b #

reflexive_closure :: Ix a => Relation a a -> Relation a a #

symmetric_closure :: Ix a => Relation a a -> Relation a a #

implies :: (Ix a, Ix b) => Relation a b -> Relation a b -> Bit #

symmetric :: Ix a => Relation a a -> Bit #

anti_symmetric :: Ix a => Relation a a -> Bit #

transitive :: Ix a => Relation a a -> Bit #

irreflexive :: Ix a => Relation a a -> Bit #

reflexive :: Ix a => Relation a a -> Bit #

regular :: (Ix a, Ix b) => Int -> Relation a b -> Bit #

regular_in_degree :: (Ix a, Ix b) => Int -> Relation a b -> Bit #

regular_out_degree :: (Ix a, Ix b) => Int -> Relation a b -> Bit #

max_in_degree :: (Ix a, Ix b) => Int -> Relation a b -> Bit #

min_in_degree :: (Ix a, Ix b) => Int -> Relation a b -> Bit #

max_out_degree :: (Ix a, Ix b) => Int -> Relation a b -> Bit #

min_out_degree :: (Ix a, Ix b) => Int -> Relation a b -> Bit #

empty :: (Ix a, Ix b) => Relation a b -> Bit #

complete :: (Ix a, Ix b) => Relation a b -> Bit #

total :: Ix a => Relation a a -> Bit #

disjoint :: (Ix a, Ix b) => Relation a b -> Relation a b -> Bit #

equals :: (Ix a, Ix b) => Relation a b -> Relation a b -> Bit #