regex-pderiv 0.1.1 → 0.1.2

raw patch · 2 files changed

+6/−5 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• Text/Regex/PDeriv/IntPattern.lhs +2/−1
• regex-pderiv.cabal +4/−4

@@ -308,7 +308,8 @@ >     | otherwise = -- p is not nested >         let pds = partDeriv (strip p) l >         in g `seq` pds `seq` if null pds then []->                              else [ (PVar x [] (PE (resToRE pds)), g) ]+>                              else -- not PCRE [ (PVar x [] (PE (resToRE pds)), g) ]+>                                   [ (PVar x [] (PE pd), g) | pd <- pds ] >     where g = updateBinderByIndex x  > {- >     | IM.null (toBinder p) = -- p is not nested

@@ -1,14 +1,14 @@ Name:                   regex-pderiv-Version:                0.1.1+Version:                0.1.2 License:                BSD3 License-File:           LICENSE-Copyright:              Copyright (c) 2010, Kenny Zhuo Ming Lu and Martin Sulzmann+Copyright:              Copyright (c) 2010-2012, Kenny Zhuo Ming Lu and Martin Sulzmann Author:                 Kenny Zhuo Ming Lu and Martin Sulzmann Maintainer:             luzhuomi@gmail.com, martin.sulzmann@gmail.com-Stability:              Alpha+Stability:              Beta Homepage:               http://code.google.com/p/xhaskell-library/ Package-URL:            http://darcs.haskell.org/packages/regex-unstable/xhaskell-library-Synopsis:               Replaces/Enhances Text.Regex+Synopsis:               Replaces/Enhances Text.Regex. Implementing regular expression matching using Antimirov's partial derivatives. The svn source also shipped with two other referential implementations, e.g. Thomspon NFA and Glushkov NFA. For more detail please check out http://code.google.com/p/xhaskell-library/ Description:            Regex algorithm implementation using partial derivatives Category:               Text Tested-With:            GHC