Nektar++
|
Public Member Functions | |
def | __init__ (self, pat) |
def | match (self, expr) |
def | match (self, expr) |
Public Attributes | |
sub_pattern | |
A container that matches any number of levels of indirection/recursion. This can be used to wrap a pattern where we wish to allow for variable mappings or equations such as "var1 = var2" before we reach the 'interesting' equation. If the expression we're matching is a ci element we recursively find the ultimate non-ci defining expression and match our sub-pattern against that. If the expression isn't a ci, or the ultimate definition isn't an expression, we match our sub-pattern against it directly.
Definition at line 1401 of file optimize.py.
def CellMLToNektar.optimize.ExpressionMatcher.R.__init__ | ( | self, | |
pat | |||
) |
Definition at line 1411 of file optimize.py.
def CellMLToNektar.optimize.ExpressionMatcher.R.match | ( | self, | |
expr | |||
) |
Method implemented by concrete subclasses to test a given expression. Returns True iff there is a match.
Reimplemented from CellMLToNektar.optimize.ExpressionMatcher.Pattern.
Definition at line 1414 of file optimize.py.
References CellMLToNektar.optimize.ExpressionMatcher.R.match(), and CellMLToNektar.optimize.ExpressionMatcher.R.sub_pattern.
Referenced by CellMLToNektar.optimize.ExpressionMatcher.R.match().
CellMLToNektar.optimize.ExpressionMatcher.R.sub_pattern |
Definition at line 1412 of file optimize.py.
Referenced by CellMLToNektar.optimize.ExpressionMatcher.R.match().