{-# LANGUAGE DeriveDataTypeable #-}
{- |
Module      :  ./RDF/Sign.hs
Copyright   :  Francisc-Nicolae Bungiu, Jacobs University Bremen
License     :  GPLv2 or higher, see LICENSE.txt

RDF signature and sentences
-}

module RDF.Sign where

import RDF.AS
import Common.Result
import Data.Data
import qualified Data.Set as Set

data Sign = Sign
    { Sign -> Set Term
subjects :: Set.Set Term
    , Sign -> Set Term
predicates :: Set.Set Term
    , Sign -> Set Term
objects :: Set.Set Term
    } deriving (Int -> Sign -> ShowS
[Sign] -> ShowS
Sign -> String
(Int -> Sign -> ShowS)
-> (Sign -> String) -> ([Sign] -> ShowS) -> Show Sign
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Sign] -> ShowS
$cshowList :: [Sign] -> ShowS
show :: Sign -> String
$cshow :: Sign -> String
showsPrec :: Int -> Sign -> ShowS
$cshowsPrec :: Int -> Sign -> ShowS
Show, Sign -> Sign -> Bool
(Sign -> Sign -> Bool) -> (Sign -> Sign -> Bool) -> Eq Sign
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Sign -> Sign -> Bool
$c/= :: Sign -> Sign -> Bool
== :: Sign -> Sign -> Bool
$c== :: Sign -> Sign -> Bool
Eq, Eq Sign
Eq Sign =>
(Sign -> Sign -> Ordering)
-> (Sign -> Sign -> Bool)
-> (Sign -> Sign -> Bool)
-> (Sign -> Sign -> Bool)
-> (Sign -> Sign -> Bool)
-> (Sign -> Sign -> Sign)
-> (Sign -> Sign -> Sign)
-> Ord Sign
Sign -> Sign -> Bool
Sign -> Sign -> Ordering
Sign -> Sign -> Sign
forall a.
Eq a =>
(a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: Sign -> Sign -> Sign
$cmin :: Sign -> Sign -> Sign
max :: Sign -> Sign -> Sign
$cmax :: Sign -> Sign -> Sign
>= :: Sign -> Sign -> Bool
$c>= :: Sign -> Sign -> Bool
> :: Sign -> Sign -> Bool
$c> :: Sign -> Sign -> Bool
<= :: Sign -> Sign -> Bool
$c<= :: Sign -> Sign -> Bool
< :: Sign -> Sign -> Bool
$c< :: Sign -> Sign -> Bool
compare :: Sign -> Sign -> Ordering
$ccompare :: Sign -> Sign -> Ordering
$cp1Ord :: Eq Sign
Ord, Typeable, Typeable Sign
Constr
DataType
Typeable Sign =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> Sign -> c Sign)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Sign)
-> (Sign -> Constr)
-> (Sign -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Sign))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Sign))
-> ((forall b. Data b => b -> b) -> Sign -> Sign)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r)
-> (forall u. (forall d. Data d => d -> u) -> Sign -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Sign -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Sign -> m Sign)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Sign -> m Sign)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Sign -> m Sign)
-> Data Sign
Sign -> Constr
Sign -> DataType
(forall b. Data b => b -> b) -> Sign -> Sign
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Sign -> c Sign
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Sign
forall a.
Typeable a =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Sign -> u
forall u. (forall d. Data d => d -> u) -> Sign -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Sign -> m Sign
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Sign -> m Sign
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Sign
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Sign -> c Sign
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Sign)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Sign)
$cSign :: Constr
$tSign :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> Sign -> m Sign
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Sign -> m Sign
gmapMp :: (forall d. Data d => d -> m d) -> Sign -> m Sign
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Sign -> m Sign
gmapM :: (forall d. Data d => d -> m d) -> Sign -> m Sign
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Sign -> m Sign
gmapQi :: Int -> (forall d. Data d => d -> u) -> Sign -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Sign -> u
gmapQ :: (forall d. Data d => d -> u) -> Sign -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Sign -> [u]
gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r
gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sign -> r
gmapT :: (forall b. Data b => b -> b) -> Sign -> Sign
$cgmapT :: (forall b. Data b => b -> b) -> Sign -> Sign
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Sign)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Sign)
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c Sign)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Sign)
dataTypeOf :: Sign -> DataType
$cdataTypeOf :: Sign -> DataType
toConstr :: Sign -> Constr
$ctoConstr :: Sign -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Sign
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Sign
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Sign -> c Sign
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Sign -> c Sign
$cp1Data :: Typeable Sign
Data)

emptySign :: Sign
emptySign :: Sign
emptySign = Sign :: Set Term -> Set Term -> Set Term -> Sign
Sign
  { subjects :: Set Term
subjects = Set Term
forall a. Set a
Set.empty
  , predicates :: Set Term
predicates = Set Term
forall a. Set a
Set.empty
  , objects :: Set Term
objects = Set Term
forall a. Set a
Set.empty
  }

