package fix

You can search for identifiers within the package.

in-package search v0.2.0

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 signature DFA describes a deterministic finite-state automaton.

type states

The type states is a type-level representation of the number of states of the automaton. Thus, a state number has type states index. See Indexing for more information about type-level indices.

val states : states Indexing.cardinal

states is the number of states of the automaton.

type state = states Indexing.index

A state number is an integer in the range [0, cardinal states).

type transitions

The type transitions is a type-level representation of the number of transitions of the automaton. Thus, a transition number has type transitions index. See Indexing for more information about type-level indices.

val transitions : transitions Indexing.cardinal

transitions is the number of transitions of the automaton.

type transition = transitions Indexing.index

A transition number is an integer in the range [0, cardinal transitions).

type label

label is the type of transition labels.

val label : transition -> label

label t returns the label of the transition t.

val source : transition -> state

source t returns the source state of the transition t.

val target : transition -> state

target t returns the target state of the transition t.

val initials : state Enum.enum

initials is an enumeration of the initial states.

val finals : state Enum.enum

finals is an enumeration of the initial states.