tdigest 0.2.1.1 → 0.3.1

raw patch · 11 files changed

Files

• CHANGELOG.md +8/−0
• src/Data/TDigest/Postprocess.hs +0/−2
• src/Data/TDigest/Postprocess/Internal.hs +7/−9
• src/Data/TDigest/Tree.hs +2/−3
• src/Data/TDigest/Tree/Internal.hs +1/−4
• src/Data/TDigest/Tree/NonEmpty.hs +10/−14
• src/Data/TDigest/Tree/Postprocess.hs +0/−3
• src/Data/TDigest/Vector.hs +2/−3
• src/Data/TDigest/Vector/Internal.hs +0/−2
• src/Data/TDigest/Vector/Postprocess.hs +0/−2
• tdigest.cabal +23/−25

@@ -1,3 +1,11 @@+## 0.3.1++- Support GHC-8.6.5...9.10.1++## 0.3++- Depend on `foldable1-classes-compat` instead of `semigroupoids`.+ ## 0.2.1.1  - `build-type: Simple`

@@ -20,8 +20,6 @@     ) where  import qualified Data.List.NonEmpty as NE-import           Prelude ()-import           Prelude.Compat  import qualified Data.TDigest.Postprocess.Internal as I 

@@ -26,15 +26,13 @@     Affine (..),     ) where -import Data.Foldable           (toList, traverse_)-import Data.Functor.Compose    (Compose (..))-import Data.Functor.Identity   (Identity (..))-import Data.List.NonEmpty      (NonEmpty (..), nonEmpty)-import Data.Proxy              (Proxy (..))-import Data.Semigroup          (Semigroup (..))-import Data.Semigroup.Foldable (foldMap1)-import Prelude ()-import Prelude.Compat+import Data.Foldable         (toList, traverse_)+import Data.Foldable1        (foldMap1)+import Data.Functor.Compose  (Compose (..))+import Data.Functor.Identity (Identity (..))+import Data.List.NonEmpty    (NonEmpty (..), nonEmpty)+import Data.Proxy            (Proxy (..))+import Data.Semigroup        (Semigroup (..))  import qualified Data.List.NonEmpty as NE 

@@ -107,10 +107,9 @@  -- $setup -- >>> :set -XDataKinds--- >>> import Prelude.Compat--- >>> import Data.List.Compat (foldl')+-- >>> import Data.Foldable (foldl') -- >>> import Data.Semigroup ((<>)) -- -- >>> let merge [] ys = []; merge xs [] = xs; merge (x:xs) (y:ys) = x : y : merge xs ys--- >>> let fairshuffle' xs = uncurry merge (splitAt (Prelude.Compat.length xs `div` 2) xs)+-- >>> let fairshuffle' xs = uncurry merge (splitAt (Prelude.length xs `div` 2) xs) -- >>> let fairshuffle xs = iterate fairshuffle' xs !! 5

@@ -12,16 +12,13 @@ import Control.Monad.ST       (ST, runST) import Data.Binary            (Binary (..)) import Data.Either            (isRight)-import Data.Foldable          (toList)-import Data.List.Compat       (foldl')+import Data.Foldable          (toList, foldl') import Data.List.NonEmpty     (nonEmpty) import Data.Ord               (comparing) import Data.Proxy             (Proxy (..)) import Data.Semigroup         (Semigroup (..)) import Data.Semigroup.Reducer (Reducer (..)) import GHC.TypeLits           (KnownNat, Nat, natVal)-import Prelude ()-import Prelude.Compat  import qualified Data.Vector.Algorithms.Heap as VHeap import qualified Data.Vector.Unboxed         as VU

@@ -57,17 +57,14 @@     debugPrint,     ) where -import Prelude ()-import Prelude.Compat--import Control.DeepSeq         (NFData (..))-import Control.Monad           (when)-import Data.Binary             (Binary (..))-import Data.Functor.Identity   (Identity (..))-import Data.Semigroup          (Semigroup (..))-import Data.Semigroup.Foldable (Foldable1)-import Data.Semigroup.Reducer  (Reducer (..))-import GHC.TypeLits            (KnownNat)+import Control.DeepSeq        (NFData (..))+import Control.Monad          (when)+import Data.Binary            (Binary (..))+import Data.Foldable1         (Foldable1)+import Data.Functor.Identity  (Identity (..))+import Data.Semigroup         (Semigroup (..))+import Data.Semigroup.Reducer (Reducer (..))+import GHC.TypeLits           (KnownNat)  import           Data.TDigest.Internal import qualified Data.TDigest.Postprocess   as PP@@ -175,10 +172,9 @@  -- $setup -- >>> :set -XDataKinds--- >>> import Prelude.Compat -- >>> import Data.List.NonEmpty (NonEmpty (..))--- >>> import Data.List.Compat (foldl')+-- >>> import Data.Foldable (foldl') -- -- >>> let merge [] ys = []; merge xs [] = xs; merge (x:xs) (y:ys) = x : y : merge xs ys--- >>> let fairshuffle' xs = uncurry merge (splitAt (length xs `div` 2) xs)+-- >>> let fairshuffle' xs = uncurry merge (splitAt (Prelude.length xs `div` 2) xs) -- >>> let fairshuffle xs = iterate fairshuffle' xs !! 5

