package goblint-cil

You can search for identifiers within the package.

in-package search v0.2.0

goblint-cil
- Alpha
- Bitmap
- Cabs
- Cabs2cil
- Cabshelper
- Cabsvisit
  - cabsVisitor
  - nopCabsVisitor
- Cfg
- Check
- Cil
- Cilint
- Cillower
- Ciloptions
- Ciltools
- Cilutil
- Cilversion
- Clexer
- Clist
- Cparser
- Cprint
- Dataflow
- Dominators
- Errormsg
- Escape
- Expcompare
  - volatileFinderClass
- Feature
- Formatcil
- Formatlex
- Formatparse
- Frontc
- GrowArray
- Inthash
- Lexerhack
- Libmaincil
  - unrollVisitorClass
- Longarray
- Machdep
- Machdepenv
- Mergecil
- Patch
- Pretty
  - MakeMapPrinter
    
    Map
  - MakeSetPrinter
    
    Set
- Rmtmps
- Stats
- Trace
- Util
- Whitetrack
goblint-cil.dataslicing
- Dataslicing
goblint-cil.liveness
- Liveness
- Usedef
  - VS
  - useDefVisitorClass
goblint-cil.makecfg
- MakeCFG
  - callBBVisitor
  - vidVisitor
goblint-cil.pta
- Golf
- Olf
- Ptranal
- Setp
  - Make
    
    Ord
  - PolyOrderedType
  - S
- Steensgaard
- Uref
goblint-cil.syntacticsearch
goblint-cil.zrapp

Legend:
Library
Module
Module type
Parameter
Class
Class type

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.