package coq-core

You can search for identifiers within the package.

in-package search v0.2.0

The Coq Proof Assistant -- Core Binaries and Tools

Install

md5=8d852367b54f095d9fbabd000304d450

sha512=46922d5f2eb6802a148a52fd3e7f0be8370c93e7bc33cee05cf4a2044290845b10ccddbaa306f29c808e7c5019700763e37e45ff6deb507b874a4348010fed50

An imperative implementation of partitions via Union-Find

Paths are compressed imperatively at each lookup of a canonical representative. Each union also modifies in-place the partition structure.

Nota: for the moment we use Pervasive's comparison for choosing the smallest object as representative. This could be made more generic.

Sourcemodule type PartitionSig = sig ... end

Sourcemodule type SetS = sig ... end

Minimal interface for sets, subtype of stdlib's Set.

Sourcemodule type MapS = sig ... end

Minimal interface for maps, subtype of stdlib's Map.

module Make
  (S : SetS)
  (M : MapS with type key = S.elt) : 
  PartitionSig with type elt = S.elt and type set = S.t