greskell 2.0.3.3 → 2.0.3.4
raw patch · 2 files changed
+10/−6 lines, 2 filesdep ~basePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base
API changes (from Hackage documentation)
+ Data.Greskell: type GreskellReturn a;
- Data.Greskell: [ByComparatorComp] :: Comparator comp => Greskell comp -> ByComparator (CompareArg comp)
+ Data.Greskell: [ByComparatorComp] :: forall comp. Comparator comp => Greskell comp -> ByComparator (CompareArg comp)
- Data.Greskell: [ByComparatorProjComp] :: Comparator comp => ByProjection s (CompareArg comp) -> Greskell comp -> ByComparator s
+ Data.Greskell: [ByComparatorProjComp] :: forall comp s. Comparator comp => ByProjection s (CompareArg comp) -> Greskell comp -> ByComparator s
- Data.Greskell: [ByComparatorProj] :: ByProjection s e -> ByComparator s
+ Data.Greskell: [ByComparatorProj] :: forall s e. ByProjection s e -> ByComparator s
- Data.Greskell: [ByProjection] :: (ProjectionLike p, ToGreskell p) => p -> ByProjection (ProjectionLikeStart p) (ProjectionLikeEnd p)
+ Data.Greskell: [ByProjection] :: forall p. (ProjectionLike p, ToGreskell p) => p -> ByProjection (ProjectionLikeStart p) (ProjectionLikeEnd p)
- Data.Greskell: [KeyNoValue] :: Key a b -> KeyValue a
+ Data.Greskell: [KeyNoValue] :: forall a b. Key a b -> KeyValue a
- Data.Greskell: [KeyValue] :: Key a b -> Greskell b -> KeyValue a
+ Data.Greskell: [KeyValue] :: forall a b. Key a b -> Greskell b -> KeyValue a
- Data.Greskell: [KeysCons] :: Key a b -> Keys a -> Keys a
+ Data.Greskell: [KeysCons] :: forall a b. Key a b -> Keys a -> Keys a
- Data.Greskell: [KeysNil] :: Keys a
+ Data.Greskell: [KeysNil] :: forall a. Keys a
- Data.Greskell: [LabeledByProjection] :: AsLabel a -> ByProjection s a -> LabeledByProjection s
+ Data.Greskell: [LabeledByProjection] :: forall a s. AsLabel a -> ByProjection s a -> LabeledByProjection s
- Data.Greskell: [MatchPattern] :: AsLabel a -> Walk Transform a b -> MatchPattern
+ Data.Greskell: [MatchPattern] :: forall a b. AsLabel a -> Walk Transform a b -> MatchPattern
- Data.Greskell: [RepeatEmitT] :: (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatEmit c s
+ Data.Greskell: [RepeatEmitT] :: forall cc c s e. (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatEmit c s
- Data.Greskell: [RepeatEmit] :: RepeatEmit c s
+ Data.Greskell: [RepeatEmit] :: forall c s. RepeatEmit c s
- Data.Greskell: [RepeatTimes] :: Greskell Int -> RepeatUntil c s
+ Data.Greskell: [RepeatTimes] :: forall c s. Greskell Int -> RepeatUntil c s
- Data.Greskell: [RepeatUntilT] :: (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatUntil c s
+ Data.Greskell: [RepeatUntilT] :: forall cc c s e. (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatUntil c s
- Data.Greskell: class (Element e) => Edge e
+ Data.Greskell: class Element e => Edge e
- Data.Greskell: class () => FromGraphSON a
+ Data.Greskell: class FromGraphSON a
- Data.Greskell: class () => GraphSONTyped a
+ Data.Greskell: class GraphSONTyped a
- Data.Greskell: class (ToGreskell (PParameter p)) => PLike p where {
+ Data.Greskell: class ToGreskell PParameter p => PLike p where {
- Data.Greskell: class Property p
+ Data.Greskell: class Property (p :: Type -> Type)
- Data.Greskell: class ToGTraversal g
+ Data.Greskell: class ToGTraversal (g :: Type -> Type -> Type -> Type)
- Data.Greskell: class () => ToGreskell a where {
+ Data.Greskell: class ToGreskell a where {
- Data.Greskell: class (Element v) => Vertex v
+ Data.Greskell: class Element v => Vertex v
- Data.Greskell: data () => GMap (c :: Type -> Type -> Type) k v
+ Data.Greskell: data GMap (c :: Type -> Type -> Type) k v
- Data.Greskell: data () => GMapEntry k v
+ Data.Greskell: data GMapEntry k v
- Data.Greskell: data () => GValue
+ Data.Greskell: data GValue
- Data.Greskell: data () => GValueBody
+ Data.Greskell: data GValueBody
- Data.Greskell: data () => GraphSON v
+ Data.Greskell: data GraphSON v
- Data.Greskell: data () => Greskell a
+ Data.Greskell: data Greskell a
- Data.Greskell: data () => Parser a
+ Data.Greskell: data Parser a
- Data.Greskell: newtype () => FlattenedMap (c :: Type -> Type -> Type) k v
+ Data.Greskell: newtype FlattenedMap (c :: Type -> Type -> Type) k v
- Data.Greskell: type family GreskellReturn a
+ Data.Greskell: type family ElementPropertyContainer e :: Type -> Type
- Data.Greskell.AsLabel: lookup :: (PMapKey k, NonEmptyLike c) => k -> PMap c v -> Maybe v
+ Data.Greskell.AsLabel: lookup :: forall k (c :: Type -> Type) v. (PMapKey k, NonEmptyLike c) => k -> PMap c v -> Maybe v
- Data.Greskell.AsLabel: lookupAs :: (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException a
+ Data.Greskell.AsLabel: lookupAs :: forall k (c :: Type -> Type) a. (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException a
- Data.Greskell.AsLabel: lookupAsM :: (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a, MonadThrow m) => k -> PMap c GValue -> m a
+ Data.Greskell.AsLabel: lookupAsM :: forall k (c :: Type -> Type) a m. (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a, MonadThrow m) => k -> PMap c GValue -> m a
- Data.Greskell.AsLabel: lookupM :: (PMapKey k, NonEmptyLike c, MonadThrow m) => k -> PMap c v -> m v
+ Data.Greskell.AsLabel: lookupM :: forall k (c :: Type -> Type) m v. (PMapKey k, NonEmptyLike c, MonadThrow m) => k -> PMap c v -> m v
- Data.Greskell.Extra: lookupAs :: (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException a
+ Data.Greskell.Extra: lookupAs :: forall k (c :: Type -> Type) a. (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException a
- Data.Greskell.Extra: lookupAs' :: (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (Maybe a)
+ Data.Greskell.Extra: lookupAs' :: forall k (c :: Type -> Type) a. (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (Maybe a)
- Data.Greskell.Extra: lookupListAs :: (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (NonEmpty a)
+ Data.Greskell.Extra: lookupListAs :: forall k (c :: Type -> Type) a. (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (NonEmpty a)
- Data.Greskell.Extra: lookupListAs' :: (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException [Maybe a]
+ Data.Greskell.Extra: lookupListAs' :: forall k (c :: Type -> Type) a. (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException [Maybe a]
- Data.Greskell.Extra: writePMapProperties :: (Foldable c, ToJSON v, Element e) => PMap c v -> Binder (Walk SideEffect e e)
+ Data.Greskell.Extra: writePMapProperties :: forall (c :: Type -> Type) v e. (Foldable c, ToJSON v, Element e) => PMap c v -> Binder (Walk SideEffect e e)
- Data.Greskell.GTraversal: [ByComparatorComp] :: Comparator comp => Greskell comp -> ByComparator (CompareArg comp)
+ Data.Greskell.GTraversal: [ByComparatorComp] :: forall comp. Comparator comp => Greskell comp -> ByComparator (CompareArg comp)
- Data.Greskell.GTraversal: [ByComparatorProjComp] :: Comparator comp => ByProjection s (CompareArg comp) -> Greskell comp -> ByComparator s
+ Data.Greskell.GTraversal: [ByComparatorProjComp] :: forall comp s. Comparator comp => ByProjection s (CompareArg comp) -> Greskell comp -> ByComparator s
- Data.Greskell.GTraversal: [ByComparatorProj] :: ByProjection s e -> ByComparator s
+ Data.Greskell.GTraversal: [ByComparatorProj] :: forall s e. ByProjection s e -> ByComparator s
- Data.Greskell.GTraversal: [ByProjection] :: (ProjectionLike p, ToGreskell p) => p -> ByProjection (ProjectionLikeStart p) (ProjectionLikeEnd p)
+ Data.Greskell.GTraversal: [ByProjection] :: forall p. (ProjectionLike p, ToGreskell p) => p -> ByProjection (ProjectionLikeStart p) (ProjectionLikeEnd p)
- Data.Greskell.GTraversal: [LabeledByProjection] :: AsLabel a -> ByProjection s a -> LabeledByProjection s
+ Data.Greskell.GTraversal: [LabeledByProjection] :: forall a s. AsLabel a -> ByProjection s a -> LabeledByProjection s
- Data.Greskell.GTraversal: [MatchPattern] :: AsLabel a -> Walk Transform a b -> MatchPattern
+ Data.Greskell.GTraversal: [MatchPattern] :: forall a b. AsLabel a -> Walk Transform a b -> MatchPattern
- Data.Greskell.GTraversal: [RepeatEmitT] :: (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatEmit c s
+ Data.Greskell.GTraversal: [RepeatEmitT] :: forall cc c s e. (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatEmit c s
- Data.Greskell.GTraversal: [RepeatEmit] :: RepeatEmit c s
+ Data.Greskell.GTraversal: [RepeatEmit] :: forall c s. RepeatEmit c s
- Data.Greskell.GTraversal: [RepeatTimes] :: Greskell Int -> RepeatUntil c s
+ Data.Greskell.GTraversal: [RepeatTimes] :: forall c s. Greskell Int -> RepeatUntil c s
- Data.Greskell.GTraversal: [RepeatUntilT] :: (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatUntil c s
+ Data.Greskell.GTraversal: [RepeatUntilT] :: forall cc c s e. (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatUntil c s
- Data.Greskell.GTraversal: class ToGTraversal g
+ Data.Greskell.GTraversal: class ToGTraversal (g :: Type -> Type -> Type -> Type)
- Data.Greskell.GTraversal.Gen: [ByComparatorComp] :: Comparator comp => Greskell comp -> ByComparator (CompareArg comp)
+ Data.Greskell.GTraversal.Gen: [ByComparatorComp] :: forall comp. Comparator comp => Greskell comp -> ByComparator (CompareArg comp)
- Data.Greskell.GTraversal.Gen: [ByComparatorProjComp] :: Comparator comp => ByProjection s (CompareArg comp) -> Greskell comp -> ByComparator s
+ Data.Greskell.GTraversal.Gen: [ByComparatorProjComp] :: forall comp s. Comparator comp => ByProjection s (CompareArg comp) -> Greskell comp -> ByComparator s
- Data.Greskell.GTraversal.Gen: [ByComparatorProj] :: ByProjection s e -> ByComparator s
+ Data.Greskell.GTraversal.Gen: [ByComparatorProj] :: forall s e. ByProjection s e -> ByComparator s
- Data.Greskell.GTraversal.Gen: [ByProjection] :: (ProjectionLike p, ToGreskell p) => p -> ByProjection (ProjectionLikeStart p) (ProjectionLikeEnd p)
+ Data.Greskell.GTraversal.Gen: [ByProjection] :: forall p. (ProjectionLike p, ToGreskell p) => p -> ByProjection (ProjectionLikeStart p) (ProjectionLikeEnd p)
- Data.Greskell.GTraversal.Gen: [LabeledByProjection] :: AsLabel a -> ByProjection s a -> LabeledByProjection s
+ Data.Greskell.GTraversal.Gen: [LabeledByProjection] :: forall a s. AsLabel a -> ByProjection s a -> LabeledByProjection s
- Data.Greskell.GTraversal.Gen: [MatchPattern] :: AsLabel a -> Walk Transform a b -> MatchPattern
+ Data.Greskell.GTraversal.Gen: [MatchPattern] :: forall a b. AsLabel a -> Walk Transform a b -> MatchPattern
- Data.Greskell.GTraversal.Gen: [RepeatEmitT] :: (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatEmit c s
+ Data.Greskell.GTraversal.Gen: [RepeatEmitT] :: forall cc c s e. (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatEmit c s
- Data.Greskell.GTraversal.Gen: [RepeatEmit] :: RepeatEmit c s
+ Data.Greskell.GTraversal.Gen: [RepeatEmit] :: forall c s. RepeatEmit c s
- Data.Greskell.GTraversal.Gen: [RepeatTimes] :: Greskell Int -> RepeatUntil c s
+ Data.Greskell.GTraversal.Gen: [RepeatTimes] :: forall c s. Greskell Int -> RepeatUntil c s
- Data.Greskell.GTraversal.Gen: [RepeatUntilT] :: (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatUntil c s
+ Data.Greskell.GTraversal.Gen: [RepeatUntilT] :: forall cc c s e. (WalkType cc, WalkType c, Split cc c) => GTraversal cc s e -> RepeatUntil c s
- Data.Greskell.GTraversal.Gen: class ToGTraversal g
+ Data.Greskell.GTraversal.Gen: class ToGTraversal (g :: Type -> Type -> Type -> Type)
- Data.Greskell.Graph: [KeyNoValue] :: Key a b -> KeyValue a
+ Data.Greskell.Graph: [KeyNoValue] :: forall a b. Key a b -> KeyValue a
- Data.Greskell.Graph: [KeyValue] :: Key a b -> Greskell b -> KeyValue a
+ Data.Greskell.Graph: [KeyValue] :: forall a b. Key a b -> Greskell b -> KeyValue a
- Data.Greskell.Graph: [KeysCons] :: Key a b -> Keys a -> Keys a
+ Data.Greskell.Graph: [KeysCons] :: forall a b. Key a b -> Keys a -> Keys a
- Data.Greskell.Graph: [KeysNil] :: Keys a
+ Data.Greskell.Graph: [KeysNil] :: forall a. Keys a
- Data.Greskell.Graph: class (Element e) => Edge e
+ Data.Greskell.Graph: class Element e => Edge e
- Data.Greskell.Graph: class Property p
+ Data.Greskell.Graph: class Property (p :: Type -> Type)
- Data.Greskell.Graph: class (Element v) => Vertex v
+ Data.Greskell.Graph: class Element v => Vertex v
- Data.Greskell.Graph.PropertyMap: class PropertyMap m
+ Data.Greskell.Graph.PropertyMap: class PropertyMap (m :: Type -> Type -> Type -> Type)
- Data.Greskell.Graph.PropertyMap: data PropertyMapList p v
+ Data.Greskell.Graph.PropertyMap: data PropertyMapList (p :: Type -> Type) v
- Data.Greskell.Graph.PropertyMap: data PropertyMapSingle p v
+ Data.Greskell.Graph.PropertyMap: data PropertyMapSingle (p :: Type -> Type) v
- Data.Greskell.Graph.PropertyMap: lookupListValues :: (PropertyMap m, Property p) => Text -> m p v -> [v]
+ Data.Greskell.Graph.PropertyMap: lookupListValues :: forall m (p :: Type -> Type) v. (PropertyMap m, Property p) => Text -> m p v -> [v]
- Data.Greskell.Graph.PropertyMap: lookupOneValue :: (PropertyMap m, Property p) => Text -> m p v -> Maybe v
+ Data.Greskell.Graph.PropertyMap: lookupOneValue :: forall m (p :: Type -> Type) v. (PropertyMap m, Property p) => Text -> m p v -> Maybe v
- Data.Greskell.Graph.PropertyMap: parseListValues :: (PropertyMap m, Property p, FromGraphSON v) => Text -> m p GValue -> Parser [v]
+ Data.Greskell.Graph.PropertyMap: parseListValues :: forall m (p :: Type -> Type) v. (PropertyMap m, Property p, FromGraphSON v) => Text -> m p GValue -> Parser [v]
- Data.Greskell.Graph.PropertyMap: parseNonEmptyValues :: (PropertyMap m, Property p, FromGraphSON v) => Text -> m p GValue -> Parser (NonEmpty v)
+ Data.Greskell.Graph.PropertyMap: parseNonEmptyValues :: forall m (p :: Type -> Type) v. (PropertyMap m, Property p, FromGraphSON v) => Text -> m p GValue -> Parser (NonEmpty v)
- Data.Greskell.Graph.PropertyMap: parseOneValue :: (PropertyMap m, Property p, FromGraphSON v) => Text -> m p GValue -> Parser v
+ Data.Greskell.Graph.PropertyMap: parseOneValue :: forall m (p :: Type -> Type) v. (PropertyMap m, Property p, FromGraphSON v) => Text -> m p GValue -> Parser v
- Data.Greskell.Graph.PropertyMap: removeProperty :: PropertyMap m => Text -> m p v -> m p v
+ Data.Greskell.Graph.PropertyMap: removeProperty :: forall (p :: Type -> Type) v. PropertyMap m => Text -> m p v -> m p v
- Data.Greskell.Gremlin: class (ToGreskell (PParameter p)) => PLike p where {
+ Data.Greskell.Gremlin: class ToGreskell PParameter p => PLike p where {
- Data.Greskell.NonEmptyLike: class Foldable t => NonEmptyLike t
+ Data.Greskell.NonEmptyLike: class Foldable t => NonEmptyLike (t :: Type -> Type)
- Data.Greskell.PMap: data PMap c v
+ Data.Greskell.PMap: data PMap (c :: Type -> Type) v
- Data.Greskell.PMap: lookup :: (PMapKey k, NonEmptyLike c) => k -> PMap c v -> Maybe v
+ Data.Greskell.PMap: lookup :: forall k (c :: Type -> Type) v. (PMapKey k, NonEmptyLike c) => k -> PMap c v -> Maybe v
- Data.Greskell.PMap: lookupAs :: (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException a
+ Data.Greskell.PMap: lookupAs :: forall k (c :: Type -> Type) a. (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException a
- Data.Greskell.PMap: lookupAs' :: (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (Maybe a)
+ Data.Greskell.PMap: lookupAs' :: forall k (c :: Type -> Type) a. (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (Maybe a)
- Data.Greskell.PMap: lookupAsM :: (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a, MonadThrow m) => k -> PMap c GValue -> m a
+ Data.Greskell.PMap: lookupAsM :: forall k (c :: Type -> Type) a m. (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a, MonadThrow m) => k -> PMap c GValue -> m a
- Data.Greskell.PMap: lookupList :: (PMapKey k, NonEmptyLike c) => k -> PMap c v -> [v]
+ Data.Greskell.PMap: lookupList :: forall k (c :: Type -> Type) v. (PMapKey k, NonEmptyLike c) => k -> PMap c v -> [v]
- Data.Greskell.PMap: lookupListAs :: (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (NonEmpty a)
+ Data.Greskell.PMap: lookupListAs :: forall k (c :: Type -> Type) a. (PMapKey k, NonEmptyLike c, PMapValue k ~ a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException (NonEmpty a)
- Data.Greskell.PMap: lookupListAs' :: (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException [Maybe a]
+ Data.Greskell.PMap: lookupListAs' :: forall k (c :: Type -> Type) a. (PMapKey k, NonEmptyLike c, PMapValue k ~ Maybe a, FromGraphSON a) => k -> PMap c GValue -> Either PMapLookupException [Maybe a]
- Data.Greskell.PMap: lookupM :: (PMapKey k, NonEmptyLike c, MonadThrow m) => k -> PMap c v -> m v
+ Data.Greskell.PMap: lookupM :: forall k (c :: Type -> Type) m v. (PMapKey k, NonEmptyLike c, MonadThrow m) => k -> PMap c v -> m v
- Data.Greskell.PMap: pMapDelete :: Text -> PMap c v -> PMap c v
+ Data.Greskell.PMap: pMapDelete :: forall (c :: Type -> Type) v. Text -> PMap c v -> PMap c v
- Data.Greskell.PMap: pMapFromList :: NonEmptyLike c => [(Text, v)] -> PMap c v
+ Data.Greskell.PMap: pMapFromList :: forall (c :: Type -> Type) v. NonEmptyLike c => [(Text, v)] -> PMap c v
- Data.Greskell.PMap: pMapInsert :: NonEmptyLike c => Text -> v -> PMap c v -> PMap c v
+ Data.Greskell.PMap: pMapInsert :: forall (c :: Type -> Type) v. NonEmptyLike c => Text -> v -> PMap c v -> PMap c v
- Data.Greskell.PMap: pMapLookup :: NonEmptyLike c => Text -> PMap c v -> [v]
+ Data.Greskell.PMap: pMapLookup :: forall (c :: Type -> Type) v. NonEmptyLike c => Text -> PMap c v -> [v]
- Data.Greskell.PMap: pMapToList :: Foldable c => PMap c v -> [(Text, v)]
+ Data.Greskell.PMap: pMapToList :: forall (c :: Type -> Type) v. Foldable c => PMap c v -> [(Text, v)]
- Data.Greskell.PMap: type PMapValue k :: Type;
+ Data.Greskell.PMap: type PMapValue k;
Files
- ChangeLog.md +4/−0
- greskell.cabal +6/−6
ChangeLog.md view
@@ -1,5 +1,9 @@ # Revision history for greskell +## 2.0.3.4 -- 2026-04-21++- Bump dependency version bounds.+ ## 2.0.3.3 -- 2025-01-30 * Binder: now `newBind` produces an expression like `((__v0))`, that is, a variable name wrapped with double parens.
greskell.cabal view
@@ -1,5 +1,5 @@ name: greskell-version: 2.0.3.3+version: 2.0.3.4 author: Toshio Ito <debug.ito@gmail.com> maintainer: Toshio Ito <debug.ito@gmail.com> license: BSD3@@ -40,7 +40,7 @@ Data.Greskell.NonEmptyLike, Data.Greskell.Logic -- other-modules: - build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0,+ build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0 || ^>=4.22.0, greskell-core ^>=1.0.0, text ^>=1.2.3 || ^>=2.0.2 || ^>=2.1, transformers ^>=0.5.6 || ^>=0.6.1,@@ -69,7 +69,7 @@ Data.Greskell.LogicSpec, ExamplesSpec build-tool-depends: hspec-discover:hspec-discover- build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0,+ build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0 || ^>=4.22.0, text ^>=1.2.3 || ^>=2.0.2 || ^>=2.1, aeson ^>=2.0.2 || ^>=2.1.0 || ^>=2.2.3, unordered-containers ^>=0.2.15,@@ -84,7 +84,7 @@ hs-source-dirs: test ghc-options: -Wall -fno-warn-unused-imports "-with-rtsopts=-M512m" main-is: Typecheck.hs- build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0,+ build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0 || ^>=4.22.0, hspec ^>=2.9.1 || ^>=2.10.6 || ^>=2.11.9, greskell, should-not-typecheck ^>=2.1.0@@ -104,7 +104,7 @@ other-modules: ServerTest.Common if flag(server-test) -- Explicitly remove dependency. See https://github.com/haskell/cabal/issues/1725- build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0,+ build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0 || ^>=4.22.0, aeson ^>=2.0.2 || ^>=2.1.0 || ^>=2.2.3, hspec ^>=2.9.1 || ^>=2.10.6 || ^>=2.11.9, text ^>=1.2.3 || ^>=2.0.2 || ^>=2.1,@@ -135,7 +135,7 @@ other-extensions: OverloadedStrings other-modules: ServerTest.Common if flag(server-behavior-test)- build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0,+ build-depends: base ^>=4.13.0 || ^>=4.14.0 || ^>=4.15.0 || ^>=4.16.0 || ^>=4.17.0 || ^>=4.18.0 || ^>=4.19.0 || ^>=4.20.0 || ^>=4.21.0 || ^>=4.22.0, aeson ^>=2.0.2 || ^>=2.1.0 || ^>=2.2.3, hspec ^>=2.9.1 || ^>=2.10.6 || ^>=2.11.9, text ^>=1.2.3 || ^>=2.0.2 || ^>=2.1,