Module `Short_paths_graph.Dependency`

include Ocaml_typing.Natural.S_no_zero

type t

val one : Ocaml_typing.Short_paths_graph.Dependency.t

val maximum : Ocaml_typing.Short_paths_graph.Dependency.t

val succ : 
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t

val pred : 
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t option

val compare : 
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  int

val equal : 
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  bool

val less_than : 
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  bool

val less_than_or_equal : 
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  bool

val max : 
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t

val plus : 
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  Ocaml_typing.Short_paths_graph.Dependency.t

val pp : 
  Stdlib.Format.formatter ->
  Ocaml_typing.Short_paths_graph.Dependency.t ->
  unit

module Map : 
  Stdlib.Map.S with type key = Ocaml_typing.Short_paths_graph.Dependency.t

module Set : 
  Stdlib.Set.S with type elt = Ocaml_typing.Short_paths_graph.Dependency.t

module Tbl : 
  Stdlib.Hashtbl.S with type key = Ocaml_typing.Short_paths_graph.Dependency.t

module Array : 
  Ocaml_typing.Natural.Array
    with type index = Ocaml_typing.Short_paths_graph.Dependency.t

val zero : Ocaml_typing.Short_paths_graph.Dependency.t

Module Short_paths_graph.Dependency

Module `Short_paths_graph.Dependency`