package git

  1. Overview
  2. Docs


module S : Store.S


val pred : S.t -> ?full:bool -> Hash.t -> pred list Lwt.t

pred t s is the list of s's predecessors in the graph t. If full is not set (by default it is) only consider commits and their history relation.

type path = [
  1. | `Tag of string * path
  2. | `Commit of path
  3. | `Path of string list

The type for path values. See find for details.

val mem : S.t -> Hash.t -> path -> bool Lwt.t

mem t s p check wether there exists a path p from s in t.

val find : S.t -> Hash.t -> path -> Hash.t option Lwt.t

find t s p follows the path p from s in t.