package zelus

You can search for identifiers within the package.

in-package search v0.2.0

package zelus

zelus
- Basics
- Defaultsolver
- Dump
- Illinois
- Lift
- Node
  - Ode23Solver
  - Ode45Solver
- Node_base
  - Make
    
    SSolver
    
    ZSolver
  - Ode23Solver
  - Ode45Solver
- Odexx
  - BUTCHER_TABLEAU
  - GenericODE
    
    Butcher
  - Ode23
  - Ode45
- Run
- Solvers
- Zls
- Zlsolve
  - Make
    
    _
  - ZELUS_SOLVER
- Zlsrun
  - Make
    
    _
- Ztypes
zelus.zlcompilerlibs
- Activate
- Add_copy_for_last
- Aform
- Automata
  - TableOfTypes
- Causal
  - K
  - M
  - S
- Causality
- Compiler
- Complete
- Control
- Copy
- Cost
- Cse
- Defcaus
- Definit
- Deftypes
- Dependences
- Deps_tools
- Disc
- Encore
- Fixstep
- Global
- Graph
  - E
  - S
- Horizon
- Init
  - M
  - S
- Initial
- Initialization
- Inline
- Inout
- Interface
- Letin
- Lident
- Lmm
- Markfunctions
- Match2condition
- Modules
  - E
- Oaux
- Obc
- Ocamlprinter
- Oprinter
- Patternsig
  - C
    
    SSet
  - LANG
- Pcaus
  - M
  - S
- Period
- Pinit
- Plmm
- Pp_tools
- Pre
- Present
- Printer
- Proba
- Ptypes
- Reduce
- Remove_last_in_patterns
- Reset
- Schedule
- Scoping
  - Error
  - Rename
  - S
- Shared
- Simulator
- Static
- Total
  - Automaton
- Translate
- Typerrors
- Typing
- Unsafe
- Vars
- Write
- Zaux
- Zconfig
- Zdeadcode
- Zdepend
  - StringSet
- Zelus
- Zident
  - Env
  - M
  - S
- Zlexer
- Zlocation
- Zlus2lmm
- Zmatching
  - PATTERN_CHECKER
    
    S
    
    SSet
  - SIG
- Zmisc
  - Env
  - S
  - State
  - name_assoc_table
  - name_generator
- Zopt
- Zparser
  - Incremental
  - MenhirInterpreter
- Zparsetree
- Ztypes

Legend:
Library
Module
Module type
Parameter
Class
Class type

type 'a collection =

| And of 'a collection list
| Before of 'a collection list
| Leaf of 'a

val read : Zelus.eq -> Zident.S.t * Zident.S.t

Read/writes of an equation.

val def : Zelus.eq -> Zident.S.t

val init : Zelus.eq -> bool

Initialization equations init x = e and

val nodep : Zelus.eq -> bool

val index : Zelus.eq -> int

val unsafe : Zelus.eq -> bool

val fresh : int -> Zelus.eq collection -> Zelus.eq collection * int

val name_to_index : 
  (Graph.S.t Zident.Env.t
   * Graph.S.t Zident.Env.t
   * (int * Zelus.eq * Zident.S.t * Zident.S.t * Zident.S.t) list) ->
  Zelus.eq collection ->
  Graph.S.t Zident.Env.t
  * Graph.S.t Zident.Env.t
  * (int * Zelus.eq * Zident.S.t * Zident.S.t * Zident.S.t) list

val make_read_write : 
  Graph.S.t Zident.Env.t ->
  Graph.S.t Zident.Env.t ->
  (Graph.E.key * 'a * Zident.S.t * Zident.S.t * Zident.S.t) list ->
  'a Graph.graph

val make_unsafes : 
  'a ->
  'b ->
  'c Graph.graph ->
  Zelus.eq collection ->
  'c Graph.graph

val make : Zelus.eq collection -> Zelus.eq Graph.graph

val print : Format.formatter -> Zelus.eq Graph.graph -> unit