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.14.0.tar.gz

sha256=b1501d686c21836302191ae30f610cca57fb309214c126518ca009363ad2cd3c

doc/coq-core.clib/Int/PMap/index.html

Module `Int.PMap`Source

This is a (partial) implementation of a Map interface on integers, except that it internally uses persistent arrays. This ensures O(1) accesses in non-backtracking cases. It is thus better suited for zero-starting, contiguous keys, or otherwise a lot of space will be empty. To keep track of the present keys, a binary tree is also used, so that adding a key is still logarithmic. It is therefore essential that most of the operations are accesses and not add/removes.

Sourcetype key = int

Sourcetype 'a t

Sourceval empty : 'a t

Sourceval is_empty : 'a t -> bool

Sourceval mem : key -> 'a t -> bool

Sourceval add : key -> 'a -> 'a t -> 'a t

Sourceval singleton : key -> 'a -> 'a t

Sourceval remove : key -> 'a t -> 'a t

Sourceval iter : (key -> 'a -> unit) -> 'a t -> unit

Sourceval fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b

Sourceval for_all : (key -> 'a -> bool) -> 'a t -> bool

Sourceval exists : (key -> 'a -> bool) -> 'a t -> bool

Sourceval find : key -> 'a t -> 'a

Sourceval domain : 'a t -> Set.t

Sourceval cast : 'a t -> 'a Map.t