Assert (component < fe->n_components(),
ExcIndexRange(component, 0, fe->n_components()));
- // if this particulat shape
+ // if this particular shape
// function is primitive, then we
// can take a short-cut by checking
// whether the requested component
if (fe->is_primitive(i))
{
if (component == fe->system_to_component_index(i).first)
- return this->shape_values(i,j);
+ return this->shape_values(this->shape_function_to_row_table[i],j);
else
return 0;
}
// no, this shape function is
// not primitive. then we have
// to loop over its components
- // and to find the
- // corresponding row in the
- // arrays of this
+ // to find the corresponding
+ // row in the arrays of this
// object. before that check
// whether the shape function
// is non-zero at all within
Assert (component < fe->n_components(),
ExcIndexRange(component, 0, fe->n_components()));
- // if this particulat shape
+ // if this particular shape
// function is primitive, then we
// can take a short-cut by checking
// whether the requested component
if (fe->is_primitive(i))
{
if (component == fe->system_to_component_index(i).first)
- return this->shape_gradients[i][j];
+ return this->shape_gradients[this->shape_function_to_row_table[i]][j];
else
return Tensor<1,dim>();
}
// no, this shape function is
// not primitive. then we have
// to loop over its components
- // and to find the
- // corresponding row in the
- // arrays of this
+ // to find the corresponding
+ // row in the arrays of this
// object. before that check
// whether the shape function
// is non-zero at all within
Assert (component < fe->n_components(),
ExcIndexRange(component, 0, fe->n_components()));
- // if this particulat shape
+ // if this particular shape
// function is primitive, then we
// can take a short-cut by checking
// whether the requested component
if (fe->is_primitive(i))
{
if (component == fe->system_to_component_index(i).first)
- return this->shape_2nd_derivatives[i][j];
+ return this->shape_2nd_derivatives[this->shape_function_to_row_table[i]][j];
else
return Tensor<2,dim>();
}
// no, this shape function is
// not primitive. then we have
// to loop over its components
- // and to find the
- // corresponding row in the
- // arrays of this
+ // to find the corresponding
+ // row in the arrays of this
// object. before that check
// whether the shape function
// is non-zero at all within