package coq

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

Formal proof management system

Install

dune-project

Dependency

coq.inria.fr Edit opam file Versions (40)

Authors

T

The Coq development team, INRIA, CNRS, and contributors.

Maintainers

C

coqdev@inria.fr

Sources

coq-8.15.0.tar.gz

sha256=73466e61f229b23b4daffdd964be72bd7a110963b9d84bd4a86bb05c5dc19ef3

doc/coq-core.clib/Diff2/Make/index.html

Module `Diff2.Make`Source

Functor building an implementation of the diff structure given a sequence type.

Parameters

module M : SeqType

Signature

Sourcetype t = M.t

The type of input sequence.

Sourcetype elem = M.elem

The type of the elements of result / input sequence.

Sourceval lcs : ?equal:(elem -> elem -> bool) -> t -> t -> elem common list

lcs ~equal seq1 seq2 computes the LCS (longest common sequence) of seq1 and seq2. Elements of seq1 and seq2 are compared with equal. equal defaults to Pervasives.(=).

Elements of lcs are `Common (pos1, pos2, e) where e is an element, pos1 is a position in seq1, and pos2 is a position in seq2.

Sourceval diff : ?equal:(elem -> elem -> bool) -> t -> t -> elem edit list

diff ~equal seq1 seq2 computes the diff of seq1 and seq2. Elements of seq1 and seq2 are compared with equal.

Elements only in seq1 are represented as `Removed (pos, e) where e is an element, and pos is a position in seq1; those only in seq2 are represented as `Added (pos, e) where e is an element, and pos is a position in seq2; those common in seq1 and seq2 are represented as `Common (pos1, pos2, e) where e is an element, pos1 is a position in seq1, and pos2 is a position in seq2.

Source

val fold_left : 
  ?equal:(elem -> elem -> bool) ->
  f:('a -> elem edit -> 'a) ->
  init:'a ->
  t ->
  t ->
  'a

fold_left ~equal ~f ~init seq1 seq2 is same as diff ~equal seq1 seq2 |> ListLabels.fold_left ~f ~init, but does not create an intermediate list.