packages feed

mello 0.3.0 → 0.4.0

raw patch · 2 files changed

+9/−9 lines, 2 filesdep ~bowtiedep ~containersdep ~prop-unitPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: bowtie, containers, prop-unit

API changes (from Hackage documentation)

- Mello.Match: altM :: Monad m => [(Text, MatchT e k m a)] -> MatchT e k m a
+ Mello.Match: altM :: forall (m :: Type -> Type) e k a. Monad m => [(Text, MatchT e k m a)] -> MatchT e k m a
- Mello.Match: annoM :: Monad m => MatchT e k m a -> MatchT e k m (Anno k a)
+ Mello.Match: annoM :: forall (m :: Type -> Type) e k a. Monad m => MatchT e k m a -> MatchT e k m (Anno k a)
- Mello.Match: anyAtomM :: Monad m => MatchT e k m Atom
+ Mello.Match: anyAtomM :: forall (m :: Type -> Type) e k. Monad m => MatchT e k m Atom
- Mello.Match: anyCharM :: Monad m => MatchT e k m Char
+ Mello.Match: anyCharM :: forall (m :: Type -> Type) e k. Monad m => MatchT e k m Char
- Mello.Match: anyIntM :: Monad m => MatchT e k m Integer
+ Mello.Match: anyIntM :: forall (m :: Type -> Type) e k. Monad m => MatchT e k m Integer
- Mello.Match: anySciM :: Monad m => MatchT e k m Scientific
+ Mello.Match: anySciM :: forall (m :: Type -> Type) e k. Monad m => MatchT e k m Scientific
- Mello.Match: anyStrM :: Monad m => MatchT e k m Text
+ Mello.Match: anyStrM :: forall (m :: Type -> Type) e k. Monad m => MatchT e k m Text
- Mello.Match: anySymM :: Monad m => MatchT e k m Sym
+ Mello.Match: anySymM :: forall (m :: Type -> Type) e k. Monad m => MatchT e k m Sym
- Mello.Match: charM :: Monad m => Char -> MatchT e k m ()
+ Mello.Match: charM :: forall (m :: Type -> Type) e k. Monad m => Char -> MatchT e k m ()
- Mello.Match: class (Monad m) => MatchSexp e k m a
+ Mello.Match: class Monad m => MatchSexp e k (m :: Type -> Type) a
- Mello.Match: data MatchT e k m a
+ Mello.Match: data MatchT e k (m :: Type -> Type) a
- Mello.Match: data SeqMatchT e k m a
+ Mello.Match: data SeqMatchT e k (m :: Type -> Type) a
- Mello.Match: docM :: Monad m => MatchT e k m a -> MatchT e k m (Doc, a)
+ Mello.Match: docM :: forall (m :: Type -> Type) e k a. Monad m => MatchT e k m a -> MatchT e k m (Doc, a)
- Mello.Match: elemM :: MatchT e k m a -> SeqMatchT e k m a
+ Mello.Match: elemM :: forall e k (m :: Type -> Type) a. MatchT e k m a -> SeqMatchT e k m a
- Mello.Match: embedM :: Monad m => e -> MatchT e k m a
+ Mello.Match: embedM :: forall (m :: Type -> Type) e k a. Monad m => e -> MatchT e k m a
- Mello.Match: intM :: Monad m => Integer -> MatchT e k m ()
+ Mello.Match: intM :: forall (m :: Type -> Type) e k. Monad m => Integer -> MatchT e k m ()
- Mello.Match: listM :: Monad m => Brace -> SeqMatchT e k m a -> MatchT e k m a
+ Mello.Match: listM :: forall (m :: Type -> Type) e k a. Monad m => Brace -> SeqMatchT e k m a -> MatchT e k m a
- Mello.Match: lookM :: Monad m => Brace -> [(Text, MatchT e k m (), SeqMatchT e k m a)] -> MatchT e k m a
+ Mello.Match: lookM :: forall (m :: Type -> Type) e k a. Monad m => Brace -> [(Text, MatchT e k m (), SeqMatchT e k m a)] -> MatchT e k m a
- Mello.Match: matchM :: Monad m => (SexpF (Memo SexpF k) -> Either (MatchErr e (LocMatchErr e k)) a) -> MatchT e k m a
+ Mello.Match: matchM :: forall (m :: Type -> Type) k e a. Monad m => (SexpF (Memo SexpF k) -> Either (MatchErr e (LocMatchErr e k)) a) -> MatchT e k m a
- Mello.Match: memoM :: Monad m => MatchT e k m (f (Memo f k)) -> MatchT e k m (Memo f k)
+ Mello.Match: memoM :: forall (m :: Type -> Type) e k f. Monad m => MatchT e k m (f (Memo f k)) -> MatchT e k m (Memo f k)
- Mello.Match: proxyM :: MatchSexp e k m a => Proxy a -> MatchT e k m a
+ Mello.Match: proxyM :: forall e k (m :: Type -> Type) a. MatchSexp e k m a => Proxy a -> MatchT e k m a
- Mello.Match: quoteM :: Monad m => MatchT e k m (Memo SexpF k)
+ Mello.Match: quoteM :: forall (m :: Type -> Type) e k. Monad m => MatchT e k m (Memo SexpF k)
- Mello.Match: remainingM :: SeqMatchT e k m Int
+ Mello.Match: remainingM :: forall e k (m :: Type -> Type). SeqMatchT e k m Int
- Mello.Match: repeatM :: SeqMatchT e k m a -> SeqMatchT e k m (Seq a)
+ Mello.Match: repeatM :: forall e k (m :: Type -> Type) a. SeqMatchT e k m a -> SeqMatchT e k m (Seq a)
- Mello.Match: restM :: MatchT e k m a -> SeqMatchT e k m (Seq a)
+ Mello.Match: restM :: forall e k (m :: Type -> Type) a. MatchT e k m a -> SeqMatchT e k m (Seq a)
- Mello.Match: sciM :: Monad m => Scientific -> MatchT e k m ()
+ Mello.Match: sciM :: forall (m :: Type -> Type) e k. Monad m => Scientific -> MatchT e k m ()
- Mello.Match: strM :: Monad m => Text -> MatchT e k m ()
+ Mello.Match: strM :: forall (m :: Type -> Type) e k. Monad m => Text -> MatchT e k m ()
- Mello.Match: symM :: Monad m => Sym -> MatchT e k m ()
+ Mello.Match: symM :: forall (m :: Type -> Type) e k. Monad m => Sym -> MatchT e k m ()
- Mello.Match: unquoteM :: Monad m => MatchT e k m (Memo SexpF k)
+ Mello.Match: unquoteM :: forall (m :: Type -> Type) e k. Monad m => MatchT e k m (Memo SexpF k)
- Mello.Parse: sexpParser :: Monad m => ParserT e m OffsetSexp
+ Mello.Parse: sexpParser :: forall (m :: Type -> Type) e. Monad m => ParserT e m OffsetSexp

