package ocaml-protoc
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Pure OCaml compiler for .proto files
Install
dune-project
Dependency
Authors
Maintainers
Sources
ocaml-protoc-4.0.tbz
sha256=88533848ee8ad662bfb063f34932286405977fa3810515b997119b06f05105e4
sha512=df12c71f7181eafc94cd0fc400edf7f258cdd3740a5badafce097f771b7828fed9a9a9c0a457e7e118848a8b1ddd87fe3134a5bdf88d4adcb0d0e04ba6808c5f
doc/ocaml-protoc.compiler-lib/Ocaml_protoc_compiler_lib/Pb_typing_recursion/index.html
Module Ocaml_protoc_compiler_lib.Pb_typing_recursionSource
Mutually recursive type resolution
The protobuf syntax allows the definition of mutually recursive types, however this declaration is implicit (ie no dedicated syntax to group together types which are mutually recursive).
OCaml requires mutually recursive types to be defined with an explicit syntax (using the and keyword), therefore it is necessary to find all the mutually recursive protobuf types.
This module performs the recursion analysis using the Tarjan graph algorithm to find all the Strongly Connnected Components.
Source
val group :
Pb_field_type.resolved Tt.proto_type list ->
Pb_field_type.resolved Tt.proto_type list listgroup types returns the list of all the mutually recursive group of types in reverse order of dependency. In other the last group of types of the returned list don't depend on any other types.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>