@@ -18,9 +18,6 @@     icdf,     ) where -import Prelude ()-import Prelude.Compat- import Data.TDigest.Tree.Internal  import qualified Data.TDigest.Postprocess as PP

@@ -97,10 +97,9 @@  -- $setup -- >>> :set -XDataKinds--- >>> import Prelude.Compat--- >>> import Data.List.Compat (foldl')+-- >>> import Data.Foldable (foldl') -- >>> import Data.Semigroup ((<>)) -- -- >>> let merge [] ys = []; merge xs [] = xs; merge (x:xs) (y:ys) = x : y : merge xs ys--- >>> let fairshuffle' xs = uncurry merge (splitAt (Prelude.Compat.length xs `div` 2) xs)+-- >>> let fairshuffle' xs = uncurry merge (splitAt (Prelude.length xs `div` 2) xs) -- >>> let fairshuffle xs = iterate fairshuffle' xs !! 5

@@ -14,8 +14,6 @@ import Data.Semigroup         (Semigroup (..)) import Data.Semigroup.Reducer (Reducer (..)) import GHC.TypeLits           (KnownNat, Nat, natVal)-import Prelude ()-import Prelude.Compat  import qualified Data.Vector.Unboxed as VU 

@@ -19,8 +19,6 @@     ) where  import GHC.TypeLits   (KnownNat)-import Prelude ()-import Prelude.Compat  import Data.TDigest.Vector.Internal 

@@ -1,6 +1,6 @@-cabal-version:      >=1.10+cabal-version:      2.2 name:               tdigest-version:            0.2.1.1+version:            0.3.1 synopsis:           On-line accumulation of rank-based statistics description:   A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means.@@ -13,22 +13,23 @@ bug-reports:        https://github.com/phadej/haskell-tdigest/issues author:             Oleg Grenrus <oleg.grenrus@iki.fi> maintainer:         Oleg Grenrus <oleg.grenrus@iki.fi>-license:            BSD3+license:            BSD-3-Clause license-file:       LICENSE tested-with:-  GHC ==7.8.4-   || ==7.10.3-   || ==8.0.2-   || ==8.2.2-   || ==8.4.4-   || ==8.6.5+  GHC ==8.6.5    || ==8.8.4-   || ==8.10.3+   || ==8.10.7+   || ==9.0.2+   || ==9.2.8+   || ==9.4.8+   || ==9.6.6+   || ==9.8.2+   || ==9.10.1  build-type:         Simple extra-source-files:-  README.md   CHANGELOG.md+  README.md  source-repository head   type:     git@@ -42,21 +43,19 @@    -- GHC boot libraries   build-depends:-      base          >=4.7     && <4.15-    , binary        >=0.7.1.0 && <0.10-    , deepseq       >=1.3.0.2 && <1.5-    , transformers  >=0.3     && <0.6+    , base          >=4.12.0.0 && <4.22+    , binary        >=0.8.6.0  && <0.10+    , deepseq       >=1.4.4.0  && <1.6+    , transformers  >=0.5.6.2  && <0.7 -  if !impl(ghc >=8.0)-    build-depends: semigroups >=0.18.4 && <0.20+  if !impl(ghc >=9.6)+    build-depends: foldable1-classes-compat >=0.1 && <0.2    -- other dependencies   build-depends:-      base-compat        >=0.10.1   && <0.12     , reducers           >=3.12.2   && <3.13-    , semigroupoids      >=5.2.2    && <5.4-    , vector             >=0.12.0.1 && <0.13-    , vector-algorithms  >=0.7.0.1  && <0.9+    , vector             >=0.12.0.1 && <0.14+    , vector-algorithms  >=0.7.0.1  && <0.10    exposed-modules:     Data.TDigest@@ -89,13 +88,12 @@   ghc-options:      -Wall -threaded   hs-source-dirs:   tests   build-depends:-      base-    , base-compat+    , base     , binary     , deepseq     , semigroups-    , tasty              >=0.11.0.4 && <1.4-    , tasty-quickcheck   >=0.8.4    && <0.11+    , tasty              >=0.11.0.4 && <1.6+    , tasty-quickcheck   >=0.8.4    && <0.12     , tdigest     , vector     , vector-algorithms