package ocaml-protoc

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

Install

Dune Dependency

Authors

Maintainers

Sources

ocaml-protoc-3.0.0.tbz
sha256=923b651cf0f400b5ee2fd1d05798a408b4c0a378aab655e4c2618bcce3fd7bff
sha512=5a1c80115e111f3d4e9384feb9a1a49375d06b11538cdfd388cb4d8a2cb1bb7ae6201d0555daf970be40a017cbb30819e7bec9875a418f5f316b0115999827df

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.

OCaml

Innovation. Community. Security.