package irmin
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Build a commit history.
Parameters
module N : Contents.STORE
Signature
Commit History
type node = N.key
The type for node values.
type commit = S.key
The type for commit values.
Create a new commit.
Get the commit parents.
Commits form a append-only, fully functional, partial-order data-structure: every commit carries the list of its immediate predecessors.
val lcas :
t ->
?max_depth:int ->
?n:int ->
commit ->
commit ->
[ `Ok of commit list | `Max_depth_reached | `Too_many_lcas ] Lwt.t
Find the lowest common ancestors lca between two commits.
val three_way_merge :
t ->
task:task ->
?max_depth:int ->
?n:int ->
commit ->
commit ->
commit Merge.result Lwt.t
Compute the lcas
of the two commit and 3-way merge the result.
Same as GRAPH.closure but for the history graph.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page