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

cil-project.github.io Readme Edit opam file Versions (11)

Authors

G

gabriel@kerneis.info

Maintainers

Sources

1.8.0.tar.gz

md5=796ad26120b5c6b939a57e8623088aef

sha512=01a58ac6d928afead21c8a97af5865715114cd0562234d1d4aef9e4ac5d91415d040a15927c52cb896dbb39a53e915627f498ebe2d026a548c3ff597682041b2

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

Module `Setp`Source

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.

Sourcemodule type PolyOrderedType = sig ... end

Input signature of the functor Set.Make.

Sourcemodule type S = sig ... end

Output signature of the functor Set.Make.

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

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