loc 0.1.3.3 → 0.1.3.4

raw patch · 3 files changed

+12/−6 lines, 3 filesdep ~basePVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: base

API changes (from Hackage documentation)

- Data.Loc.Exception: instance GHC.Exception.Exception Data.Loc.Exception.LocException

+ Data.Loc.Exception: instance GHC.Exception.Type.Exception Data.Loc.Exception.LocException

+ Data.Loc.Internal.Prelude: infix 4 `elem`

+ Data.Loc.Internal.Prelude: infixr 5 :|

+ Data.Loc.Internal.Prelude: infixr 6 <>

- Data.Loc.Internal.Prelude: ($) :: () => a -> b -> a -> b

+ Data.Loc.Internal.Prelude: ($) :: () => (a -> b) -> a -> b

- Data.Loc.Internal.Prelude: (&) :: () => a -> a -> b -> b

+ Data.Loc.Internal.Prelude: (&) :: () => a -> (a -> b) -> b

- Data.Loc.Internal.Prelude: (.) :: () => b -> c -> a -> b -> a -> c

+ Data.Loc.Internal.Prelude: (.) :: () => (b -> c) -> (a -> b) -> a -> c

- Data.Loc.Internal.Prelude: (<$>) :: Functor f => a -> b -> f a -> f b

+ Data.Loc.Internal.Prelude: (<$>) :: Functor f => (a -> b) -> f a -> f b

- Data.Loc.Internal.Prelude: (<*>) :: Applicative f => f a -> b -> f a -> f b

+ Data.Loc.Internal.Prelude: (<*>) :: Applicative f => f (a -> b) -> f a -> f b

- Data.Loc.Internal.Prelude: (>>=) :: Monad m => m a -> a -> m b -> m b

+ Data.Loc.Internal.Prelude: (>>=) :: Monad m => m a -> (a -> m b) -> m b

- Data.Loc.Internal.Prelude: bimap :: Bifunctor p => a -> b -> c -> d -> p a c -> p b d

+ Data.Loc.Internal.Prelude: bimap :: Bifunctor p => (a -> b) -> (c -> d) -> p a c -> p b d

- Data.Loc.Internal.Prelude: class Bifunctor (p :: * -> * -> *)

+ Data.Loc.Internal.Prelude: class Bifunctor (p :: Type -> Type -> Type)

- Data.Loc.Internal.Prelude: class Foldable (t :: * -> *)

+ Data.Loc.Internal.Prelude: class Foldable (t :: Type -> Type)

- Data.Loc.Internal.Prelude: class Functor (f :: * -> *)

+ Data.Loc.Internal.Prelude: class Functor (f :: Type -> Type)

- Data.Loc.Internal.Prelude: class Applicative m => Monad (m :: * -> *)

+ Data.Loc.Internal.Prelude: class Applicative m => Monad (m :: Type -> Type)

- Data.Loc.Internal.Prelude: first :: Bifunctor p => a -> b -> p a c -> p b c

+ Data.Loc.Internal.Prelude: first :: Bifunctor p => (a -> b) -> p a c -> p b c

- Data.Loc.Internal.Prelude: flip :: () => a -> b -> c -> b -> a -> c

+ Data.Loc.Internal.Prelude: flip :: () => (a -> b -> c) -> b -> a -> c

- Data.Loc.Internal.Prelude: fmap :: Functor f => a -> b -> f a -> f b

+ Data.Loc.Internal.Prelude: fmap :: Functor f => (a -> b) -> f a -> f b

- Data.Loc.Internal.Prelude: foldMap :: (Foldable t, Monoid m) => a -> m -> t a -> m

+ Data.Loc.Internal.Prelude: foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m

- Data.Loc.Internal.Prelude: foldl :: Foldable t => b -> a -> b -> b -> t a -> b

+ Data.Loc.Internal.Prelude: foldl :: Foldable t => (b -> a -> b) -> b -> t a -> b

- Data.Loc.Internal.Prelude: foldl' :: Foldable t => b -> a -> b -> b -> t a -> b

+ Data.Loc.Internal.Prelude: foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b

- Data.Loc.Internal.Prelude: foldl1 :: Foldable t => a -> a -> a -> t a -> a

+ Data.Loc.Internal.Prelude: foldl1 :: Foldable t => (a -> a -> a) -> t a -> a

- Data.Loc.Internal.Prelude: foldr :: Foldable t => a -> b -> b -> b -> t a -> b

+ Data.Loc.Internal.Prelude: foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b

