regex-tdfa 1.2.3 → 1.2.3.1
raw patch · 4 files changed
+32/−16 lines, 4 filesdep ~arraydep ~bytestringdep ~containersPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: array, bytestring, containers, mtl, parsec
API changes (from Hackage documentation)
- Data.IntMap.CharMap2: instance Data.Semigroup.Semigroup (Data.IntMap.CharMap2.CharMap a)
- Data.IntMap.EnumMap2: instance GHC.Classes.Ord k => Data.Semigroup.Semigroup (Data.IntMap.EnumMap2.EnumMap k a)
- Data.IntSet.EnumSet2: instance Data.Semigroup.Semigroup (Data.IntSet.EnumSet2.EnumSet e)
- Text.Regex.TDFA.CorePattern: instance Data.Semigroup.Semigroup Text.Regex.TDFA.CorePattern.SetTestInfo
+ Data.IntMap.CharMap2: instance GHC.Base.Semigroup (Data.IntMap.CharMap2.CharMap a)
+ Data.IntMap.EnumMap2: instance GHC.Classes.Ord k => GHC.Base.Semigroup (Data.IntMap.EnumMap2.EnumMap k a)
+ Data.IntSet.EnumSet2: instance GHC.Base.Semigroup (Data.IntSet.EnumSet2.EnumSet e)
+ Text.Regex.TDFA: CompOption :: Bool -> Bool -> Bool -> Bool -> Bool -> CompOption
+ Text.Regex.TDFA: ExecOption :: Bool -> ExecOption
+ Text.Regex.TDFA: [captureGroups] :: ExecOption -> Bool
+ Text.Regex.TDFA: [caseSensitive] :: CompOption -> Bool
+ Text.Regex.TDFA: [lastStarGreedy] :: CompOption -> Bool
+ Text.Regex.TDFA: [multiline] :: CompOption -> Bool
+ Text.Regex.TDFA: [newSyntax] :: CompOption -> Bool
+ Text.Regex.TDFA: [rightAssoc] :: CompOption -> Bool
+ Text.Regex.TDFA: data CompOption
+ Text.Regex.TDFA: data ExecOption
+ Text.Regex.TDFA: data Regex
+ Text.Regex.TDFA.CorePattern: instance GHC.Base.Semigroup Text.Regex.TDFA.CorePattern.SetTestInfo
- Data.IntMap.EnumMap2: (!) :: (Enum key) => EnumMap key a -> key -> a
+ Data.IntMap.EnumMap2: (!) :: Enum key => EnumMap key a -> key -> a
- Data.IntMap.EnumMap2: (\\) :: (Enum key) => EnumMap key a -> EnumMap key b -> EnumMap key a
+ Data.IntMap.EnumMap2: (\\) :: Enum key => EnumMap key a -> EnumMap key b -> EnumMap key a
- Data.IntMap.EnumMap2: adjust :: (Enum key) => (a -> a) -> key -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: adjust :: Enum key => (a -> a) -> key -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: adjustWithKey :: (Enum key) => (key -> a -> a) -> key -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: adjustWithKey :: Enum key => (key -> a -> a) -> key -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: assocs :: (Enum key) => EnumMap key a -> [(key, a)]
+ Data.IntMap.EnumMap2: assocs :: Enum key => EnumMap key a -> [(key, a)]
- Data.IntMap.EnumMap2: delete :: (Enum key) => key -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: delete :: Enum key => key -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: difference :: (Enum key) => EnumMap key a -> EnumMap key b -> EnumMap key a
+ Data.IntMap.EnumMap2: difference :: Enum key => EnumMap key a -> EnumMap key b -> EnumMap key a
- Data.IntMap.EnumMap2: differenceWith :: (Enum key) => (a -> b -> Maybe a) -> EnumMap key a -> EnumMap key b -> EnumMap key a
+ Data.IntMap.EnumMap2: differenceWith :: Enum key => (a -> b -> Maybe a) -> EnumMap key a -> EnumMap key b -> EnumMap key a
- Data.IntMap.EnumMap2: differenceWithKey :: (Enum key) => (key -> a -> b -> Maybe a) -> EnumMap key a -> EnumMap key b -> EnumMap key a
+ Data.IntMap.EnumMap2: differenceWithKey :: Enum key => (key -> a -> b -> Maybe a) -> EnumMap key a -> EnumMap key b -> EnumMap key a
- Data.IntMap.EnumMap2: elems :: (Enum key) => EnumMap key a -> [a]
+ Data.IntMap.EnumMap2: elems :: Enum key => EnumMap key a -> [a]
- Data.IntMap.EnumMap2: empty :: (Enum key) => EnumMap key a
+ Data.IntMap.EnumMap2: empty :: Enum key => EnumMap key a
- Data.IntMap.EnumMap2: filter :: (Enum key) => (a -> Bool) -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: filter :: Enum key => (a -> Bool) -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: filterWithKey :: (Enum key) => (key -> a -> Bool) -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: filterWithKey :: Enum key => (key -> a -> Bool) -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: findWithDefault :: (Enum key) => a -> key -> EnumMap key a -> a
+ Data.IntMap.EnumMap2: findWithDefault :: Enum key => a -> key -> EnumMap key a -> a
- Data.IntMap.EnumMap2: fold :: (Enum key) => (a -> b -> b) -> b -> EnumMap key a -> b
+ Data.IntMap.EnumMap2: fold :: Enum key => (a -> b -> b) -> b -> EnumMap key a -> b
- Data.IntMap.EnumMap2: foldWithKey :: (Enum key) => (key -> a -> b -> b) -> b -> EnumMap key a -> b
+ Data.IntMap.EnumMap2: foldWithKey :: Enum key => (key -> a -> b -> b) -> b -> EnumMap key a -> b
- Data.IntMap.EnumMap2: fromAscList :: (Enum key) => [(key, a)] -> EnumMap key a
+ Data.IntMap.EnumMap2: fromAscList :: Enum key => [(key, a)] -> EnumMap key a
- Data.IntMap.EnumMap2: fromAscListWith :: (Enum key) => (a -> a -> a) -> [(key, a)] -> EnumMap key a
+ Data.IntMap.EnumMap2: fromAscListWith :: Enum key => (a -> a -> a) -> [(key, a)] -> EnumMap key a
- Data.IntMap.EnumMap2: fromAscListWithKey :: (Enum key) => (key -> a -> a -> a) -> [(key, a)] -> EnumMap key a
+ Data.IntMap.EnumMap2: fromAscListWithKey :: Enum key => (key -> a -> a -> a) -> [(key, a)] -> EnumMap key a
- Data.IntMap.EnumMap2: fromDistinctAscList :: (Enum key) => [(key, a)] -> EnumMap key a
+ Data.IntMap.EnumMap2: fromDistinctAscList :: Enum key => [(key, a)] -> EnumMap key a
- Data.IntMap.EnumMap2: fromList :: (Enum key) => [(key, a)] -> EnumMap key a
+ Data.IntMap.EnumMap2: fromList :: Enum key => [(key, a)] -> EnumMap key a
- Data.IntMap.EnumMap2: fromListWith :: (Enum key) => (a -> a -> a) -> [(key, a)] -> EnumMap key a
+ Data.IntMap.EnumMap2: fromListWith :: Enum key => (a -> a -> a) -> [(key, a)] -> EnumMap key a
- Data.IntMap.EnumMap2: fromListWithKey :: (Enum key) => (key -> a -> a -> a) -> [(key, a)] -> EnumMap key a
+ Data.IntMap.EnumMap2: fromListWithKey :: Enum key => (key -> a -> a -> a) -> [(key, a)] -> EnumMap key a
- Data.IntMap.EnumMap2: insert :: (Enum key) => key -> a -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: insert :: Enum key => key -> a -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: insertLookupWithKey :: (Enum key) => (key -> a -> a -> a) -> key -> a -> EnumMap key a -> (Maybe a, EnumMap key a)
+ Data.IntMap.EnumMap2: insertLookupWithKey :: Enum key => (key -> a -> a -> a) -> key -> a -> EnumMap key a -> (Maybe a, EnumMap key a)
- Data.IntMap.EnumMap2: insertWith :: (Enum key) => (a -> a -> a) -> key -> a -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: insertWith :: Enum key => (a -> a -> a) -> key -> a -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: insertWithKey :: (Enum key) => (key -> a -> a -> a) -> key -> a -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: insertWithKey :: Enum key => (key -> a -> a -> a) -> key -> a -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: intersection :: (Enum key) => EnumMap key a -> EnumMap key b -> EnumMap key a
+ Data.IntMap.EnumMap2: intersection :: Enum key => EnumMap key a -> EnumMap key b -> EnumMap key a
- Data.IntMap.EnumMap2: intersectionWith :: (Enum key) => (a -> b -> a) -> EnumMap key a -> EnumMap key b -> EnumMap key a
+ Data.IntMap.EnumMap2: intersectionWith :: Enum key => (a -> b -> a) -> EnumMap key a -> EnumMap key b -> EnumMap key a
- Data.IntMap.EnumMap2: intersectionWithKey :: (Enum key) => (key -> a -> b -> a) -> EnumMap key a -> EnumMap key b -> EnumMap key a
+ Data.IntMap.EnumMap2: intersectionWithKey :: Enum key => (key -> a -> b -> a) -> EnumMap key a -> EnumMap key b -> EnumMap key a
- Data.IntMap.EnumMap2: isProperSubmapOfBy :: (Enum key) => (a -> b -> Bool) -> EnumMap key a -> EnumMap key b -> Bool
+ Data.IntMap.EnumMap2: isProperSubmapOfBy :: Enum key => (a -> b -> Bool) -> EnumMap key a -> EnumMap key b -> Bool
- Data.IntMap.EnumMap2: isSubmapOfBy :: (Enum key) => (a -> b -> Bool) -> EnumMap key a -> EnumMap key b -> Bool
+ Data.IntMap.EnumMap2: isSubmapOfBy :: Enum key => (a -> b -> Bool) -> EnumMap key a -> EnumMap key b -> Bool
- Data.IntMap.EnumMap2: keys :: (Enum key) => EnumMap key a -> [key]
+ Data.IntMap.EnumMap2: keys :: Enum key => EnumMap key a -> [key]
- Data.IntMap.EnumMap2: keysSet :: (Enum key) => EnumMap key a -> EnumSet key
+ Data.IntMap.EnumMap2: keysSet :: Enum key => EnumMap key a -> EnumSet key
- Data.IntMap.EnumMap2: lookup :: (Enum key) => key -> EnumMap key a -> Maybe a
+ Data.IntMap.EnumMap2: lookup :: Enum key => key -> EnumMap key a -> Maybe a
- Data.IntMap.EnumMap2: map :: (Enum key) => (a -> b) -> EnumMap key a -> EnumMap key b
+ Data.IntMap.EnumMap2: map :: Enum key => (a -> b) -> EnumMap key a -> EnumMap key b
- Data.IntMap.EnumMap2: mapAccum :: (Enum key) => (a -> b -> (a, c)) -> a -> EnumMap key b -> (a, EnumMap key c)
+ Data.IntMap.EnumMap2: mapAccum :: Enum key => (a -> b -> (a, c)) -> a -> EnumMap key b -> (a, EnumMap key c)
- Data.IntMap.EnumMap2: mapAccumWithKey :: (Enum key) => (a -> key -> b -> (a, c)) -> a -> EnumMap key b -> (a, EnumMap key c)
+ Data.IntMap.EnumMap2: mapAccumWithKey :: Enum key => (a -> key -> b -> (a, c)) -> a -> EnumMap key b -> (a, EnumMap key c)
- Data.IntMap.EnumMap2: mapEither :: (Enum key) => (a -> Either b c) -> EnumMap key a -> (EnumMap key b, EnumMap key c)
+ Data.IntMap.EnumMap2: mapEither :: Enum key => (a -> Either b c) -> EnumMap key a -> (EnumMap key b, EnumMap key c)
- Data.IntMap.EnumMap2: mapEitherWithKey :: (Enum key) => (key -> a -> Either b c) -> EnumMap key a -> (EnumMap key b, EnumMap key c)
+ Data.IntMap.EnumMap2: mapEitherWithKey :: Enum key => (key -> a -> Either b c) -> EnumMap key a -> (EnumMap key b, EnumMap key c)
- Data.IntMap.EnumMap2: mapMaybe :: (Enum key) => (a -> Maybe b) -> EnumMap key a -> EnumMap key b
+ Data.IntMap.EnumMap2: mapMaybe :: Enum key => (a -> Maybe b) -> EnumMap key a -> EnumMap key b
- Data.IntMap.EnumMap2: mapMaybeWithKey :: (Enum key) => (key -> a -> Maybe b) -> EnumMap key a -> EnumMap key b
+ Data.IntMap.EnumMap2: mapMaybeWithKey :: Enum key => (key -> a -> Maybe b) -> EnumMap key a -> EnumMap key b
- Data.IntMap.EnumMap2: mapWithKey :: (Enum key) => (key -> a -> b) -> EnumMap key a -> EnumMap key b
+ Data.IntMap.EnumMap2: mapWithKey :: Enum key => (key -> a -> b) -> EnumMap key a -> EnumMap key b
- Data.IntMap.EnumMap2: member :: (Enum key) => key -> EnumMap key a -> Bool
+ Data.IntMap.EnumMap2: member :: Enum key => key -> EnumMap key a -> Bool
- Data.IntMap.EnumMap2: notMember :: (Enum key) => key -> EnumMap key a -> Bool
+ Data.IntMap.EnumMap2: notMember :: Enum key => key -> EnumMap key a -> Bool
- Data.IntMap.EnumMap2: null :: (Enum key) => EnumMap key a -> Bool
+ Data.IntMap.EnumMap2: null :: Enum key => EnumMap key a -> Bool
- Data.IntMap.EnumMap2: partition :: (Enum key) => (a -> Bool) -> EnumMap key a -> (EnumMap key a, EnumMap key a)
+ Data.IntMap.EnumMap2: partition :: Enum key => (a -> Bool) -> EnumMap key a -> (EnumMap key a, EnumMap key a)
- Data.IntMap.EnumMap2: partitionWithKey :: (Enum key) => (key -> a -> Bool) -> EnumMap key a -> (EnumMap key a, EnumMap key a)
+ Data.IntMap.EnumMap2: partitionWithKey :: Enum key => (key -> a -> Bool) -> EnumMap key a -> (EnumMap key a, EnumMap key a)
- Data.IntMap.EnumMap2: singleton :: (Enum key) => key -> a -> EnumMap key a
+ Data.IntMap.EnumMap2: singleton :: Enum key => key -> a -> EnumMap key a
- Data.IntMap.EnumMap2: size :: (Enum key) => EnumMap key a -> Int
+ Data.IntMap.EnumMap2: size :: Enum key => EnumMap key a -> Int
- Data.IntMap.EnumMap2: split :: (Enum key) => key -> EnumMap key a -> (EnumMap key a, EnumMap key a)
+ Data.IntMap.EnumMap2: split :: Enum key => key -> EnumMap key a -> (EnumMap key a, EnumMap key a)
- Data.IntMap.EnumMap2: splitLookup :: (Enum key) => key -> EnumMap key a -> (EnumMap key a, Maybe a, EnumMap key a)
+ Data.IntMap.EnumMap2: splitLookup :: Enum key => key -> EnumMap key a -> (EnumMap key a, Maybe a, EnumMap key a)
- Data.IntMap.EnumMap2: toAscList :: (Enum key) => EnumMap key a -> [(key, a)]
+ Data.IntMap.EnumMap2: toAscList :: Enum key => EnumMap key a -> [(key, a)]
- Data.IntMap.EnumMap2: toList :: (Enum key) => EnumMap key a -> [(key, a)]
+ Data.IntMap.EnumMap2: toList :: Enum key => EnumMap key a -> [(key, a)]
- Data.IntMap.EnumMap2: union :: (Enum key) => EnumMap key a -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: union :: Enum key => EnumMap key a -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: unionWith :: (Enum key) => (a -> a -> a) -> EnumMap key a -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: unionWith :: Enum key => (a -> a -> a) -> EnumMap key a -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: unionWithKey :: (Enum key) => (key -> a -> a -> a) -> EnumMap key a -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: unionWithKey :: Enum key => (key -> a -> a -> a) -> EnumMap key a -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: unions :: (Enum key) => [EnumMap key a] -> EnumMap key a
+ Data.IntMap.EnumMap2: unions :: Enum key => [EnumMap key a] -> EnumMap key a
- Data.IntMap.EnumMap2: unionsWith :: (Enum key) => (a -> a -> a) -> [EnumMap key a] -> EnumMap key a
+ Data.IntMap.EnumMap2: unionsWith :: Enum key => (a -> a -> a) -> [EnumMap key a] -> EnumMap key a
- Data.IntMap.EnumMap2: update :: (Enum key) => (a -> Maybe a) -> key -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: update :: Enum key => (a -> Maybe a) -> key -> EnumMap key a -> EnumMap key a
- Data.IntMap.EnumMap2: updateLookupWithKey :: (Enum key) => (key -> a -> Maybe a) -> key -> EnumMap key a -> (Maybe a, EnumMap key a)
+ Data.IntMap.EnumMap2: updateLookupWithKey :: Enum key => (key -> a -> Maybe a) -> key -> EnumMap key a -> (Maybe a, EnumMap key a)
- Data.IntMap.EnumMap2: updateWithKey :: (Enum key) => (key -> a -> Maybe a) -> key -> EnumMap key a -> EnumMap key a
+ Data.IntMap.EnumMap2: updateWithKey :: Enum key => (key -> a -> Maybe a) -> key -> EnumMap key a -> EnumMap key a
- Data.IntSet.EnumSet2: (\\) :: (Enum e) => EnumSet e -> EnumSet e -> EnumSet e
+ Data.IntSet.EnumSet2: (\\) :: Enum e => EnumSet e -> EnumSet e -> EnumSet e
- Data.IntSet.EnumSet2: delete :: (Enum e) => e -> EnumSet e -> EnumSet e
+ Data.IntSet.EnumSet2: delete :: Enum e => e -> EnumSet e -> EnumSet e
- Data.IntSet.EnumSet2: difference :: (Enum e) => EnumSet e -> EnumSet e -> EnumSet e
+ Data.IntSet.EnumSet2: difference :: Enum e => EnumSet e -> EnumSet e -> EnumSet e
- Data.IntSet.EnumSet2: elems :: (Enum e) => EnumSet e -> [e]
+ Data.IntSet.EnumSet2: elems :: Enum e => EnumSet e -> [e]
- Data.IntSet.EnumSet2: empty :: (Enum e) => EnumSet e
+ Data.IntSet.EnumSet2: empty :: Enum e => EnumSet e
- Data.IntSet.EnumSet2: filter :: (Enum e) => (e -> Bool) -> EnumSet e -> EnumSet e
+ Data.IntSet.EnumSet2: filter :: Enum e => (e -> Bool) -> EnumSet e -> EnumSet e
- Data.IntSet.EnumSet2: fold :: (Enum e) => (e -> b -> b) -> b -> EnumSet e -> b
+ Data.IntSet.EnumSet2: fold :: Enum e => (e -> b -> b) -> b -> EnumSet e -> b
- Data.IntSet.EnumSet2: fromAscList :: (Enum e) => [e] -> EnumSet e
+ Data.IntSet.EnumSet2: fromAscList :: Enum e => [e] -> EnumSet e
- Data.IntSet.EnumSet2: fromDistinctAscList :: (Enum e) => [e] -> EnumSet e
+ Data.IntSet.EnumSet2: fromDistinctAscList :: Enum e => [e] -> EnumSet e
- Data.IntSet.EnumSet2: fromList :: (Enum e) => [e] -> EnumSet e
+ Data.IntSet.EnumSet2: fromList :: Enum e => [e] -> EnumSet e
- Data.IntSet.EnumSet2: insert :: (Enum e) => e -> EnumSet e -> EnumSet e
+ Data.IntSet.EnumSet2: insert :: Enum e => e -> EnumSet e -> EnumSet e
- Data.IntSet.EnumSet2: intersection :: (Enum e) => EnumSet e -> EnumSet e -> EnumSet e
+ Data.IntSet.EnumSet2: intersection :: Enum e => EnumSet e -> EnumSet e -> EnumSet e
- Data.IntSet.EnumSet2: isProperSubsetOf :: (Enum e) => EnumSet e -> EnumSet e -> Bool
+ Data.IntSet.EnumSet2: isProperSubsetOf :: Enum e => EnumSet e -> EnumSet e -> Bool
- Data.IntSet.EnumSet2: isSubsetOf :: (Enum e) => EnumSet e -> EnumSet e -> Bool
+ Data.IntSet.EnumSet2: isSubsetOf :: Enum e => EnumSet e -> EnumSet e -> Bool
- Data.IntSet.EnumSet2: map :: (Enum e) => (e -> e) -> EnumSet e -> EnumSet e
+ Data.IntSet.EnumSet2: map :: Enum e => (e -> e) -> EnumSet e -> EnumSet e
- Data.IntSet.EnumSet2: member :: (Enum e) => e -> EnumSet e -> Bool
+ Data.IntSet.EnumSet2: member :: Enum e => e -> EnumSet e -> Bool
- Data.IntSet.EnumSet2: notMember :: (Enum e) => Int -> EnumSet e -> Bool
+ Data.IntSet.EnumSet2: notMember :: Enum e => Int -> EnumSet e -> Bool
- Data.IntSet.EnumSet2: null :: (Enum e) => EnumSet e -> Bool
+ Data.IntSet.EnumSet2: null :: Enum e => EnumSet e -> Bool
- Data.IntSet.EnumSet2: partition :: (Enum e) => (e -> Bool) -> EnumSet e -> (EnumSet e, EnumSet e)
+ Data.IntSet.EnumSet2: partition :: Enum e => (e -> Bool) -> EnumSet e -> (EnumSet e, EnumSet e)
- Data.IntSet.EnumSet2: showTree :: (Enum e) => EnumSet e -> String
+ Data.IntSet.EnumSet2: showTree :: Enum e => EnumSet e -> String
- Data.IntSet.EnumSet2: showTreeWith :: (Enum e) => Bool -> Bool -> EnumSet e -> String
+ Data.IntSet.EnumSet2: showTreeWith :: Enum e => Bool -> Bool -> EnumSet e -> String
- Data.IntSet.EnumSet2: singleton :: (Enum e) => e -> EnumSet e
+ Data.IntSet.EnumSet2: singleton :: Enum e => e -> EnumSet e
- Data.IntSet.EnumSet2: size :: (Enum e) => EnumSet e -> Int
+ Data.IntSet.EnumSet2: size :: Enum e => EnumSet e -> Int
- Data.IntSet.EnumSet2: split :: (Enum e) => e -> EnumSet e -> (EnumSet e, EnumSet e)
+ Data.IntSet.EnumSet2: split :: Enum e => e -> EnumSet e -> (EnumSet e, EnumSet e)
- Data.IntSet.EnumSet2: splitMember :: (Enum e) => e -> EnumSet e -> (EnumSet e, Bool, EnumSet e)
+ Data.IntSet.EnumSet2: splitMember :: Enum e => e -> EnumSet e -> (EnumSet e, Bool, EnumSet e)
- Data.IntSet.EnumSet2: toAscList :: (Enum e) => EnumSet e -> [e]
+ Data.IntSet.EnumSet2: toAscList :: Enum e => EnumSet e -> [e]
- Data.IntSet.EnumSet2: toList :: (Enum e) => EnumSet e -> [e]
+ Data.IntSet.EnumSet2: toList :: Enum e => EnumSet e -> [e]
- Data.IntSet.EnumSet2: union :: (Enum e) => EnumSet e -> EnumSet e -> EnumSet e
+ Data.IntSet.EnumSet2: union :: Enum e => EnumSet e -> EnumSet e -> EnumSet e
- Data.IntSet.EnumSet2: unions :: (Enum e) => [EnumSet e] -> EnumSet e
+ Data.IntSet.EnumSet2: unions :: Enum e => [EnumSet e] -> EnumSet e
- Text.Regex.TDFA.Common: Instructions :: ![(Tag, Action)] -> !(Maybe (Position -> OrbitTransformer)) -> Instructions
+ Text.Regex.TDFA.Common: Instructions :: ![(Tag, Action)] -> !Maybe (Position -> OrbitTransformer) -> Instructions
- Text.Regex.TDFA.Common: Orbits :: !Bool -> Position -> (Maybe Int) -> !(Seq Position) -> Orbits
+ Text.Regex.TDFA.Common: Orbits :: !Bool -> Position -> Maybe Int -> !Seq Position -> Orbits
- Text.Regex.TDFA.Common: WinTest :: WhichTest -> (Maybe WinEmpty) -> (Maybe WinEmpty) -> WinEmpty
+ Text.Regex.TDFA.Common: WinTest :: WhichTest -> Maybe WinEmpty -> Maybe WinEmpty -> WinEmpty
- Text.Regex.TDFA.Common: [getOrbits] :: Orbits -> !(Seq Position)
+ Text.Regex.TDFA.Common: [getOrbits] :: Orbits -> !Seq Position
- Text.Regex.TDFA.Common: [newOrbits] :: Instructions -> !(Maybe (Position -> OrbitTransformer))
+ Text.Regex.TDFA.Common: [newOrbits] :: Instructions -> !Maybe (Position -> OrbitTransformer)
- Text.Regex.TDFA.Common: [ordinal] :: Orbits -> (Maybe Int)
+ Text.Regex.TDFA.Common: [ordinal] :: Orbits -> Maybe Int
- Text.Regex.TDFA.Common: mapFst :: (Functor f) => (t -> t2) -> f (t, t1) -> f (t2, t1)
+ Text.Regex.TDFA.Common: mapFst :: Functor f => (t -> t2) -> f (t, t1) -> f (t2, t1)
- Text.Regex.TDFA.Common: mapSnd :: (Functor f) => (t1 -> t2) -> f (t, t1) -> f (t, t2)
+ Text.Regex.TDFA.Common: mapSnd :: Functor f => (t1 -> t2) -> f (t, t1) -> f (t, t2)
- Text.Regex.TDFA.Common: norep :: (Eq a) => [a] -> [a]
+ Text.Regex.TDFA.Common: norep :: Eq a => [a] -> [a]
- Text.Regex.TDFA.Pattern: PBound :: Int -> (Maybe Int) -> Pattern -> Pattern
+ Text.Regex.TDFA.Pattern: PBound :: Int -> Maybe Int -> Pattern -> Pattern
- Text.Regex.TDFA.Pattern: PGroup :: (Maybe GroupIndex) -> Pattern -> Pattern
+ Text.Regex.TDFA.Pattern: PGroup :: Maybe GroupIndex -> Pattern -> Pattern
- Text.Regex.TDFA.Pattern: PatternSet :: (Maybe (Set Char)) -> (Maybe (Set PatternSetCharacterClass)) -> (Maybe (Set PatternSetCollatingElement)) -> (Maybe (Set PatternSetEquivalenceClass)) -> PatternSet
+ Text.Regex.TDFA.Pattern: PatternSet :: Maybe (Set Char) -> Maybe (Set PatternSetCharacterClass) -> Maybe (Set PatternSetCollatingElement) -> Maybe (Set PatternSetEquivalenceClass) -> PatternSet
- Text.Regex.TDFA.Sequence: compile :: CompOption -> ExecOption -> (Seq Char) -> Either String Regex
+ Text.Regex.TDFA.Sequence: compile :: CompOption -> ExecOption -> Seq Char -> Either String Regex
- Text.Regex.TDFA.Sequence: execute :: Regex -> (Seq Char) -> Either String (Maybe MatchArray)
+ Text.Regex.TDFA.Sequence: execute :: Regex -> Seq Char -> Either String (Maybe MatchArray)
- Text.Regex.TDFA.Sequence: regexec :: Regex -> (Seq Char) -> Either String (Maybe ((Seq Char), (Seq Char), (Seq Char), [(Seq Char)]))
+ Text.Regex.TDFA.Sequence: regexec :: Regex -> Seq Char -> Either String (Maybe (Seq Char, Seq Char, Seq Char, [Seq Char]))
Files
- CHANGELOG.md +4/−0
- Data/IntMap/CharMap2.hs +9/−4
- Data/IntMap/EnumMap2.hs +11/−4
- regex-tdfa.cabal +8/−8
CHANGELOG.md view
@@ -1,3 +1,7 @@+# 1.2.3.1++* Compatibility with `containers-0.6`.+ # 1.2.3 * Added `Semigroup` instances for some types (h/t Herbert Valerio Riedel).
Data/IntMap/CharMap2.hs view
@@ -9,6 +9,11 @@ import Data.Char as C(ord) import Data.List as L (map) import qualified Data.IntMap as M+#if MIN_VERSION_containers(0,6,0)+import qualified Data.IntMap.Internal.Debug as MD+#else+import qualified Data.IntMap as MD+#endif import qualified Data.IntSet as S(IntSet) import Data.Semigroup as Sem @@ -150,10 +155,10 @@ f' a1 b a2 = f a1 (unsafeChr b) a2 fold :: (a -> b -> b) -> b -> CharMap a -> b-fold f a (CharMap m) = M.fold f a m+fold f a (CharMap m) = M.foldr f a m foldWithKey :: (Key -> a -> b -> b) -> b -> CharMap a -> b-foldWithKey f a (CharMap m) = M.foldWithKey f' a m+foldWithKey f a (CharMap m) = M.foldrWithKey f' a m where f' b a1 a2 = f (unsafeChr b) a1 a2 elems :: CharMap a -> [a]@@ -250,10 +255,10 @@ isProperSubmapOfBy f (CharMap m1) (CharMap m2) = M.isProperSubmapOfBy f m1 m2 showTree :: Show a => CharMap a -> String-showTree (CharMap m) = M.showTree m+showTree (CharMap m) = MD.showTree m showTreeWith :: Show a => Bool -> Bool -> CharMap a -> String-showTreeWith b1 b2 (CharMap m) = M.showTreeWith b1 b2 m+showTreeWith b1 b2 (CharMap m) = MD.showTreeWith b1 b2 m {-# INLINE (!) #-} {-# INLINE (\\) #-} {-# INLINE null #-}
Data/IntMap/EnumMap2.hs view
@@ -1,7 +1,14 @@+{-# LANGUAGE CPP #-}+ module Data.IntMap.EnumMap2 where import Data.Foldable(Foldable(..)) import qualified Data.IntMap as M+#if MIN_VERSION_containers(0,6,0)+import qualified Data.IntMap.Internal.Debug as MD+#else+import qualified Data.IntMap as MD+#endif import qualified Data.IntSet.EnumSet2 as S (EnumSet(..)) import Data.Semigroup as Sem import Prelude@@ -144,10 +151,10 @@ f' a1 b a2 = f a1 (toEnum b) a2 fold :: (Enum key) => (a -> b -> b) -> b -> EnumMap key a -> b-fold f a (EnumMap m) = M.fold f a m+fold f a (EnumMap m) = M.foldr f a m foldWithKey :: (Enum key) => (key -> a -> b -> b) -> b -> EnumMap key a -> b-foldWithKey f a (EnumMap m) = M.foldWithKey f' a m+foldWithKey f a (EnumMap m) = M.foldrWithKey f' a m where f' b a1 a2 = f (toEnum b) a1 a2 elems :: (Enum key) => EnumMap key a -> [a]@@ -245,7 +252,7 @@ isProperSubmapOfBy f (EnumMap m1) (EnumMap m2) = M.isProperSubmapOfBy f m1 m2 showTree :: (Enum key,Show a) => EnumMap key a -> String-showTree (EnumMap m) = M.showTree m+showTree (EnumMap m) = MD.showTree m showTreeWith :: (Enum key,Show a) => Bool -> Bool -> EnumMap key a -> String-showTreeWith b1 b2 (EnumMap m) = M.showTreeWith b1 b2 m+showTreeWith b1 b2 (EnumMap m) = MD.showTreeWith b1 b2 m
regex-tdfa.cabal view
@@ -1,5 +1,5 @@ Name: regex-tdfa-Version: 1.2.3+Version: 1.2.3.1 License: BSD3 License-File: LICENSE Copyright: Copyright (c) 2007, Christopher Kuklewicz@@ -27,14 +27,14 @@ manual: True library - Build-Depends: array >= 0.4- , base >= 4 && < 5- , bytestring- , containers+ Build-Depends: array >= 0.4 && < 0.6+ , base >= 4 && < 5+ , bytestring >= 0.10 && < 0.11+ , containers >= 0.5 && < 0.7 , ghc-prim- , mtl- , parsec- , regex-base >= 0.93.1+ , mtl == 2.*+ , parsec == 3.*+ , regex-base >= 0.93.1 -- Support Semigroup instances uniformly --