package ocaml-protoc

  1. Overview
  2. Docs
Protobuf compiler for OCaml

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (20)

Authors

  1. M
    Maxime Ransan <maxime.ransan@gmail.com>

Maintainers

  1. M
    Maxime Ransan <maxime.ransan@gmail.com>

Sources

2.4.0.tar.gz
md5=8a294e86c6202b8ec8016e71d19264cb
sha512=67020bef50b59c6590c1b25d85a75d6e19d6cd37d42b87c94aef798bff51a45f38fe7024b4c67d71c22c13d3f2776bec83acd77794a518f1c4a7eddfc30b6d0b

doc/ocaml-protoc.compiler-lib/Ocaml_protoc_compiler_lib/Pb_typing_graph/index.html

Module Ocaml_protoc_compiler_lib.Pb_typing_graphSource

Graph algorithms to support the recursion analysis

Types

Sourcetype node

Node in a graph, each node is identified using a unique int id

Sourcetype graph

Graph.

Creators

Sourceval create_node : int -> int list -> node

create_node id sub create a node uniquely identified with id and connections to other nodes in sub.

The client application is responsible to ensure that the graph is consistent, by adding all nodes identified in sub to the same graph later.

Sourceval empty_graph : graph

empty_graph () create a new empty graph.

Sourceval add_node : node -> graph -> graph

add_node node graph add node to graph

Algorithms

Sourceval tarjan : graph -> int list list

tarjan graph compute the ordered list of strongly connected components of a graph.

The returned list is order in decreasing order of dependencies. This means the last component of the list does not link to any other components.