#include <cardinality.h>
Definition at line 22 of file cardinality.h.
◆ cardinality_calculator()
◆ is_a_new_unique_element()
bool mcrl2::data::cardinality_calculator::is_a_new_unique_element |
( |
const data_expression & |
t, |
|
|
const std::vector< data_expression > |
already_found_elements, |
|
|
bool & |
determined |
|
) |
| const |
|
inlineprotected |
◆ operator()()
std::size_t mcrl2::data::cardinality_calculator::operator() |
( |
const sort_expression & |
s | ) |
const |
|
inline |
Counts the number of elements in a sort.
The returned value is either the number of elements, or zero if the number of elements cannot be determined, or is infinite.
- Parameters
-
s | The sort expression to be determined. |
Definition at line 66 of file cardinality.h.
◆ m_rewriter
const rewriter& mcrl2::data::cardinality_calculator::m_rewriter |
|
protected |
◆ m_specification
The documentation for this class was generated from the following file: