module Data.Loc.Area
(
Area,
fromTo, spanArea,
(+), (-), addSpan,
firstSpan, lastSpan,
start, end,
areaSpan, spansAsc, spanCount,
areaShowsPrec, areaReadPrec,
)
where
import Data.Loc.Internal.Prelude
import Data.Loc.Loc (Loc)
import Data.Loc.Span (Span)
import qualified Data.Loc.Internal.Map as Map
import qualified Data.Loc.Span as Span
import Data.Data (Data)
import qualified Data.Foldable as Foldable
import qualified Data.Set as Set
data Terminus = Start | End
deriving (Typeable Terminus
DataType
Constr
Typeable Terminus
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Terminus -> c Terminus)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Terminus)
-> (Terminus -> Constr)
-> (Terminus -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Terminus))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Terminus))
-> ((forall b. Data b => b -> b) -> Terminus -> Terminus)
-> (forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Terminus -> r)
-> (forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Terminus -> r)
-> (forall u. (forall d. Data d => d -> u) -> Terminus -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Terminus -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Terminus -> m Terminus)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Terminus -> m Terminus)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Terminus -> m Terminus)
-> Data Terminus
Terminus -> DataType
Terminus -> Constr
(forall b. Data b => b -> b) -> Terminus -> Terminus
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Terminus -> c Terminus
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Terminus
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) -> Terminus -> u
forall u. (forall d. Data d => d -> u) -> Terminus -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Terminus -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Terminus -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Terminus -> m Terminus
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Terminus -> m Terminus
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Terminus
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Terminus -> c Terminus
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Terminus)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Terminus)
$cEnd :: Constr
$cStart :: Constr
$tTerminus :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> Terminus -> m Terminus
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Terminus -> m Terminus
gmapMp :: (forall d. Data d => d -> m d) -> Terminus -> m Terminus
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Terminus -> m Terminus
gmapM :: (forall d. Data d => d -> m d) -> Terminus -> m Terminus
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Terminus -> m Terminus
gmapQi :: Int -> (forall d. Data d => d -> u) -> Terminus -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Terminus -> u
gmapQ :: (forall d. Data d => d -> u) -> Terminus -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Terminus -> [u]
gmapQr :: (r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Terminus -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Terminus -> r
gmapQl :: (r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Terminus -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Terminus -> r
gmapT :: (forall b. Data b => b -> b) -> Terminus -> Terminus
$cgmapT :: (forall b. Data b => b -> b) -> Terminus -> Terminus
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Terminus)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Terminus)
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c Terminus)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Terminus)
dataTypeOf :: Terminus -> DataType
$cdataTypeOf :: Terminus -> DataType
toConstr :: Terminus -> Constr
$ctoConstr :: Terminus -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Terminus
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Terminus
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Terminus -> c Terminus
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Terminus -> c Terminus
$cp1Data :: Typeable Terminus
Data, Terminus -> Terminus -> Bool
(Terminus -> Terminus -> Bool)
-> (Terminus -> Terminus -> Bool) -> Eq Terminus
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Terminus -> Terminus -> Bool
$c/= :: Terminus -> Terminus -> Bool
== :: Terminus -> Terminus -> Bool
$c== :: Terminus -> Terminus -> Bool
Eq, Eq Terminus
Eq Terminus
-> (Terminus -> Terminus -> Ordering)
-> (Terminus -> Terminus -> Bool)
-> (Terminus -> Terminus -> Bool)
-> (Terminus -> Terminus -> Bool)
-> (Terminus -> Terminus -> Bool)
-> (Terminus -> Terminus -> Terminus)
-> (Terminus -> Terminus -> Terminus)
-> Ord Terminus
Terminus -> Terminus -> Bool
Terminus -> Terminus -> Ordering
Terminus -> Terminus -> Terminus
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 :: Terminus -> Terminus -> Terminus
$cmin :: Terminus -> Terminus -> Terminus
max :: Terminus -> Terminus -> Terminus
$cmax :: Terminus -> Terminus -> Terminus
>= :: Terminus -> Terminus -> Bool
$c>= :: Terminus -> Terminus -> Bool
> :: Terminus -> Terminus -> Bool
$c> :: Terminus -> Terminus -> Bool
<= :: Terminus -> Terminus -> Bool
$c<= :: Terminus -> Terminus -> Bool
< :: Terminus -> Terminus -> Bool
$c< :: Terminus -> Terminus -> Bool
compare :: Terminus -> Terminus -> Ordering
$ccompare :: Terminus -> Terminus -> Ordering
$cp1Ord :: Eq Terminus
Ord)
newtype Area = Area (Map Loc Terminus)
deriving (Typeable Area
DataType
Constr
Typeable Area
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Area -> c Area)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Area)
-> (Area -> Constr)
-> (Area -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Area))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Area))
-> ((forall b. Data b => b -> b) -> Area -> Area)
-> (forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Area -> r)
-> (forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Area -> r)
-> (forall u. (forall d. Data d => d -> u) -> Area -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Area -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Area -> m Area)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Area -> m Area)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Area -> m Area)
-> Data Area
Area -> DataType
Area -> Constr
(forall b. Data b => b -> b) -> Area -> Area
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Area -> c Area
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Area
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) -> Area -> u
forall u. (forall d. Data d => d -> u) -> Area -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Area -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Area -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Area -> m Area
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Area -> m Area
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Area
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Area -> c Area
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Area)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Area)
$cArea :: Constr
$tArea :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> Area -> m Area
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Area -> m Area
gmapMp :: (forall d. Data d => d -> m d) -> Area -> m Area
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Area -> m Area
gmapM :: (forall d. Data d => d -> m d) -> Area -> m Area
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Area -> m Area
gmapQi :: Int -> (forall d. Data d => d -> u) -> Area -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Area -> u
gmapQ :: (forall d. Data d => d -> u) -> Area -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Area -> [u]
gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Area -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Area -> r
gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Area -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Area -> r
gmapT :: (forall b. Data b => b -> b) -> Area -> Area
$cgmapT :: (forall b. Data b => b -> b) -> Area -> Area
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Area)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Area)
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c Area)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Area)
dataTypeOf :: Area -> DataType
$cdataTypeOf :: Area -> DataType
toConstr :: Area -> Constr
$ctoConstr :: Area -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Area
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Area
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Area -> c Area
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Area -> c Area
$cp1Data :: Typeable Area
Data, Area -> Area -> Bool
(Area -> Area -> Bool) -> (Area -> Area -> Bool) -> Eq Area
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Area -> Area -> Bool
$c/= :: Area -> Area -> Bool
== :: Area -> Area -> Bool
$c== :: Area -> Area -> Bool
Eq, Eq Area
Eq Area
-> (Area -> Area -> Ordering)
-> (Area -> Area -> Bool)
-> (Area -> Area -> Bool)
-> (Area -> Area -> Bool)
-> (Area -> Area -> Bool)
-> (Area -> Area -> Area)
-> (Area -> Area -> Area)
-> Ord Area
Area -> Area -> Bool
Area -> Area -> Ordering
Area -> Area -> Area
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 :: Area -> Area -> Area
$cmin :: Area -> Area -> Area
max :: Area -> Area -> Area
$cmax :: Area -> Area -> Area
>= :: Area -> Area -> Bool
$c>= :: Area -> Area -> Bool
> :: Area -> Area -> Bool
$c> :: Area -> Area -> Bool
<= :: Area -> Area -> Bool
$c<= :: Area -> Area -> Bool
< :: Area -> Area -> Bool
$c< :: Area -> Area -> Bool
compare :: Area -> Area -> Ordering
$ccompare :: Area -> Area -> Ordering
$cp1Ord :: Eq Area
Ord)
instance Show Area
where
showsPrec :: Int -> Area -> ShowS
showsPrec = Int -> Area -> ShowS
areaShowsPrec
instance Read Area
where
readPrec :: ReadPrec Area
readPrec = ReadPrec Area
areaReadPrec
instance Monoid Area
where
mempty :: Area
mempty = Map Loc Terminus -> Area
Area Map Loc Terminus
forall k a. Map k a
Map.empty
instance Semigroup Area
where
<> :: Area -> Area -> Area
(<>) = Area -> Area -> Area
(+)
areaShowsPrec :: Int -> Area -> ShowS
areaShowsPrec :: Int -> Area -> ShowS
areaShowsPrec Int
_ Area
a =
[Span] -> ShowS
forall a. Show a => [a] -> ShowS
showList (Area -> [Span]
spansAsc Area
a)
areaReadPrec :: ReadPrec Area
areaReadPrec :: ReadPrec Area
areaReadPrec =
(Span -> Area) -> [Span] -> Area
forall (t :: * -> *) m a.
(Foldable t, Monoid m) =>
(a -> m) -> t a -> m
foldMap Span -> Area
spanArea ([Span] -> Area) -> ReadPrec [Span] -> ReadPrec Area
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> ReadPrec [Span]
forall a. Read a => ReadPrec [a]
readListPrec
fromTo
:: Loc
-> Loc
-> Area
fromTo :: Loc -> Loc -> Area
fromTo Loc
a Loc
b
| Loc
a Loc -> Loc -> Bool
forall a. Eq a => a -> a -> Bool
== Loc
b = Area
forall a. Monoid a => a
mempty
| Bool
otherwise = Span -> Area
spanArea (Loc -> Loc -> Span
Span.fromTo Loc
a Loc
b)
spanArea :: Span -> Area
spanArea :: Span -> Area
spanArea Span
s = Map Loc Terminus -> Area
Area ([(Loc, Terminus)] -> Map Loc Terminus
forall k a. Ord k => [(k, a)] -> Map k a
Map.fromList [(Loc, Terminus)]
locs)
where
locs :: [(Loc, Terminus)]
locs = [ (Span -> Loc
Span.start Span
s, Terminus
Start)
, (Span -> Loc
Span.end Span
s, Terminus
End )
]
areaSpan :: Area -> Maybe Span
areaSpan :: Area -> Maybe Span
areaSpan Area
x =
Area -> Maybe Loc
start Area
x Maybe Loc -> (Loc -> Maybe Span) -> Maybe Span
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= \Loc
a ->
Area -> Maybe Loc
end Area
x Maybe Loc -> (Loc -> Span) -> Maybe Span
forall (f :: * -> *) a b. Functor f => f a -> (a -> b) -> f b
<&> \Loc
b ->
Loc -> Loc -> Span
Span.fromTo Loc
a Loc
b
spansAsc :: Area -> [Span]
spansAsc :: Area -> [Span]
spansAsc (Area Map Loc Terminus
m) =
(Maybe Loc -> Loc -> (Maybe Loc, Maybe Span))
-> Maybe Loc -> [Loc] -> (Maybe Loc, [Maybe Span])
forall (t :: * -> *) a b c.
Traversable t =>
(a -> b -> (a, c)) -> a -> t b -> (a, t c)
mapAccumL Maybe Loc -> Loc -> (Maybe Loc, Maybe Span)
f Maybe Loc
forall a. Maybe a
Nothing (Map Loc Terminus -> [Loc]
forall k a. Map k a -> [k]
Map.keys Map Loc Terminus
m) (Maybe Loc, [Maybe Span])
-> ((Maybe Loc, [Maybe Span]) -> [Maybe Span]) -> [Maybe Span]
forall a b. a -> (a -> b) -> b
& (Maybe Loc, [Maybe Span]) -> [Maybe Span]
forall a b. (a, b) -> b
snd [Maybe Span] -> ([Maybe Span] -> [Span]) -> [Span]
forall a b. a -> (a -> b) -> b
& [Maybe Span] -> [Span]
forall a. [Maybe a] -> [a]
catMaybes
where
f :: Maybe Loc -> Loc -> (Maybe Loc, Maybe Span)
f Maybe Loc
Nothing Loc
l = (Loc -> Maybe Loc
forall a. a -> Maybe a
Just Loc
l, Maybe Span
forall a. Maybe a
Nothing)
f (Just Loc
l) Loc
l' = (Maybe Loc
forall a. Maybe a
Nothing, Span -> Maybe Span
forall a. a -> Maybe a
Just (Span -> Maybe Span) -> Span -> Maybe Span
forall a b. (a -> b) -> a -> b
$ Loc -> Loc -> Span
Span.fromTo Loc
l Loc
l')
spanCount :: Area -> Natural
spanCount :: Area -> Natural
spanCount (Area Map Loc Terminus
locs) =
Int -> Natural
forall a b. (Integral a, Num b) => a -> b
fromIntegral (Map Loc Terminus -> Int
forall (t :: * -> *) a. Foldable t => t a -> Int
Foldable.length Map Loc Terminus
locs Int -> Int -> Int
forall a. Integral a => a -> a -> a
`div` Int
2)
firstSpan :: Area -> Maybe Span
firstSpan :: Area -> Maybe Span
firstSpan (Area Map Loc Terminus
m) =
case Set Loc -> [Loc]
forall a. Set a -> [a]
Set.toAscList (Map Loc Terminus -> Set Loc
forall k a. Map k a -> Set k
Map.keysSet Map Loc Terminus
m) of
Loc
a:Loc
b:[Loc]
_ -> Span -> Maybe Span
forall a. a -> Maybe a
Just (Loc -> Loc -> Span
Span.fromTo Loc
a Loc
b)
[Loc]
_ -> Maybe Span
forall a. Maybe a
Nothing
lastSpan :: Area -> Maybe Span
lastSpan :: Area -> Maybe Span
lastSpan (Area Map Loc Terminus
m) =
case Set Loc -> [Loc]
forall a. Set a -> [a]
Set.toDescList (Map Loc Terminus -> Set Loc
forall k a. Map k a -> Set k
Map.keysSet Map Loc Terminus
m) of
Loc
b:Loc
a:[Loc]
_ -> Span -> Maybe Span
forall a. a -> Maybe a
Just (Loc -> Loc -> Span
Span.fromTo Loc
a Loc
b)
[Loc]
_ -> Maybe Span
forall a. Maybe a
Nothing
start :: Area -> Maybe Loc
start :: Area -> Maybe Loc
start (Area Map Loc Terminus
m) =
case Map Loc Terminus -> Maybe ((Loc, Terminus), Map Loc Terminus)
forall k a. Map k a -> Maybe ((k, a), Map k a)
Map.minViewWithKey Map Loc Terminus
m of
Just ((Loc
l, Terminus
_), Map Loc Terminus
_) -> Loc -> Maybe Loc
forall a. a -> Maybe a
Just Loc
l
Maybe ((Loc, Terminus), Map Loc Terminus)
Nothing -> Maybe Loc
forall a. Maybe a
Nothing
end :: Area -> Maybe Loc
end :: Area -> Maybe Loc
end (Area Map Loc Terminus
locs) =
case Map Loc Terminus -> Maybe ((Loc, Terminus), Map Loc Terminus)
forall k a. Map k a -> Maybe ((k, a), Map k a)
Map.maxViewWithKey Map Loc Terminus
locs of
Just ((Loc
l, Terminus
_), Map Loc Terminus
_) -> Loc -> Maybe Loc
forall a. a -> Maybe a
Just Loc
l
Maybe ((Loc, Terminus), Map Loc Terminus)
Nothing -> Maybe Loc
forall a. Maybe a
Nothing
(+) :: Area -> Area -> Area
Area
a + :: Area -> Area -> Area
+ Area
b
| Area -> Natural
spanCount Area
a Natural -> Natural -> Bool
forall a. Ord a => a -> a -> Bool
>= Area -> Natural
spanCount Area
b = (Span -> Area -> Area) -> Area -> [Span] -> Area
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr Span -> Area -> Area
addSpan Area
a (Area -> [Span]
spansAsc Area
b)
| Bool
otherwise = Area
b Area -> Area -> Area
+ Area
a
addSpan :: Span -> Area -> Area
addSpan :: Span -> Area -> Area
addSpan Span
b (Area Map Loc Terminus
as) =
let
unmodifiedSpansBelow :: Map Loc Terminus
unmodifiedSpansAbove :: Map Loc Terminus
startBelow :: Maybe Loc
endAbove :: Maybe Loc
middle :: Map Loc Terminus
(Map Loc Terminus
unmodifiedSpansBelow, Maybe Loc
startBelow) =
let
below :: Map Loc Terminus
below = Loc -> Map Loc Terminus -> Map Loc Terminus
forall k a. Ord k => k -> Map k a -> Map k a
Map.below (Span -> Loc
Span.start Span
b) Map Loc Terminus
as
in
case Map Loc Terminus -> Maybe ((Loc, Terminus), Map Loc Terminus)
forall k a. Map k a -> Maybe ((k, a), Map k a)
Map.maxViewWithKey Map Loc Terminus
below of
Just ((Loc
l, Terminus
Start), Map Loc Terminus
xs) -> (Map Loc Terminus
xs, Loc -> Maybe Loc
forall a. a -> Maybe a
Just Loc
l)
Maybe ((Loc, Terminus), Map Loc Terminus)
_ -> (Map Loc Terminus
below, Maybe Loc
forall a. Maybe a
Nothing)
(Map Loc Terminus
unmodifiedSpansAbove, Maybe Loc
endAbove) =
let
above :: Map Loc Terminus
above = Loc -> Map Loc Terminus -> Map Loc Terminus
forall k a. Ord k => k -> Map k a -> Map k a
Map.above (Span -> Loc
Span.end Span
b) Map Loc Terminus
as
in
case Map Loc Terminus -> Maybe ((Loc, Terminus), Map Loc Terminus)
forall k a. Map k a -> Maybe ((k, a), Map k a)
Map.minViewWithKey Map Loc Terminus
above of
Just ((Loc
l, Terminus
End), Map Loc Terminus
xs) -> (Map Loc Terminus
xs, Loc -> Maybe Loc
forall a. a -> Maybe a
Just Loc
l)
Maybe ((Loc, Terminus), Map Loc Terminus)
_ -> (Map Loc Terminus
above, Maybe Loc
forall a. Maybe a
Nothing)
middle :: Map Loc Terminus
middle = [(Loc, Terminus)] -> Map Loc Terminus
forall k a. Ord k => [(k, a)] -> Map k a
Map.fromList
[ ([Loc] -> Loc
forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
minimum ([Loc] -> Loc) -> [Loc] -> Loc
forall a b. (a -> b) -> a -> b
$ Maybe Loc -> [Loc]
forall (t :: * -> *) a. Foldable t => t a -> [a]
Foldable.toList Maybe Loc
startBelow [Loc] -> [Loc] -> [Loc]
forall a. Semigroup a => a -> a -> a
<> [Span -> Loc
Span.start Span
b], Terminus
Start)
, ([Loc] -> Loc
forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
maximum ([Loc] -> Loc) -> [Loc] -> Loc
forall a b. (a -> b) -> a -> b
$ Maybe Loc -> [Loc]
forall (t :: * -> *) a. Foldable t => t a -> [a]
Foldable.toList Maybe Loc
endAbove [Loc] -> [Loc] -> [Loc]
forall a. Semigroup a => a -> a -> a
<> [Span -> Loc
Span.end Span
b], Terminus
End)
]
in
Map Loc Terminus -> Area
Area (Map Loc Terminus -> Area) -> Map Loc Terminus -> Area
forall a b. (a -> b) -> a -> b
$ Map Loc Terminus
unmodifiedSpansBelow Map Loc Terminus -> Map Loc Terminus -> Map Loc Terminus
forall a. Semigroup a => a -> a -> a
<> Map Loc Terminus
middle Map Loc Terminus -> Map Loc Terminus -> Map Loc Terminus
forall a. Semigroup a => a -> a -> a
<> Map Loc Terminus
unmodifiedSpansAbove
(-) :: Area -> Area -> Area
Area
a - :: Area -> Area -> Area
- Area
b = (Span -> Area -> Area) -> Area -> [Span] -> Area
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr Span -> Area -> Area
subtractSpan Area
a (Area -> [Span]
spansAsc Area
b)
subtractSpan :: Span -> Area -> Area
subtractSpan :: Span -> Area -> Area
subtractSpan Span
b (Area Map Loc Terminus
as) =
let
Map Loc Terminus
resultBelow :: Map Loc Terminus =
let
below :: Map Loc Terminus
below = Loc -> Map Loc Terminus -> Map Loc Terminus
forall k a. Ord k => k -> Map k a -> Map k a
Map.belowInclusive (Span -> Loc
Span.start Span
b) Map Loc Terminus
as
in
case Map Loc Terminus -> Maybe ((Loc, Terminus), Map Loc Terminus)
forall k a. Map k a -> Maybe ((k, a), Map k a)
Map.maxViewWithKey Map Loc Terminus
below of
Just ((Loc
l, Terminus
Start), Map Loc Terminus
xs) ->
if Loc
l Loc -> Loc -> Bool
forall a. Eq a => a -> a -> Bool
== Span -> Loc
Span.start Span
b
then Map Loc Terminus
xs
else Map Loc Terminus
below Map Loc Terminus
-> (Map Loc Terminus -> Map Loc Terminus) -> Map Loc Terminus
forall a b. a -> (a -> b) -> b
& Loc -> Terminus -> Map Loc Terminus -> Map Loc Terminus
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert (Span -> Loc
Span.start Span
b) Terminus
End
Maybe ((Loc, Terminus), Map Loc Terminus)
_ -> Map Loc Terminus
below
Map Loc Terminus
resultAbove :: Map Loc Terminus =
let
above :: Map Loc Terminus
above = Loc -> Map Loc Terminus -> Map Loc Terminus
forall k a. Ord k => k -> Map k a -> Map k a
Map.aboveInclusive (Span -> Loc
Span.end Span
b) Map Loc Terminus
as
in
case Map Loc Terminus -> Maybe ((Loc, Terminus), Map Loc Terminus)
forall k a. Map k a -> Maybe ((k, a), Map k a)
Map.minViewWithKey Map Loc Terminus
above of
Just ((Loc
l, Terminus
End), Map Loc Terminus
xs) ->
if Loc
l Loc -> Loc -> Bool
forall a. Eq a => a -> a -> Bool
== Span -> Loc
Span.end Span
b
then Map Loc Terminus
xs
else Map Loc Terminus
above Map Loc Terminus
-> (Map Loc Terminus -> Map Loc Terminus) -> Map Loc Terminus
forall a b. a -> (a -> b) -> b
& Loc -> Terminus -> Map Loc Terminus -> Map Loc Terminus
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert (Span -> Loc
Span.end Span
b) Terminus
Start
Maybe ((Loc, Terminus), Map Loc Terminus)
_ -> Map Loc Terminus
above
in
Map Loc Terminus -> Area
Area (Map Loc Terminus -> Area) -> Map Loc Terminus -> Area
forall a b. (a -> b) -> a -> b
$ Map Loc Terminus
resultBelow Map Loc Terminus -> Map Loc Terminus -> Map Loc Terminus
forall a. Semigroup a => a -> a -> a
<> Map Loc Terminus
resultAbove