packages feed

hashed-storage 0.5.3 → 0.5.4

raw patch · 3 files changed

+3/−21 lines, 3 filesdep ~QuickCheckPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: QuickCheck

API changes (from Hackage documentation)

- Storage.Hashed.Monad: instance (Monad m, MonadError e m) => TreeRO (TreeMonad m)
- Storage.Hashed.Tree: instance (Monad m) => FilterTree Tree m
+ Storage.Hashed.Monad: instance (Functor m, Monad m, MonadError e m) => TreeRO (TreeMonad m)
+ Storage.Hashed.Tree: instance Monad m => FilterTree Tree m
- Storage.Hashed.Index: filter :: (FilterTree a m) => (AnchoredPath -> TreeItem m -> Bool) -> a m -> a m
+ Storage.Hashed.Index: filter :: FilterTree a m => (AnchoredPath -> TreeItem m -> Bool) -> a m -> a m
- Storage.Hashed.Monad: currentDirectory :: (TreeRO m) => m AnchoredPath
+ Storage.Hashed.Monad: currentDirectory :: TreeRO m => m AnchoredPath
- Storage.Hashed.Tree: class (Monad m) => FilterTree a m
+ Storage.Hashed.Tree: class Monad m => FilterTree a m
- Storage.Hashed.Tree: emptyBlob :: (Monad m) => Blob m
+ Storage.Hashed.Tree: emptyBlob :: Monad m => Blob m
- Storage.Hashed.Tree: emptyTree :: (Monad m) => Tree m
+ Storage.Hashed.Tree: emptyTree :: Monad m => Tree m
- Storage.Hashed.Tree: expand :: (Monad m) => Tree m -> m (Tree m)
+ Storage.Hashed.Tree: expand :: Monad m => Tree m -> m (Tree m)
- Storage.Hashed.Tree: expandPath :: (Monad m) => Tree m -> AnchoredPath -> m (Tree m)
+ Storage.Hashed.Tree: expandPath :: Monad m => Tree m -> AnchoredPath -> m (Tree m)
- Storage.Hashed.Tree: expandUpdate :: (Monad m) => (AnchoredPath -> Tree m -> m (Tree m)) -> Tree m -> m (Tree m)
+ Storage.Hashed.Tree: expandUpdate :: Monad m => (AnchoredPath -> Tree m -> m (Tree m)) -> Tree m -> m (Tree m)
- Storage.Hashed.Tree: filter :: (FilterTree a m) => (AnchoredPath -> TreeItem m -> Bool) -> a m -> a m
+ Storage.Hashed.Tree: filter :: FilterTree a m => (AnchoredPath -> TreeItem m -> Bool) -> a m -> a m
- Storage.Hashed.Tree: makeBlob :: (Monad m) => ByteString -> Blob m
+ Storage.Hashed.Tree: makeBlob :: Monad m => ByteString -> Blob m
- Storage.Hashed.Tree: makeBlobBS :: (Monad m) => ByteString -> Blob m
+ Storage.Hashed.Tree: makeBlobBS :: Monad m => ByteString -> Blob m
- Storage.Hashed.Tree: makeTree :: (Monad m) => [(Name, TreeItem m)] -> Tree m
+ Storage.Hashed.Tree: makeTree :: Monad m => [(Name, TreeItem m)] -> Tree m
- Storage.Hashed.Tree: makeTreeWithHash :: (Monad m) => [(Name, TreeItem m)] -> Hash -> Tree m
+ Storage.Hashed.Tree: makeTreeWithHash :: Monad m => [(Name, TreeItem m)] -> Hash -> Tree m
- Storage.Hashed.Tree: modifyTree :: (Monad m) => Tree m -> AnchoredPath -> Maybe (TreeItem m) -> Tree m
+ Storage.Hashed.Tree: modifyTree :: Monad m => Tree m -> AnchoredPath -> Maybe (TreeItem m) -> Tree m

Files

Storage/Hashed/Monad.hs view
@@ -188,7 +188,7 @@         megs = (* (1024 * 1024))         age (_, (_, a)) (_, (_, b)) = compare a b -instance (Monad m, MonadError e m) => TreeRO (TreeMonad m) where+instance (Functor m, Monad m, MonadError e m) => TreeRO (TreeMonad m) where     expandTo p =         do t <- gets tree            p' <- (`catPaths` p) `fmap` ask
Storage/Hashed/Test.hs view
@@ -471,14 +471,6 @@ instance Arbitrary BL.ByteString where     arbitrary = BL.pack `fmap` arbitrary -instance Arbitrary Word32 where-    arbitrary = do x <- arbitrary :: Gen Int-                   return $ fromIntegral x--instance Arbitrary Word8 where-    arbitrary = do x <- arbitrary :: Gen Int-                   return $ fromIntegral x- instance Arbitrary Hash where     arbitrary = sized hash'         where hash' 0 = return NoHash@@ -487,16 +479,6 @@                 case tag of                   0 -> SHA256 . BS.pack <$> sequence [ arbitrary | _ <- [1..32] ]                   1 -> SHA1 . BS.pack <$> sequence [ arbitrary | _ <- [1..20] ]--instance Arbitrary Word64 where-    arbitrary = do x <- arbitrary :: Gen Int-                   y <- arbitrary :: Gen Int-                   let x' = fromIntegral x-                       y' = fromIntegral y-                   return $ x' .|. (y' `shift` 32)--instance Arbitrary Int64 where-    arbitrary = fromIntegral `fmap` (arbitrary :: Gen Word64)  instance (Monad m) => Arbitrary (TreeItem m) where   arbitrary = sized tree'
hashed-storage.cabal view
@@ -1,5 +1,5 @@ name:          hashed-storage-version:       0.5.3+version:       0.5.4 synopsis:      Hashed file storage support code.  description:   Support code for reading and manipulating hashed file storage@@ -97,7 +97,7 @@       build-depends: test-framework,                      test-framework-hunit,                      test-framework-quickcheck2,-                     QuickCheck >= 2, HUnit, process >= 1.0.1, zip-archive+                     QuickCheck >= 2.3, HUnit, process >= 1.0.1, zip-archive     else       buildable: False