Copyright | Jeremy Groven |
---|---|
License | BSD3 |
Safe Haskell | None |
Language | Haskell2010 |
- toFragments :: Ord k => StableTree k v -> [(ObjectID, Fragment k v)]
- fromFragments :: (Ord k, Serialize k, Serialize v) => Map ObjectID (Fragment k v) -> Fragment k v -> Either Text (StableTree k v)
- fragsToMap :: Ord k => Map ObjectID (Fragment k v) -> Fragment k v -> Either Text (Map k v)
Documentation
toFragments :: Ord k => StableTree k v -> [(ObjectID, Fragment k v)] Source
Convert a StableTree
Tree
into a list of storable Fragment
s. The
resulting list is guaranteed to be in an order where each Fragment
will be
seen after all its children.
fromFragments :: (Ord k, Serialize k, Serialize v) => Map ObjectID (Fragment k v) -> Fragment k v -> Either Text (StableTree k v) Source
Recover a Tree
from a single Fragment
and a map of the fragments as
returned from toFragments
. If the fragment set was already stored, it is
the caller's responsibility to load all the child fragments into a map
(probably involving finding children using the fragmentChildren field of the
Fragment type).