package fix

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

fix
- Fix
  - ARRAY
  - CompactQueue
  - DATA_FLOW_GRAPH
  - DataFlow
    
    ForCustomMaps
    
    B
    
    G
    
    P
    
    V
    
    ForHashedType
    
    G
    
    P
    
    T
    
    ForIntSegment
    
    G
    
    K
    
    P
    
    ForOrderedType
    
    G
    
    P
    
    T
    
    ForType
    
    G
    
    P
    
    T
    
    Run
    
    G
    
    M
    
    P
  - Enum
  - FINITE_TYPE
  - Fix
    
    ForHashedType
    
    P
    
    T
    
    ForOrderedType
    
    P
    
    T
    
    ForType
    
    P
    
    T
    
    Make
    
    M
    
    P
  - GRAPH
  - Gensym
  - Glue
    
    ArraysAsImperativeMaps
    
    K
    
    CHAR
    
    HashTablesAsImperativeMaps
    
    H
    
    INT
    
    InjectHashedType
    
    I
    
    U
    
    InjectImperativeMaps
    
    I
    
    J
    
    M
    
    InjectMinimalImperativeMaps
    
    I
    
    M
    
    InjectOrderedType
    
    I
    
    U
    
    MinimalSemiLattice
    
    P
    
    PersistentMapsToImperativeMaps
    
    M
    
    STRING
    
    TrivialHashedType
    
    T
    
    TrivialOrderedType
    
    T
    
    WeakHashTablesAsImperativeMaps
    
    H
  - GraphNumbering
    
    ForHashedType
    
    G
    
    T
    
    ForOrderedType
    
    G
    
    T
    
    ForType
    
    G
    
    T
    
    Make
    
    G
    
    M
  - HashCons
    
    ForHashedType
    
    T
    
    ForHashedTypeWeak
    
    T
    
    Make
    
    M
    
    SERVICE
  - IMPERATIVE_MAPS
  - INJECTION
  - Indexing
    
    CARDINAL
    
    Const
    
    X
    
    Empty
    
    Gensym
    
    Index
    
    SUM
    
    Sum
    
    L
    
    R
    
    Vector
    
    Of_array
    
    A
    
    V
  - MEMOIZER
  - MINIMAL_IMPERATIVE_MAPS
  - MINIMAL_SEMI_LATTICE
  - Make
    
    M
    
    P
  - Memoize
    
    Char
    
    ForHashedType
    
    T
    
    ForOrderedType
    
    T
    
    ForType
    
    T
    
    Int
    
    Make
    
    M
    
    String
  - Minimize
    
    DFA
    
    Minimize
    
    A
    
    Label
  - NUMBERING
  - Numbering
    
    ForHashedType
    
    Done
    
    T
    
    ForOrderedType
    
    Done
    
    T
    
    ForType
    
    Done
    
    T
    
    Make
    
    Done
    
    M
  - ONGOING_NUMBERING
  - PERSISTENT_MAPS
  - PROPERTY
  - Partition
  - Prop
    
    Boolean
    
    Option
    
    X
    
    Set
    
    X
  - SEMI_LATTICE
  - SOLUTION
  - SOLVER
  - TABULATOR
  - TWO_PHASE_NUMBERING
    
    Done
  - TYPE
  - Tabulate
    
    ForHashedType
    
    F
    
    T
    
    ForIntSegment
    
    K
    
    ForOrderedType
    
    F
    
    T
    
    ForType
    
    F
    
    Make
    
    F
    
    M

Legend:
Library
Module
Module type
Parameter
Class
Class type

The functor Make requires an implementation of maps for the type M.key and offers a two-phase numbering facility. The function encode is backed by a map, therefore runs in logarithmic time or constant time, depending on the type of map that is used. The function decode is backed by an array of size n, therefore runs in constant time.

Parameters

module M : sig ... end

Signature

type t = M.key

The type t of values of interest.

val encode : t -> int

encode maps a value of type t to a unique integer code. If applied twice to the same value, encode returns the same code; if applied to a value that has never been encountered, it returns a fresh code.

val current : unit -> int

current() returns the next available code, which is also the number of values that have been encoded so far.

val has_been_encoded : t -> bool

has_been_encoded x determines whether the value x has been encoded already.

module Done () : sig ... end

The functor Done ends the numbering process.