ipfs 1.4.0 → 1.4.1
raw patch · 3 files changed
+13/−9 lines, 3 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Network.IPFS.Internal.Orphanage.Natural: instance RIO.Prelude.Display.Display GHC.Natural.Natural
- Network.IPFS.Internal.Orphanage.Natural: instance System.Envy.Var GHC.Natural.Natural
+ Network.IPFS.Internal.Orphanage.Natural: instance RIO.Prelude.Display.Display GHC.Num.Natural.Natural
+ Network.IPFS.Internal.Orphanage.Natural: instance System.Envy.Var GHC.Num.Natural.Natural
+ Network.IPFS.Prelude: flushTBQueue :: TBQueue a -> STM [a]
+ Network.IPFS.Prelude: lengthTBQueue :: TBQueue a -> STM Natural
+ Network.IPFS.Prelude: liftIOOp :: MonadUnliftIO m => (IO a -> IO b) -> m a -> m b
+ Network.IPFS.Prelude: stateTVar :: TVar s -> (s -> (a, s)) -> STM a
- Network.IPFS.Prelude: (>>>) :: forall k cat (a :: k) (b :: k) (c :: k). Category cat => cat a b -> cat b c -> cat a c
+ Network.IPFS.Prelude: (>>>) :: forall {k} cat (a :: k) (b :: k) (c :: k). Category cat => cat a b -> cat b c -> cat a c
- Network.IPFS.Prelude: -- | State token type
+ Network.IPFS.Prelude: -- | State token type.
- Network.IPFS.Prelude: class Category a => Arrow (a :: Type -> Type -> Type)
+ Network.IPFS.Prelude: class Category a => Arrow (a :: TYPE LiftedRep -> TYPE LiftedRep -> Type)
- Network.IPFS.Prelude: class Bifoldable (p :: Type -> Type -> Type)
+ Network.IPFS.Prelude: class Bifoldable (p :: TYPE LiftedRep -> TYPE LiftedRep -> Type)
- Network.IPFS.Prelude: class Foldable (t :: Type -> Type)
+ Network.IPFS.Prelude: class Foldable (t :: TYPE LiftedRep -> Type)
- Network.IPFS.Prelude: class Hashable a
+ Network.IPFS.Prelude: class Eq a => Hashable a
- Network.IPFS.Prelude: data Conc (m :: Type -> Type) a
+ Network.IPFS.Prelude: data Conc (m :: TYPE LiftedRep -> Type) a
- Network.IPFS.Prelude: dequeToList :: forall (v :: Type -> Type -> Type) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> m [a]
+ Network.IPFS.Prelude: dequeToList :: forall (v :: Type -> TYPE LiftedRep -> TYPE LiftedRep) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> m [a]
- Network.IPFS.Prelude: dequeToVector :: forall v' a (v :: Type -> Type -> Type) m. (Vector v' a, MVector v a, PrimMonad m) => Deque v (PrimState m) a -> m (v' a)
+ Network.IPFS.Prelude: dequeToVector :: forall v' a (v :: Type -> TYPE LiftedRep -> TYPE LiftedRep) m. (Vector v' a, MVector v a, PrimMonad m) => Deque v (PrimState m) a -> m (v' a)
- Network.IPFS.Prelude: foldlDeque :: forall (v :: Type -> Type -> Type) a m acc. (MVector v a, PrimMonad m) => (acc -> a -> m acc) -> acc -> Deque v (PrimState m) a -> m acc
+ Network.IPFS.Prelude: foldlDeque :: forall (v :: Type -> TYPE LiftedRep -> TYPE LiftedRep) a m acc. (MVector v a, PrimMonad m) => (acc -> a -> m acc) -> acc -> Deque v (PrimState m) a -> m acc
- Network.IPFS.Prelude: foldrDeque :: forall (v :: Type -> Type -> Type) a m acc. (MVector v a, PrimMonad m) => (a -> acc -> m acc) -> acc -> Deque v (PrimState m) a -> m acc
+ Network.IPFS.Prelude: foldrDeque :: forall (v :: Type -> TYPE LiftedRep -> TYPE LiftedRep) a m acc. (MVector v a, PrimMonad m) => (a -> acc -> m acc) -> acc -> Deque v (PrimState m) a -> m acc
- Network.IPFS.Prelude: infixl 6 +
+ Network.IPFS.Prelude: infixl 6 -
- Network.IPFS.Prelude: newDeque :: forall (v :: Type -> Type -> Type) a m. (MVector v a, PrimMonad m) => m (Deque v (PrimState m) a)
+ Network.IPFS.Prelude: newDeque :: forall (v :: Type -> TYPE LiftedRep -> TYPE LiftedRep) a m. (MVector v a, PrimMonad m) => m (Deque v (PrimState m) a)
- Network.IPFS.Prelude: popBackDeque :: forall (v :: Type -> Type -> Type) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> m (Maybe a)
+ Network.IPFS.Prelude: popBackDeque :: forall (v :: Type -> TYPE LiftedRep -> TYPE LiftedRep) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> m (Maybe a)
- Network.IPFS.Prelude: popFrontDeque :: forall (v :: Type -> Type -> Type) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> m (Maybe a)
+ Network.IPFS.Prelude: popFrontDeque :: forall (v :: Type -> TYPE LiftedRep -> TYPE LiftedRep) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> m (Maybe a)
- Network.IPFS.Prelude: pushBackDeque :: forall (v :: Type -> Type -> Type) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> a -> m ()
+ Network.IPFS.Prelude: pushBackDeque :: forall (v :: Type -> TYPE LiftedRep -> TYPE LiftedRep) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> a -> m ()
- Network.IPFS.Prelude: pushFrontDeque :: forall (v :: Type -> Type -> Type) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> a -> m ()
+ Network.IPFS.Prelude: pushFrontDeque :: forall (v :: Type -> TYPE LiftedRep -> TYPE LiftedRep) a m. (MVector v a, PrimMonad m) => Deque v (PrimState m) a -> a -> m ()
- Network.IPFS.Prelude: replicateConcurrently :: MonadUnliftIO m => Int -> m b -> m [b]
+ Network.IPFS.Prelude: replicateConcurrently :: MonadUnliftIO f => Int -> f a -> f [a]
- Network.IPFS.Prelude: seq :: forall (r :: RuntimeRep) a (b :: TYPE r). a -> b -> b
+ Network.IPFS.Prelude: seq :: forall {r :: RuntimeRep} a (b :: TYPE r). a -> b -> b
Files
- ipfs.cabal +6/−4
- library/Network/IPFS/Peer/Error.hs +1/−0
- library/Network/IPFS/SparseTree/Types.hs +6/−5
ipfs.cabal view
@@ -1,11 +1,11 @@ cabal-version: 2.0 --- This file has been generated from package.yaml by hpack version 0.34.4.+-- This file has been generated from package.yaml by hpack version 0.35.1. -- -- see: https://github.com/sol/hpack name: ipfs-version: 1.4.0+version: 1.4.1 synopsis: Access IPFS locally and remotely description: Interact with the IPFS network by shelling out to a local IPFS node or communicating via the HTTP interface of a remote IPFS node. category: Network@@ -19,12 +19,12 @@ daniel@fission.codes, steven@fission.codes, james@fission.codes-copyright: © 2021 Fission Internet Software Services for Open Networks Inc.+copyright: © 2023 Fission Internet Software Services for Open Networks Inc. license: Apache-2.0 license-file: LICENSE build-type: Simple tested-with:- GHC==8.10.7+ GHC==9.2.7 extra-source-files: README.md @@ -164,6 +164,8 @@ type: exitcode-stdio-1.0 main-is: Main.hs other-modules:+ Paths_ipfs+ autogen-modules: Paths_ipfs hs-source-dirs: test/doctest
library/Network/IPFS/Peer/Error.hs view
@@ -18,4 +18,5 @@ display = \case DecodeFailure err -> "Unable to decode: " <> displayShow err CannotConnect peer -> "Unable to connect to " <> display peer+ CannotDisconnect peer -> "Unable to disconnect from " <> display peer UnknownErr msg -> "Unknown IPFS peer list error: " <> display msg
library/Network/IPFS/SparseTree/Types.hs view
@@ -3,7 +3,8 @@ , Tag (..) ) where -import qualified RIO.HashMap as HashMap+import qualified Data.Aeson.KeyMap as Aeson.KeyMap+import qualified Data.Aeson.Key as Aeson.Key import qualified RIO.Map as Map import qualified RIO.Text as Text @@ -57,13 +58,13 @@ toJSON = \case Stub (Name name) -> String <| Text.pack name Content (CID cid) -> String <| UTF8.stripN 1 cid- Directory dirMap -> Object <| HashMap.fromList (jsonKV <$> Map.toList dirMap)+ Directory dirMap -> Object <| Aeson.KeyMap.fromList (jsonKV <$> Map.toList dirMap) where- jsonKV :: (Tag, SparseTree) -> (Text, Value)+ jsonKV :: (Tag, SparseTree) -> (Aeson.Key.Key, Value) jsonKV (tag, subtree) = (jsonTag tag, toJSON subtree) - jsonTag (Key (Name n)) = Text.pack n- jsonTag (Hash (CID cid)) = UTF8.stripN 1 cid+ jsonTag (Key (Name n)) = Aeson.Key.fromText (Text.pack n)+ jsonTag (Hash (CID cid)) = Aeson.Key.fromText (UTF8.stripN 1 cid) data Tag = Key Name