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 immediate =

| Eint of int
| Efloat of float
| Ebool of bool
| Echar of char
| Estring of string
| Evoid

type name = string

type 'a loc = {

mutable t_desc : 'a;
mutable t_index : int;
mutable t_level : int;

}

type typ = typ_desc loc

and typ_desc =

| Tvar
| Tproduct of typ list
| Tconstr of Lident.qualident * typ list * abbrev ref
| Tvec of typ * size
| Tfun of kind * Zident.t option * typ * typ
| Tlink of typ

and size =

| Tconst of int
| Tglobal of Lident.qualident
| Tname of Zident.t
| Top of op * size * size

and op =

| Tplus
| Tminus

and abbrev =

| Tnil
| Tcons of typ list * typ

and typ_scheme = {

typ_vars : typ list;
mutable typ_body : typ;

}

and typ_instance = {

typ_instance : typ list;

}

and kind =

| Tstatic of bool
| Tany
| Tcont
| Tdiscrete of bool
| Tproba

type tentry = {

mutable t_sort : tsort;
mutable t_typ : typ;

}

and tsort =

| Sstatic
| Sval
| Svar of var
| Smem of mem

and var = {

v_combine : Lident.t option;
v_default : constant option;

}

and mem = {

m_kind : mkind option;
m_next : bool option;
m_previous : bool;
m_init : minit;
m_combine : Lident.t option;

}

and mkind =

| Cont
| Zero
| Horizon
| Period
| Encore
| Major

and minit =

| Noinit
| InitEq
| InitDecl of constant

and constant =

| Cimmediate of immediate
| Cglobal of Lident.t

type defnames = {

dv : Zident.S.t;
nv : Zident.S.t;
mv : Zident.S.t;
di : Zident.S.t;
der : Zident.S.t;

}

Names written in a block

val names : Zident.S.t -> defnames -> Zident.S.t

val cur_names : Zident.S.t -> defnames -> Zident.S.t

val empty : defnames

Making values

val make : 'a -> 'a loc

val make_realtime : 'a -> 'a loc

val no_typ : typ_desc loc

val is_no_typ : typ -> bool

val no_typ_scheme : typ_scheme

val no_typ_instance : typ_instance

val no_abbrev : unit -> abbrev ref

val static : tsort

val value : tsort

val variable : tsort

val empty_mem : mem

val initialized : mem -> mem

val previous : mem -> mem

val next : mem -> mem

val zero : mem -> tsort

val horizon : mem -> tsort

val major : unit -> tsort

val default : constant option -> Lident.t option -> tsort

val imem : mem

val cmem : Lident.t option -> mem -> mem

val mem : mem

val memory : tsort

val imemory : tsort

val entry : tsort -> typ -> tentry

val desc : 'a loc -> 'a

val index : 'a loc -> int