packages feed

binary-search 1.0.0.1 → 1.0.0.2

raw patch · 2 files changed

+5/−4 lines, 2 filesdep +transformersdep ~basedep ~containersPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependencies added: transformers

Dependency ranges changed: base, containers

API changes (from Hackage documentation)

- Numeric.Search: instance (GHC.Classes.Eq a, GHC.Classes.Eq b) => GHC.Classes.Eq (Numeric.Search.Range b a)
- Numeric.Search: instance (GHC.Classes.Ord a, GHC.Classes.Ord b) => GHC.Classes.Ord (Numeric.Search.Range b a)
- Numeric.Search: instance (GHC.Read.Read a, GHC.Read.Read b) => GHC.Read.Read (Numeric.Search.Range b a)
- Numeric.Search: instance (GHC.Read.Read b, GHC.Read.Read a) => GHC.Read.Read (Numeric.Search.Evidence a b)
- Numeric.Search: instance (GHC.Show.Show a, GHC.Show.Show b) => GHC.Show.Show (Numeric.Search.Range b a)
- Numeric.Search: instance (GHC.Show.Show b, GHC.Show.Show a) => GHC.Show.Show (Numeric.Search.Evidence a b)
+ Numeric.Search: instance (GHC.Classes.Eq b, GHC.Classes.Eq a) => GHC.Classes.Eq (Numeric.Search.Range b a)
+ Numeric.Search: instance (GHC.Classes.Ord b, GHC.Classes.Ord a) => GHC.Classes.Ord (Numeric.Search.Range b a)
+ Numeric.Search: instance (GHC.Read.Read a, GHC.Read.Read b) => GHC.Read.Read (Numeric.Search.Evidence a b)
+ Numeric.Search: instance (GHC.Read.Read b, GHC.Read.Read a) => GHC.Read.Read (Numeric.Search.Range b a)
+ Numeric.Search: instance (GHC.Show.Show a, GHC.Show.Show b) => GHC.Show.Show (Numeric.Search.Evidence a b)
+ Numeric.Search: instance (GHC.Show.Show b, GHC.Show.Show a) => GHC.Show.Show (Numeric.Search.Range b a)
- Numeric.Search: searchM :: forall a m b. (Monad m, Eq b) => SearchRange a -> Splitter a -> (a -> m b) -> m [Range b a]
+ Numeric.Search: searchM :: (Functor m, Monad m, Eq b) => SearchRange a -> Splitter a -> (a -> m b) -> m [Range b a]

Files

Numeric/Search.hs view
@@ -81,7 +81,7 @@  module Numeric.Search where -import           Control.Applicative((<$>))+import           Control.Applicative import           Data.Functor.Identity import           Data.Maybe (fromJust, listToMaybe) import           Prelude hiding (init, pred)@@ -270,7 +270,7 @@ -- -- 'searchM' keeps track of the predicates found, so that it works well with the 'Evidence' type. -searchM :: forall a m b . (Monad m, Eq b) =>+searchM :: forall a m b . (Functor m, Monad m, Eq b) =>            SearchRange a -> Splitter a -> (a -> m b) -> m [Range b a] searchM init0 split0 pred0 = do   ranges0 <- initializeSearchM init0 pred0
binary-search.cabal view
@@ -1,5 +1,5 @@ Name:           binary-search-Version:        1.0.0.1+Version:        1.0.0.2 Build-Type:     Simple License:        BSD3 license-file:   LICENSE@@ -50,6 +50,7 @@   Ghc-Options:      -Wall    build-depends:    base >=4.5 && < 5+                  , transformers                   , containers >= 0.4  Test-Suite doctest@@ -69,7 +70,7 @@   Main-Is: Spec.hs   Other-Modules:    PureSpec -  Build-Depends:    base >=4.5 && < 5+  Build-Depends:    base >=4.7 && < 5                   , binary-search                    , hspec >= 1.3