packages feed

box-tuples 0.1.0.0 → 0.1.1.0

raw patch · 2 files changed

+10/−1 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

+ Data.Tuple.Unboxed: compose_3pba :: (a -> (# Addr#, ByteArray#, Array# b #)) -> a -> (Addr# -> ByteArray# -> Array# b -> r) -> r
+ Data.Tuple.Unboxed: composes3spw :: (State# s -> (# State# t, Addr#, Word# #)) -> State# s -> (State# t -> Addr# -> Word# -> r) -> r
+ Data.Tuple.Unboxed: composew2wi :: (Word# -> (# Word#, Int# #)) -> Word# -> (Word# -> Int# -> r) -> r

Files

box-tuples.cabal view
@@ -2,7 +2,7 @@ -- documentation, see http://haskell.org/cabal/users-guide/  name:                box-tuples-version:             0.1.0.0+version:             0.1.1.0 synopsis:            A hack to use GHC.Prim primitives in GHCi description:         As of now, the GHCi interactive runtime is incapable of working on unboxed                      tuples. In particular, it is unable to fully apply any function returning an
src/Data/Tuple/Unboxed.hs view
@@ -95,9 +95,12 @@         composes2sv,         composes2sw,         composes2sWp,+        composew2wi,         composew2ww,         compose_3pab,+        compose_3pba,         composes3si_,+        composes3spw,         composed4iwwi,         composes4siii,         decomposes2s_@@ -136,9 +139,12 @@ composes2sv :: (State# s -> (# State# t, MutVar# u a #)) -> State# s -> (State# t -> MutVar# u a -> r) -> r composes2sw :: (State# s -> (# State# t, Word# #)) -> State# s -> (State# t -> Word# -> r) -> r composes2sWp :: (State# s -> (# State# t, Weak# a #)) -> State# s -> (State# t -> Weak# a -> r) -> r+composew2wi :: (Word# -> (# Word#, Int# #)) -> Word# -> (Word# -> Int# -> r) -> r composew2ww :: (Word# -> (# Word#, Word# #)) -> Word# -> (Word# -> Word# -> r) -> r compose_3pab :: (a -> (# Addr#, Array# b, ByteArray# #)) -> a -> (Addr# -> Array# b -> ByteArray# -> r) -> r+compose_3pba :: (a -> (# Addr#, ByteArray#, Array# b #)) -> a -> (Addr# -> ByteArray# -> Array# b -> r) -> r composes3si_ :: (State# s -> (# State# t, Int#, a #)) -> State# s -> (State# t -> Int# -> a -> r) -> r+composes3spw :: (State# s -> (# State# t, Addr#, Word# #)) -> State# s -> (State# t -> Addr# -> Word# -> r) -> r composed4iwwi :: (Double# -> (# Int#, Word#, Word#, Int# #)) -> Double# -> (Int# -> Word# -> Word# -> Int# -> r) -> r composes4siii :: (State# s -> (# State# t, Int#, Int#, Int# #)) -> State# s -> (State# t -> Int# -> Int# -> Int# -> r) -> r composea1_ p x f = case p x of (# a #) -> f a@@ -171,9 +177,12 @@ composes2sv p x f = case p x of (# a, b #) -> f a b composes2sw p x f = case p x of (# a, b #) -> f a b composes2sWp p x f = case p x of (# a, b #) -> f a b+composew2wi p x f = case p x of (# a, b #) -> f a b composew2ww p x f = case p x of (# a, b #) -> f a b compose_3pab p x f = case p x of (# a, b, c #) -> f a b c+compose_3pba p x f = case p x of (# a, b, c #) -> f a b c composes3si_ p x f = case p x of (# a, b, c #) -> f a b c+composes3spw p x f = case p x of (# a, b, c #) -> f a b c composed4iwwi p x f = case p x of (# a, b, c, d #) -> f a b c d composes4siii p x f = case p x of (# a, b, c, d #) -> f a b c d