package coq

You can search for identifiers within the package.

in-package search v0.2.0

Formal proof management system

Install

Dune Dependency

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

Authors

T

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

Maintainers

C

coqdev@inria.fr

Sources

coq-8.16.0.tar.gz

sha256=36577b55f4a4b1c64682c387de7abea932d0fd42fc0cd5406927dca344f53587

doc/coq-core.clib/Segmenttree/index.html

Module `Segmenttree`Source

This module is a very simple implementation of "segment trees".

A segment tree of type 'a t represents a mapping from a union of disjoint segments to some values of type 'a.

Sourcetype 'a t

A mapping from a union of disjoint segments to some values of type 'a.

Sourceval make : ((int * int) * 'a) list -> 'a t

make [(i1, j1), v1; (i2, j2), v2; ...] creates a mapping that associates to every integer x the value v1 if i1 <= x <= j1, v2 if i2 <= x <= j2, and so one. Precondition: the segments must be sorted.

Sourceval lookup : int -> 'a t -> 'a

lookup k t looks for an image for key k in the interval tree t. Raise Not_found if it fails.