packages feed

binary-search 1.0.0.3 → 2.0.0

raw patch · 2 files changed

+10/−7 lines, 2 filessetup-changednew-uploaderPVP ok

version bump matches the API change (PVP)

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: largest :: (Eq b) => b -> [Range b a] -> Maybe a
+ Numeric.Search: largest :: Eq b => b -> [Range b a] -> Maybe a
- Numeric.Search: lookupRanges :: (Eq b) => b -> [Range b a] -> Maybe (Range b a)
+ Numeric.Search: lookupRanges :: Eq b => b -> [Range b a] -> Maybe (Range b a)
- Numeric.Search: search :: (Eq b) => SearchRange a -> Splitter a -> (a -> b) -> [Range b a]
+ Numeric.Search: search :: Eq b => SearchRange a -> Splitter a -> (a -> b) -> [Range b a]
- Numeric.Search: smallest :: (Eq b) => b -> [Range b a] -> Maybe a
+ Numeric.Search: smallest :: Eq b => b -> [Range b a] -> Maybe a

Files

Setup.hs view
@@ -1,2 +1,2 @@ import Distribution.Simple-main = defaultMainWithHooks defaultUserHooks+main = defaultMain
binary-search.cabal view
@@ -1,10 +1,11 @@+cabal-version:  2.0 Name:           binary-search-Version:        1.0.0.3+Version:        2.0.0 Build-Type:     Simple License:        BSD3 license-file:   LICENSE-Author:         Ross Paterson <ross@soi.city.ac.uk>, Takayuki Muranushi <muranushi@gmail.com>-Maintainer:     Takayuki Muranushi <muranushi@gmail.com>+Author:         supercede <support@supercede.com>, Ross Paterson <ross@soi.city.ac.uk>, Takayuki Muranushi <muranushi@gmail.com>+Maintainer:     supercede <support@supercede.com> Category:       Algorithms Synopsis:       Binary and exponential searches Description:@@ -35,13 +36,13 @@             __The Module Structure__             .             *  "Numeric.Search" provides the generic search combinator, to search for pure and monadic predicates.+            .             *  "Numeric.Search.Bounded" ,  "Numeric.Search.Integer" ,  "Numeric.Search.Range" provides the various specialized searchers, which means less number of function arguments, and easier to use.             .             <<https://travis-ci.org/nushio3/binary-search.svg?branch=master>> -cabal-version:      >=1.8- library+  default-language: Haskell2010   exposed-modules:  Numeric.Search                     Numeric.Search.Bounded                     Numeric.Search.Integer@@ -54,6 +55,7 @@                   , containers >= 0.4  Test-Suite doctest+  default-language: Haskell2010   Type: exitcode-stdio-1.0   HS-Source-Dirs: test   Ghc-Options: -threaded -Wall@@ -64,6 +66,7 @@                   , doctest >= 0.9.3  Test-Suite spec+  default-language: Haskell2010   Type: exitcode-stdio-1.0   Hs-Source-Dirs: test   Ghc-Options: -Wall@@ -80,4 +83,4 @@  Source-Repository head   Type: git-  Location: https://github.com/nushio3/binary-search+  Location: https://github.com/riskbook/binary-search