1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
--------------------------------------------------------------------------------
module Language.Haskell.Stylish.Block
( Block (..)
, LineBlock
, SpanBlock
, blockLength
, linesFromSrcSpan
, spanFromSrcSpan
, moveBlock
, adjacent
, merge
, overlapping
, groupAdjacent
) where
--------------------------------------------------------------------------------
import Control.Arrow (arr, (&&&), (>>>))
import qualified Data.IntSet as IS
import qualified Language.Haskell.Exts as H
--------------------------------------------------------------------------------
-- | Indicates a line span
data Block a = Block
{ blockStart :: Int
, blockEnd :: Int
} deriving (Eq, Ord, Show)
--------------------------------------------------------------------------------
type LineBlock = Block String
--------------------------------------------------------------------------------
type SpanBlock = Block Char
--------------------------------------------------------------------------------
blockLength :: Block a -> Int
blockLength (Block start end) = end - start + 1
--------------------------------------------------------------------------------
linesFromSrcSpan :: H.SrcSpanInfo -> LineBlock
linesFromSrcSpan = H.srcInfoSpan >>>
H.srcSpanStartLine &&& H.srcSpanEndLine >>>
arr (uncurry Block)
--------------------------------------------------------------------------------
spanFromSrcSpan :: H.SrcSpanInfo -> SpanBlock
spanFromSrcSpan = H.srcInfoSpan >>>
H.srcSpanStartColumn &&& H.srcSpanEndColumn >>>
arr (uncurry Block)
--------------------------------------------------------------------------------
moveBlock :: Int -> Block a -> Block a
moveBlock offset (Block start end) = Block (start + offset) (end + offset)
--------------------------------------------------------------------------------
adjacent :: Block a -> Block a -> Bool
adjacent b1 b2 = follows b1 b2 || follows b2 b1
where
follows (Block _ e1) (Block s2 _) = e1 + 1 == s2
--------------------------------------------------------------------------------
merge :: Block a -> Block a -> Block a
merge (Block s1 e1) (Block s2 e2) = Block (min s1 s2) (max e1 e2)
--------------------------------------------------------------------------------
overlapping :: [Block a] -> Bool
overlapping = go IS.empty
where
go _ [] = False
go acc (b : bs) =
let ints = [blockStart b .. blockEnd b] in
if any (`IS.member` acc) ints
then True
else go (IS.union acc $ IS.fromList ints) bs
--------------------------------------------------------------------------------
-- | Groups adjacent blocks into larger blocks
groupAdjacent :: [(Block a, b)]
-> [(Block a, [b])]
groupAdjacent = foldr go []
where
-- This code is ugly and not optimal, and no fucks were given.
go (b1, x) gs = case break (adjacent b1 . fst) gs of
(_, []) -> (b1, [x]) : gs
(ys, ((b2, xs) : zs)) -> (merge b1 b2, x : xs) : (ys ++ zs)
|
