|
|
|
|
|
|
Synopsis |
|
|
|
|
Obtaining Trees.
|
|
Please note that Trees obtained this way will contain Stub
items. These need to be executed (they are IO actions) in order to be
accessed. Use expand to do this. However, many operations are
perfectly fine to be used on a stubbed Tree (and it is often more
efficient to do everything that can be done before expanding a Tree).
|
|
|
|
|
Read in a darcs-style hashed tree. This is mainly useful for reading
"pristine.hashed". You need to provide the root hash you are interested in
(found in _darcs/hashed_inventory).
|
|
Blob access.
|
|
|
Read a Blob into a Lazy ByteString. Might be backed by an mmap, use with
care.
|
|
Writing trees.
|
|
|
Write out full tree to a plain directory structure. If you instead want
to make incremental updates, refer to Storage.Hashed.Monad.
|
|
|
Write a Tree into a darcs-style hashed directory.
|
|
Unsafe functions for the curious explorer.
|
|
These are more useful for playing within ghci than for real, serious
programs. They generally trade safety for conciseness. Please use
responsibly. Don't kill innocent kittens.
|
|
|
Take a relative FilePath and turn it into an AnchoredPath. The operation
is (relatively) unsafe. Basically, by using floatPath, you are testifying
that the argument is a path relative to some common root -- i.e. the root of
the associated Tree object. Also, there are certain invariants about
AnchoredPath that this function tries hard to preserve, but probably cannot
guarantee (i.e. this is a best-effort thing). You should sanitize any
FilePaths before you declare them good by converting into AnchoredPath
(using this function).
|
|
|
Take a relative FilePath within a Tree and print the contents of the
object there. Useful for exploration, less so for serious programming.
|
|
Produced by Haddock version 2.6.0 |