regex-with-pcre 1.1.0.0 → 1.1.0.1
raw patch · 3 files changed
+8/−3 lines, 3 filesdep ~regex-tdfaPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: regex-tdfa
API changes (from Hackage documentation)
- Text.RE.PCRE: anyMatches :: () => Matches a -> Bool
+ Text.RE.PCRE: anyMatches :: Matches a -> Bool
- Text.RE.PCRE: countMatches :: () => Matches a -> Int
+ Text.RE.PCRE: countMatches :: Matches a -> Int
- Text.RE.PCRE: matched :: () => Match a -> Bool
+ Text.RE.PCRE: matched :: Match a -> Bool
- Text.RE.PCRE: matchedText :: () => Match a -> Maybe a
+ Text.RE.PCRE: matchedText :: Match a -> Maybe a
- Text.RE.PCRE: matches :: () => Matches a -> [a]
+ Text.RE.PCRE: matches :: Matches a -> [a]
- Text.RE.PCRE.ByteString: anyMatches :: () => Matches a -> Bool
+ Text.RE.PCRE.ByteString: anyMatches :: Matches a -> Bool
- Text.RE.PCRE.ByteString: countMatches :: () => Matches a -> Int
+ Text.RE.PCRE.ByteString: countMatches :: Matches a -> Int
- Text.RE.PCRE.ByteString: matched :: () => Match a -> Bool
+ Text.RE.PCRE.ByteString: matched :: Match a -> Bool
- Text.RE.PCRE.ByteString: matchedText :: () => Match a -> Maybe a
+ Text.RE.PCRE.ByteString: matchedText :: Match a -> Maybe a
- Text.RE.PCRE.ByteString: matches :: () => Matches a -> [a]
+ Text.RE.PCRE.ByteString: matches :: Matches a -> [a]
- Text.RE.PCRE.ByteString.Lazy: anyMatches :: () => Matches a -> Bool
+ Text.RE.PCRE.ByteString.Lazy: anyMatches :: Matches a -> Bool
- Text.RE.PCRE.ByteString.Lazy: countMatches :: () => Matches a -> Int
+ Text.RE.PCRE.ByteString.Lazy: countMatches :: Matches a -> Int
- Text.RE.PCRE.ByteString.Lazy: matched :: () => Match a -> Bool
+ Text.RE.PCRE.ByteString.Lazy: matched :: Match a -> Bool
- Text.RE.PCRE.ByteString.Lazy: matchedText :: () => Match a -> Maybe a
+ Text.RE.PCRE.ByteString.Lazy: matchedText :: Match a -> Maybe a
- Text.RE.PCRE.ByteString.Lazy: matches :: () => Matches a -> [a]
+ Text.RE.PCRE.ByteString.Lazy: matches :: Matches a -> [a]
- Text.RE.PCRE.Sequence: anyMatches :: () => Matches a -> Bool
+ Text.RE.PCRE.Sequence: anyMatches :: Matches a -> Bool
- Text.RE.PCRE.Sequence: countMatches :: () => Matches a -> Int
+ Text.RE.PCRE.Sequence: countMatches :: Matches a -> Int
- Text.RE.PCRE.Sequence: matched :: () => Match a -> Bool
+ Text.RE.PCRE.Sequence: matched :: Match a -> Bool
- Text.RE.PCRE.Sequence: matchedText :: () => Match a -> Maybe a
+ Text.RE.PCRE.Sequence: matchedText :: Match a -> Maybe a
- Text.RE.PCRE.Sequence: matches :: () => Matches a -> [a]
+ Text.RE.PCRE.Sequence: matches :: Matches a -> [a]
- Text.RE.PCRE.String: anyMatches :: () => Matches a -> Bool
+ Text.RE.PCRE.String: anyMatches :: Matches a -> Bool
- Text.RE.PCRE.String: countMatches :: () => Matches a -> Int
+ Text.RE.PCRE.String: countMatches :: Matches a -> Int
- Text.RE.PCRE.String: matched :: () => Match a -> Bool
+ Text.RE.PCRE.String: matched :: Match a -> Bool
- Text.RE.PCRE.String: matchedText :: () => Match a -> Maybe a
+ Text.RE.PCRE.String: matchedText :: Match a -> Maybe a
- Text.RE.PCRE.String: matches :: () => Matches a -> [a]
+ Text.RE.PCRE.String: matches :: Matches a -> [a]
- Text.RE.PCRE.Text: anyMatches :: () => Matches a -> Bool
+ Text.RE.PCRE.Text: anyMatches :: Matches a -> Bool
- Text.RE.PCRE.Text: countMatches :: () => Matches a -> Int
+ Text.RE.PCRE.Text: countMatches :: Matches a -> Int
- Text.RE.PCRE.Text: matched :: () => Match a -> Bool
+ Text.RE.PCRE.Text: matched :: Match a -> Bool
- Text.RE.PCRE.Text: matchedText :: () => Match a -> Maybe a
+ Text.RE.PCRE.Text: matchedText :: Match a -> Maybe a
- Text.RE.PCRE.Text: matches :: () => Matches a -> [a]
+ Text.RE.PCRE.Text: matches :: Matches a -> [a]
- Text.RE.PCRE.Text.Lazy: anyMatches :: () => Matches a -> Bool
+ Text.RE.PCRE.Text.Lazy: anyMatches :: Matches a -> Bool
- Text.RE.PCRE.Text.Lazy: countMatches :: () => Matches a -> Int
+ Text.RE.PCRE.Text.Lazy: countMatches :: Matches a -> Int
- Text.RE.PCRE.Text.Lazy: matched :: () => Match a -> Bool
+ Text.RE.PCRE.Text.Lazy: matched :: Match a -> Bool
- Text.RE.PCRE.Text.Lazy: matchedText :: () => Match a -> Maybe a
+ Text.RE.PCRE.Text.Lazy: matchedText :: Match a -> Maybe a
- Text.RE.PCRE.Text.Lazy: matches :: () => Matches a -> [a]
+ Text.RE.PCRE.Text.Lazy: matches :: Matches a -> [a]
Files
- README.md +1/−0
- changelog +4/−0
- regex-with-pcre.cabal +3/−3
README.md view
@@ -43,6 +43,7 @@ - [X] 2018-12-18 v1.0.1.5 [TDFA quasi quoters not dealing with newlines](https://github.com/iconnect/regex/milestone/24) - [X] 2018-12-19 v1.0.2.0 [Tidy build issues](https://github.com/iconnect/regex/milestone/25) - [X] 2020-01-27 v1.1.0.0 [Adapt for MonadFail/base-4.13/GHC-8.8](https://github.com/iconnect/regex/milestone/26)+- [X] 2021-12-18 v1.1.0.1 [Fix for base-4.16.0.0/GHC 9.2.1](https://github.com/iconnect/regex/milestone/27) See the [Roadmap page](http://roadmap.regex.uk) for details.
changelog view
@@ -1,5 +1,9 @@ -*-change-log-*- +1.1.0.1 Chris Dornan <chris.dornan@irisconnect.co.uk> 2018-12-19+ * fix for base-4.16.0.0/GHC 9.2.1+ * eliminate http-conduit dependency (currently stymied by cryptonite)+ 1.1.0.0 Chris Dornan <chris.dornan@irisconnect.co.uk> 2018-12-19 * drop support for GHC 8.0 and below * adapt for base 4.13 (MonadFail)
regex-with-pcre.cabal view
@@ -1,5 +1,5 @@ Name: regex-with-pcre-Version: 1.1.0.0+Version: 1.1.0.1 Synopsis: Toolkit for regex-base Description: A regular expression toolkit for regex-base with compile-time checking of RE syntax, data types for@@ -32,7 +32,7 @@ Source-Repository this Type: git Location: https://github.com/iconnect/regex.git- Tag: 1.1.0.0+ Tag: 1.1.0.1 @@ -101,7 +101,7 @@ , containers >= 0.4 , regex-base >= 0.93 , regex-pcre-builtin >= 0.94- , regex-tdfa >= 1.2+ , regex-tdfa >= 1.3.1.0 , template-haskell >= 2.7 , text >= 1.2 , transformers >= 0.2.2