claferIG-0.3.6: src/Language/Clafer/IG/Constraints.hs
{-# LANGUAGE NamedFieldPuns #-}
{-
Copyright (C) 2012-2013 Jimmy Liang <http://gsd.uwaterloo.ca>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
-}
module Language.Clafer.IG.Constraints (Constraint(..), Cardinality(..), ClaferInfo(..), ConstraintInfo(..), isLowerCardinalityConstraint, isUpperCardinalityConstraint, lookupConstraint, parseConstraints) where
import Data.List
import Data.Maybe
import Data.Ord
import Language.Clafer
import Language.Clafer.Front.Absclafer (Span(..))
import Language.Clafer.Intermediate.Intclafer
import qualified Language.Clafer.Intermediate.Intclafer as I
data Constraint =
ExactCardinalityConstraint {range::Span, claferInfo::ClaferInfo} |
LowerCardinalityConstraint {range::Span, claferInfo::ClaferInfo} |
UpperCardinalityConstraint {range::Span, claferInfo::ClaferInfo} |
UserConstraint {range::Span, constraintInfo::ConstraintInfo}
deriving (Show, Eq)
data Cardinality = Cardinality {lower::Integer, upper::Maybe Integer} deriving Eq
instance Show Cardinality where
show (Cardinality 0 Nothing) = "*"
show (Cardinality 1 Nothing) = "+"
show (Cardinality lower Nothing) = show lower ++ "..*"
show (Cardinality 0 (Just 1)) = "?"
show (Cardinality lower (Just upper))
| lower == upper = show lower
| otherwise = show lower ++ ".." ++ show upper
data ClaferInfo = ClaferInfo {uniqueId::String, cardinality::Cardinality} deriving Eq
instance Show ClaferInfo where
show (ClaferInfo uniqueId cardinality) = uniqueId ++ " " ++ show cardinality
data ConstraintInfo = ConstraintInfo {pId::String, pos::Span, syntax::String} deriving Eq
instance Show ConstraintInfo where
show ConstraintInfo{pos = Span (Pos l c) _, syntax} = syntax ++ " (line " ++ show l ++ ", column " ++ show c ++ ")"
show ConstraintInfo{pos = PosSpan _ (Pos l c) _, syntax} = syntax ++ " (line " ++ show l ++ ", column " ++ show c ++ ")" -- Should never happen
show ConstraintInfo{pos = Span (PosPos _ l c) _, syntax} = syntax ++ " (line " ++ show l ++ ", column " ++ show c ++ ")" -- Should never happen
show ConstraintInfo{pos = PosSpan _ (PosPos _ l c) _, syntax} = syntax ++ " (line " ++ show l ++ ", column " ++ show c ++ ")" -- Should never happen
isLowerCardinalityConstraint :: Constraint -> Bool
isLowerCardinalityConstraint LowerCardinalityConstraint{} = True
isLowerCardinalityConstraint _ = False
isUpperCardinalityConstraint :: Constraint -> Bool
isUpperCardinalityConstraint UpperCardinalityConstraint{} = True
isUpperCardinalityConstraint _ = False
to :: Span -> Pos
to (Span _ t) = t
to (PosSpan _ _ t) = t -- Should never happen
{-from :: Span -> Pos
from (Span f _) = f
from (PosSpan _ f _) = f -- Should never happen-}
lookupConstraint :: Span -> [Constraint] -> Constraint
lookupConstraint constraint' constraints =
case [x | x <- constraints, constraint' == range x] of
[] -> error $ show constraint' ++ " not equal to known constraints " ++ show constraints
cs -> minimumBy (comparing $ to . range) cs
parseConstraints :: String -> IModule -> [(Span, IrTrace)] -> [Constraint]
parseConstraints claferModel imodule mapping =
mapMaybe (uncurry convert) mapping
where
clafers = _mDecls imodule >>= subclafers
pexps = (mapMaybe constraint $ _mDecls imodule ++ concatMap _elements clafers) >>= subexpressions
convert s IrPExp{pUid} =
Just $ UserConstraint s $ ConstraintInfo pUid (_inPos $ findPExp pUid) $ extract $ _inPos $ findPExp pUid
convert s LowerCard{pUid, isGroup = False} =
Just $ LowerCardinalityConstraint s $ claferInfo pUid
convert s UpperCard{pUid, isGroup = False} =
Just $ UpperCardinalityConstraint s $ claferInfo pUid
convert s ExactCard{pUid, isGroup = False} =
Just $ ExactCardinalityConstraint s $ claferInfo pUid
convert _ _ = Nothing
findPExp pUid = fromMaybe (error $ "Unknown constraint " ++ pUid) $ find ((== pUid) . _pid) pexps
findClafer pUid = fromMaybe (error $ "Unknown clafer " ++ pUid) $ find ((== pUid) . _uid) clafers
text = lines claferModel
extract (Span (Pos l1 c1) (Pos l2 c2)) -- This one should occur the rest should not happen
| l1 == l2 = drop (fromInteger $ c1 - 1) $ take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l1 - 1)
| otherwise = unlines $ f1 : fs ++ [fn]
where
f1 = drop (fromInteger $ c1 - 1) $ text !! (fromInteger $ l1 - 1)
fs = map (text !!) [(fromInteger $ l1) .. (fromInteger $ l2 - 2)]
fn = take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l2 - 1)
extract (Span (PosPos _ l1 c1) (Pos l2 c2))
| l1 == l2 = drop (fromInteger $ c1 - 1) $ take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l1 - 1)
| otherwise = unlines $ f1 : fs ++ [fn]
where
f1 = drop (fromInteger $ c1 - 1) $ text !! (fromInteger $ l1 - 1)
fs = map (text !!) [(fromInteger $ l1) .. (fromInteger $ l2 - 2)]
fn = take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l2 - 1)
extract (Span (Pos l1 c1) (PosPos _ l2 c2))
| l1 == l2 = drop (fromInteger $ c1 - 1) $ take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l1 - 1)
| otherwise = unlines $ f1 : fs ++ [fn]
where
f1 = drop (fromInteger $ c1 - 1) $ text !! (fromInteger $ l1 - 1)
fs = map (text !!) [(fromInteger $ l1) .. (fromInteger $ l2 - 2)]
fn = take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l2 - 1)
extract (Span (PosPos _ l1 c1) (PosPos _ l2 c2))
| l1 == l2 = drop (fromInteger $ c1 - 1) $ take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l1 - 1)
| otherwise = unlines $ f1 : fs ++ [fn]
where
f1 = drop (fromInteger $ c1 - 1) $ text !! (fromInteger $ l1 - 1)
fs = map (text !!) [(fromInteger $ l1) .. (fromInteger $ l2 - 2)]
fn = take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l2 - 1)
extract (PosSpan _ (Pos l1 c1) (Pos l2 c2))
| l1 == l2 = drop (fromInteger $ c1 - 1) $ take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l1 - 1)
| otherwise = unlines $ f1 : fs ++ [fn]
where
f1 = drop (fromInteger $ c1 - 1) $ text !! (fromInteger $ l1 - 1)
fs = map (text !!) [(fromInteger $ l1) .. (fromInteger $ l2 - 2)]
fn = take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l2 - 1)
extract (PosSpan _ (PosPos _ l1 c1) (Pos l2 c2))
| l1 == l2 = drop (fromInteger $ c1 - 1) $ take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l1 - 1)
| otherwise = unlines $ f1 : fs ++ [fn]
where
f1 = drop (fromInteger $ c1 - 1) $ text !! (fromInteger $ l1 - 1)
fs = map (text !!) [(fromInteger $ l1) .. (fromInteger $ l2 - 2)]
fn = take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l2 - 1)
extract (PosSpan _ (Pos l1 c1) (PosPos _ l2 c2))
| l1 == l2 = drop (fromInteger $ c1 - 1) $ take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l1 - 1)
| otherwise = unlines $ f1 : fs ++ [fn]
where
f1 = drop (fromInteger $ c1 - 1) $ text !! (fromInteger $ l1 - 1)
fs = map (text !!) [(fromInteger $ l1) .. (fromInteger $ l2 - 2)]
fn = take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l2 - 1)
extract (PosSpan _ (PosPos _ l1 c1) (PosPos _ l2 c2))
| l1 == l2 = drop (fromInteger $ c1 - 1) $ take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l1 - 1)
| otherwise = unlines $ f1 : fs ++ [fn]
where
f1 = drop (fromInteger $ c1 - 1) $ text !! (fromInteger $ l1 - 1)
fs = map (text !!) [(fromInteger $ l1) .. (fromInteger $ l2 - 2)]
fn = take (fromInteger $ c2 - 1) $ text !! (fromInteger $ l2 - 1)
convertCard (l, -1) = Cardinality l Nothing
convertCard (l, h) = Cardinality l $ Just h
claferInfo pUid =
ClaferInfo (_ident claf) $ convertCard $ fromJust $ _card claf
where
claf = findClafer pUid
subclafers :: IElement -> [IClafer]
subclafers (IEClafer claf) = claf : (_elements claf >>= subclafers)
subclafers _ = []
constraint :: IElement -> Maybe PExp
constraint (IEConstraint _ pexp') = Just pexp'
constraint _ = Nothing
subexpressions :: PExp -> [PExp]
subexpressions p@PExp{I._exp = exp'} =
p : subexpressions' exp'
where
subexpressions' IDeclPExp{_oDecls, _bpexp} =
concatMap (subexpressions . _body) _oDecls ++ subexpressions _bpexp
subexpressions' IFunExp{_exps} = concatMap subexpressions _exps
subexpressions' _ = []