The change variables were hard coded so that only the first TIME_INDEPENDENT equation would have its change variable (for Newton-Picard iteration). This prevented the addition of multiple TIME_INDEPENDENT (#166) equations. To fix this, I switched the FEEvaluation vectors to unordered maps instead.
This way, we can assign the FEEvaluation to the global variable index rather than the index of variable type (e.g. phi might be the 4th explicit variable and the 5th global variable. In the prior scheme we would index based on the 4th explicit). Doing so also reduced the convolutedness of loadVariableAttributes.cc and variableContainer.cc.
Some minor optimizations were also made in regard to dereferencing over and over. Before we had this
The change variables were hard coded so that only the first
TIME_INDEPENDENT
equation would have its change variable (for Newton-Picard iteration). This prevented the addition of multipleTIME_INDEPENDENT
(#166) equations. To fix this, I switched theFEEvaluation
vectors to unordered maps instead.This way, we can assign the
FEEvaluation
to the global variable index rather than the index of variable type (e.g. phi might be the 4th explicit variable and the 5th global variable. In the prior scheme we would index based on the 4th explicit). Doing so also reduced the convolutedness ofloadVariableAttributes.cc
andvariableContainer.cc
.Some minor optimizations were also made in regard to dereferencing over and over. Before we had this
Instead, I stored the pointer in a local variable.
Since these are called for every cell and every step, the performance improvement should be rather significant.