fay-base 0.1.0.0 → 0.14.0.0

raw patch · 3 files changed

+7/−10 lines, 3 filesdep ~faynew-uploaderPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: fay

API changes (from Hackage documentation)

- Prelude: max :: (Num a, Foreign a) => a -> a -> a

+ Prelude: max :: Num a => a -> a -> a

- Prelude: maximum :: (Num a, Foreign a) => [a] -> a

+ Prelude: maximum :: Num a => [a] -> a

- Prelude: min :: (Num a, Foreign a) => a -> a -> a

+ Prelude: min :: Num a => a -> a -> a

- Prelude: minimum :: (Num a, Foreign a) => [a] -> a

+ Prelude: minimum :: Num a => [a] -> a

Files

fay-base.cabal +2/−2
src/FFI.hs +0/−3
src/Prelude.hs +5/−5

fay-base.cabal view

@@ -1,5 +1,5 @@ name:                fay-base-version:             0.1.0.0+version:             0.14.0.0 synopsis:            The base package for Fay. description:         The base package for Fay.                      This package exports Prelude and FFI which you probably want to use with Fay.@@ -21,4 +21,4 @@   exposed-modules:   Prelude                     ,FFI                     ,Data.Data-  build-depends: base == 4.*, fay >= 0.12+  build-depends: base == 4.*, fay >= 0.14.0.0

src/FFI.hs view

@@ -1,8 +1,5 @@-{-# LANGUAGE CPP #-} module FFI-#ifndef FAY   (module Language.Fay.FFI)-#endif   where  import Language.Fay.FFI

src/Prelude.hs view

@@ -203,7 +203,7 @@ #endif   where -import                  Language.Fay.Types (Fay)+import                  Fay.Types (Fay) import                  Language.Fay.FFI import Data.Data import qualified "base" Prelude as Base@@ -467,10 +467,10 @@   | x < 0 && y > 1 = case (x+1) `quotRem` y of (q,r) -> (q-1, r+y-1) divMod x y         = quotRem x y -min :: (Num a, Foreign a) => a -> a -> a+min :: (Num a) => a -> a -> a min = ffi "Math.min(%1,%2)" -max :: (Num a, Foreign a) => a -> a -> a+max :: (Num a) => a -> a -> a max = ffi "Math.max(%1,%2)"  recip :: Double -> Double@@ -869,11 +869,11 @@ intercalate :: [a] -> [[a]] -> [a] intercalate xs xss = concat (intersperse xs xss) -maximum :: (Num a, Foreign a) => [a] -> a+maximum :: (Num a) => [a] -> a maximum [] = error "maximum: empty list" maximum xs = foldl1 max xs -minimum :: (Num a, Foreign a) => [a] -> a+minimum :: (Num a) => [a] -> a minimum [] = error "minimum: empty list" minimum xs = foldl1 min xs