Cabal revisions of hw-fingertree-strict-0.1.0.2
Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.
revision 1
--- This file has been generated from package.yaml by hpack version 0.20.0.------ see: https://github.com/sol/hpack------ hash: cf96e753aa89a6ce71fe493132b754969cc657812d4d88482f673fee7fe3a96c--name: hw-fingertree-strict-version: 0.1.0.2-synopsis: Generic strict finger-tree structure-description: A general sequence representation with arbitrary- annotations, for use as a base for implementations of- various collection types, with examples, as described- in section 4 of- .- * Ralf Hinze and Ross Paterson,- \"Finger trees: a simple general-purpose data structure\",- /Journal of Functional Programming/ 16:2 (2006) pp 197-217.- <http://staff.city.ac.uk/~ross/papers/FingerTree.html>- .- For a tuned sequence type, see @Data.Sequence@ in the- @containers@ package, which is a specialization of- this structure.-category: Data Structures-homepage: https://github.com/haskell-works/hw-fingertree-strict#readme-bug-reports: https://github.com/haskell-works/hw-fingertree-strict/issues-author: John Ky-maintainer: newhoggy@gmail.com-copyright: 2017 John Ky; 2006 Ross Paterson,- Ralf Hinze-license: BSD3-license-file: LICENSE-build-type: Simple-cabal-version: >= 1.10--extra-source-files:- README.md--source-repository head- type: git- location: https://github.com/haskell-works/hw-fingertree-strict--library- hs-source-dirs:- src- build-depends:- base >=4.7 && <5- if !(impl(ghc >=8.0))- build-depends:- semigroups ==0.18.*- exposed-modules:- HaskellWorks.Data.FingerTree.Strict- HaskellWorks.Data.IntervalMap.Strict- HaskellWorks.Data.Item.Strict- HaskellWorks.Data.PriorityQueue.Strict- HaskellWorks.Data.SegmentMap.Strict- HaskellWorks.Data.SegmentSet.Strict- HaskellWorks.Data.Segment.Strict- other-modules:- Paths_hw_fingertree_strict- default-language: Haskell2010--test-suite hw-fingertree-strict-test- type: exitcode-stdio-1.0- main-is: Spec.hs- hs-source-dirs:- test- ghc-options: -threaded -rtsopts -with-rtsopts=-N- cpp-options: -DTESTING- build-depends:- HUnit- , QuickCheck- , base >=4.2 && <6- , hedgehog- , hspec- , hw-fingertree-strict- , hw-hspec-hedgehog- , test-framework- , test-framework-hunit- , test-framework-quickcheck2- other-modules:- HaskellWorks.Data.FingerTree.Strict.Gen- HaskellWorks.Data.FingerTree.StrictSpec- HaskellWorks.Data.Gen- HaskellWorks.Data.SegmentMap.StrictSpec- HaskellWorks.Data.SegmentSet.Naive- HaskellWorks.Data.SegmentSet.NaiveSpec- HaskellWorks.Data.SegmentSet.StrictSpec- Paths_hw_fingertree_strict- default-language: Haskell2010+-- This file has been generated from package.yaml by hpack version 0.20.0. +-- +-- see: https://github.com/sol/hpack +-- +-- hash: cf96e753aa89a6ce71fe493132b754969cc657812d4d88482f673fee7fe3a96c + +name: hw-fingertree-strict +version: 0.1.0.2 +x-revision: 1 +synopsis: Generic strict finger-tree structure +description: A general sequence representation with arbitrary + annotations, for use as a base for implementations of + various collection types, with examples, as described + in section 4 of + . + * Ralf Hinze and Ross Paterson, + \"Finger trees: a simple general-purpose data structure\", + /Journal of Functional Programming/ 16:2 (2006) pp 197-217. + <http://staff.city.ac.uk/~ross/papers/FingerTree.html> + . + For a tuned sequence type, see @Data.Sequence@ in the + @containers@ package, which is a specialization of + this structure. +category: Data Structures +homepage: https://github.com/haskell-works/hw-fingertree-strict#readme +bug-reports: https://github.com/haskell-works/hw-fingertree-strict/issues +author: John Ky +maintainer: newhoggy@gmail.com +copyright: 2017 John Ky; 2006 Ross Paterson, + Ralf Hinze +license: BSD3 +license-file: LICENSE +build-type: Simple +cabal-version: >= 1.10 + +extra-source-files: + README.md + +source-repository head + type: git + location: https://github.com/haskell-works/hw-fingertree-strict + +library + hs-source-dirs: + src + build-depends: + base >=4.7 && <5 + if !(impl(ghc >=8.0)) + build-depends: + semigroups ==0.18.* + exposed-modules: + HaskellWorks.Data.FingerTree.Strict + HaskellWorks.Data.IntervalMap.Strict + HaskellWorks.Data.Item.Strict + HaskellWorks.Data.PriorityQueue.Strict + HaskellWorks.Data.SegmentMap.Strict + HaskellWorks.Data.SegmentSet.Strict + HaskellWorks.Data.Segment.Strict + other-modules: + Paths_hw_fingertree_strict + other-extensions: + DeriveAnyClass + default-language: Haskell2010 + +test-suite hw-fingertree-strict-test + type: exitcode-stdio-1.0 + main-is: Spec.hs + hs-source-dirs: + test + ghc-options: -threaded -rtsopts -with-rtsopts=-N + cpp-options: -DTESTING + build-depends: + HUnit + , QuickCheck + , base >=4.2 && <6 + , hedgehog + , hspec + , hw-fingertree-strict + , hw-hspec-hedgehog + , test-framework + , test-framework-hunit + , test-framework-quickcheck2 + other-modules: + HaskellWorks.Data.FingerTree.Strict.Gen + HaskellWorks.Data.FingerTree.StrictSpec + HaskellWorks.Data.Gen + HaskellWorks.Data.SegmentMap.StrictSpec + HaskellWorks.Data.SegmentSet.Naive + HaskellWorks.Data.SegmentSet.NaiveSpec + HaskellWorks.Data.SegmentSet.StrictSpec + Paths_hw_fingertree_strict + default-language: Haskell2010