packages feed

Earley 0.12.0.0 → 0.12.0.1

raw patch · 3 files changed

+11/−5 lines, 3 filesdep ~basePVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base

API changes (from Hackage documentation)

Files

CHANGELOG.md view
@@ -1,5 +1,9 @@ # Unreleased +# 0.12.0.1++- Update 'base' dependency bounds+ # 0.12.0.0  - Add the `Generator` module for generating grammar members
Earley.cabal view
@@ -1,5 +1,5 @@ name:                Earley-version:             0.12.0.0+version:             0.12.0.1 synopsis:            Parsing all context-free grammars using Earley's algorithm. description:         See <https://www.github.com/ollef/Earley> for more                      information and@@ -9,11 +9,11 @@ license-file:        LICENSE author:              Olle Fredriksson maintainer:          fredriksson.olle@gmail.com-copyright:           (c) 2014-2016 Olle Fredriksson+copyright:           (c) 2014-2017 Olle Fredriksson category:            Parsing build-type:          Simple cabal-version:       >=1.10-tested-with:         GHC ==7.6.*, GHC==7.8.*, GHC==7.10.*, GHC==8.0.*, GHC==8.1.*+tested-with:         GHC ==7.6.3, GHC==7.8.4, GHC==7.10.3, GHC==8.0.2, GHC==8.2.1  extra-source-files:                       README.md@@ -38,7 +38,7 @@                        Text.Earley.Mixfix,                        Text.Earley.Parser,                        Text.Earley.Parser.Internal-  build-depends:       base >=4.6 && <4.10, ListLike >=4.1+  build-depends:       base >=4.6 && <4.11, ListLike >=4.1   default-language:    Haskell2010   ghc-options:         -Wall                        -funbox-strict-fields@@ -125,6 +125,8 @@   other-modules:                        Text.Earley,                        Text.Earley.Derived,+                       Text.Earley.Generator,+                       Text.Earley.Generator.Internal,                        Text.Earley.Grammar,                        Text.Earley.Parser,                        Text.Earley.Parser.Internal
Text/Earley/Derived.hs view
@@ -26,7 +26,7 @@ -- | Match a list of tokens in sequence. {-# INLINE list #-} list :: Eq t => [t] -> Prod r e t [t]-list = foldr (liftA2 (:) . satisfy . (==)) (pure [])+list = listLike  -- | Match a 'ListLike' of tokens in sequence. {-# INLINE listLike #-}