package lrgrep

  1. Overview
  2. Docs
Detailed error messages for Menhir-generated parsers

Install 

dune-project
 Dependency

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

Authors

  1. F
    Frederic Bour <frederic.bour@lakaban.net>

Maintainers

  1. F
    Frederic Bour <frederic.bour@lakaban.net>

Sources

lrgrep-0.9.tbz
sha256=e53de12e4c5cbe6bca00643593266b4f9fa2e3f6a138195eeff7a4329f5c1c75
sha512=7fd7c4d11506fea7cc11c9bbf5aea9142d905643553c0c90e1bb16b794106b0c14a266acf89ae91b6929008dc0ba6515f788642873e2e4ba6c3d49bd45d25127

doc/fix/Fix/GraphNumbering/index.html

Module Fix.GraphNumberingSource

This module offers a facility for discovering and numbering the reachable vertices in a finite directed graph.

Sourcemodule Make (M : sig ... end) (G : sig ... end) : sig ... end

Make(M)(G) produces a numbering of the graph G, or more precisely, of the subset of the vertices of G that are reachable from the roots. The type of the vertices must be equipped with an implementation of imperative maps.

Sourcemodule ForOrderedType (T : sig ... end) (G : sig ... end) : sig ... end

ForOrderedType is a special case of Make where it suffices for the vertices of G to be ordered.

Sourcemodule ForHashedType (T : sig ... end) (G : sig ... end) : sig ... end

ForHashedType is a special case of Make where it suffices for the vertices of G to be hashed.

Sourcemodule ForType (T : sig ... end) (G : sig ... end) : sig ... end

ForType is a special case of Make where the vertices of G can have arbitrary type. OCaml's built-in generic equality and hash functions are used.