package irmin
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
package irmin
-
irmin
-
-
irmin_mem
-
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library
Module
Module type
Parameter
Class
Class type
Build a commit history.
Parameters
Signature
Commit History
type 'a t = 'a C.t
The type for store handles.
type node = C.Node.key
The type for node values.
type commit = C.key
The type for commit values.
type v = C.Val.t
The type for commit objects.
Create a new commit.
val parents : [> Perms.read ] t -> commit -> commit list Lwt.t
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 merge : [> Perms.read_write ] t -> info:Info.f -> commit Merge.t
merge 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.t
Find 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.t
val three_way_merge :
[> Perms.read_write ] t ->
info:Info.f ->
?max_depth:int ->
?n:int ->
commit ->
commit ->
(commit, Merge.conflict) result Lwt.t
Compute 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.t
Same as NODE_GRAPH.iter but for traversing the history graph.
Value Types
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page