Files

mello.cabal view
@@ -1,11 +1,11 @@ cabal-version: 1.12 --- This file has been generated from package.yaml by hpack version 0.37.0.+-- This file has been generated from package.yaml by hpack version 0.39.1. -- -- see: https://github.com/sol/hpack  name:           mello-version:        0.3.0+version:        0.4.0 synopsis:       No-fuss syntax with s-expressions description:    Please see the README on GitHub at <https://github.com/ejconlon/mello#readme> category:       Parsing@@ -70,8 +70,8 @@   ghc-options: -Wall -Wcompat -Widentities -Wincomplete-record-updates -Wincomplete-uni-patterns -Wpartial-fields -Wredundant-constraints -fno-warn-unused-top-binds   build-depends:       base >=4.12 && <5-    , bowtie ==0.4.*-    , containers ==0.6.*+    , bowtie ==0.7.*+    , containers >=0.6 && <0.8     , foldl ==1.4.*     , looksee ==0.8.*     , mtl >=2.3 && <2.5@@ -120,8 +120,8 @@   ghc-options: -Wall -Wcompat -Widentities -Wincomplete-record-updates -Wincomplete-uni-patterns -Wpartial-fields -Wredundant-constraints -fno-warn-unused-top-binds -threaded -rtsopts -with-rtsopts=-N   build-depends:       base >=4.12 && <5-    , bowtie ==0.4.*-    , containers ==0.6.*+    , bowtie ==0.7.*+    , containers >=0.6 && <0.8     , daytripper ==1.0.*     , foldl ==1.4.*     , looksee ==0.8.*@@ -129,7 +129,7 @@     , mello     , mtl >=2.3 && <2.5     , prettyprinter ==1.7.*-    , prop-unit >=1.0.1 && <1.1+    , prop-unit ==1.0.*     , recursion-schemes ==5.2.*     , scientific ==0.3.*     , text >=2.0 && <2.2
test/Main.hs view
@@ -26,10 +26,10 @@ expectParseSexp = expectParsePretty (fmap unMkMemo sexpParser) cmpEq  parseCase :: TestName -> Sexp -> TestTree-parseCase n = testRT Nothing . mkUnitRT n expectParseSexp+parseCase n = testRT undefined . mkUnitRT n expectParseSexp  parseCaseAs :: TestName -> Text -> Sexp -> TestTree-parseCaseAs n t = testRT Nothing . mkUnitRT n (expectRendered t expectParseSexp)+parseCaseAs n t = testRT undefined . mkUnitRT n (expectRendered t expectParseSexp)  testParsing :: TestTree testParsing =