Up – Package index » lrgrep » Library utils » Utils » Refine

Module `Utils.Refine`Source

Refine computes the refined partition of a list of overlapping set: the smallest list of non-overlapping sets such that each set is a subset of one of the input set.

This is useful when computing the set of transitions of a DFA when the alphabet is large: rather than representing a transition for each letter separately, we group them by subset having the same destination.

lrgrep
- CHANGELOG
- README
- Library bit_lib
  - Bit_lib
- Library fix
  - Fix
- Library front
  - Front
- Library kernel
  - Kernel
- Library lrgrep.internal
- Library lrgrep.interpreter
  - Lrgrep_interpreter
- Library lrgrep.runtime
  - Lrgrep_runtime
- Library lrijkstra_utils
  - Mcop
  - Tarjan
- Library support
  - Lrgrep_support
  - Lrgrep_support_packer
- Library syntax
  - Syntax
- Library utils
  - Utils
- Library valmari
  - Valmari
- Sources

Sourcemodule type DECOMPOSABLE = sig ... end

Sourcemodule type S = sig ... end

The type of refined sets

Sourcemodule Make (Set : DECOMPOSABLE) : S with type 'a t := 'a Set.t