packages feed

Cabal revisions of rrb-vector-0.1.0.0

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

revision 1
-name:               rrb-vector-version:            0.1.0.0-synopsis:           Efficient RRB-Vectors-description:-  An RRB-Vector is an efficient sequence data structure.-  It supports fast indexing, iteration, concatenation and splitting.-  .-  == Comparison with [Data.Sequence](https://hackage.haskell.org/package/containers/docs/Data-Sequence.html)-  .-  @Seq a@ is a container with a very similar API. RRB-Vectors are generally faster for indexing and iteration,-  while sequences are faster for access to the front/back (amortized \(O(1)\)).-homepage:           https://github.com/konsumlamm/rrb-vector-bug-reports:        https://github.com/konsumlamm/rrb-vector/issues-license:            BSD3-license-file:       LICENSE-author:             konsumlamm-maintainer:         konsumlamm@gmail.com-copyright:          2021 konsumlamm-category:           Data Structures-build-type:         Simple-extra-source-files: README.md-cabal-version:      2.0-tested-with:        GHC == 8.4.4, GHC == 8.6.5, GHC == 8.8.4, GHC == 8.10.5, GHC == 9.0.1--source-repository head-  type:     git-  location: https://github.com/konsumlamm/rbb-vector--library-  hs-source-dirs:       src-  exposed-modules:-    Data.RRBVector-    Data.RRBVector.Internal.Debug-  other-modules:-    Data.RRBVector.Internal-    Data.RRBVector.Internal.Array-    Data.RRBVector.Internal.Buffer-    Data.RRBVector.Internal.Indexed-    Data.RRBVector.Internal.IntRef-  build-depends:        base >= 4.11 && < 5, deepseq ^>= 1.4.3, indexed-traversable ^>= 0.1, primitive ^>= 0.7-  ghc-options:          -O2 -Wall -Wno-name-shadowing-  default-language:     Haskell2010--test-suite test-  hs-source-dirs:       test-  main-is:              Spec.hs-  type:                 exitcode-stdio-1.0-  ghc-options:          -Wall -Wno-orphans -Wno-type-defaults-  build-depends:        base >= 4.11 && < 5, rrb-vector, hspec, QuickCheck-  default-language:     Haskell2010-  default-extensions:   ExtendedDefaultRules, NumericUnderscores--benchmark rrb-bench-  hs-source-dirs:       bench-  main-is:              Main.hs-  type:                 exitcode-stdio-1.0-  default-language:     Haskell2010-  ghc-options:          -O2-  build-depends:        base >= 4.11 && < 5, gauge, rrb-vector-  default-extensions:   ExtendedDefaultRules, NumericUnderscores--benchmark traverse-  hs-source-dirs:       bench-  main-is:              Traverse.hs-  type:                 exitcode-stdio-1.0-  default-language:     Haskell2010-  ghc-options:          -O2-  build-depends:        base >= 4.11 && < 5, gauge, rrb-vector, primitive-  default-extensions:   ExtendedDefaultRules, NumericUnderscores+name:               rrb-vector
+version:            0.1.0.0
+x-revision: 1
+synopsis:           Efficient RRB-Vectors
+description:
+  An RRB-Vector is an efficient sequence data structure.
+  It supports fast indexing, iteration, concatenation and splitting.
+  .
+  == Comparison with [Data.Sequence](https://hackage.haskell.org/package/containers/docs/Data-Sequence.html)
+  .
+  @Seq a@ is a container with a very similar API. RRB-Vectors are generally faster for indexing and iteration,
+  while sequences are faster for access to the front/back (amortized \(O(1)\)).
+homepage:           https://github.com/konsumlamm/rrb-vector
+bug-reports:        https://github.com/konsumlamm/rrb-vector/issues
+license:            BSD3
+license-file:       LICENSE
+author:             konsumlamm
+maintainer:         konsumlamm@gmail.com
+copyright:          2021 konsumlamm
+category:           Data Structures
+build-type:         Simple
+extra-source-files: README.md
+cabal-version:      2.0
+tested-with:        GHC == 8.4.4, GHC == 8.6.5, GHC == 8.8.4, GHC == 8.10.5, GHC == 9.0.1
+
+source-repository head
+  type:     git
+  location: https://github.com/konsumlamm/rrb-vector
+
+library
+  hs-source-dirs:       src
+  exposed-modules:
+    Data.RRBVector
+    Data.RRBVector.Internal.Debug
+  other-modules:
+    Data.RRBVector.Internal
+    Data.RRBVector.Internal.Array
+    Data.RRBVector.Internal.Buffer
+    Data.RRBVector.Internal.Indexed
+    Data.RRBVector.Internal.IntRef
+  build-depends:        base >= 4.11 && < 5, deepseq ^>= 1.4.3, indexed-traversable ^>= 0.1, primitive ^>= 0.7
+  ghc-options:          -O2 -Wall -Wno-name-shadowing
+  default-language:     Haskell2010
+
+test-suite test
+  hs-source-dirs:       test
+  main-is:              Spec.hs
+  type:                 exitcode-stdio-1.0
+  ghc-options:          -Wall -Wno-orphans -Wno-type-defaults
+  build-depends:        base >= 4.11 && < 5, rrb-vector, hspec, QuickCheck
+  default-language:     Haskell2010
+  default-extensions:   ExtendedDefaultRules, NumericUnderscores
+
+benchmark rrb-bench
+  hs-source-dirs:       bench
+  main-is:              Main.hs
+  type:                 exitcode-stdio-1.0
+  default-language:     Haskell2010
+  ghc-options:          -O2
+  build-depends:        base >= 4.11 && < 5, gauge, rrb-vector
+  default-extensions:   ExtendedDefaultRules, NumericUnderscores
+
+benchmark traverse
+  hs-source-dirs:       bench
+  main-is:              Traverse.hs
+  type:                 exitcode-stdio-1.0
+  default-language:     Haskell2010
+  ghc-options:          -O2
+  build-depends:        base >= 4.11 && < 5, gauge, rrb-vector, primitive
+  default-extensions:   ExtendedDefaultRules, NumericUnderscores