ixset-typed 0.5.1.0 → 0.5.1.1
raw patch · 3 files changed
+11/−8 lines, 3 filesdep −HUnitdep −QuickCheckdep ~template-haskellnew-uploaderPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependencies removed: HUnit, QuickCheck
Dependency ranges changed: template-haskell
API changes (from Hackage documentation)
- Data.IxSet.Typed: (&&&) :: Indexable ixs a => IxSet ixs a -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: (&&&) :: forall (ixs :: [Type]) a. Indexable ixs a => IxSet ixs a -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: (@*) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> [ix] -> IxSet ixs a
+ Data.IxSet.Typed: (@*) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> [ix] -> IxSet ixs a
- Data.IxSet.Typed: (@+) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> [ix] -> IxSet ixs a
+ Data.IxSet.Typed: (@+) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> [ix] -> IxSet ixs a
- Data.IxSet.Typed: (@<) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
+ Data.IxSet.Typed: (@<) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
- Data.IxSet.Typed: (@<=) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
+ Data.IxSet.Typed: (@<=) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
- Data.IxSet.Typed: (@=) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
+ Data.IxSet.Typed: (@=) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
- Data.IxSet.Typed: (@>) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
+ Data.IxSet.Typed: (@>) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
- Data.IxSet.Typed: (@><) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> (ix, ix) -> IxSet ixs a
+ Data.IxSet.Typed: (@><) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> (ix, ix) -> IxSet ixs a
- Data.IxSet.Typed: (@><=) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> (ix, ix) -> IxSet ixs a
+ Data.IxSet.Typed: (@><=) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> (ix, ix) -> IxSet ixs a
- Data.IxSet.Typed: (@>=) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
+ Data.IxSet.Typed: (@>=) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> ix -> IxSet ixs a
- Data.IxSet.Typed: (@>=<) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> (ix, ix) -> IxSet ixs a
+ Data.IxSet.Typed: (@>=<) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> (ix, ix) -> IxSet ixs a
- Data.IxSet.Typed: (@>=<=) :: (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> (ix, ix) -> IxSet ixs a
+ Data.IxSet.Typed: (@>=<=) :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => IxSet ixs a -> (ix, ix) -> IxSet ixs a
- Data.IxSet.Typed: (|||) :: Indexable ixs a => IxSet ixs a -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: (|||) :: forall (ixs :: [Type]) a. Indexable ixs a => IxSet ixs a -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: change :: forall ixs a. Indexable ixs a => SetOp -> IndexOp -> a -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: change :: forall (ixs :: [Type]) a. Indexable ixs a => SetOp -> IndexOp -> a -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: class (All Ord ixs, Ord a) => Indexable ixs a
+ Data.IxSet.Typed: class (All Ord ixs, Ord a) => Indexable (ixs :: [Type]) a
- Data.IxSet.Typed: class Ord ix => IsIndexOf (ix :: Type) (ixs :: [Type])
+ Data.IxSet.Typed: class Ord ix => IsIndexOf ix (ixs :: [Type])
- Data.IxSet.Typed: class MkIxList ixs ixs' a r | r -> a ixs ixs'
+ Data.IxSet.Typed: class MkIxList (ixs :: [Type]) (ixs' :: [Type]) a r | r -> a ixs ixs'
- Data.IxSet.Typed: data Ix (ix :: Type) (a :: Type)
+ Data.IxSet.Typed: data Ix ix a
- Data.IxSet.Typed: data IxList (ixs :: [Type]) (a :: Type)
+ Data.IxSet.Typed: data IxList (ixs :: [Type]) a
- Data.IxSet.Typed: data IxSet (ixs :: [Type]) (a :: Type)
+ Data.IxSet.Typed: data IxSet (ixs :: [Type]) a
- Data.IxSet.Typed: delete :: Indexable ixs a => a -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: delete :: forall (ixs :: [Type]) a. Indexable ixs a => a -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: deleteIx :: (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: deleteIx :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: empty :: Indexable ixs a => IxSet ixs a
+ Data.IxSet.Typed: empty :: forall (ixs :: [Type]) a. Indexable ixs a => IxSet ixs a
- Data.IxSet.Typed: fromList :: Indexable ixs a => [a] -> IxSet ixs a
+ Data.IxSet.Typed: fromList :: forall (ixs :: [Type]) a. Indexable ixs a => [a] -> IxSet ixs a
- Data.IxSet.Typed: fromSet :: Indexable ixs a => Set a -> IxSet ixs a
+ Data.IxSet.Typed: fromSet :: forall (ixs :: [Type]) a. Indexable ixs a => Set a -> IxSet ixs a
- Data.IxSet.Typed: getEQ :: (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: getEQ :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: getGT :: (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: getGT :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: getGTE :: (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: getGTE :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: getLT :: (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: getLT :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: getLTE :: (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: getLTE :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => ix -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: getOne :: Ord a => IxSet ixs a -> Maybe a
+ Data.IxSet.Typed: getOne :: forall a (ixs :: [Type]). Ord a => IxSet ixs a -> Maybe a
- Data.IxSet.Typed: getOneOr :: Ord a => a -> IxSet ixs a -> a
+ Data.IxSet.Typed: getOneOr :: forall a (ixs :: [Type]). Ord a => a -> IxSet ixs a -> a
- Data.IxSet.Typed: getRange :: (Indexable ixs a, IsIndexOf ix ixs) => ix -> ix -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: getRange :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => ix -> ix -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: groupAscBy :: forall ix ixs a. IsIndexOf ix ixs => IxSet ixs a -> [(ix, [a])]
+ Data.IxSet.Typed: groupAscBy :: forall ix (ixs :: [Type]) a. IsIndexOf ix ixs => IxSet ixs a -> [(ix, [a])]
- Data.IxSet.Typed: groupBy :: forall ix ixs a. IsIndexOf ix ixs => IxSet ixs a -> [(ix, [a])]
+ Data.IxSet.Typed: groupBy :: forall ix (ixs :: [Type]) a. IsIndexOf ix ixs => IxSet ixs a -> [(ix, [a])]
- Data.IxSet.Typed: groupDescBy :: IsIndexOf ix ixs => IxSet ixs a -> [(ix, [a])]
+ Data.IxSet.Typed: groupDescBy :: forall ix (ixs :: [Type]) a. IsIndexOf ix ixs => IxSet ixs a -> [(ix, [a])]
- Data.IxSet.Typed: indexKeys :: forall ix ixs a. IsIndexOf ix ixs => IxSet ixs a -> [ix]
+ Data.IxSet.Typed: indexKeys :: forall ix (ixs :: [Type]) a. IsIndexOf ix ixs => IxSet ixs a -> [ix]
- Data.IxSet.Typed: insert :: Indexable ixs a => a -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: insert :: forall (ixs :: [Type]) a. Indexable ixs a => a -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: insertList :: forall ixs a. Indexable ixs a => [a] -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: insertList :: forall (ixs :: [Type]) a. Indexable ixs a => [a] -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: intersection :: Indexable ixs a => IxSet ixs a -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: intersection :: forall (ixs :: [Type]) a. Indexable ixs a => IxSet ixs a -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: ixList :: MkIxList ixs ixs a r => r
+ Data.IxSet.Typed: ixList :: forall (ixs :: [Type]) a r. MkIxList ixs ixs a r => r
- Data.IxSet.Typed: null :: IxSet ixs a -> Bool
+ Data.IxSet.Typed: null :: forall (ixs :: [Type]) a. IxSet ixs a -> Bool
- Data.IxSet.Typed: size :: IxSet ixs a -> Int
+ Data.IxSet.Typed: size :: forall (ixs :: [Type]) a. IxSet ixs a -> Int
- Data.IxSet.Typed: stats :: Indexable ixs a => IxSet ixs a -> (Int, Int, Int, Int)
+ Data.IxSet.Typed: stats :: forall (ixs :: [Type]) a. Indexable ixs a => IxSet ixs a -> (Int, Int, Int, Int)
- Data.IxSet.Typed: toAscList :: forall proxy ix ixs a. IsIndexOf ix ixs => proxy ix -> IxSet ixs a -> [a]
+ Data.IxSet.Typed: toAscList :: forall proxy ix (ixs :: [Type]) a. IsIndexOf ix ixs => proxy ix -> IxSet ixs a -> [a]
- Data.IxSet.Typed: toDescList :: forall proxy ix ixs a. IsIndexOf ix ixs => proxy ix -> IxSet ixs a -> [a]
+ Data.IxSet.Typed: toDescList :: forall proxy ix (ixs :: [Type]) a. IsIndexOf ix ixs => proxy ix -> IxSet ixs a -> [a]
- Data.IxSet.Typed: toList :: IxSet ixs a -> [a]
+ Data.IxSet.Typed: toList :: forall (ixs :: [Type]) a. IxSet ixs a -> [a]
- Data.IxSet.Typed: toSet :: IxSet ixs a -> Set a
+ Data.IxSet.Typed: toSet :: forall (ixs :: [Type]) a. IxSet ixs a -> Set a
- Data.IxSet.Typed: type family All (c :: Type -> Constraint) (xs :: [Type]) :: Constraint
+ Data.IxSet.Typed: type family All (c :: Type -> Constraint) (xs :: [Type])
- Data.IxSet.Typed: type IndexOp = forall k a. (Ord k, Ord a) => k -> a -> Map k (Set a) -> Map k (Set a)
+ Data.IxSet.Typed: type IndexOp = forall k a. (Ord k, Ord a) => k -> a -> Map k Set a -> Map k Set a
- Data.IxSet.Typed: union :: Indexable ixs a => IxSet ixs a -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: union :: forall (ixs :: [Type]) a. Indexable ixs a => IxSet ixs a -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed: updateIx :: (Indexable ixs a, IsIndexOf ix ixs) => ix -> a -> IxSet ixs a -> IxSet ixs a
+ Data.IxSet.Typed: updateIx :: forall (ixs :: [Type]) a ix. (Indexable ixs a, IsIndexOf ix ixs) => ix -> a -> IxSet ixs a -> IxSet ixs a
- Data.IxSet.Typed.Ix: [Ix] :: !Map ix (Set a) -> (a -> [ix]) -> Ix ix a
+ Data.IxSet.Typed.Ix: [Ix] :: forall ix a. !Map ix (Set a) -> (a -> [ix]) -> Ix ix a
- Data.IxSet.Typed.Ix: data Ix (ix :: Type) (a :: Type)
+ Data.IxSet.Typed.Ix: data Ix ix a
Files
- CHANGELOG.md +6/−1
- ixset-typed.cabal +4/−6
- src/Data/IxSet/Typed.hs +1/−1
CHANGELOG.md view
@@ -1,7 +1,12 @@+0.5.1.1 (2026-07-13)+====================++- GHC 9.4 through to 9.14 compatibility.+ 0.5.1.0 (2022-05-10) ==================== -- GHC 9.0.2 and 9.2.2 compatibility.+- GHC 9.0 and 9.2 compatibility. 0.5 (2020-03-18) ================
ixset-typed.cabal view
@@ -1,5 +1,5 @@ name: ixset-typed-version: 0.5.1.0+version: 0.5.1.1 synopsis: Efficient relational queries on Haskell sets. description: This Haskell package provides a data structure of sets that are indexed@@ -21,12 +21,12 @@ license: BSD3 license-file: COPYING author: Andres Löh, Happstack team, HAppS LLC-maintainer: Andres Löh <andres@well-typed.com>+maintainer: Andres Löh <andres@well-typed.com>, Adam Gundry <adam@well-typed.com> category: Data Structures build-type: Simple cabal-version: >= 1.10 extra-source-files: CHANGELOG.md-tested-with: GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.4, GHC == 8.6.5, GHC == 8.8.4, GHC == 8.10.7, GHC == 9.0.2, GHC == 9.2.2+tested-with: GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.4, GHC == 8.6.5, GHC == 8.8.4, GHC == 8.10.7, GHC == 9.0.2, GHC == 9.2.8, GHC == 9.4.8, GHC == 9.6.7, GHC == 9.8.4, GHC == 9.10.2, GHC == 9.12.4, GHC == 9.14.1 source-repository head type: git@@ -38,7 +38,7 @@ deepseq >= 1.3 && < 2, safecopy >= 0.8 && < 0.11, syb >= 0.4 && < 1,- template-haskell >= 2.8 && < 2.19+ template-haskell >= 2.8 && < 2.25 hs-source-dirs: src exposed-modules:@@ -54,8 +54,6 @@ build-depends: ixset-typed, base >= 4.9 && < 5, containers >= 0.5 && < 1,- HUnit,- QuickCheck, tasty, tasty-hunit, tasty-quickcheck
src/Data/IxSet/Typed.hs view
@@ -607,7 +607,7 @@ _ -> error "IxSet.inferIxSet calInfo unexpected match" #if MIN_VERSION_template_haskell(2,17,0)-tyVarBndrToName :: TyVarBndr () -> Name+tyVarBndrToName :: TyVarBndr flag -> Name tyVarBndrToName (PlainTV nm _) = nm tyVarBndrToName (KindedTV nm _ _) = nm #else