dfinity-radix-tree 0.3.0 → 0.3.1

raw patch · 4 files changed

+9/−5 lines, 4 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• CHANGELOG.md +4/−0
• README.md +2/−2
• dfinity-radix-tree.cabal +1/−1
• src/Network/DFINITY/RadixTree/Types.hs +2/−2

@@ -1,3 +1,7 @@+0.3.1 Enzo Haussecker <enzo@dfinity.org> Mon Aug 06 2018++ *  Relax constraint on radix database instance+ 0.3.0 Enzo Haussecker <enzo@dfinity.org> Thu Aug 02 2018   * Add thread safety to parallel download combinators

@@ -13,12 +13,12 @@ {-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE MultiParamTypeClasses #-} -import Control.Monad.Trans.Resource (MonadResource)+import Control.Monad.IO.Class (MonadIO) import Database.LevelDB (DB, defaultReadOptions, defaultWriteOptions, get, put)  import Network.DFINITY.RadixTree -instance MonadResource m => RadixDatabase m DB where+instance MonadIO m => RadixDatabase m DB where    load database = get database defaultReadOptions    store database = put database defaultWriteOptions ```

@@ -1,5 +1,5 @@ Name:               dfinity-radix-tree-Version:            0.3.0+Version:            0.3.1 Synopsis:           A generic data integrity layer. Description:    This library allows you to construct a Merkle tree on top of any underlying

@@ -26,8 +26,8 @@ import Control.DeepSeq (NFData(..)) import Control.Exception (Exception) import Control.Monad (void)+import Control.Monad.IO.Class import Control.Monad.State.Strict as State (StateT, get, modify)-import Control.Monad.Trans.Resource (MonadResource) import Crypto.Hash.SHA256 (hash) import Data.BloomFilter (Bloom) import Data.Bool (bool)@@ -64,7 +64,7 @@    load _ key = Map.lookup key <$> State.get    store _ key = modify . insert key -instance MonadResource m => RadixDatabase m DB where+instance MonadIO m => RadixDatabase m DB where    load database = LevelDB.get database defaultReadOptions    store database = put database defaultWriteOptions