module Language.Haskell.TokenUtils.DualTree (
renderLayoutTree
, layoutTreeToSourceTree
, retrieveLinesFromLayoutTree
, retrieveLines
, renderLines
, renderSourceTree
, SourceTree
, Line(..)
, Source(..)
, renderLinesFromLayoutTree
, Alignment(..)
, Annot(..)
, DeletedSpan(..)
, LineOpt(..)
, Prim(..)
, Transformation(..)
, Up(..)
) where
import Control.Monad.State
import qualified Data.Tree as T
import qualified Text.PrettyPrint as P
import Language.Haskell.TokenUtils.Types
import Language.Haskell.TokenUtils.Utils
import Data.Tree.DUAL
import Data.Semigroup
import Data.Monoid.Action
import qualified Data.List.NonEmpty as NE
import qualified Data.Tree.DUAL.Internal as I
import Debug.Trace
data DeletedSpan = DeletedSpan SimpSpan RowOffset SimpPos
deriving (Show,Eq)
data Transformation = TAbove ColOffset EndOffset (Row,Col) (Row,Col) EndOffset
deriving Show
data Up a = Up DtSimpSpan Alignment (NE.NonEmpty (Line a)) [DeletedSpan]
| UDeleted [DeletedSpan]
deriving Show
data DtSimpSpan = Dt SimpSpan
deriving (Eq,Show)
instance Outputable DtSimpSpan where
ppr s = P.parens $ P.text "DtSimpSpan" P.<+> ppr s
data Line a = Line Row Col RowOffset Source LineOpt [a]
data Alignment = ANone | AVertical
deriving (Show,Eq)
instance (IsToken a) => Show (Line a) where
show (Line r c o f s toks) = "(" ++ show r
++ " " ++ show c
++ " " ++ show o
++ " " ++ show f
++ " " ++ show s
++ " " ++ "\"" ++ showFriendlyToks toks ++ "\")"
data Source = SOriginal
| SAdded
| SWasAdded
deriving (Show,Eq)
data LineOpt = ONone
| OGroup
deriving (Show,Eq)
data Annot = Ann String
| ADeleted ForestSpan RowOffset SimpPos
| ASubtree ForestSpan
deriving Show
data Prim a = PToks [a]
| PDeleted ForestSpan RowOffset SimpPos
deriving Show
type SourceTree a = DUALTree Transformation (Up a) Annot (Prim a)
instance Semigroup DtSimpSpan where
Dt (p1,_p2) <> Dt (_q1,q2) = Dt (p1,q2)
instance (IsToken a) => Semigroup (Up a) where
u1 <> u2 = combineUps u1 u2
instance Semigroup Transformation where
(TAbove co1 bo1 p11 _p21 _eo1) <> (TAbove _co2 _bo2 _p12 p22 eo2)
= (TAbove co1 bo1 p11 p22 eo2)
instance (Action Transformation (Up a)) where
act (TAbove _co _bo _p1 _p2 _eo) (Up sspan _a s ds) = (Up sspan a' s' ds)
where
a' = AVertical
s' = NE.map (\(Line r c o ss _f toks) -> (Line r c o ss OGroup toks)) s
act (TAbove _co _bo _p1 _p2 _eo) (UDeleted ds) = UDeleted ds
renderLayoutTree :: (IsToken a) => LayoutTree a -> String
renderLayoutTree = renderSourceTree . layoutTreeToSourceTree
renderLinesFromLayoutTree :: (IsToken a) => LayoutTree a -> String
renderLinesFromLayoutTree = renderLines . retrieveLinesFromLayoutTree
retrieveLinesFromLayoutTree :: (IsToken a) => LayoutTree a -> [Line a]
retrieveLinesFromLayoutTree = retrieveLines . layoutTreeToSourceTree
retrieveLines :: (IsToken a) => SourceTree a -> [Line a]
retrieveLines srcTree
= case getU srcTree of
Nothing -> []
Just (Up _ss _a str _ds) -> NE.toList str
Just (UDeleted _) -> []
renderSourceTree :: (IsToken a) => SourceTree a -> String
renderSourceTree srcTree = r
where
r = case getU srcTree of
Nothing -> ""
Just (Up _ss _a str _ds) -> renderLines $ NE.toList str
Just (UDeleted _) -> ""
renderLines :: (IsToken a) => [Line a] -> String
renderLines ls = res
where
(_,(_,res)) = runState (go 0 ls) ((1,1),"")
go _ [] = do return ()
go ci ((Line r c _o _f _s str):ls') = do
newPos r (c+ci)
addString (showTokenStream str)
go ci ls'
getRC = do
(rc,_) <- get
return rc
putRC (r,c) = do
(_,str) <- get
put ((r,c),str)
newPos newRow newCol = do
(oldRow',oldCol) <- getRC
let oldRow = if oldRow' <= newRow then oldRow' else (newRow 1)
putRC (oldRow,oldCol)
if oldRow == newRow
then addString (take (newCol oldCol) $ repeat ' ')
else
addString ( (take (newRow oldRow) $ repeat '\n') ++
(take (newCol 1) $ repeat ' ') )
addString [] = return ()
addString str = do
((r,c),curr) <- get
let ll = (length $ filter (=='\n') str)
let c'' = (length $ takeWhile (/='\n') $ reverse str)
let (r',c') = case ll of
0 -> (r,c + c'')
_ -> (r + ll, c'' + 1)
put ((r',c'),curr++str)
addDebugString str = do
((r,c),curr) <- get
put ((r,c),curr++str)
layoutTreeToSourceTree :: (IsToken a) => LayoutTree a -> SourceTree a
layoutTreeToSourceTree (T.Node (Deleted sspan pg eg) _)
= leaf (UDeleted [(DeletedSpan (fs2s sspan) pg eg)]) (PDeleted sspan pg eg)
layoutTreeToSourceTree (T.Node (Entry sspan NoChange []) ts0)
= annot (ASubtree sspan) (mconcatl $ map layoutTreeToSourceTree ts0)
layoutTreeToSourceTree (T.Node (Entry sspan (Above bo p1 p2 eo) []) ts0)
= case (numLines ts0) of
0 -> annot (ASubtree sspan) (mconcatl $ map layoutTreeToSourceTree ts0)
_ -> annot (ASubtree sspan)
(applyD (TAbove co bo p1 p2 eo) subs)
where
subs = (mconcatl $ map layoutTreeToSourceTree ts0)
co = 0
numLines :: [T.Tree (Entry a)] -> Int
numLines [] = 0
numLines sts = l f
where
((f,_),_ ) = forestSpanToSimpPos $ treeStartEnd $ head sts
(_ ,(l,_)) = forestSpanToSimpPos $ treeStartEnd $ last sts
layoutTreeToSourceTree (T.Node (Entry sspan _lay toks) _ts) = leaf (mkUp sspan toks) (PToks toks)
mconcatl :: (Monoid a) => [a] -> a
mconcatl = foldl mappend mempty
fs2s :: ForestSpan -> SimpSpan
fs2s ss = (sp,ep)
where
(sp,ep) = forestSpanToSimpPos ss
mkUp :: (IsToken a) => ForestSpan -> [a] -> Up a
mkUp sspan toks = Up (Dt ss) a ls []
where
a = ANone
s = if forestSpanVersionSet sspan then SAdded else SOriginal
ss = mkSpan sspan
toksByLine = groupTokensByLine toks
ls = NE.fromList $ concatMap (mkLinesFromToks s) toksByLine
mkLinesFromToks :: (IsToken a) => Source -> [a] -> [Line a]
mkLinesFromToks _ [] = []
mkLinesFromToks s toks = [Line ro co 0 s f toks']
where
f = ONone
ro' = tokenRow $ head toks
co' = tokenCol $ head toks
(ro,co) = srcPosToSimpPos (tokenRow $ head toks, tokenCol $ head toks)
toks' = addOffsetToToks (ro',co') toks
combineUps :: (IsToken a) => Up a -> Up a -> Up a
combineUps (UDeleted d1) (UDeleted d2) = UDeleted (d1 <> d2)
combineUps (UDeleted d1) (Up sp2 a2 l2 d2) = (Up sp2 a2 l (d1 <> d2))
where
l = adjustForDeleted d1 l2
combineUps (Up sp1 a1 l1 d1) (UDeleted d2) = (Up sp1 a1 l1 (d1 <> d2))
combineUps u1@(Up sp1 _a1 l1 d1) u2@(Up sp2 _a2 l2 d2)
=
(Up (sp1 <> sp2) a l (d1 <> d2))
where
a = ANone
l2' = adjustForDeleted d1 l2
(Line _ _ o2 _ _ _) = NE.head l2'
l2'' = if o1 == o2
then l2'
else NE.fromList $ map (\(Line r c f aa ff s) -> (Line (r + (o1f)) c (o1f) aa ff s)) (NE.toList l2')
(Line r1 c1 o1 ss1 ff1 s1) = NE.last l1
(Line r2 c2 _o2 ss2 ff2 s2) = NE.head l2''
l = if r1 == r2
then NE.fromList $ (NE.init l1) ++ m ++ ll
else NE.fromList $ (NE.toList l1) ++ rest
s2' = addOffsetToToks (0,c2 c1) s2
s1' = s1 ++ s2'
ff' = if ff1 == OGroup || ff2 == OGroup then OGroup else ONone
m' = [Line r1 c1 o1 ss1 ff' s1']
odiff = sum $ map (\t -> (tokenLen t) (tokenColEnd t tokenCol t)) $ filter (not . isComment) s1
st1 = showTokenStream s1
st2 = showTokenStream (s1 ++ s2')
st3 = drop (length st1) st2
st4 = takeWhile (==' ') st3
oo = length (st1++st4)
coo = c1 + oo
o = coo c2
(m,ll) = if (ss1 /= ss2) && (length s1 == 1 && (tokenLen $ head s1) == 0)
then ([NE.last l1],map (\(Line r c f aa ff s) -> (Line (r+1) (c + o) (f+1) aa ff s)) (NE.toList l2''))
else if ff' == OGroup
then (m',addOffsetToGroup o (NE.tail l2''))
else (m', (NE.tail l2''))
rest = if ff2 == OGroup && ff1 == OGroup
then addOffsetToGroup odiff (NE.toList l2'')
else NE.toList l2''
addOffsetToGroup _off [] = []
addOffsetToGroup _off (ls@((Line _r _c _f _aa ONone _s):_)) = ls
addOffsetToGroup off ((Line r c f aa OGroup s):ls)
= (Line r (c+off) f aa OGroup s) : addOffsetToGroup off ls
adjustForDeleted :: (IsToken a) => [DeletedSpan] -> NE.NonEmpty (Line a) -> NE.NonEmpty (Line a)
adjustForDeleted d1 l2 = l
where
deltaL = calcDelta d1
l = NE.map go l2
go (Line r c o SOriginal f str) = Line (r deltaL) c o SOriginal f str
go (Line r c o SWasAdded f str) = Line (r deltaL) c o SWasAdded f str
go (Line r c o SAdded f str) = Line r c o SWasAdded f str
calcDelta :: [DeletedSpan] -> RowOffset
calcDelta d1 = deltaL
where
deltaL = case d1 of
[] -> 0
_ -> (1) + (sum $ map calcDelta' d1)
calcDelta' :: DeletedSpan -> RowOffset
calcDelta' (DeletedSpan ((rs,_cs),(re,_ce)) pg (rd,_cd)) = r + 1
where
ol = re rs
eg = rd
r = (pg + ol + eg) (max pg eg)
mkSpan :: ForestSpan -> SimpSpan
mkSpan ss = (s,e)
where
(s,e) = forestSpanToSimpPos ss