package irmin
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Install
Dune Dependency
Authors
Maintainers
Sources
sha256=cc6846d91459abc61e713b9adb55fe0427d9e320669f023a609121af1893b57a
sha512=e3f8519b5b6c2dc27dc2e1cce9daed927ea17ce298807cc9ec854ea700122fa3866be991c7e01e1226919d8a9c7a7b0f679a80078d2aed17b83aeb961845eb81
doc/irmin.mem/Irmin_mem/Make/Head/index.html
Module Make.Head
Source
Managing the store's heads.
list t
is the list of all the heads in local store. Similar to git rev-list --all
.
find t
is the current head of the store t
. This works for both persistent and temporary branches. In the case of a persistent branch, this involves getting the the head associated with the branch, so this may block. In the case of a temporary store, it simply returns the current head. Returns None
if the store has no contents. Similar to git rev-parse HEAD
.
Same as find
but raise Invalid_argument
if the store does not have any contents.
set t h
updates t
's contents with the contents of the commit h
. Can cause data loss as it discards the current contents. Similar to git reset --hard <hash>
.
fast_forward t h
is similar to set
but the t
's head is updated to h
only if h
is stricly in the future of t
's current head. max_depth
or n
are used to limit the search space of the lowest common ancestors (see lcas
).
The result is:
Ok ()
if the operation is succesfull;Error `No_change
ifh
is alreadyt
's head;Error `Rejected
ifh
is not in the strict future oft
's head.Error e
if the history exploration has been cut before getting useful results. In that case. the operation can be retried using different parameters ofn
andmax_depth
to get better results.
val merge :
into:t ->
info:Info.f ->
?max_depth:int ->
?n:int ->
commit ->
(unit, Irmin.Merge.conflict) result Lwt.t
merge ~into:t ?max_head ?n commit
merges the contents of the commit associated to commit
into t
. max_depth
is the maximal depth used for getting the lowest common ancestor. n
is the maximum number of lowest common ancestors. If present, max_depth
or n
are used to limit the search space of the lowest common ancestors (see lcas
).