hw-fingertree-strict 0.1.1.1 → 0.1.1.2
raw patch · 3 files changed
+68/−60 lines, 3 filesdep ~HUnitdep ~QuickCheckdep ~basePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: HUnit, QuickCheck, base, deepseq, hedgehog, hspec, hw-hspec-hedgehog
API changes (from Hackage documentation)
- HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData (s a), Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
- HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData (s a), Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
- HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData t) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.Split t a)
- HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData v) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.Node v a)
- HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData v, Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.FingerTree v a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Eq (s a), GHC.Classes.Eq a) => GHC.Classes.Eq (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Eq (s a), GHC.Classes.Eq a) => GHC.Classes.Eq (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Eq a, GHC.Classes.Eq t) => GHC.Classes.Eq (HaskellWorks.Data.FingerTree.Strict.Split t a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Ord (s a), GHC.Classes.Ord a) => GHC.Classes.Ord (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Ord (s a), GHC.Classes.Ord a) => GHC.Classes.Ord (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Read.Read (s a), GHC.Read.Read a) => GHC.Read.Read (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Read.Read (s a), GHC.Read.Read a) => GHC.Read.Read (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show (s a), GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show (s a), GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show a, GHC.Show.Show t) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.Split t a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show a, GHC.Show.Show v) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.Node v a)
- HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show v, GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.FingerTree v a)
- HaskellWorks.Data.FingerTree.Strict: instance HaskellWorks.Data.FingerTree.Strict.Measured v a => Data.Semigroup.Semigroup (HaskellWorks.Data.FingerTree.Strict.FingerTree v a)
- HaskellWorks.Data.IntervalMap.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData v) => Control.DeepSeq.NFData (HaskellWorks.Data.IntervalMap.Strict.IntervalMap v a)
- HaskellWorks.Data.IntervalMap.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData v) => Control.DeepSeq.NFData (HaskellWorks.Data.IntervalMap.Strict.Node v a)
- HaskellWorks.Data.IntervalMap.Strict: instance (GHC.Classes.Eq a, GHC.Classes.Eq v) => GHC.Classes.Eq (HaskellWorks.Data.IntervalMap.Strict.Node v a)
- HaskellWorks.Data.IntervalMap.Strict: instance (GHC.Show.Show a, GHC.Show.Show v) => GHC.Show.Show (HaskellWorks.Data.IntervalMap.Strict.IntervalMap v a)
- HaskellWorks.Data.IntervalMap.Strict: instance (GHC.Show.Show a, GHC.Show.Show v) => GHC.Show.Show (HaskellWorks.Data.IntervalMap.Strict.Node v a)
- HaskellWorks.Data.IntervalMap.Strict: instance GHC.Classes.Ord v => Data.Semigroup.Semigroup (HaskellWorks.Data.IntervalMap.Strict.IntInterval v)
- HaskellWorks.Data.IntervalMap.Strict: instance GHC.Classes.Ord v => Data.Semigroup.Semigroup (HaskellWorks.Data.IntervalMap.Strict.IntervalMap v a)
- HaskellWorks.Data.Item.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData k) => Control.DeepSeq.NFData (HaskellWorks.Data.Item.Strict.Item k a)
- HaskellWorks.Data.Item.Strict: instance (GHC.Classes.Eq a, GHC.Classes.Eq k) => GHC.Classes.Eq (HaskellWorks.Data.Item.Strict.Item k a)
- HaskellWorks.Data.Item.Strict: instance (GHC.Show.Show a, GHC.Show.Show k) => GHC.Show.Show (HaskellWorks.Data.Item.Strict.Item k a)
- HaskellWorks.Data.PriorityQueue.Strict: instance GHC.Classes.Ord k => Data.Semigroup.Semigroup (HaskellWorks.Data.PriorityQueue.Strict.PQueue k v)
- HaskellWorks.Data.PriorityQueue.Strict: instance GHC.Classes.Ord k => Data.Semigroup.Semigroup (HaskellWorks.Data.PriorityQueue.Strict.Prio k v)
- HaskellWorks.Data.SegmentMap.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData k) => Control.DeepSeq.NFData (HaskellWorks.Data.SegmentMap.Strict.OrderedMap k a)
- HaskellWorks.Data.SegmentMap.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData k) => Control.DeepSeq.NFData (HaskellWorks.Data.SegmentMap.Strict.SegmentMap k a)
- HaskellWorks.Data.SegmentMap.Strict: instance (GHC.Show.Show a, GHC.Show.Show k) => GHC.Show.Show (HaskellWorks.Data.SegmentMap.Strict.OrderedMap k a)
- HaskellWorks.Data.SegmentMap.Strict: instance (GHC.Show.Show a, GHC.Show.Show k) => GHC.Show.Show (HaskellWorks.Data.SegmentMap.Strict.SegmentMap k a)
- HaskellWorks.Data.SegmentSet.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData k) => Control.DeepSeq.NFData (HaskellWorks.Data.SegmentSet.Strict.OrderedMap k a)
- HaskellWorks.Data.SegmentSet.Strict: instance (GHC.Show.Show a, GHC.Show.Show k) => GHC.Show.Show (HaskellWorks.Data.SegmentSet.Strict.OrderedMap k a)
+ HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData (s a)) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData (s a)) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData a, Control.DeepSeq.NFData v) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.FingerTree v a)
+ HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData t, Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.Split t a)
+ HaskellWorks.Data.FingerTree.Strict: instance (Control.DeepSeq.NFData v, Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.FingerTree.Strict.Node v a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Eq a, GHC.Classes.Eq (s a)) => GHC.Classes.Eq (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Eq a, GHC.Classes.Eq (s a)) => GHC.Classes.Eq (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Eq t, GHC.Classes.Eq a) => GHC.Classes.Eq (HaskellWorks.Data.FingerTree.Strict.Split t a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Ord a, GHC.Classes.Ord (s a)) => GHC.Classes.Ord (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Classes.Ord a, GHC.Classes.Ord (s a)) => GHC.Classes.Ord (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Read.Read a, GHC.Read.Read (s a)) => GHC.Read.Read (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Read.Read a, GHC.Read.Read (s a)) => GHC.Read.Read (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show a, GHC.Show.Show (s a)) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.ViewL s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show a, GHC.Show.Show (s a)) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.ViewR s a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show a, GHC.Show.Show v) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.FingerTree v a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show t, GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.Split t a)
+ HaskellWorks.Data.FingerTree.Strict: instance (GHC.Show.Show v, GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.FingerTree.Strict.Node v a)
+ HaskellWorks.Data.FingerTree.Strict: instance HaskellWorks.Data.FingerTree.Strict.Measured v a => GHC.Base.Semigroup (HaskellWorks.Data.FingerTree.Strict.FingerTree v a)
+ HaskellWorks.Data.IntervalMap.Strict: instance (Control.DeepSeq.NFData v, Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.IntervalMap.Strict.IntervalMap v a)
+ HaskellWorks.Data.IntervalMap.Strict: instance (Control.DeepSeq.NFData v, Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.IntervalMap.Strict.Node v a)
+ HaskellWorks.Data.IntervalMap.Strict: instance (GHC.Classes.Eq v, GHC.Classes.Eq a) => GHC.Classes.Eq (HaskellWorks.Data.IntervalMap.Strict.Node v a)
+ HaskellWorks.Data.IntervalMap.Strict: instance (GHC.Show.Show v, GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.IntervalMap.Strict.IntervalMap v a)
+ HaskellWorks.Data.IntervalMap.Strict: instance (GHC.Show.Show v, GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.IntervalMap.Strict.Node v a)
+ HaskellWorks.Data.IntervalMap.Strict: instance GHC.Classes.Ord v => GHC.Base.Semigroup (HaskellWorks.Data.IntervalMap.Strict.IntInterval v)
+ HaskellWorks.Data.IntervalMap.Strict: instance GHC.Classes.Ord v => GHC.Base.Semigroup (HaskellWorks.Data.IntervalMap.Strict.IntervalMap v a)
+ HaskellWorks.Data.Item.Strict: instance (Control.DeepSeq.NFData k, Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.Item.Strict.Item k a)
+ HaskellWorks.Data.Item.Strict: instance (GHC.Classes.Eq k, GHC.Classes.Eq a) => GHC.Classes.Eq (HaskellWorks.Data.Item.Strict.Item k a)
+ HaskellWorks.Data.Item.Strict: instance (GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.Item.Strict.Item k a)
+ HaskellWorks.Data.PriorityQueue.Strict: instance GHC.Classes.Ord k => GHC.Base.Semigroup (HaskellWorks.Data.PriorityQueue.Strict.PQueue k v)
+ HaskellWorks.Data.PriorityQueue.Strict: instance GHC.Classes.Ord k => GHC.Base.Semigroup (HaskellWorks.Data.PriorityQueue.Strict.Prio k v)
+ HaskellWorks.Data.SegmentMap.Strict: instance (Control.DeepSeq.NFData k, Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.SegmentMap.Strict.OrderedMap k a)
+ HaskellWorks.Data.SegmentMap.Strict: instance (Control.DeepSeq.NFData k, Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.SegmentMap.Strict.SegmentMap k a)
+ HaskellWorks.Data.SegmentMap.Strict: instance (GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.SegmentMap.Strict.OrderedMap k a)
+ HaskellWorks.Data.SegmentMap.Strict: instance (GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.SegmentMap.Strict.SegmentMap k a)
+ HaskellWorks.Data.SegmentSet.Strict: instance (Control.DeepSeq.NFData k, Control.DeepSeq.NFData a) => Control.DeepSeq.NFData (HaskellWorks.Data.SegmentSet.Strict.OrderedMap k a)
+ HaskellWorks.Data.SegmentSet.Strict: instance (GHC.Show.Show k, GHC.Show.Show a) => GHC.Show.Show (HaskellWorks.Data.SegmentSet.Strict.OrderedMap k a)
- HaskellWorks.Data.FingerTree.Strict: (:<) :: !a -> !(s a) -> ViewL s a
+ HaskellWorks.Data.FingerTree.Strict: (:<) :: !a -> !s a -> ViewL s a
- HaskellWorks.Data.FingerTree.Strict: (:>) :: !(s a) -> !a -> ViewR s a
+ HaskellWorks.Data.FingerTree.Strict: (:>) :: !s a -> !a -> ViewR s a
- HaskellWorks.Data.FingerTree.Strict: Deep :: !v -> !(Digit a) -> !(FingerTree v (Node v a)) -> !(Digit a) -> FingerTree v a
+ HaskellWorks.Data.FingerTree.Strict: Deep :: !v -> !Digit a -> !FingerTree v (Node v a) -> !Digit a -> FingerTree v a
- HaskellWorks.Data.FingerTree.Strict: infixl 5 |>
+ HaskellWorks.Data.FingerTree.Strict: infixl 5 :>
- HaskellWorks.Data.FingerTree.Strict: infixr 5 ><
+ HaskellWorks.Data.FingerTree.Strict: infixr 5 :<
- HaskellWorks.Data.FingerTree.Strict: unsafeTraverse :: (Applicative f) => (a -> f b) -> FingerTree v a -> f (FingerTree v b)
+ HaskellWorks.Data.FingerTree.Strict: unsafeTraverse :: Applicative f => (a -> f b) -> FingerTree v a -> f (FingerTree v b)
- HaskellWorks.Data.IntervalMap.Strict: IntervalMap :: (FingerTree (IntInterval v) (Node v a)) -> IntervalMap v a
+ HaskellWorks.Data.IntervalMap.Strict: IntervalMap :: FingerTree (IntInterval v) (Node v a) -> IntervalMap v a
- HaskellWorks.Data.IntervalMap.Strict: dominators :: (Ord v) => Interval v -> IntervalMap v a -> [(Interval v, a)]
+ HaskellWorks.Data.IntervalMap.Strict: dominators :: Ord v => Interval v -> IntervalMap v a -> [(Interval v, a)]
- HaskellWorks.Data.IntervalMap.Strict: insert :: (Ord v) => Interval v -> a -> IntervalMap v a -> IntervalMap v a
+ HaskellWorks.Data.IntervalMap.Strict: insert :: Ord v => Interval v -> a -> IntervalMap v a -> IntervalMap v a
- HaskellWorks.Data.IntervalMap.Strict: intersections :: (Ord v) => Interval v -> IntervalMap v a -> [(Interval v, a)]
+ HaskellWorks.Data.IntervalMap.Strict: intersections :: Ord v => Interval v -> IntervalMap v a -> [(Interval v, a)]
- HaskellWorks.Data.IntervalMap.Strict: search :: (Ord v) => v -> IntervalMap v a -> [(Interval v, a)]
+ HaskellWorks.Data.IntervalMap.Strict: search :: Ord v => v -> IntervalMap v a -> [(Interval v, a)]
- HaskellWorks.Data.IntervalMap.Strict: union :: (Ord v) => IntervalMap v a -> IntervalMap v a -> IntervalMap v a
+ HaskellWorks.Data.IntervalMap.Strict: union :: Ord v => IntervalMap v a -> IntervalMap v a -> IntervalMap v a
- HaskellWorks.Data.SegmentMap.Strict: OrderedMap :: (FingerTree k (Item k a)) -> OrderedMap k a
+ HaskellWorks.Data.SegmentMap.Strict: OrderedMap :: FingerTree k (Item k a) -> OrderedMap k a
- HaskellWorks.Data.SegmentMap.Strict: SegmentMap :: (OrderedMap (Max k) (Segment k, a)) -> SegmentMap k a
+ HaskellWorks.Data.SegmentMap.Strict: SegmentMap :: OrderedMap (Max k) (Segment k, a) -> SegmentMap k a
- HaskellWorks.Data.SegmentSet.Strict: OrderedMap :: (FingerTree k (Item k a)) -> OrderedMap k a
+ HaskellWorks.Data.SegmentSet.Strict: OrderedMap :: FingerTree k (Item k a) -> OrderedMap k a
- HaskellWorks.Data.SegmentSet.Strict: SegmentSet :: (OrderedMap (Max k) (Segment k)) -> SegmentSet k
+ HaskellWorks.Data.SegmentSet.Strict: SegmentSet :: OrderedMap (Max k) (Segment k) -> SegmentSet k
Files
- hw-fingertree-strict.cabal +66/−58
- test/HaskellWorks/Data/FingerTree/StrictSpec.hs +1/−1
- test/HaskellWorks/Data/FingerTreeSpec.hs +1/−1
hw-fingertree-strict.cabal view
@@ -1,11 +1,7 @@--- This file has been generated from package.yaml by hpack version 0.20.0.------ see: https://github.com/sol/hpack------ hash: 1a9f8c64ec2369530869030e8871c1280ef0345df0b89a6a286c8bcb125cd482+cabal-version: 2.2 name: hw-fingertree-strict-version: 0.1.1.1+version: 0.1.1.2 synopsis: Generic strict finger-tree structure description: A general sequence representation with arbitrary annotations, for use as a base for implementations of@@ -25,13 +21,11 @@ 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+copyright: 2017-2019 John Ky;+ 2006 Ross Paterson, Ralf Hinze+license: BSD-3-Clause license-file: LICENSE build-type: Simple-cabal-version: >= 1.10- extra-source-files: README.md @@ -39,55 +33,69 @@ type: git location: https://github.com/haskell-works/hw-fingertree-strict -library- hs-source-dirs:- src- other-extensions: DeriveAnyClass- build-depends:- base >=4.7 && <5- , deepseq- if !(impl(ghc >=8.0))+common base { build-depends: base >= 4.7 && < 5 }++common deepseq { build-depends: deepseq >= 1.4 && < 1.5 }+common hedgehog { build-depends: hedgehog >= 0.6 && < 1.1 }+common hspec { build-depends: hspec >= 2.4 && < 2.8 }+common HUnit { build-depends: HUnit >= 1.5 && < 1.7 }+common hw-hspec-hedgehog { build-depends: hw-hspec-hedgehog >= 0.1 && < 0.2 }+common QuickCheck { build-depends: QuickCheck >= 2.10 && < 2.14 }+common test-framework { build-depends: test-framework }+common test-framework-hunit { build-depends: test-framework-hunit }+common test-framework-quickcheck2 { build-depends: test-framework-quickcheck2 }++common hw-fingertree-strict+ build-depends: hw-fingertree-strict++common config+ default-language: Haskell2010+ if !(impl(ghc >= 8.0)) build-depends:- semigroups ==0.18.*+ semigroups == 0.18.*++library+ import: base, config+ , deepseq+ hs-source-dirs: src+ other-extensions: DeriveAnyClass+ other-modules: Paths_hw_fingertree_strict+ autogen-modules: Paths_hw_fingertree_strict 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+ 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 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+ import: base, config+ , HUnit+ , QuickCheck+ , hedgehog+ , hspec+ , hw-fingertree-strict+ , hw-hspec-hedgehog+ , test-framework+ , test-framework-hunit+ , test-framework-quickcheck2+ type: exitcode-stdio-1.0+ main-is: Spec.hs+ hs-source-dirs: test+ ghc-options: -threaded -rtsopts -with-rtsopts=-N+ cpp-options: -DTESTING+ build-tool-depends: hspec-discover:hspec-discover+ autogen-modules: Paths_hw_fingertree_strict other-modules:- HaskellWorks.Data.FingerTree.Gen- HaskellWorks.Data.FingerTree.Strict.Gen- HaskellWorks.Data.FingerTree.StrictSpec- HaskellWorks.Data.FingerTreeSpec- 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+ HaskellWorks.Data.FingerTree.Gen+ HaskellWorks.Data.FingerTree.Strict.Gen+ HaskellWorks.Data.FingerTree.StrictSpec+ HaskellWorks.Data.FingerTreeSpec+ HaskellWorks.Data.Gen+ HaskellWorks.Data.SegmentMap.StrictSpec+ HaskellWorks.Data.SegmentSet.Naive+ HaskellWorks.Data.SegmentSet.NaiveSpec+ HaskellWorks.Data.SegmentSet.StrictSpec+ Paths_hw_fingertree_strict
test/HaskellWorks/Data/FingerTree/StrictSpec.hs view
@@ -24,7 +24,7 @@ {-# ANN module ("HLint: ignore Redundant do" :: String) #-} {-# ANN module ("HLint: ignore Reduce duplication" :: String) #-}-{-# ANN module ("HLint: redundant bracket" :: String) #-}+{-# ANN module ("HLint: ignore Redundant bracket" :: String) #-} spec :: Spec spec = do
test/HaskellWorks/Data/FingerTreeSpec.hs view
@@ -24,7 +24,7 @@ {-# ANN module ("HLint: ignore Redundant do" :: String) #-} {-# ANN module ("HLint: ignore Reduce duplication" :: String) #-}-{-# ANN module ("HLint: redundant bracket" :: String) #-}+{-# ANN module ("HLint: ignore Redundant bracket" :: String) #-} spec :: Spec spec = do