module Language.Haskell.Lexer.Position where
data Pos = Pos { Pos -> Int
char, Pos -> Int
line, Pos -> Int
column :: !Int } deriving (Int -> Pos -> ShowS
[Pos] -> ShowS
Pos -> String
(Int -> Pos -> ShowS)
-> (Pos -> String) -> ([Pos] -> ShowS) -> Show Pos
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> Pos -> ShowS
showsPrec :: Int -> Pos -> ShowS
$cshow :: Pos -> String
show :: Pos -> String
$cshowList :: [Pos] -> ShowS
showList :: [Pos] -> ShowS
Show)
simpPos :: Pos -> (Int,Int)
simpPos :: Pos -> (Int, Int)
simpPos (Pos Int
_ Int
l Int
c) = (Int
l,Int
c)
instance Eq Pos where Pos
p1 == :: Pos -> Pos -> Bool
== Pos
p2 = Pos -> (Int, Int)
simpPos Pos
p1 (Int, Int) -> (Int, Int) -> Bool
forall a. Eq a => a -> a -> Bool
== Pos -> (Int, Int)
simpPos Pos
p2
instance Ord Pos where compare :: Pos -> Pos -> Ordering
compare Pos
p1 Pos
p2 = (Int, Int) -> (Int, Int) -> Ordering
forall a. Ord a => a -> a -> Ordering
compare (Pos -> (Int, Int)
simpPos Pos
p1) (Pos -> (Int, Int)
simpPos Pos
p2)
startPos :: Pos
startPos :: Pos
startPos = Pos { char :: Int
char = Int
0, line :: Int
line = Int
1, column :: Int
column = Int
1 }
nextPos :: Pos -> String -> Pos
nextPos :: Pos -> String -> Pos
nextPos = (Pos -> Char -> Pos) -> Pos -> String -> Pos
forall b a. (b -> a -> b) -> b -> [a] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl Pos -> Char -> Pos
nextPos1
nextPos1 :: Pos -> Char -> Pos
nextPos1 :: Pos -> Char -> Pos
nextPos1 (Pos Int
n Int
y Int
x) Char
c =
case Char
c of
Char
'\CR' -> Int -> Int -> Int -> Pos
Pos (Int
nInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1) (Int
yInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1) Int
1
Char
'\LF' -> Int -> Int -> Int -> Pos
Pos (Int
nInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1) (Int
yInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1) Int
1
Char
'\FF' -> Int -> Int -> Int -> Pos
Pos (Int
nInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1) (Int
yInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1) Int
1
Char
'\t' -> Int -> Int -> Int -> Pos
Pos (Int
nInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1) Int
y (Int
xInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
8Int -> Int -> Int
forall a. Num a => a -> a -> a
-(Int
xInt -> Int -> Int
forall a. Num a => a -> a -> a
-Int
1) Int -> Int -> Int
forall a. Integral a => a -> a -> a
`mod` Int
8)
Char
_ -> Int -> Int -> Int -> Pos
Pos (Int
nInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1) Int
y (Int
xInt -> Int -> Int
forall a. Num a => a -> a -> a
+Int
1)