hw-balancedparens 0.4.1.2 → 0.4.1.3

raw patch · 3 files changed

+10/−9 lines, 3 filesdep ~bytestringdep ~deepseqdep ~doctestPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: bytestring, deepseq, doctest, hedgehog, optparse-applicative

API changes (from Hackage documentation)

Files

• hw-balancedparens.cabal +7/−7
• src/HaskellWorks/Data/BalancedParens/Internal/ParensSeq.hs +2/−2
• src/HaskellWorks/Data/BalancedParens/ParensSeq.hs +1/−0

@@ -1,7 +1,7 @@ cabal-version: 2.2  name:                   hw-balancedparens-version:                0.4.1.2+version:                0.4.1.3 synopsis:               Balanced parentheses description:            Balanced parentheses. category:               Data, Bit, Succinct Data Structures, Data Structures@@ -9,10 +9,10 @@ bug-reports:            https://github.com/haskell-works/hw-balancedparens/issues author:                 John Ky maintainer:             newhoggy@gmail.com-copyright:              2016-2021 John Ky+copyright:              2016-2022 John Ky license:                BSD-3-Clause license-file:           LICENSE-tested-with:            GHC == 9.2.2, GHC == 9.0.2, GHC == 8.10.7, GHC == 8.8.4, GHC == 8.6.5+tested-with:            GHC == 9.4.2, GHC == 9.2.4, GHC == 9.0.2, GHC == 8.10.7, GHC == 8.8.4, GHC == 8.6.5 build-type:             Simple extra-source-files:     README.md @@ -23,14 +23,14 @@ common base                       { build-depends: base                       >= 4.11       && < 5      }  common bytestring                 { build-depends: bytestring                 >= 0.9        && < 0.12   }-common criterion                  { build-depends: criterion                  >= 1.2        && < 1.6    }+common criterion                  { build-depends: criterion                  >= 1.2        && < 1.7    } common deepseq                    { build-depends: deepseq                    >= 1.4.2.0    && < 1.5    } common directory                  { build-depends: directory                  >= 1.2.2      && < 1.4    } common doctest                    { build-depends: doctest                    >= 0.16.2     && < 0.21   } common doctest-discover           { build-depends: doctest-discover           >= 0.2        && < 0.3    } common generic-lens               { build-depends: generic-lens               >= 1.2.0.0    && < 2.3    }-common hedgehog                   { build-depends: hedgehog                   >= 1.0        && < 1.2    }-common hspec                      { build-depends: hspec                      >= 2.2        && < 3.0    }+common hedgehog                   { build-depends: hedgehog                   >= 1.0        && < 1.3    }+common hspec                      { build-depends: hspec                      >= 2.2        && < 3      } common hw-hspec-hedgehog          { build-depends: hw-hspec-hedgehog          >= 0.1        && < 0.2    } common hw-bits                    { build-depends: hw-bits                    >= 0.7.2.1    && < 0.8    } common hw-excess                  { build-depends: hw-excess                  >= 0.2.2.0    && < 0.3    }@@ -42,7 +42,7 @@ common mmap                       { build-depends: mmap                       >= 0.5.9      && < 0.6    } common optparse-applicative       { build-depends: optparse-applicative       >= 0.14       && < 0.18   } common transformers               { build-depends: transformers               >= 0.5.6.2    && < 0.7    }-common vector                     { build-depends: vector                     >= 0.12       && < 0.13   }+common vector                     { build-depends: vector                     >= 0.12       && < 0.14   }  common hw-balancedparens   build-depends:        hw-balancedparens

@@ -123,7 +123,7 @@           else 0  atSizeBelowZero :: Count -> Measure -> Bool-atSizeBelowZero n m = n < size (m :: Measure)+atSizeBelowZero n (Measure { size = sz }) = n < sz  atMinZero :: Measure -> Bool-atMinZero m = min (m :: Measure) <= 0+atMinZero (Measure { min = m }) = m <= 0

@@ -30,6 +30,7 @@  import qualified Data.List                                           as L import qualified HaskellWorks.Data.BalancedParens.Internal.ParensSeq as PS+  hiding ( Elem(size) ) import qualified HaskellWorks.Data.BalancedParens.Internal.Word      as W import qualified HaskellWorks.Data.FingerTree                        as FT