- Data.Loc.Internal.Prelude: foldr' :: Foldable t => a -> b -> b -> b -> t a -> b

+ Data.Loc.Internal.Prelude: foldr' :: Foldable t => (a -> b -> b) -> b -> t a -> b

- Data.Loc.Internal.Prelude: foldr1 :: Foldable t => a -> a -> a -> t a -> a

+ Data.Loc.Internal.Prelude: foldr1 :: Foldable t => (a -> a -> a) -> t a -> a

- Data.Loc.Internal.Prelude: infixl 7 /

+ Data.Loc.Internal.Prelude: infixl 7 `div`

- Data.Loc.Internal.Prelude: mapAccumL :: Traversable t => a -> b -> (a, c) -> a -> t b -> (a, t c)

+ Data.Loc.Internal.Prelude: mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)

- Data.Loc.Internal.Prelude: maybe :: () => b -> a -> b -> Maybe a -> b

+ Data.Loc.Internal.Prelude: maybe :: () => b -> (a -> b) -> Maybe a -> b

- Data.Loc.Internal.Prelude: mfilter :: MonadPlus m => a -> Bool -> m a -> m a

+ Data.Loc.Internal.Prelude: mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a

- Data.Loc.Internal.Prelude: on :: () => b -> b -> c -> a -> b -> a -> a -> c

+ Data.Loc.Internal.Prelude: on :: () => (b -> b -> c) -> (a -> b) -> a -> a -> c

- Data.Loc.Internal.Prelude: readP_to_Prec :: () => Int -> ReadP a -> ReadPrec a

+ Data.Loc.Internal.Prelude: readP_to_Prec :: () => (Int -> ReadP a) -> ReadPrec a

- Data.Loc.Internal.Prelude: second :: Bifunctor p => b -> c -> p a b -> p a c

+ Data.Loc.Internal.Prelude: second :: Bifunctor p => (b -> c) -> p a b -> p a c

- Data.Loc.Internal.Prelude: sequenceA :: (Traversable t, Applicative f) => t f a -> f t a

+ Data.Loc.Internal.Prelude: sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)

- Data.Loc.Internal.Prelude: traverse :: (Traversable t, Applicative f) => a -> f b -> t a -> f t b

+ Data.Loc.Internal.Prelude: traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b)

- Data.Loc.Internal.Prelude: traverse_ :: (Foldable t, Applicative f) => a -> f b -> t a -> f ()

+ Data.Loc.Internal.Prelude: traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()

Files

loc.cabal +10/−4
src/Data/Loc.hs +1/−1
src/Data/Loc/Span.hs +1/−1

loc.cabal view

@@ -1,5 +1,5 @@ name: loc-version: 0.1.3.3+version: 0.1.3.4  synopsis: Types representing line and column positions and ranges in text files. @@ -23,6 +23,12 @@ build-type: Simple cabal-version: >= 1.10 +tested-with:+    GHC == 8.0.2+  , GHC == 8.2.2+  , GHC == 8.4.3+  , GHC == 8.6.1+ extra-source-files:     example.png     example.svg@@ -34,7 +40,7 @@   default-extensions: NoImplicitPrelude   ghc-options: -Wall   build-depends:-      base >=4.9 && <4.12+      base >=4.9 && <4.13     , containers   exposed-modules:       Data.Loc@@ -57,7 +63,7 @@   default-extensions: NoImplicitPrelude   ghc-options: -Wall -threaded   build-depends:-      base >=4.9 && <4.12+      base >=4.9 && <4.13     , containers     , doctest     , loc@@ -70,7 +76,7 @@   default-extensions: NoImplicitPrelude   ghc-options: -Wall -threaded   build-depends:-      base >=4.9 && <4.12+      base >=4.9 && <4.13     , containers     , hedgehog     , loc

src/Data/Loc.hs view

@@ -88,7 +88,7 @@  {- | Attempt to construct a 'Span' from two 'Loc's. The lesser loc will be the-start, and the greater loc will be the end. If the two locs are not equal,+start, and the greater loc will be the end. If the two locs are equal, the result is 'Nothing', because a span cannot be empty.  /This is the safe version of 'spanFromTo', which throws an exception instead./

src/Data/Loc/Span.hs view

@@ -117,7 +117,7 @@ {- |  Attempt to construct a 'Span' from two 'Loc's. The lesser loc will be the-start, and the greater loc will be the end. If the two locs are not equal,+start, and the greater loc will be the end. If the two locs are equal, the result is 'Nothing', because a span cannot be empty.  /This is the safe version of 'fromTo', which throws an exception instead./