package ocaml-protoc

  1. Overview
  2. Docs
Pure OCaml compiler for .proto files

Install 

dune-project
 Dependency

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

Authors

  1. M
    Maxime Ransan <maxime.ransan@gmail.com>
  2. S
    Simon Cruanes

Maintainers

  1. M
    Maxime Ransan <maxime.ransan@gmail.com>
  2. S
    Simon Cruanes

Sources

ocaml-protoc-3.0.2.tbz
sha256=eb3ca953610cc0766b2a89dcb201d49372949458b7d3cb826e15a5ab35205fec
sha512=8db991f12d3a02f226fb7cf3e99ca02d907497d8b4f48f1393d396594868e25a9fa0e4a3e73322bda8d65e690754b73d2523abf8236e47b77fc0c059f2244e3a

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 id = int

Identifier of a node in the graph

Sourcetype node

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

Sourcetype graph

Graph.

Creators

Sourceval create_node : id -> id 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 -> id 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.