Build a commit history.
type 'a t = 'a C.tThe type for store handles.
type node = C.Node.keyThe type for node values.
type commit = C.keyThe type for commit values.
type v = C.Val.tThe type for commit objects.
Create a new commit.
val parents : [> Perms.read ] t -> commit -> commit list Lwt.tGet the commit parents.
Commits form a append-only, fully functional, partial-order data-structure: every commit carries the list of its immediate predecessors.
val merge : [> Perms.read_write ] t -> info:Info.f -> commit Merge.tmerge t is the 3-way merge function for commit.
val lcas :
[> Perms.read ] t ->
?max_depth:int ->
?n:int ->
commit ->
commit ->
(commit list, [ `Max_depth_reached | `Too_many_lcas ]) result Lwt.tFind the lowest common ancestors lca between two commits.
val lca :
[> Perms.read_write ] t ->
info:Info.f ->
?max_depth:int ->
?n:int ->
commit list ->
(commit option, Merge.conflict) result Lwt.tval three_way_merge :
[> Perms.read_write ] t ->
info:Info.f ->
?max_depth:int ->
?n:int ->
commit ->
commit ->
(commit, Merge.conflict) result Lwt.tCompute the lcas of the two commit and 3-way merge the result.
Same as NODE_GRAPH.closure but for the history graph.
val iter :
[> Perms.read ] t ->
min:node list ->
max:node list ->
?commit:(commit -> unit Lwt.t) ->
?edge:(node -> node -> unit Lwt.t) ->
?skip:(node -> bool Lwt.t) ->
?rev:bool ->
unit ->
unit Lwt.tSame as NODE_GRAPH.iter but for traversing the history graph.