packages feed

Cabal revisions of dyckword-0.1.0.4

Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.

revision 1
-name:                dyckword-version:             0.1.0.4-synopsis:            A library for working with binary Dyck words.-description:-    The binary Dyck language consists of all strings of evenly balanced left -    and right parentheses, brackets, or some other symbols, together with the -    /empty/ word. Words in this language are known as /Dyck words/, some -    examples of which are @()()()@, @(())((()))@, and @((()()))()@.-    .-    The counting sequence associated with the Dyck language is the -    /Catalan numbers/, who describe properties of a great number of -    combinatorial objects.--homepage:            https://github.com/johanneshilden/dyckword#readme-license:             BSD3-license-file:        LICENSE-author:              Johannes Hildén-maintainer:          johannes@isomorphic.co-copyright:           2017 Johannes Hildén-category:            Math-build-type:          Simple-extra-source-files:  README.md-cabal-version:       >=1.10--library-  hs-source-dirs:      src-  exposed-modules:     Math.DyckWord.Binary-                     , Math.DyckWord.Binary.Internal-  build-depends:       base ==4.*-                     , text-                     , exact-combinatorics-  default-language:    Haskell2010--Test-Suite dyckword-testsuite-  hs-source-dirs:      tests-  Type:                exitcode-stdio-1.0-  Main-is:             Suite.hs-  Build-depends:       base-                     , hspec-                     , dyckword-                     , text-                     , ansi-terminal-  default-language:    Haskell2010--source-repository head-  type:     git-  location: https://github.com/johanneshilden/dyckword+name:                dyckword
+version:             0.1.0.4
+x-revision: 1
+synopsis:            A library for working with binary Dyck words.
+description:
+    The binary Dyck language consists of all strings of evenly balanced left 
+    and right parentheses, brackets, or some other symbols, together with the 
+    /empty/ word. Words in this language are known as /Dyck words/, some 
+    examples of which are @()()()@, @(())((()))@, and @((()()))()@.
+    .
+    The counting sequence associated with the Dyck language is the 
+    /Catalan numbers/, who describe properties of a great number of 
+    combinatorial objects.
+
+homepage:            https://github.com/laserpants/dyckword#readme
+license:             BSD3
+license-file:        LICENSE
+author:              Johannes Hildén
+maintainer:          hildenjohannes@gmail.com
+copyright:           2017 Johannes Hildén
+category:            Math
+build-type:          Simple
+extra-source-files:  README.md
+cabal-version:       >=1.10
+
+library
+  hs-source-dirs:      src
+  exposed-modules:     Math.DyckWord.Binary
+                     , Math.DyckWord.Binary.Internal
+  build-depends:       base ==4.*
+                     , text
+                     , exact-combinatorics
+  default-language:    Haskell2010
+
+Test-Suite dyckword-testsuite
+  hs-source-dirs:      tests
+  Type:                exitcode-stdio-1.0
+  Main-is:             Suite.hs
+  Build-depends:       base
+                     , hspec
+                     , dyckword
+                     , text
+                     , ansi-terminal
+  default-language:    Haskell2010
+
+source-repository head
+  type:     git
+  location: https://github.com/johanneshilden/dyckword