Cabal revisions of acme-circular-containers-0.1.0.0

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

--- This file has been generated from package.yaml by hpack version 0.28.2.------ see: https://github.com/sol/hpack------ hash: 9bfd1add64ea5a2ac495678caae6921732856bc9198297dfce5b9048ffe58f7d--name:           acme-circular-containers-version:        0.1.0.0-synopsis:       Spineless containers which are fast to read but inefficient to update-description:    Doubly-linked lists, doubly-linked trees, and naïvely-represented graphs, with each vertex literally pointing at its neighbours.-category:       Acme-homepage:       https://github.com/gelisam/acme-circular-containers#readme-bug-reports:    https://github.com/gelisam/acme-circular-containers/issues-author:         Samuel Gélineau-maintainer:     gelisam+github@gmail.com-license:        PublicDomain-build-type:     Simple-cabal-version:  >= 1.10-extra-source-files:-    README.md--source-repository head-  type: git-  location: https://github.com/gelisam/acme-circular-containers--library-  exposed-modules:-      Data.Graph.Wrapper.Circular-      Data.Sequence.Circular-      Data.Tree.Circular-  other-modules:-      Paths_acme_circular_containers-  hs-source-dirs:-      src-  ghc-options: -W -Wall-  build-depends:-      base >=4.7 && <5-    , containers-    , graph-wrapper-  default-language: Haskell2010--test-suite doctests-  type: exitcode-stdio-1.0-  main-is: doctests.hs-  other-modules:-      Paths_acme_circular_containers-  hs-source-dirs:-      tests-  build-depends:-      base >=4.7 && <5-    , containers-    , doctest-    , doctest-discover-    , graph-wrapper-  default-language: Haskell2010+-- This file has been generated from package.yaml by hpack version 0.28.2.
+--
+-- see: https://github.com/sol/hpack
+--
+-- hash: 9bfd1add64ea5a2ac495678caae6921732856bc9198297dfce5b9048ffe58f7d
+
+name:           acme-circular-containers
+version:        0.1.0.0
+x-revision: 1
+synopsis:       Spineless containers which are fast to read but inefficient to update
+description:    Doubly-linked lists, doubly-linked trees, and naïvely-represented graphs, with each vertex literally pointing at its neighbours.
+category:       Acme
+homepage:       https://github.com/gelisam/acme-circular-containers#readme
+bug-reports:    https://github.com/gelisam/acme-circular-containers/issues
+author:         Samuel Gélineau
+maintainer:     gelisam+github@gmail.com
+license:        PublicDomain
+build-type:     Simple
+cabal-version:  >= 1.10
+extra-source-files:
+    README.md
+
+source-repository head
+  type: git
+  location: https://github.com/gelisam/acme-circular-containers
+
+library
+  exposed-modules:
+      Data.Graph.Wrapper.Circular
+      Data.Sequence.Circular
+      Data.Tree.Circular
+  other-modules:
+      Paths_acme_circular_containers
+  hs-source-dirs:
+      src
+  ghc-options: -W -Wall
+  build-depends:
+      base >=4.7 && <5
+    , containers >= 0.5.8
+    , graph-wrapper
+  default-language: Haskell2010
+
+test-suite doctests
+  type: exitcode-stdio-1.0
+  main-is: doctests.hs
+  other-modules:
+      Paths_acme_circular_containers
+  hs-source-dirs:
+      tests
+  build-depends:
+      base >=4.7 && <5
+    , containers
+    , doctest
+    , doctest-discover
+    , graph-wrapper
+  default-language: Haskell2010

 
 name:           acme-circular-containers
 version:        0.1.0.0
-x-revision: 1
+x-revision: 2
 synopsis:       Spineless containers which are fast to read but inefficient to update
 description:    Doubly-linked lists, doubly-linked trees, and naïvely-represented graphs, with each vertex literally pointing at its neighbours.
 category:       Acme
       src
   ghc-options: -W -Wall
   build-depends:
-      base >=4.7 && <5
+      base >=4.8 && <5
     , containers >= 0.5.8
     , graph-wrapper
   default-language: Haskell2010
   hs-source-dirs:
       tests
   build-depends:
-      base >=4.7 && <5
+      base >=4.8 && <5
     , containers
     , doctest
     , doctest-discover

 
 name:           acme-circular-containers
 version:        0.1.0.0
-x-revision: 2
+x-revision: 3
 synopsis:       Spineless containers which are fast to read but inefficient to update
 description:    Doubly-linked lists, doubly-linked trees, and naïvely-represented graphs, with each vertex literally pointing at its neighbours.
 category:       Acme
       src
   ghc-options: -W -Wall
   build-depends:
-      base >=4.8 && <5
+      base >=4.9 && <5
     , containers >= 0.5.8
     , graph-wrapper
   default-language: Haskell2010