Codec.TPTP.Diff

Documentation

class Diffable a b | a -> b where

Minimal complete definition

diff

Methods

diff :: a -> a -> b

Instances

Diffable Term (T DiffResult)

Methods

diff :: Term -> Term -> T DiffResult

Diffable Formula (F DiffResult)

Methods

diff :: Formula -> Formula -> F DiffResult

data DiffResult d

Constructors

Same

Both arguments are the same.

SameHead d

The arguments are recursive expressions of the same form, but their subterms differ. Return a "decorated" term that shows where the differences are

Differ d d

The arguments differ and are not of similar form (don't recurse)

DontCare

Instances

Functor DiffResult

Methods

fmap :: (a -> b) -> DiffResult a -> DiffResult b

(<$) :: a -> DiffResult b -> DiffResult a

Pretty F0Diff

Methods

pretty :: F0Diff -> Doc

prettyList :: [F0Diff] -> Doc

Pretty T0Diff

Methods

pretty :: T0Diff -> Doc

prettyList :: [T0Diff] -> Doc

Diffable Term (T DiffResult)

Methods

diff :: Term -> Term -> T DiffResult

Diffable Formula (F DiffResult)

Methods

diff :: Formula -> Formula -> F DiffResult

Eq d => Eq (DiffResult d)

Methods

(==) :: DiffResult d -> DiffResult d -> Bool

(/=) :: DiffResult d -> DiffResult d -> Bool

Data d => Data (DiffResult d)

Methods

gfoldl :: (forall a b. Data a => c (a -> b) -> a -> c b) -> (forall g. g -> c g) -> DiffResult d -> c (DiffResult d)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DiffResult d)

toConstr :: DiffResult d -> Constr

dataTypeOf :: DiffResult d -> DataType

dataCast1 :: Typeable (* -> *) t => (forall a. Data a => c (t a)) -> Maybe (c (DiffResult d))

dataCast2 :: Typeable (* -> * -> *) t => (forall a e. (Data a, Data e) => c (t a e)) -> Maybe (c (DiffResult d))

gmapT :: (forall b. Data b => b -> b) -> DiffResult d -> DiffResult d

gmapQl :: (r -> r' -> r) -> r -> (forall a. Data a => a -> r') -> DiffResult d -> r

gmapQr :: (r' -> r -> r) -> r -> (forall a. Data a => a -> r') -> DiffResult d -> r

gmapQ :: (forall a. Data a => a -> u) -> DiffResult d -> [u]

gmapQi :: Int -> (forall a. Data a => a -> u) -> DiffResult d -> u

gmapM :: Monad m => (forall a. Data a => a -> m a) -> DiffResult d -> m (DiffResult d)

gmapMp :: MonadPlus m => (forall a. Data a => a -> m a) -> DiffResult d -> m (DiffResult d)

gmapMo :: MonadPlus m => (forall a. Data a => a -> m a) -> DiffResult d -> m (DiffResult d)

Ord d => Ord (DiffResult d)

Methods

compare :: DiffResult d -> DiffResult d -> Ordering

(<) :: DiffResult d -> DiffResult d -> Bool

(<=) :: DiffResult d -> DiffResult d -> Bool

(>) :: DiffResult d -> DiffResult d -> Bool

(>=) :: DiffResult d -> DiffResult d -> Bool

max :: DiffResult d -> DiffResult d -> DiffResult d

min :: DiffResult d -> DiffResult d -> DiffResult d

Read d => Read (DiffResult d)

Methods

readsPrec :: Int -> ReadS (DiffResult d)

readList :: ReadS [DiffResult d]

readPrec :: ReadPrec (DiffResult d)

readListPrec :: ReadPrec [DiffResult d]

Show (T DiffResult)

Methods

showsPrec :: Int -> T DiffResult -> ShowS

show :: T DiffResult -> String

showList :: [T DiffResult] -> ShowS

Show (F DiffResult)

Methods

showsPrec :: Int -> F DiffResult -> ShowS

show :: F DiffResult -> String

showList :: [F DiffResult] -> ShowS

Show d => Show (DiffResult d)

Methods

showsPrec :: Int -> DiffResult d -> ShowS

show :: DiffResult d -> String

showList :: [DiffResult d] -> ShowS

Pretty (T DiffResult)

Methods

pretty :: T DiffResult -> Doc

prettyList :: [T DiffResult] -> Doc

Pretty (F DiffResult)

Methods

pretty :: F DiffResult -> Doc

prettyList :: [F DiffResult] -> Doc

Pretty (WithEnclosing (T DiffResult))

Methods

pretty :: WithEnclosing (T DiffResult) -> Doc

prettyList :: [WithEnclosing (T DiffResult)] -> Doc

Pretty (WithEnclosing (F DiffResult))

Methods

pretty :: WithEnclosing (F DiffResult) -> Doc

prettyList :: [WithEnclosing (F DiffResult)] -> Doc

Pretty (WithEnclosing F0Diff)

Methods

pretty :: WithEnclosing F0Diff -> Doc

prettyList :: [WithEnclosing F0Diff] -> Doc

Pretty (WithEnclosing T0Diff)

Methods

pretty :: WithEnclosing T0Diff -> Doc

prettyList :: [WithEnclosing T0Diff] -> Doc

type T0Diff = DiffResult (Term0 (T DiffResult))

type F0Diff = DiffResult (Formula0 (T DiffResult) (F DiffResult))

isSame :: forall t. DiffResult t -> Bool

diffGenF :: Gen Formula

Less random generator for generating formulae suitable for testing diff

diffGenT :: Gen Term

printSampleDiffs :: IO ()