package coq-core

  1. Overview
  2. Docs
The Coq Proof Assistant -- Core Binaries and Tools

Install 

dune-project
 Dependency

coq.inria.fr Readme Edit opam file Versions (11)

Authors

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

Maintainers

  1. T
    The Coq development team <coqdev@inria.fr>

Sources

coq-8.19.2.tar.gz
md5=5d1187d5e44ed0163f76fb12dabf012e
sha512=91bc81530fa4f6498961583ad51eac5001f139881788b88e360a866ad8e2a6e2c5bce86d1a580ab4cd4782bf49d48318767df82471ce33ba3ac143e5569ad33c

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

Module Diff2.MakeSource

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.

Sourceval 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.

Sourceval iter : ?equal:(elem -> elem -> bool) -> f:(elem edit -> unit) -> t -> t -> unit

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