packages feed

data-accessor 0.2.1.3 → 0.2.1.4

raw patch · 1 files changed

+2/−2 lines, 1 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Data.Accessor.BinaryRead: instance (ByteCompatible byte) => ByteStream [byte]
+ Data.Accessor.BinaryRead: instance ByteCompatible byte => ByteStream [byte]
- Data.Accessor: (%:) :: (Monad m) => T r a -> (a -> a) -> StateT r m ()
+ Data.Accessor: (%:) :: Monad m => T r a -> (a -> a) -> StateT r m ()
- Data.Accessor: (%=) :: (Monad m) => T r a -> a -> StateT r m ()
+ Data.Accessor: (%=) :: Monad m => T r a -> a -> StateT r m ()
- Data.Accessor: (=:) :: (Monad m) => Accessor r a -> a -> StateT r m ()
+ Data.Accessor: (=:) :: Monad m => Accessor r a -> a -> StateT r m ()
- Data.Accessor: getA :: (Monad m) => Accessor r a -> StateT r m a
+ Data.Accessor: getA :: Monad m => Accessor r a -> StateT r m a
- Data.Accessor: modA :: (Monad m) => Accessor r a -> (a -> a) -> StateT r m ()
+ Data.Accessor: modA :: Monad m => Accessor r a -> (a -> a) -> StateT r m ()
- Data.Accessor: putA :: (Monad m) => Accessor r a -> a -> StateT r m ()
+ Data.Accessor: putA :: Monad m => Accessor r a -> a -> StateT r m ()
- Data.Accessor.Basic: result :: (Eq a) => a -> T (a -> r) r
+ Data.Accessor.Basic: result :: Eq a => a -> T (a -> r) r
- Data.Accessor.BinaryRead: class (Monad source) => ByteSource source
+ Data.Accessor.BinaryRead: class Monad source => ByteSource source
- Data.Accessor.BinaryRead: readWord8 :: (ByteSource source) => source Word8
+ Data.Accessor.BinaryRead: readWord8 :: ByteSource source => source Word8
- Data.Accessor.BinaryRead: toByte :: (ByteCompatible byte) => byte -> Word8
+ Data.Accessor.BinaryRead: toByte :: ByteCompatible byte => byte -> Word8
- Data.Accessor.Container: array :: (Ix i) => i -> T (Array i e) e
+ Data.Accessor.Container: array :: Ix i => i -> T (Array i e) e
- Data.Accessor.Container: mapDefault :: (Ord key) => elem -> key -> T (Map key elem) elem
+ Data.Accessor.Container: mapDefault :: Ord key => elem -> key -> T (Map key elem) elem
- Data.Accessor.Container: mapMaybe :: (Ord key) => key -> T (Map key elem) (Maybe elem)
+ Data.Accessor.Container: mapMaybe :: Ord key => key -> T (Map key elem) (Maybe elem)
- Data.Accessor.MonadState: (%:) :: (Monad m) => T r a -> (a -> a) -> StateT r m ()
+ Data.Accessor.MonadState: (%:) :: Monad m => T r a -> (a -> a) -> StateT r m ()
- Data.Accessor.MonadState: (%=) :: (Monad m) => T r a -> a -> StateT r m ()
+ Data.Accessor.MonadState: (%=) :: Monad m => T r a -> a -> StateT r m ()
- Data.Accessor.MonadState: get :: (Monad m) => T r a -> StateT r m a
+ Data.Accessor.MonadState: get :: Monad m => T r a -> StateT r m a
- Data.Accessor.MonadState: getAndModify :: (Monad m) => T r a -> (a -> a) -> StateT r m a
+ Data.Accessor.MonadState: getAndModify :: Monad m => T r a -> (a -> a) -> StateT r m a
- Data.Accessor.MonadState: lift :: (Monad m) => T r s -> State s a -> StateT r m a
+ Data.Accessor.MonadState: lift :: Monad m => T r s -> State s a -> StateT r m a
- Data.Accessor.MonadState: liftT :: (Monad m) => T r s -> StateT s m a -> StateT r m a
+ Data.Accessor.MonadState: liftT :: Monad m => T r s -> StateT s m a -> StateT r m a
- Data.Accessor.MonadState: modify :: (Monad m) => T r a -> (a -> a) -> StateT r m ()
+ Data.Accessor.MonadState: modify :: Monad m => T r a -> (a -> a) -> StateT r m ()
- Data.Accessor.MonadState: modifyAndGet :: (Monad m) => T r a -> (a -> a) -> StateT r m a
+ Data.Accessor.MonadState: modifyAndGet :: Monad m => T r a -> (a -> a) -> StateT r m a
- Data.Accessor.MonadState: set :: (Monad m) => T r a -> a -> StateT r m ()
+ Data.Accessor.MonadState: set :: Monad m => T r a -> a -> StateT r m ()

Files

data-accessor.cabal view
@@ -1,5 +1,5 @@ Name:             data-accessor-Version:          0.2.1.3+Version:          0.2.1.4 License:          BSD3 License-File:     LICENSE Author:           Henning Thielemann <haskell@henning-thielemann.de>, Luke Palmer <lrpalmer@gmail.com>@@ -64,7 +64,7 @@   that conflicts with the two-way nature (set and get) of accessors. -- Portability:      Haskell98 Cabal-Version:    >=1.2-Tested-With:      GHC==6.4.1 && ==6.8.2 && ==6.10.4, JHC==0.7.3+Tested-With:      GHC==6.4.1, GHC==6.8.2, GHC==6.10.4, JHC==0.7.3 Build-Type:       Simple  Extra-Source-Files: