C | |
| Compare [SHGraph] | |
| Compare [Hashhe] | |
| Compare [Mappe] | |
| Compare [Sette] | |
D | |
| DHashhe |
Two-way hashtable between two data types
|
| DMappe |
Two-way map between two ordered data types
|
F | |
| FGraph |
Directed graphs, functional API, with two-way information maintained,
|
| FGraph1 |
Directed graphs, functional API, with one-way information maintained,
|
H | |
| Hash [Symbol] |
Hashtables on type
t
|
| Hash [Hashhe.S] | |
| HashH [SHGraph.T] |
Hash module with hyperedges as keys
|
| HashH [SHGraph.S] | |
| HashV [SHGraph.T] |
Hash module with vertices as keys
|
| HashV [SHGraph.S] | |
| HashX [DHashhe.Param] |
Hashtable for objects in the first place of bindings
|
| HashX [DHashhe.S] | |
| HashY [DHashhe.Param] |
Hashtable for objects in the second place of bindings
|
| HashY [DHashhe.S] | |
| HashedType [Symbol] |
To use hashtables on type
t
|
| Hashhe |
Hash tables and hash functions (extension of standard library module)
|
| HashheI |
Hashhe specialized for keys of type int
|
| HashheIB |
Hashhe specialized for keys of type (int,bool)
|
| HashheS |
Hashhe specialized for keys of type string
|
I | |
| Ilist |
Imbricated lists
|
M | |
| Make [SHGraph] | |
| Make [FGraph] | |
| Make [FGraph1] | |
| Make [MultiSetList] |
Functor building an implementation of the MultiSetList structure
given a totally ordered type.
|
| Make [SetList] |
Functor building an implementation of the SetList structure
given a totally ordered type.
|
| Make [DHashhe] |
Functor building an implementation of the DHashtbl structure
given two hashtables
|
| Make [DMappe] |
Functor building an implementation of the DMappe structure
given two map structures.
|
| Make [Hashhe] |
Functor building an implementation of the hashtable structure.
|
| Make [Mappe] |
Functor building an implementation of the map structure
given a totally ordered type.
|
| Make [Sette] |
Functor building an implementation of the set structure
given a totally ordered type.
|
| Map [Symbol] |
Maps on type
t
|
| MapE [FGraph.T] |
Map module for associating attributes to edges, of type
MapV.key *
MapV.key
|
| MapE [FGraph.S] |
The Map for edges
|
| MapE [FGraph1.T] |
Map module for associating attributes to edges, of type
MapV.key *
MapV.key
|
| MapE [FGraph1.S] |
The Map for edges
|
| MapV [FGraph.T] |
Map module for associating attributes to vertices, of type
MapV.key
|
| MapV [FGraph.S] |
The Map for vertices
|
| MapV [FGraph1.T] |
Map module for associating attributes to vertices, of type
MapV.key
|
| MapV [FGraph1.S] |
The Map for vertices
|
| Mappe |
Association tables over ordered types (extension of standard library module and polymorphic variant)
|
| MappeI |
Mappe specialized for keys of type int
|
| MappeS |
Mappe specialized for keys of type string
|
| MappeX [DMappe.Param] | |
| MappeX [DMappe.S] | |
| MappeY [DMappe.Param] | |
| MappeY [DMappe.S] | |
| MultiSetList |
Multisets implemented with lists
|
O | |
| Ord [Sette.S] |
The ordering module used for this set module.
|
| OrderedType [Symbol] |
To use sets or maps on type
t
|
P | |
| PDHashhe |
Two-way hashtable between two data types, parametrized polymorpphic version
|
| PDMappe |
Two-way map between two ordered data types, parametrized polymorphic version
|
| PHashhe |
Hash tables, parametrized polymorphic version
|
| PMappe |
Association tables over ordered types, parametrized polymorphic version
|
| PSHGraph |
Oriented hypergraphs, parametrized polymorphic version.
|
| PSette |
Sets over ordered types, parametrized polymorphic version
|
| Parse |
Linking lexer and parser function, with (basic) error messages
|
Printing functions using module
Format
| |
R | |
| Rational |
Rational numbers
|
S | |
| SHGraph |
Oriented hypergraphs
|
| Set [Symbol] |
Sets on type
t
|
| SetE [FGraph.S] |
The type of sets of edges
|
| SetE [FGraph1.S] |
The type of sets of edges
|
| SetH [SHGraph.T] |
Set module for hyperedges
|
| SetH [SHGraph.S] | |
| SetList |
Sets over totally ordered type with lists.
|
| SetV [SHGraph.T] |
Set module for vertices
|
| SetV [SHGraph.S] | |
| SetV [FGraph.S] |
The type of sets of vertices
|
| SetV [FGraph1.S] |
The type of sets of vertices
|
| Setkey [Mappe.S] | |
| Sette |
Sets over ordered types (extension of standard library module and polymorphic variant)
|
| SetteI |
Sette specialized for keys of type int
|
| SetteS |
Sette specialized for keys of type string
|
| Statistic |
Standard statistics functions
|
| Symbol |
Symbol table, for string management
|
T | |
| Time |
Small module to compute the duration of computations
|
U | |
| Union |
Union-find Abstract Data Types
|