package coq-int-map
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Maps indexed by binary integers : IntMap
Install
Dune Dependency
Authors
Maintainers
Sources
v8.6.0.tar.gz
md5=99c39b3b9dd3ccff89cee32f852c3e29
Description
This library contains a data structure for finite sets implemented by an efficient structure of map (trees indexed by binary integers). It was initially developed by Jean Goubault.
This user contribution used to be part of Coq Standard Library. It is now considered to be obsolete and subsumed by the new FSets/FMap library. IntMap can be now seen as a particular implementation of FMapInterface, see file FMapIntMap.
Tags
keyword: finite sets keyword: maps keyword: binary integers keyword: efficient data structures keyword: data structures category: Computer Science/Data Types and Data Structures date: around 1999 (integrated within Coq 7.0)Published: 20 Nov 2018
Dev Dependencies
None
Used by (4)
-
coq-bdds
= "8.6.0"
-
coq-graphs
< "8.7.0"
-
coq-smc
= "8.6.0"
-
coq-tree-automata
< "8.7.0"
Conflicts
None
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page