foldl-statistics 0.1.5.0 → 0.1.5.1
raw patch · 2 files changed
+25/−10 lines, 2 filesdep ~containersdep ~criteriondep ~foldlPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: containers, criterion, foldl, math-functions, mwc-random, profunctors, tasty, tasty-quickcheck
API changes (from Hackage documentation)
- Control.Foldl.Statistics: instance Data.Semigroup.Semigroup Control.Foldl.Statistics.LMVSKState
- Control.Foldl.Statistics: instance Data.Semigroup.Semigroup Control.Foldl.Statistics.LinRegState
+ Control.Foldl.Statistics: EndoM :: a -> m a -> EndoM a
+ Control.Foldl.Statistics: [FoldM] :: FoldM m a b
+ Control.Foldl.Statistics: [Fold] :: Fold a b
+ Control.Foldl.Statistics: [appEndoM] :: EndoM a -> a -> m a
+ Control.Foldl.Statistics: _Fold1 :: () => a -> a -> a -> Fold a Maybe a
+ Control.Foldl.Statistics: all :: () => a -> Bool -> Fold a Bool
+ Control.Foldl.Statistics: and :: Fold Bool Bool
+ Control.Foldl.Statistics: any :: () => a -> Bool -> Fold a Bool
+ Control.Foldl.Statistics: class Foldable (t :: * -> *)
+ Control.Foldl.Statistics: class Monad m => PrimMonad (m :: * -> *)
+ Control.Foldl.Statistics: class MVector Mutable v a => Vector (v :: * -> *) a
+ Control.Foldl.Statistics: data Fold a b
+ Control.Foldl.Statistics: data FoldM (m :: * -> *) a b
+ Control.Foldl.Statistics: data RealWorld
+ Control.Foldl.Statistics: duplicateM :: Applicative m => FoldM m a b -> FoldM m a FoldM m a b
+ Control.Foldl.Statistics: elem :: Eq a => a -> Fold a Bool
+ Control.Foldl.Statistics: elemIndex :: Eq a => a -> Fold a Maybe Int
+ Control.Foldl.Statistics: eqNub :: Eq a => Fold a [a]
+ Control.Foldl.Statistics: filtered :: Monoid m => a -> Bool -> a -> m -> a -> m
+ Control.Foldl.Statistics: find :: () => a -> Bool -> Fold a Maybe a
+ Control.Foldl.Statistics: findIndex :: () => a -> Bool -> Fold a Maybe Int
+ Control.Foldl.Statistics: fold :: Foldable f => Fold a b -> f a -> b
+ Control.Foldl.Statistics: foldM :: (Foldable f, Monad m) => FoldM m a b -> f a -> m b
+ Control.Foldl.Statistics: foldMap :: Monoid w => a -> w -> w -> b -> Fold a b
+ Control.Foldl.Statistics: foldOver :: () => Handler s a -> Fold a b -> s -> b
+ Control.Foldl.Statistics: foldOverM :: Monad m => HandlerM m s a -> FoldM m a b -> s -> m b
+ Control.Foldl.Statistics: folded :: (Contravariant f, Applicative f, Foldable t) => a -> f a -> t a -> f t a
+ Control.Foldl.Statistics: generalize :: Monad m => Fold a b -> FoldM m a b
+ Control.Foldl.Statistics: genericIndex :: Integral i => i -> Fold a Maybe a
+ Control.Foldl.Statistics: genericLength :: Num b => Fold a b
+ Control.Foldl.Statistics: groupBy :: Ord g => a -> g -> Fold a r -> Fold a Map g r
+ Control.Foldl.Statistics: handles :: () => Handler a b -> Fold b r -> Fold a r
+ Control.Foldl.Statistics: handlesM :: () => HandlerM m a b -> FoldM m b r -> FoldM m a r
+ Control.Foldl.Statistics: hashMap :: (Eq a, Hashable a) => Fold (a, b) HashMap a b
+ Control.Foldl.Statistics: hashSet :: (Eq a, Hashable a) => Fold a HashSet a
+ Control.Foldl.Statistics: head :: () => Fold a Maybe a
+ Control.Foldl.Statistics: hoists :: () => forall x. () => m x -> n x -> FoldM m a b -> FoldM n a b
+ Control.Foldl.Statistics: impurely :: () => forall x. () => x -> a -> m x -> m x -> x -> m b -> r -> FoldM m a b -> r
+ Control.Foldl.Statistics: impurely_ :: Monad m => forall x. () => x -> a -> m x -> m x -> m x -> FoldM m a b -> m b
+ Control.Foldl.Statistics: index :: () => Int -> Fold a Maybe a
+ Control.Foldl.Statistics: instance GHC.Base.Semigroup Control.Foldl.Statistics.LMVSKState
+ Control.Foldl.Statistics: instance GHC.Base.Semigroup Control.Foldl.Statistics.LinRegState
+ Control.Foldl.Statistics: last :: () => Fold a Maybe a
+ Control.Foldl.Statistics: lastDef :: () => a -> Fold a a
+ Control.Foldl.Statistics: lastN :: () => Int -> Fold a [a]
+ Control.Foldl.Statistics: length :: () => Fold a Int
+ Control.Foldl.Statistics: list :: () => Fold a [a]
+ Control.Foldl.Statistics: lookup :: Eq a => a -> Fold (a, b) Maybe b
+ Control.Foldl.Statistics: map :: Ord a => Fold (a, b) Map a b
+ Control.Foldl.Statistics: mapM_ :: Monad m => a -> m () -> FoldM m a ()
+ Control.Foldl.Statistics: maximum :: Ord a => Fold a Maybe a
+ Control.Foldl.Statistics: maximumBy :: () => a -> a -> Ordering -> Fold a Maybe a
+ Control.Foldl.Statistics: mconcat :: Monoid a => Fold a a
+ Control.Foldl.Statistics: minimum :: Ord a => Fold a Maybe a
+ Control.Foldl.Statistics: minimumBy :: () => a -> a -> Ordering -> Fold a Maybe a
+ Control.Foldl.Statistics: newtype EndoM (m :: * -> *) a
+ Control.Foldl.Statistics: notElem :: Eq a => a -> Fold a Bool
+ Control.Foldl.Statistics: nub :: Ord a => Fold a [a]
+ Control.Foldl.Statistics: null :: () => Fold a Bool
+ Control.Foldl.Statistics: or :: Fold Bool Bool
+ Control.Foldl.Statistics: postscan :: Traversable t => Fold a b -> t a -> t b
+ Control.Foldl.Statistics: prefilter :: () => a -> Bool -> Fold a r -> Fold a r
+ Control.Foldl.Statistics: prefilterM :: Monad m => a -> m Bool -> FoldM m a r -> FoldM m a r
+ Control.Foldl.Statistics: premap :: () => a -> b -> Fold b r -> Fold a r
+ Control.Foldl.Statistics: premapM :: Monad m => a -> m b -> FoldM m b r -> FoldM m a r
+ Control.Foldl.Statistics: prescan :: Traversable t => Fold a b -> t a -> t b
+ Control.Foldl.Statistics: product :: Num a => Fold a a
+ Control.Foldl.Statistics: purely :: () => forall x. () => x -> a -> x -> x -> x -> b -> r -> Fold a b -> r
+ Control.Foldl.Statistics: purely_ :: () => forall x. () => x -> a -> x -> x -> x -> Fold a b -> b
+ Control.Foldl.Statistics: random :: () => FoldM IO a Maybe a
+ Control.Foldl.Statistics: randomN :: Vector v a => Int -> FoldM IO a Maybe v a
+ Control.Foldl.Statistics: revList :: () => Fold a [a]
+ Control.Foldl.Statistics: scan :: () => Fold a b -> [a] -> [b]
+ Control.Foldl.Statistics: set :: Ord a => Fold a Set a
+ Control.Foldl.Statistics: simplify :: () => FoldM Identity a b -> Fold a b
+ Control.Foldl.Statistics: sink :: (Monoid w, Monad m) => a -> m w -> FoldM m a w
+ Control.Foldl.Statistics: std :: Floating a => Fold a a
+ Control.Foldl.Statistics: sum :: Num a => Fold a a
+ Control.Foldl.Statistics: type HandlerM (m :: * -> *) a b = forall x. () => b -> Const Dual EndoM m x b -> a -> Const Dual EndoM m x a
+ Control.Foldl.Statistics: vector :: Vector v a => Fold a v a
+ Control.Foldl.Statistics: vectorM :: (PrimMonad m, Vector v a) => FoldM m a v a
Files
- CHANGELOG.md +15/−0
- foldl-statistics.cabal +10/−10
CHANGELOG.md view
@@ -1,36 +1,51 @@+# 0.1.5.1++- GHC 8.6 compatibility (Thanks @gwils)+ # 0.1.5.0+ - Added `histogram`, `histogram'` and `ordersOfMagnitude`. # 0.1.4.6+ - Relax bounds on tasty-quickcheck # 0.1.4.5+ - Fix dependencies for GHC < 8.0 # 0.1.4.4+ - Update to foldl < 1.4 # 0.1.4.3+ - Update to statistics 0.14 # 0.1.4.1+ - foldl >= 1.2.2 exports `mean` and ` variance`, so hide them. - export `lrrCount` # 0.1.4.0+ - Added monoidal interface to linear regression # 0.1.3.0+ - Added unbiased versions of LMVSK functions # 0.1.2.0+ - Exposed monoidal LMVSKState - Improved testing, including for fastLMVSK # 0.1.1.0+ - Add fastLMVSK (length, mean, variance, skewness and kurtosis) - Add fastLinearReg (count, slope, (Y) intercept and correlation of `(x,y)`) # 0.1.0.0+ - Initial release
foldl-statistics.cabal view
@@ -1,5 +1,5 @@ name: foldl-statistics-version: 0.1.5.0+version: 0.1.5.1 synopsis: Statistical functions from the statistics package implemented as Folds. description: The use of this package allows statistics to be computed using at most two@@ -19,17 +19,17 @@ build-type: Simple extra-source-files: CHANGELOG.md, README.md cabal-version: >=1.10-tested-with: GHC == 7.8.4, GHC == 7.10.2, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.*+tested-with: GHC == 7.8.4, GHC == 7.10.2, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.3, GHC == 8.6.1 library hs-source-dirs: src exposed-modules: Control.Foldl.Statistics default-language: Haskell2010 build-depends: base >= 4.7 && < 5- , foldl >= 1.1 && < 1.4- , math-functions >= 0.1 && < 0.3- , profunctors >= 5.2 && < 5.3- , containers >= 0.1.0.0 && < 0.6+ , foldl >= 1.1 && < 1.5+ , math-functions >= 0.1 && < 0.4+ , profunctors >= 5.2 && < 5.4+ , containers >= 0.1.0.0 && < 0.7 , unordered-containers >= 0.1.0.0 && < 0.3 , hashable >=1.0.1.1 && < 1.3 if impl(ghc < 8.0)@@ -46,8 +46,8 @@ , foldl-statistics , foldl , statistics >= 0.13 && < 0.15- , tasty >= 0.11 && < 0.12- , tasty-quickcheck >= 0.8 && < 0.10+ , tasty >= 0.11 && < 1.2+ , tasty-quickcheck >= 0.8 && < 0.11 , vector >= 0.11 && < 0.13 , quickcheck-instances >= 0.3 && < 0.4 , profunctors@@ -63,9 +63,9 @@ , foldl-statistics , foldl , statistics >= 0.13 && < 0.15- , criterion >= 1.1 && < 1.3+ , criterion >= 1.1 && < 1.6 , vector >= 0.10 && < 1.0- , mwc-random >= 0.13 && < 0.14+ , mwc-random >= 0.13 && < 0.15 if impl(ghc < 8.0) build-depends: semigroups