diffSig :: Sign -> Sign -> Sign
diffSig :: Sign -> Sign -> Sign
diffSig a :: Sign
a b :: Sign
b =
    Sign
a { subjects :: Set Term
subjects = Sign -> Set Term
subjects Sign
a Set Term -> Set Term -> Set Term
forall a. Ord a => Set a -> Set a -> Set a
`Set.difference` Sign -> Set Term
subjects Sign
b
      , predicates :: Set Term
predicates = Sign -> Set Term
predicates Sign
a Set Term -> Set Term -> Set Term
forall a. Ord a => Set a -> Set a -> Set a
`Set.difference` Sign -> Set Term
predicates Sign
b
      , objects :: Set Term
objects = Sign -> Set Term
objects Sign
a Set Term -> Set Term -> Set Term
forall a. Ord a => Set a -> Set a -> Set a
`Set.difference` Sign -> Set Term
objects Sign
b
      }

addSign :: Sign -> Sign -> Sign
addSign :: Sign -> Sign -> Sign
addSign toIns :: Sign
toIns totalSign :: Sign
totalSign = Sign
totalSign
    { subjects :: Set Term
subjects = Set Term -> Set Term -> Set Term
forall a. Ord a => Set a -> Set a -> Set a
Set.union (Sign -> Set Term
subjects Sign
totalSign) (Sign -> Set Term
subjects Sign
toIns)
    , predicates :: Set Term
predicates = Set Term -> Set Term -> Set Term
forall a. Ord a => Set a -> Set a -> Set a
Set.union (Sign -> Set Term
predicates Sign
totalSign) (Sign -> Set Term
predicates Sign
toIns)
    , objects :: Set Term
objects = Set Term -> Set Term -> Set Term
forall a. Ord a => Set a -> Set a -> Set a
Set.union (Sign -> Set Term
objects Sign
totalSign) (Sign -> Set Term
objects Sign
toIns)
    }

isSubSign :: Sign -> Sign -> Bool
isSubSign :: Sign -> Sign -> Bool
isSubSign a :: Sign
a b :: Sign
b =
    Set Term -> Set Term -> Bool
forall a. Ord a => Set a -> Set a -> Bool
Set.isSubsetOf (Sign -> Set Term
subjects Sign
a) (Sign -> Set Term
subjects Sign
b)
       Bool -> Bool -> Bool
&& Set Term -> Set Term -> Bool
forall a. Ord a => Set a -> Set a -> Bool
Set.isSubsetOf (Sign -> Set Term
predicates Sign
a) (Sign -> Set Term
predicates Sign
b)
       Bool -> Bool -> Bool
&& Set Term -> Set Term -> Bool
forall a. Ord a => Set a -> Set a -> Bool
Set.isSubsetOf (Sign -> Set Term
objects Sign
a) (Sign -> Set Term
objects Sign
b)

uniteSign :: Sign -> Sign -> Result Sign
uniteSign :: Sign -> Sign -> Result Sign
uniteSign s1 :: Sign
s1 s2 :: Sign
s2 = Sign -> Result Sign
forall (m :: * -> *) a. Monad m => a -> m a
return (Sign -> Result Sign) -> Sign -> Result Sign
forall a b. (a -> b) -> a -> b
$ Sign -> Sign -> Sign
addSign Sign
s1 Sign
s2

symOf :: Sign -> Set.Set RDFEntity
symOf :: Sign -> Set RDFEntity
symOf s :: Sign
s = [Set RDFEntity] -> Set RDFEntity
forall (f :: * -> *) a. (Foldable f, Ord a) => f (Set a) -> Set a
Set.unions
  [ (Term -> RDFEntity) -> Set Term -> Set RDFEntity
forall b a. Ord b => (a -> b) -> Set a -> Set b
Set.map (RDFEntityType -> Term -> RDFEntity
RDFEntity RDFEntityType
SubjectEntity) (Set Term -> Set RDFEntity) -> Set Term -> Set RDFEntity
forall a b. (a -> b) -> a -> b
$ Sign -> Set Term
subjects Sign
s
  , (Term -> RDFEntity) -> Set Term -> Set RDFEntity
forall b a. Ord b => (a -> b) -> Set a -> Set b
Set.map (RDFEntityType -> Term -> RDFEntity
RDFEntity RDFEntityType
PredicateEntity) (Set Term -> Set RDFEntity) -> Set Term -> Set RDFEntity
forall a b. (a -> b) -> a -> b
$ Sign -> Set Term
predicates Sign
s
  , (Term -> RDFEntity) -> Set Term -> Set RDFEntity
forall b a. Ord b => (a -> b) -> Set a -> Set b
Set.map (RDFEntityType -> Term -> RDFEntity
RDFEntity RDFEntityType
ObjectEntity) (Set Term -> Set RDFEntity) -> Set Term -> Set RDFEntity
forall a b. (a -> b) -> a -> b
$ Sign -> Set Term
objects Sign
s ]