package goblint-cil

You can search for identifiers within the package.

in-package search v0.2.0

A front-end for the C programming language that facilitates program analysis and transformation

Install

Dune Dependency

github.com Readme Edit opam file Versions (11)

Authors

G

gabriel@kerneis.info

Maintainers

Sources

goblint-cil-1.8.2.tbz

sha256=f4711e3fa53c482cdef2d7ed62b287d859ce55ef8b4ddfdc6071e81034c3bc89

sha512=8a861aa04aed7684a7c86207cfd5b63503984917fe53ae4866890242cb0db38d2c4f7bd5a5565fd094da064fb290e67071bae6874377e10d2005330c71cc13a2

doc/goblint-cil.pta/Setp/index.html

Module `Setp`

Sets over ordered types.

This module implements the set data structure, given a total ordering function over the set elements. All operations over sets are purely applicative (no side-effects). The implementation uses balanced binary trees, and is therefore reasonably efficient: insertion and membership take time logarithmic in the size of the set, for instance.

module type PolyOrderedType = sig ... end

Input signature of the functor Set.Make.

module type S = sig ... end

Output signature of the functor Set.Make.

module Make (Ord : PolyOrderedType) : S with type 'a elt = 'a Ord.t

Functor building an implementation of the set structure given a totally ordered type.