fe_system.cc

// ---------------------------------------------------------------------
//
// Copyright (C) 1999 - 2016 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, redistribute
// it, and/or modify it under the terms of the GNU Lesser General
// Public License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE at
// the top level of the deal.II distribution.
//
// ---------------------------------------------------------------------

#include <deal.II/base/memory_consumption.h>
#include <deal.II/base/quadrature.h>
#include <deal.II/base/qprojector.h>
#include <deal.II/grid/tria.h>
#include <deal.II/grid/tria_iterator.h>
#include <deal.II/dofs/dof_accessor.h>
#include <deal.II/fe/mapping.h>
#include <deal.II/fe/fe_system.h>
#include <deal.II/fe/fe_values.h>

#include <sstream>


DEAL_II_NAMESPACE_OPEN

namespace
{
  bool IsNonZero (unsigned int i)
  {
    return i>0;
  }

  unsigned int count_nonzeros(const std::vector<unsigned int> &vec)
  {
    return std::count_if(vec.begin(), vec.end(), IsNonZero);
  }

}
/* ----------------------- FESystem::InternalData ------------------- */


template <int dim, int spacedim>
FESystem<dim,spacedim>::InternalData::InternalData(const unsigned int n_base_elements)
  :
  base_fe_datas(n_base_elements),
  base_fe_output_objects(n_base_elements)
{}



template <int dim, int spacedim>
FESystem<dim,spacedim>::InternalData::~InternalData()
{
  // delete pointers and set them to zero to avoid inadvertent use
  for (unsigned int i=0; i<base_fe_datas.size(); ++i)
    if (base_fe_datas[i])
      {
        delete base_fe_datas[i];
        base_fe_datas[i] = 0;
      }
}



template <int dim, int spacedim>
typename FiniteElement<dim,spacedim>::InternalDataBase &
FESystem<dim,spacedim>::
InternalData::get_fe_data (const unsigned int base_no) const
{
  Assert(base_no<base_fe_datas.size(),
         ExcIndexRange(base_no,0,base_fe_datas.size()));
  return *base_fe_datas[base_no];
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::
InternalData::set_fe_data (const unsigned int base_no,
                           typename FiniteElement<dim,spacedim>::InternalDataBase *ptr)
{
  Assert(base_no<base_fe_datas.size(),
         ExcIndexRange(base_no,0,base_fe_datas.size()));
  base_fe_datas[base_no]=ptr;
}



template <int dim, int spacedim>
internal::FEValues::FiniteElementRelatedData<dim,spacedim> &
FESystem<dim,spacedim>::
InternalData::get_fe_output_object (const unsigned int base_no) const
{
  Assert(base_no<base_fe_output_objects.size(),
         ExcIndexRange(base_no,0,base_fe_output_objects.size()));
  return base_fe_output_objects[base_no];
}



/* ---------------------------------- FESystem ------------------- */


template <int dim, int spacedim>
const unsigned int FESystem<dim,spacedim>::invalid_face_number;

namespace
{

  template <int dim, int spacedim>
  FiniteElementData<dim>
  multiply_dof_numbers (const std::vector<const FiniteElement<dim,spacedim>*> &fes,
                        const std::vector<unsigned int>                       &multiplicities)
  {
    AssertDimension(fes.size(), multiplicities.size());

    unsigned int multiplied_dofs_per_vertex = 0;
    unsigned int multiplied_dofs_per_line = 0;
    unsigned int multiplied_dofs_per_quad = 0;
    unsigned int multiplied_dofs_per_hex = 0;

    unsigned int multiplied_n_components = 0;

    unsigned int degree = 0; // degree is the maximal degree of the components

    for (unsigned int i=0; i<fes.size(); i++)
      if (multiplicities[i]>0)
        {
          multiplied_dofs_per_vertex += fes[i]->dofs_per_vertex * multiplicities[i];
          multiplied_dofs_per_line   += fes[i]->dofs_per_line * multiplicities[i];
          multiplied_dofs_per_quad   += fes[i]->dofs_per_quad * multiplicities[i];
          multiplied_dofs_per_hex    += fes[i]->dofs_per_hex * multiplicities[i];

          multiplied_n_components+=fes[i]->n_components() * multiplicities[i];

          degree = std::max(degree, fes[i]->tensor_degree() );
        }

    // assume conformity of the first finite element and then take away
    // bits as indicated by the base elements. if all multiplicities
    // happen to be zero, then it doesn't matter what we set it to.
    typename FiniteElementData<dim>::Conformity total_conformity
      = typename FiniteElementData<dim>::Conformity();
    {
      unsigned int index = 0;
      for (index=0; index<fes.size(); ++index)
        if (multiplicities[index]>0)
          {
            total_conformity = fes[index]->conforming_space;
            break;
          }

      for (; index<fes.size(); ++index)
        if (multiplicities[index]>0)
          total_conformity =
            typename FiniteElementData<dim>::Conformity(total_conformity
                                                        &
                                                        fes[index]->conforming_space);
    }

    std::vector<unsigned int> dpo;
    dpo.push_back(multiplied_dofs_per_vertex);
    dpo.push_back(multiplied_dofs_per_line);
    if (dim>1) dpo.push_back(multiplied_dofs_per_quad);
    if (dim>2) dpo.push_back(multiplied_dofs_per_hex);

    BlockIndices block_indices (0,0);

    for (unsigned int base=0; base < fes.size(); ++base)
      for (unsigned int m = 0; m < multiplicities[base]; ++m)
        block_indices.push_back(fes[base]->dofs_per_cell);

    return FiniteElementData<dim> (dpo,
                                   multiplied_n_components,
                                   degree,
                                   total_conformity,
                                   block_indices);
  }

  template <int dim, int spacedim>
  FiniteElementData<dim>
  multiply_dof_numbers (const FiniteElement<dim,spacedim> *fe1,
                        const unsigned int            N1,
                        const FiniteElement<dim,spacedim> *fe2=NULL,
                        const unsigned int            N2=0,
                        const FiniteElement<dim,spacedim> *fe3=NULL,
                        const unsigned int            N3=0,
                        const FiniteElement<dim,spacedim> *fe4=NULL,
                        const unsigned int            N4=0,
                        const FiniteElement<dim,spacedim> *fe5=NULL,
                        const unsigned int            N5=0)
  {
    std::vector<const FiniteElement<dim,spacedim>*> fes;
    fes.push_back(fe1);
    fes.push_back(fe2);
    fes.push_back(fe3);
    fes.push_back(fe4);
    fes.push_back(fe5);

    std::vector<unsigned int> mult;
    mult.push_back(N1);
    mult.push_back(N2);
    mult.push_back(N3);
    mult.push_back(N4);
    mult.push_back(N5);
    return multiply_dof_numbers(fes, mult);
  }



  template <int dim, int spacedim>
  std::vector<bool>
  compute_restriction_is_additive_flags (const std::vector<const FiniteElement<dim,spacedim>*> &fes,
                                         const std::vector<unsigned int>              &multiplicities)
  {
    AssertDimension(fes.size(), multiplicities.size());

    // first count the number of dofs and components that will emerge from the
    // given FEs
    unsigned int n_shape_functions = 0;
    for (unsigned int i=0; i<fes.size(); ++i)
      if (multiplicities[i]>0) // check needed as fe might be NULL
        n_shape_functions += fes[i]->dofs_per_cell * multiplicities[i];

    // generate the array that will hold the output
    std::vector<bool> retval (n_shape_functions, false);

    // finally go through all the shape functions of the base elements, and copy
    // their flags. this somehow copies the code in build_cell_table, which is
    // not nice as it uses too much implicit knowledge about the layout of the
    // individual bases in the composed FE, but there seems no way around...
    //
    // for each shape function, copy the flags from the base element to this
    // one, taking into account multiplicities, and other complications
    unsigned int total_index = 0;
    for (unsigned int vertex_number=0;
         vertex_number<GeometryInfo<dim>::vertices_per_cell;
         ++vertex_number)
      {
        for (unsigned int base=0; base<fes.size(); ++base)
          for (unsigned int m=0; m<multiplicities[base]; ++m)
            for (unsigned int local_index = 0;
                 local_index < fes[base]->dofs_per_vertex;
                 ++local_index, ++total_index)
              {
                const unsigned int index_in_base
                  = (fes[base]->dofs_per_vertex*vertex_number +
                     local_index);

                Assert (index_in_base < fes[base]->dofs_per_cell,
                        ExcInternalError());
                retval[total_index] = fes[base]->restriction_is_additive(index_in_base);
              }
      }

    // 2. Lines
    if (GeometryInfo<dim>::lines_per_cell > 0)
      for (unsigned int line_number= 0;
           line_number != GeometryInfo<dim>::lines_per_cell;
           ++line_number)
        {
          for (unsigned int base=0; base<fes.size(); ++base)
            for (unsigned int m=0; m<multiplicities[base]; ++m)
              for (unsigned int local_index = 0;
                   local_index < fes[base]->dofs_per_line;
                   ++local_index, ++total_index)
                {
                  const unsigned int index_in_base
                    = (fes[base]->dofs_per_line*line_number +
                       local_index +
                       fes[base]->first_line_index);

                  Assert (index_in_base < fes[base]->dofs_per_cell,
                          ExcInternalError());
                  retval[total_index] = fes[base]->restriction_is_additive(index_in_base);
                }
        }

    // 3. Quads
    if (GeometryInfo<dim>::quads_per_cell > 0)
      for (unsigned int quad_number= 0;
           quad_number != GeometryInfo<dim>::quads_per_cell;
           ++quad_number)
        {
          for (unsigned int base=0; base<fes.size(); ++base)
            for (unsigned int m=0; m<multiplicities[base]; ++m)
              for (unsigned int local_index = 0;
                   local_index < fes[base]->dofs_per_quad;
                   ++local_index, ++total_index)
                {
                  const unsigned int index_in_base
                    = (fes[base]->dofs_per_quad*quad_number +
                       local_index +
                       fes[base]->first_quad_index);

                  Assert (index_in_base < fes[base]->dofs_per_cell,
                          ExcInternalError());
                  retval[total_index] = fes[base]->restriction_is_additive(index_in_base);
                }
        }

    // 4. Hexes
    if (GeometryInfo<dim>::hexes_per_cell > 0)
      for (unsigned int hex_number= 0;
           hex_number != GeometryInfo<dim>::hexes_per_cell;
           ++hex_number)
        {
          for (unsigned int base=0; base<fes.size(); ++base)
            for (unsigned int m=0; m<multiplicities[base]; ++m)
              for (unsigned int local_index = 0;
                   local_index < fes[base]->dofs_per_hex;
                   ++local_index, ++total_index)
                {
                  const unsigned int index_in_base
                    = (fes[base]->dofs_per_hex*hex_number +
                       local_index +
                       fes[base]->first_hex_index);

                  Assert (index_in_base < fes[base]->dofs_per_cell,
                          ExcInternalError());
                  retval[total_index] = fes[base]->restriction_is_additive(index_in_base);
                }
        }

    Assert (total_index == n_shape_functions, ExcInternalError());

    return retval;
  }



  template <int dim, int spacedim>
  std::vector<bool>
  compute_restriction_is_additive_flags (const FiniteElement<dim,spacedim> *fe1,
                                         const unsigned int        N1,
                                         const FiniteElement<dim,spacedim> *fe2=NULL,
                                         const unsigned int        N2=0,
                                         const FiniteElement<dim,spacedim> *fe3=NULL,
                                         const unsigned int        N3=0,
                                         const FiniteElement<dim,spacedim> *fe4=NULL,
                                         const unsigned int        N4=0,
                                         const FiniteElement<dim,spacedim> *fe5=NULL,
                                         const unsigned int        N5=0)
  {
    std::vector<const FiniteElement<dim,spacedim>*> fe_list;
    std::vector<unsigned int>              multiplicities;

    fe_list.push_back (fe1);
    multiplicities.push_back (N1);

    fe_list.push_back (fe2);
    multiplicities.push_back (N2);

    fe_list.push_back (fe3);
    multiplicities.push_back (N3);

    fe_list.push_back (fe4);
    multiplicities.push_back (N4);

    fe_list.push_back (fe5);
    multiplicities.push_back (N5);
    return compute_restriction_is_additive_flags (fe_list, multiplicities);
  }



  template <int dim, int spacedim>
  std::vector<ComponentMask>
  compute_nonzero_components (const std::vector<const FiniteElement<dim,spacedim>*> &fes,
                              const std::vector<unsigned int>              &multiplicities)
  {
    AssertDimension(fes.size(), multiplicities.size());

    // first count the number of dofs and components that will emerge from the
    // given FEs
    unsigned int n_shape_functions = 0;
    for (unsigned int i=0; i<fes.size(); ++i)
      if (multiplicities[i]>0) //needed because fe might be NULL
        n_shape_functions += fes[i]->dofs_per_cell * multiplicities[i];

    unsigned int n_components = 0;
    for (unsigned int i=0; i<fes.size(); ++i)
      if (multiplicities[i]>0) //needed because fe might be NULL
        n_components += fes[i]->n_components() * multiplicities[i];

    // generate the array that will hold the output
    std::vector<std::vector<bool> >
    retval (n_shape_functions, std::vector<bool> (n_components, false));

    // finally go through all the shape functions of the base elements, and copy
    // their flags. this somehow copies the code in build_cell_table, which is
    // not nice as it uses too much implicit knowledge about the layout of the
    // individual bases in the composed FE, but there seems no way around...
    //
    // for each shape function, copy the non-zero flags from the base element to
    // this one, taking into account multiplicities, multiple components in base
    // elements, and other complications
    unsigned int total_index = 0;
    for (unsigned int vertex_number=0;
         vertex_number<GeometryInfo<dim>::vertices_per_cell;
         ++vertex_number)
      {
        unsigned int comp_start = 0;
        for (unsigned int base=0; base<fes.size(); ++base)
          for (unsigned int m=0; m<multiplicities[base];
               ++m, comp_start+=fes[base]->n_components())
            for (unsigned int local_index = 0;
                 local_index < fes[base]->dofs_per_vertex;
                 ++local_index, ++total_index)
              {
                const unsigned int index_in_base
                  = (fes[base]->dofs_per_vertex*vertex_number +
                     local_index);

                Assert (comp_start+fes[base]->n_components() <=
                        retval[total_index].size(),
                        ExcInternalError());
                for (unsigned int c=0; c<fes[base]->n_components(); ++c)
                  {
                    Assert (c < fes[base]->get_nonzero_components(index_in_base).size(),
                            ExcInternalError());
                    retval[total_index][comp_start+c]
                      = fes[base]->get_nonzero_components(index_in_base)[c];
                  }
              }
      }

    // 2. Lines
    if (GeometryInfo<dim>::lines_per_cell > 0)
      for (unsigned int line_number= 0;
           line_number != GeometryInfo<dim>::lines_per_cell;
           ++line_number)
        {
          unsigned int comp_start = 0;
          for (unsigned int base=0; base<fes.size(); ++base)
            for (unsigned int m=0; m<multiplicities[base];
                 ++m, comp_start+=fes[base]->n_components())
              for (unsigned int local_index = 0;
                   local_index < fes[base]->dofs_per_line;
                   ++local_index, ++total_index)
                {
                  const unsigned int index_in_base
                    = (fes[base]->dofs_per_line*line_number +
                       local_index +
                       fes[base]->first_line_index);

                  Assert (comp_start+fes[base]->n_components() <=
                          retval[total_index].size(),
                          ExcInternalError());
                  for (unsigned int c=0; c<fes[base]->n_components(); ++c)
                    {
                      Assert (c < fes[base]->get_nonzero_components(index_in_base).size(),
                              ExcInternalError());
                      retval[total_index][comp_start+c]
                        = fes[base]->get_nonzero_components(index_in_base)[c];
                    }
                }
        }

    // 3. Quads
    if (GeometryInfo<dim>::quads_per_cell > 0)
      for (unsigned int quad_number= 0;
           quad_number != GeometryInfo<dim>::quads_per_cell;
           ++quad_number)
        {
          unsigned int comp_start = 0;
          for (unsigned int base=0; base<fes.size(); ++base)
            for (unsigned int m=0; m<multiplicities[base];
                 ++m, comp_start+=fes[base]->n_components())
              for (unsigned int local_index = 0;
                   local_index < fes[base]->dofs_per_quad;
                   ++local_index, ++total_index)
                {
                  const unsigned int index_in_base
                    = (fes[base]->dofs_per_quad*quad_number +
                       local_index +
                       fes[base]->first_quad_index);

                  Assert (comp_start+fes[base]->n_components() <=
                          retval[total_index].size(),
                          ExcInternalError());
                  for (unsigned int c=0; c<fes[base]->n_components(); ++c)
                    {
                      Assert (c < fes[base]->get_nonzero_components(index_in_base).size(),
                              ExcInternalError());
                      retval[total_index][comp_start+c]
                        = fes[base]->get_nonzero_components(index_in_base)[c];
                    }
                }
        }

    // 4. Hexes
    if (GeometryInfo<dim>::hexes_per_cell > 0)
      for (unsigned int hex_number= 0;
           hex_number != GeometryInfo<dim>::hexes_per_cell;
           ++hex_number)
        {
          unsigned int comp_start = 0;
          for (unsigned int base=0; base<fes.size(); ++base)
            for (unsigned int m=0; m<multiplicities[base];
                 ++m, comp_start+=fes[base]->n_components())
              for (unsigned int local_index = 0;
                   local_index < fes[base]->dofs_per_hex;
                   ++local_index, ++total_index)
                {
                  const unsigned int index_in_base
                    = (fes[base]->dofs_per_hex*hex_number +
                       local_index +
                       fes[base]->first_hex_index);

                  Assert (comp_start+fes[base]->n_components() <=
                          retval[total_index].size(),
                          ExcInternalError());
                  for (unsigned int c=0; c<fes[base]->n_components(); ++c)
                    {
                      Assert (c < fes[base]->get_nonzero_components(index_in_base).size(),
                              ExcInternalError());
                      retval[total_index][comp_start+c]
                        = fes[base]->get_nonzero_components(index_in_base)[c];
                    }
                }
        }

    Assert (total_index == n_shape_functions, ExcInternalError());

    // now copy the vector<vector<bool> > into a vector<ComponentMask>.
    // this appears complicated but we do it this way since it's just
    // awkward to generate ComponentMasks directly and so we need the
    // recourse of the inner vector<bool> anyway.
    std::vector<ComponentMask> xretval (retval.size());
    for (unsigned int i=0; i<retval.size(); ++i)
      xretval[i] = ComponentMask(retval[i]);
    return xretval;
  }


  template <int dim, int spacedim>
  std::vector<ComponentMask>
  compute_nonzero_components (const FiniteElement<dim,spacedim> *fe1,
                              const unsigned int        N1,
                              const FiniteElement<dim,spacedim> *fe2=NULL,
                              const unsigned int        N2=0,
                              const FiniteElement<dim,spacedim> *fe3=NULL,
                              const unsigned int        N3=0,
                              const FiniteElement<dim,spacedim> *fe4=NULL,
                              const unsigned int        N4=0,
                              const FiniteElement<dim,spacedim> *fe5=NULL,
                              const unsigned int        N5=0)
  {
    std::vector<const FiniteElement<dim,spacedim>*> fe_list;
    std::vector<unsigned int>              multiplicities;

    fe_list.push_back (fe1);
    multiplicities.push_back (N1);

    fe_list.push_back (fe2);
    multiplicities.push_back (N2);

    fe_list.push_back (fe3);
    multiplicities.push_back (N3);

    fe_list.push_back (fe4);
    multiplicities.push_back (N4);

    fe_list.push_back (fe5);
    multiplicities.push_back (N5);

    return compute_nonzero_components (fe_list, multiplicities);
  }
}



template <int dim, int spacedim>
FESystem<dim,spacedim>::FESystem (const FiniteElement<dim,spacedim> &fe,
                                  const unsigned int n_elements) :
  FiniteElement<dim,spacedim> (multiply_dof_numbers(&fe, n_elements),
                               compute_restriction_is_additive_flags (&fe, n_elements),
                               compute_nonzero_components(&fe, n_elements)),
  base_elements((n_elements>0))
{
  std::vector<const FiniteElement<dim,spacedim>*> fes;
  fes.push_back(&fe);
  std::vector<unsigned int> multiplicities;
  multiplicities.push_back(n_elements);
  initialize(fes, multiplicities);
}



template <int dim, int spacedim>
FESystem<dim,spacedim>::FESystem (const FiniteElement<dim,spacedim> &fe1,
                                  const unsigned int        n1,
                                  const FiniteElement<dim,spacedim> &fe2,
                                  const unsigned int        n2) :
  FiniteElement<dim,spacedim> (multiply_dof_numbers(&fe1, n1, &fe2, n2),
                               compute_restriction_is_additive_flags (&fe1, n1,
                                   &fe2, n2),
                               compute_nonzero_components(&fe1, n1,
                                                          &fe2, n2)),
  base_elements((n1>0)+(n2>0))
{
  std::vector<const FiniteElement<dim,spacedim>*> fes;
  fes.push_back(&fe1);
  fes.push_back(&fe2);
  std::vector<unsigned int> multiplicities;
  multiplicities.push_back(n1);
  multiplicities.push_back(n2);
  initialize(fes, multiplicities);
}



template <int dim, int spacedim>
FESystem<dim,spacedim>::FESystem (const FiniteElement<dim,spacedim> &fe1,
                                  const unsigned int        n1,
                                  const FiniteElement<dim,spacedim> &fe2,
                                  const unsigned int        n2,
                                  const FiniteElement<dim,spacedim> &fe3,
                                  const unsigned int        n3) :
  FiniteElement<dim,spacedim> (multiply_dof_numbers(&fe1, n1,
                                                    &fe2, n2,
                                                    &fe3, n3),
                               compute_restriction_is_additive_flags (&fe1, n1,
                                   &fe2, n2,
                                   &fe3, n3),
                               compute_nonzero_components(&fe1, n1,
                                                          &fe2, n2,
                                                          &fe3, n3)),
  base_elements((n1>0)+(n2>0)+(n3>0))
{
  std::vector<const FiniteElement<dim,spacedim>*> fes;
  fes.push_back(&fe1);
  fes.push_back(&fe2);
  fes.push_back(&fe3);
  std::vector<unsigned int> multiplicities;
  multiplicities.push_back(n1);
  multiplicities.push_back(n2);
  multiplicities.push_back(n3);
  initialize(fes, multiplicities);
}



template <int dim, int spacedim>
FESystem<dim,spacedim>::FESystem (const FiniteElement<dim,spacedim> &fe1,
                                  const unsigned int        n1,
                                  const FiniteElement<dim,spacedim> &fe2,
                                  const unsigned int        n2,
                                  const FiniteElement<dim,spacedim> &fe3,
                                  const unsigned int        n3,
                                  const FiniteElement<dim,spacedim> &fe4,
                                  const unsigned int        n4) :
  FiniteElement<dim,spacedim> (multiply_dof_numbers(&fe1, n1,
                                                    &fe2, n2,
                                                    &fe3, n3,
                                                    &fe4, n4),
                               compute_restriction_is_additive_flags (&fe1, n1,
                                   &fe2, n2,
                                   &fe3, n3,
                                   &fe4, n4),
                               compute_nonzero_components(&fe1, n1,
                                                          &fe2, n2,
                                                          &fe3, n3,
                                                          &fe4 ,n4)),
  base_elements((n1>0)+(n2>0)+(n3>0)+(n4>0))
{
  std::vector<const FiniteElement<dim,spacedim>*> fes;
  fes.push_back(&fe1);
  fes.push_back(&fe2);
  fes.push_back(&fe3);
  fes.push_back(&fe4);
  std::vector<unsigned int> multiplicities;
  multiplicities.push_back(n1);
  multiplicities.push_back(n2);
  multiplicities.push_back(n3);
  multiplicities.push_back(n4);
  initialize(fes, multiplicities);
}



template <int dim, int spacedim>
FESystem<dim,spacedim>::FESystem (const FiniteElement<dim,spacedim> &fe1,
                                  const unsigned int        n1,
                                  const FiniteElement<dim,spacedim> &fe2,
                                  const unsigned int        n2,
                                  const FiniteElement<dim,spacedim> &fe3,
                                  const unsigned int        n3,
                                  const FiniteElement<dim,spacedim> &fe4,
                                  const unsigned int        n4,
                                  const FiniteElement<dim,spacedim> &fe5,
                                  const unsigned int        n5) :
  FiniteElement<dim,spacedim> (multiply_dof_numbers(&fe1, n1,
                                                    &fe2, n2,
                                                    &fe3, n3,
                                                    &fe4, n4,
                                                    &fe5, n5),
                               compute_restriction_is_additive_flags (&fe1, n1,
                                   &fe2, n2,
                                   &fe3, n3,
                                   &fe4, n4,
                                   &fe5, n5),
                               compute_nonzero_components(&fe1, n1,
                                                          &fe2, n2,
                                                          &fe3, n3,
                                                          &fe4 ,n4,
                                                          &fe5, n5)),
  base_elements((n1>0)+(n2>0)+(n3>0)+(n4>0)+(n5>0))
{
  std::vector<const FiniteElement<dim,spacedim>*> fes;
  fes.push_back(&fe1);
  fes.push_back(&fe2);
  fes.push_back(&fe3);
  fes.push_back(&fe4);
  fes.push_back(&fe5);
  std::vector<unsigned int> multiplicities;
  multiplicities.push_back(n1);
  multiplicities.push_back(n2);
  multiplicities.push_back(n3);
  multiplicities.push_back(n4);
  multiplicities.push_back(n5);
  initialize(fes, multiplicities);
}



template <int dim, int spacedim>
FESystem<dim,spacedim>::FESystem (
  const std::vector<const FiniteElement<dim,spacedim>*>  &fes,
  const std::vector<unsigned int>                  &multiplicities)
  :
  FiniteElement<dim,spacedim> (multiply_dof_numbers(fes, multiplicities),
                               compute_restriction_is_additive_flags (fes, multiplicities),
                               compute_nonzero_components(fes, multiplicities)),
  base_elements(count_nonzeros(multiplicities))
{
  initialize(fes, multiplicities);
}



template <int dim, int spacedim>
FESystem<dim,spacedim>::~FESystem ()
{}



template <int dim, int spacedim>
std::string
FESystem<dim,spacedim>::get_name () const
{
  // note that the
  // FETools::get_fe_from_name
  // function depends on the
  // particular format of the string
  // this function returns, so they
  // have to be kept in synch

  std::ostringstream namebuf;

  namebuf << "FESystem<"
          << Utilities::dim_string(dim,spacedim)
          << ">[";
  for (unsigned int i=0; i< this->n_base_elements(); ++i)
    {
      namebuf << base_element(i).get_name();
      if (this->element_multiplicity(i) != 1)
        namebuf << '^' << this->element_multiplicity(i);
      if (i != this->n_base_elements()-1)
        namebuf << '-';
    }
  namebuf << ']';

  return namebuf.str();
}



template <int dim, int spacedim>
FiniteElement<dim,spacedim> *
FESystem<dim,spacedim>::clone() const
{
  std::vector< const FiniteElement<dim,spacedim>* >  fes;
  std::vector<unsigned int> multiplicities;

  for (unsigned int i=0; i<this->n_base_elements(); i++)
    {
      fes.push_back( & base_element(i) );
      multiplicities.push_back(this->element_multiplicity(i) );
    }
  return new FESystem<dim,spacedim>(fes, multiplicities);
}



template <int dim, int spacedim>
double
FESystem<dim,spacedim>::shape_value (const unsigned int i,
                                     const Point<dim> &p) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (this->is_primitive(i),
          (typename FiniteElement<dim,spacedim>::ExcShapeFunctionNotPrimitive(i)));

  return (base_element(this->system_to_base_table[i].first.first)
          .shape_value(this->system_to_base_table[i].second, p));
}



template <int dim, int spacedim>
double
FESystem<dim,spacedim>::shape_value_component (const unsigned int i,
                                               const Point<dim>  &p,
                                               const unsigned int component) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (component < this->n_components(),
          ExcIndexRange (component, 0, this->n_components()));

  // if this value is supposed to be
  // zero, then return right away...
  if (this->nonzero_components[i][component] == false)
    return 0;

  // ...otherwise: first find out to
  // which of the base elements this
  // desired component belongs, and
  // which component within this base
  // element it is
  const unsigned int base              = this->component_to_base_index(component).first;
  const unsigned int component_in_base = this->component_to_base_index(component).second;

  // then get value from base
  // element. note that that will
  // throw an error should the
  // respective shape function not be
  // primitive; thus, there is no
  // need to check this here
  return (base_element(base).
          shape_value_component(this->system_to_base_table[i].second,
                                p,
                                component_in_base));
}



template <int dim, int spacedim>
Tensor<1,dim>
FESystem<dim,spacedim>::shape_grad (const unsigned int i,
                                    const Point<dim> &p) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (this->is_primitive(i),
          (typename FiniteElement<dim,spacedim>::ExcShapeFunctionNotPrimitive(i)));

  return (base_element(this->system_to_base_table[i].first.first)
          .shape_grad(this->system_to_base_table[i].second, p));
}



template <int dim, int spacedim>
Tensor<1,dim>
FESystem<dim,spacedim>::shape_grad_component (const unsigned int i,
                                              const Point<dim>  &p,
                                              const unsigned int component) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (component < this->n_components(),
          ExcIndexRange (component, 0, this->n_components()));

  // if this value is supposed to be zero, then return right away...
  if (this->nonzero_components[i][component] == false)
    return Tensor<1,dim>();

  // ...otherwise: first find out to which of the base elements this desired
  // component belongs, and which component within this base element it is
  const unsigned int base              = this->component_to_base_index(component).first;
  const unsigned int component_in_base = this->component_to_base_index(component).second;

  // then get value from base element. note that that will throw an error
  // should the respective shape function not be primitive; thus, there is no
  // need to check this here
  return (base_element(base).
          shape_grad_component(this->system_to_base_table[i].second,
                               p,
                               component_in_base));
}



template <int dim, int spacedim>
Tensor<2,dim>
FESystem<dim,spacedim>::shape_grad_grad (const unsigned int i,
                                         const Point<dim> &p) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (this->is_primitive(i),
          (typename FiniteElement<dim,spacedim>::ExcShapeFunctionNotPrimitive(i)));

  return (base_element(this->system_to_base_table[i].first.first)
          .shape_grad_grad(this->system_to_base_table[i].second, p));
}



template <int dim, int spacedim>
Tensor<2,dim>
FESystem<dim,spacedim>::shape_grad_grad_component (const unsigned int i,
                                                   const Point<dim>  &p,
                                                   const unsigned int component) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (component < this->n_components(),
          ExcIndexRange (component, 0, this->n_components()));

  // if this value is supposed to be zero, then return right away...
  if (this->nonzero_components[i][component] == false)
    return Tensor<2,dim>();

  // ...otherwise: first find out to which of the base elements this desired
  // component belongs, and which component within this base element it is
  const unsigned int base              = this->component_to_base_index(component).first;
  const unsigned int component_in_base = this->component_to_base_index(component).second;

  // then get value from base element. note that that will throw an error
  // should the respective shape function not be primitive; thus, there is no
  // need to check this here
  return (base_element(base).
          shape_grad_grad_component(this->system_to_base_table[i].second,
                                    p,
                                    component_in_base));
}



template <int dim, int spacedim>
Tensor<3,dim>
FESystem<dim,spacedim>::shape_3rd_derivative (const unsigned int i,
                                              const Point<dim> &p) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (this->is_primitive(i),
          (typename FiniteElement<dim,spacedim>::ExcShapeFunctionNotPrimitive(i)));

  return (base_element(this->system_to_base_table[i].first.first)
          .shape_3rd_derivative(this->system_to_base_table[i].second, p));
}



template <int dim, int spacedim>
Tensor<3,dim>
FESystem<dim,spacedim>::shape_3rd_derivative_component (const unsigned int i,
                                                        const Point<dim> &p,
                                                        const unsigned int component) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (component < this->n_components(),
          ExcIndexRange (component, 0, this->n_components()));

  // if this value is supposed to be zero, then return right away...
  if (this->nonzero_components[i][component] == false)
    return Tensor<3,dim>();

  // ...otherwise: first find out to which of the base elements this desired
  // component belongs, and which component within this base element it is
  const unsigned int base              = this->component_to_base_index(component).first;
  const unsigned int component_in_base = this->component_to_base_index(component).second;

  // then get value from base element. note that that will throw an error
  // should the respective shape function not be primitive; thus, there is no
  // need to check this here
  return (base_element(base).
          shape_3rd_derivative_component(this->system_to_base_table[i].second,
                                         p,
                                         component_in_base));
}



template <int dim, int spacedim>
Tensor<4,dim>
FESystem<dim,spacedim>::shape_4th_derivative (const unsigned int i,
                                              const Point<dim> &p) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (this->is_primitive(i),
          (typename FiniteElement<dim,spacedim>::ExcShapeFunctionNotPrimitive(i)));

  return (base_element(this->system_to_base_table[i].first.first)
          .shape_4th_derivative(this->system_to_base_table[i].second, p));
}



template <int dim, int spacedim>
Tensor<4,dim>
FESystem<dim,spacedim>::shape_4th_derivative_component (const unsigned int i,
                                                        const Point<dim> &p,
                                                        const unsigned int component) const
{
  Assert (i<this->dofs_per_cell, ExcIndexRange(i, 0, this->dofs_per_cell));
  Assert (component < this->n_components(),
          ExcIndexRange (component, 0, this->n_components()));

  // if this value is supposed to be zero, then return right away...
  if (this->nonzero_components[i][component] == false)
    return Tensor<4,dim>();

  // ...otherwise: first find out to which of the base elements this desired
  // component belongs, and which component within this base element it is
  const unsigned int base              = this->component_to_base_index(component).first;
  const unsigned int component_in_base = this->component_to_base_index(component).second;

  // then get value from base element. note that that will throw an error
  // should the respective shape function not be primitive; thus, there is no
  // need to check this here
  return (base_element(base).
          shape_4th_derivative_component(this->system_to_base_table[i].second,
                                         p,
                                         component_in_base));
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::get_interpolation_matrix (
  const FiniteElement<dim,spacedim> &x_source_fe,
  FullMatrix<double>           &interpolation_matrix) const
{
  // check that the size of the matrices is correct. for historical
  // reasons, if you call matrix.reinit(8,0), it sets the sizes
  // to m==n==0 internally. this may happen when we use a FE_Nothing,
  // so write the test in a more lenient way
  Assert ((interpolation_matrix.m() == this->dofs_per_cell)
          ||
          (x_source_fe.dofs_per_cell == 0),
          ExcDimensionMismatch (interpolation_matrix.m(),
                                this->dofs_per_cell));
  Assert ((interpolation_matrix.n() == x_source_fe.dofs_per_cell)
          ||
          (this->dofs_per_cell == 0),
          ExcDimensionMismatch (interpolation_matrix.m(),
                                x_source_fe.dofs_per_cell));

  // there are certain conditions that the two elements have to satisfy so
  // that this can work.
  //
  // condition 1: the other element must also be a system element

  typedef FiniteElement<dim,spacedim> FEL;
  AssertThrow ((x_source_fe.get_name().find ("FESystem<") == 0)
               ||
               (dynamic_cast<const FESystem<dim,spacedim>*>(&x_source_fe) != 0),
               typename FEL::
               ExcInterpolationNotImplemented());

  // ok, source is a system element, so we may be able to do the work
  const FESystem<dim,spacedim> &source_fe
    = dynamic_cast<const FESystem<dim,spacedim>&>(x_source_fe);

  // condition 2: same number of basis elements
  AssertThrow (this->n_base_elements() == source_fe.n_base_elements(),
               typename FEL::
               ExcInterpolationNotImplemented());

  // condition 3: same number of basis elements
  for (unsigned int i=0; i< this->n_base_elements(); ++i)
    AssertThrow (this->element_multiplicity(i) ==
                 source_fe.element_multiplicity(i),
                 typename FEL::
                 ExcInterpolationNotImplemented());

  // ok, so let's try whether it works:

  // first let's see whether all the basis elements actually generate their
  // interpolation matrices. if we get past the following loop, then
  // apparently none of the called base elements threw an exception, so we're
  // fine continuing and assembling the one big matrix from the small ones of
  // the base elements
  std::vector<FullMatrix<double> > base_matrices (this->n_base_elements());
  for (unsigned int i=0; i<this->n_base_elements(); ++i)
    {
      base_matrices[i].reinit (base_element(i).dofs_per_cell,
                               source_fe.base_element(i).dofs_per_cell);
      base_element(i).get_interpolation_matrix (source_fe.base_element(i),
                                                base_matrices[i]);
    }

  // first clear big matrix, to make sure that entries that would couple
  // different bases (or multiplicity indices) are really zero. then assign
  // entries
  interpolation_matrix = 0;
  for (unsigned int i=0; i<this->dofs_per_cell; ++i)
    for (unsigned int j=0; j<source_fe.dofs_per_cell; ++j)
      if (this->system_to_base_table[i].first ==
          source_fe.system_to_base_table[j].first)
        interpolation_matrix(i,j)
          = (base_matrices[this->system_to_base_table[i].first.first]
             (this->system_to_base_table[i].second,
              source_fe.system_to_base_table[j].second));
}



template <int dim, int spacedim>
const FullMatrix<double> &
FESystem<dim,spacedim>
::get_restriction_matrix (const unsigned int child,
                          const RefinementCase<dim> &refinement_case) const
{
  Assert (refinement_case<RefinementCase<dim>::isotropic_refinement+1,
          ExcIndexRange(refinement_case,0,RefinementCase<dim>::isotropic_refinement+1));
  Assert (refinement_case!=RefinementCase<dim>::no_refinement,
          ExcMessage("Restriction matrices are only available for refined cells!"));
  Assert (child<GeometryInfo<dim>::n_children(refinement_case),
          ExcIndexRange(child,0,GeometryInfo<dim>::n_children(refinement_case)));

  // initialization upon first request
  if (this->restriction[refinement_case-1][child].n() == 0)
    {
      Threads::Mutex::ScopedLock lock(this->mutex);

      // check if updated while waiting for lock
      if (this->restriction[refinement_case-1][child].n() ==
          this->dofs_per_cell)
        return this->restriction[refinement_case-1][child];

      // Check if some of the matrices of the base elements are void.
      bool do_restriction = true;

      // shortcut for accessing local restrictions further down
      std::vector<const FullMatrix<double> *>
      base_matrices(this->n_base_elements());

      for (unsigned int i=0; i<this->n_base_elements(); ++i)
        {
          base_matrices[i] =
            &base_element(i).get_restriction_matrix(child, refinement_case);
          if (base_matrices[i]->n() != base_element(i).dofs_per_cell)
            do_restriction = false;
        }
      Assert(do_restriction,
             (typename FiniteElement<dim,spacedim>::ExcProjectionVoid()));

      // if we did not encounter void matrices, initialize the matrix sizes
      if (do_restriction)
        {
          FullMatrix<double> restriction(this->dofs_per_cell,
                                         this->dofs_per_cell);

          // distribute the matrices of the base finite elements to the
          // matrices of this object. for this, loop over all degrees of
          // freedom and take the respective entry of the underlying base
          // element.
          //
          // note that we by definition of a base element, they are
          // independent, i.e. do not couple. only DoFs that belong to the
          // same instance of a base element may couple
          for (unsigned int i=0; i<this->dofs_per_cell; ++i)
            for (unsigned int j=0; j<this->dofs_per_cell; ++j)
              {
                // first find out to which base element indices i and j
                // belong, and which instance thereof in case the base element
                // has a multiplicity greater than one. if they should not
                // happen to belong to the same instance of a base element,
                // then they cannot couple, so go on with the next index
                if (this->system_to_base_table[i].first !=
                    this->system_to_base_table[j].first)
                  continue;

                // so get the common base element and the indices therein:
                const unsigned int
                base = this->system_to_base_table[i].first.first;

                const unsigned int
                base_index_i = this->system_to_base_table[i].second,
                base_index_j = this->system_to_base_table[j].second;

                // if we are sure that DoFs i and j may couple, then copy
                // entries of the matrices:
                restriction(i,j) = (*base_matrices[base])(base_index_i,base_index_j);
              }

          restriction.swap(const_cast<FullMatrix<double> &>
                           (this->restriction[refinement_case-1][child]));
        }
    }

  return this->restriction[refinement_case-1][child];
}



template <int dim, int spacedim>
const FullMatrix<double> &
FESystem<dim,spacedim>
::get_prolongation_matrix (const unsigned int child,
                           const RefinementCase<dim> &refinement_case) const
{
  Assert (refinement_case<RefinementCase<dim>::isotropic_refinement+1,
          ExcIndexRange(refinement_case,0,RefinementCase<dim>::isotropic_refinement+1));
  Assert (refinement_case!=RefinementCase<dim>::no_refinement,
          ExcMessage("Restriction matrices are only available for refined cells!"));
  Assert (child<GeometryInfo<dim>::n_children(refinement_case),
          ExcIndexRange(child,0,GeometryInfo<dim>::n_children(refinement_case)));

  // initialization upon first request, construction completely analogous to
  // restriction matrix
  if (this->prolongation[refinement_case-1][child].n() == 0)
    {
      Threads::Mutex::ScopedLock lock(this->mutex);

      if (this->prolongation[refinement_case-1][child].n() ==
          this->dofs_per_cell)
        return this->prolongation[refinement_case-1][child];

      bool do_prolongation = true;
      std::vector<const FullMatrix<double> *>
      base_matrices(this->n_base_elements());
      for (unsigned int i=0; i<this->n_base_elements(); ++i)
        {
          base_matrices[i] =
            &base_element(i).get_prolongation_matrix(child, refinement_case);
          if (base_matrices[i]->n() != base_element(i).dofs_per_cell)
            do_prolongation = false;
        }
      Assert(do_prolongation,
             (typename FiniteElement<dim,spacedim>::ExcEmbeddingVoid()));

      if (do_prolongation)
        {
          FullMatrix<double> prolongate (this->dofs_per_cell,
                                         this->dofs_per_cell);

          for (unsigned int i=0; i<this->dofs_per_cell; ++i)
            for (unsigned int j=0; j<this->dofs_per_cell; ++j)
              {
                if (this->system_to_base_table[i].first !=
                    this->system_to_base_table[j].first)
                  continue;
                const unsigned int
                base = this->system_to_base_table[i].first.first;

                const unsigned int
                base_index_i = this->system_to_base_table[i].second,
                base_index_j = this->system_to_base_table[j].second;
                prolongate(i,j) = (*base_matrices[base])(base_index_i,base_index_j);
              }
          prolongate.swap(const_cast<FullMatrix<double> &>
                          (this->prolongation[refinement_case-1][child]));
        }
    }

  return this->prolongation[refinement_case-1][child];
}


template <int dim, int spacedim>
unsigned int
FESystem<dim,spacedim>::
face_to_cell_index (const unsigned int face_dof_index,
                    const unsigned int face,
                    const bool face_orientation,
                    const bool face_flip,
                    const bool face_rotation) const
{
  // we need to ask the base elements how they want to translate
  // the DoFs within their own numbering. thus, translate to
  // the base element numbering and then back
  const std::pair<std::pair<unsigned int, unsigned int>, unsigned int>
  face_base_index = this->face_system_to_base_index(face_dof_index);

  const unsigned int
  base_face_to_cell_index
    = this->base_element(face_base_index.first.first).face_to_cell_index (face_base_index.second,
        face,
        face_orientation,
        face_flip,
        face_rotation);

  // it would be nice if we had a base_to_system_index function, but
  // all that exists is a component_to_system_index function. we can't do
  // this here because it won't work for non-primitive elements. consequently,
  // simply do a loop over all dofs till we find whether it corresponds
  // to the one we're interested in -- crude, maybe, but works for now
  const std::pair<std::pair<unsigned int, unsigned int>, unsigned int>
  target = std::make_pair (face_base_index.first, base_face_to_cell_index);
  for (unsigned int i=0; i<this->dofs_per_cell; ++i)
    if (this->system_to_base_index(i) == target)
      return i;

  Assert (false, ExcInternalError());
  return numbers::invalid_unsigned_int;
}



//---------------------------------------------------------------------------
// Data field initialization
//---------------------------------------------------------------------------



template <int dim, int spacedim>
UpdateFlags
FESystem<dim,spacedim>::requires_update_flags (const UpdateFlags flags) const
{
  UpdateFlags out = update_default;
  // generate maximal set of flags
  // that are necessary
  for (unsigned int base_no=0; base_no<this->n_base_elements(); ++base_no)
    out |= base_element(base_no).requires_update_flags (flags);
  return out;
}



template <int dim, int spacedim>
typename FiniteElement<dim,spacedim>::InternalDataBase *
FESystem<dim,spacedim>::
get_data (const UpdateFlags                                                    flags,
          const Mapping<dim,spacedim>                                         &mapping,
          const Quadrature<dim>                                               &quadrature,
          ::internal::FEValues::FiniteElementRelatedData<dim, spacedim> &/*output_data*/) const
{
  // create an internal data object and set the update flags we will need
  // to deal with. the current object does not make use of these flags,
  // but we need to nevertheless set them correctly since we look
  // into the update_each flag of base elements in fill_fe_values,
  // and so the current object's update_each flag needs to be
  // correct in case the current FESystem is a base element for another,
  // higher-level FESystem itself.
  InternalData *data = new InternalData(this->n_base_elements());
  data->update_each = requires_update_flags(flags);

  // get data objects from each of the base elements and store
  // them. one might think that doing this in parallel (over the
  // base elements) would be a good idea, but this turns out to
  // be wrong because we would then run these jobs on different
  // threads/processors and this allocates memory in different
  // NUMA domains; this has large detrimental effects when later
  // writing into these objects in fill_fe_*_values. all of this
  // is particularly true when using FEValues objects in
  // WorkStream contexts where we explicitly make sure that
  // every function only uses objects previously allocated
  // in the same NUMA context and on the same thread as the
  // function is called
  for (unsigned int base_no=0; base_no<this->n_base_elements(); ++base_no)
    {
      internal::FEValues::FiniteElementRelatedData<dim,spacedim> &base_fe_output_object
        = data->get_fe_output_object(base_no);
      base_fe_output_object.initialize (quadrature.size(), base_element(base_no),
                                        flags | base_element(base_no).requires_update_flags(flags));

      // let base objects produce their scratch objects. they may
      // also at this time write into the output objects we provide
      // for them; it would be nice if we could already copy something
      // out of the base output object into the system output object,
      // but we can't because we can't know what the elements already
      // copied and/or will want to update on every cell
      typename FiniteElement<dim,spacedim>::InternalDataBase *base_fe_data =
        base_element(base_no).get_data (flags, mapping, quadrature,
                                        base_fe_output_object);

      data->set_fe_data(base_no, base_fe_data);
    }

  return data;
}

// The following function is a clone of get_data, with the exception
// that get_face_data of the base elements is called.

template <int dim, int spacedim>
typename FiniteElement<dim,spacedim>::InternalDataBase *
FESystem<dim,spacedim>::
get_face_data (const UpdateFlags                                                    flags,
               const Mapping<dim,spacedim>                                         &mapping,
               const Quadrature<dim-1>                                             &quadrature,
               ::internal::FEValues::FiniteElementRelatedData<dim, spacedim> &/*output_data*/) const
{
  // create an internal data object and set the update flags we will need
  // to deal with. the current object does not make use of these flags,
  // but we need to nevertheless set them correctly since we look
  // into the update_each flag of base elements in fill_fe_values,
  // and so the current object's update_each flag needs to be
  // correct in case the current FESystem is a base element for another,
  // higher-level FESystem itself.
  InternalData *data = new InternalData(this->n_base_elements());
  data->update_each = requires_update_flags(flags);

  // get data objects from each of the base elements and store
  // them. one might think that doing this in parallel (over the
  // base elements) would be a good idea, but this turns out to
  // be wrong because we would then run these jobs on different
  // threads/processors and this allocates memory in different
  // NUMA domains; this has large detrimental effects when later
  // writing into these objects in fill_fe_*_values. all of this
  // is particularly true when using FEValues objects in
  // WorkStream contexts where we explicitly make sure that
  // every function only uses objects previously allocated
  // in the same NUMA context and on the same thread as the
  // function is called
  for (unsigned int base_no=0; base_no<this->n_base_elements(); ++base_no)
    {
      internal::FEValues::FiniteElementRelatedData<dim,spacedim> &base_fe_output_object
        = data->get_fe_output_object(base_no);
      base_fe_output_object.initialize (quadrature.size(), base_element(base_no),
                                        flags | base_element(base_no).requires_update_flags(flags));

      // let base objects produce their scratch objects. they may
      // also at this time write into the output objects we provide
      // for them; it would be nice if we could already copy something
      // out of the base output object into the system output object,
      // but we can't because we can't know what the elements already
      // copied and/or will want to update on every cell
      typename FiniteElement<dim,spacedim>::InternalDataBase *base_fe_data =
        base_element(base_no).get_face_data (flags, mapping, quadrature,
                                             base_fe_output_object);

      data->set_fe_data(base_no, base_fe_data);
    }

  return data;
}



// The following function is a clone of get_data, with the exception
// that get_subface_data of the base elements is called.

template <int dim, int spacedim>
typename FiniteElement<dim,spacedim>::InternalDataBase *
FESystem<dim,spacedim>::
get_subface_data (const UpdateFlags                                                    flags,
                  const Mapping<dim,spacedim>                                         &mapping,
                  const Quadrature<dim-1>                                             &quadrature,
                  ::internal::FEValues::FiniteElementRelatedData<dim, spacedim> &/*output_data*/) const
{
  // create an internal data object and set the update flags we will need
  // to deal with. the current object does not make use of these flags,
  // but we need to nevertheless set them correctly since we look
  // into the update_each flag of base elements in fill_fe_values,
  // and so the current object's update_each flag needs to be
  // correct in case the current FESystem is a base element for another,
  // higher-level FESystem itself.
  InternalData *data = new InternalData(this->n_base_elements());
  data->update_each = requires_update_flags(flags);

  // get data objects from each of the base elements and store
  // them. one might think that doing this in parallel (over the
  // base elements) would be a good idea, but this turns out to
  // be wrong because we would then run these jobs on different
  // threads/processors and this allocates memory in different
  // NUMA domains; this has large detrimental effects when later
  // writing into these objects in fill_fe_*_values. all of this
  // is particularly true when using FEValues objects in
  // WorkStream contexts where we explicitly make sure that
  // every function only uses objects previously allocated
  // in the same NUMA context and on the same thread as the
  // function is called
  for (unsigned int base_no=0; base_no<this->n_base_elements(); ++base_no)
    {
      internal::FEValues::FiniteElementRelatedData<dim,spacedim> &base_fe_output_object
        = data->get_fe_output_object(base_no);
      base_fe_output_object.initialize (quadrature.size(), base_element(base_no),
                                        flags | base_element(base_no).requires_update_flags(flags));

      // let base objects produce their scratch objects. they may
      // also at this time write into the output objects we provide
      // for them; it would be nice if we could already copy something
      // out of the base output object into the system output object,
      // but we can't because we can't know what the elements already
      // copied and/or will want to update on every cell
      typename FiniteElement<dim,spacedim>::InternalDataBase *base_fe_data =
        base_element(base_no).get_subface_data (flags, mapping, quadrature,
                                                base_fe_output_object);

      data->set_fe_data(base_no, base_fe_data);
    }

  return data;
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::
fill_fe_values (const typename Triangulation<dim,spacedim>::cell_iterator           &cell,
                const CellSimilarity::Similarity                                     cell_similarity,
                const Quadrature<dim>                                               &quadrature,
                const Mapping<dim,spacedim>                                         &mapping,
                const typename Mapping<dim,spacedim>::InternalDataBase              &mapping_internal,
                const ::internal::FEValues::MappingRelatedData<dim, spacedim> &mapping_data,
                const typename FiniteElement<dim,spacedim>::InternalDataBase        &fe_internal,
                ::internal::FEValues::FiniteElementRelatedData<dim, spacedim> &output_data) const
{
  compute_fill(mapping, cell, invalid_face_number, invalid_face_number,
               quadrature, cell_similarity, mapping_internal, fe_internal,
               mapping_data, output_data);
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::
fill_fe_face_values (const typename Triangulation<dim,spacedim>::cell_iterator           &cell,
                     const unsigned int                                                   face_no,
                     const Quadrature<dim-1>                                             &quadrature,
                     const Mapping<dim,spacedim>                                         &mapping,
                     const typename Mapping<dim,spacedim>::InternalDataBase              &mapping_internal,
                     const ::internal::FEValues::MappingRelatedData<dim, spacedim> &mapping_data,
                     const typename FiniteElement<dim,spacedim>::InternalDataBase        &fe_internal,
                     ::internal::FEValues::FiniteElementRelatedData<dim, spacedim> &output_data) const
{
  compute_fill (mapping, cell, face_no, invalid_face_number, quadrature,
                CellSimilarity::none, mapping_internal, fe_internal,
                mapping_data, output_data);
}




template <int dim, int spacedim>
void
FESystem<dim,spacedim>::
fill_fe_subface_values (const typename Triangulation<dim,spacedim>::cell_iterator           &cell,
                        const unsigned int                                                   face_no,
                        const unsigned int                                                   sub_no,
                        const Quadrature<dim-1>                                             &quadrature,
                        const Mapping<dim,spacedim>                                         &mapping,
                        const typename Mapping<dim,spacedim>::InternalDataBase              &mapping_internal,
                        const ::internal::FEValues::MappingRelatedData<dim, spacedim> &mapping_data,
                        const typename FiniteElement<dim,spacedim>::InternalDataBase        &fe_internal,
                        ::internal::FEValues::FiniteElementRelatedData<dim, spacedim> &output_data) const
{
  compute_fill (mapping, cell, face_no, sub_no, quadrature,
                CellSimilarity::none, mapping_internal, fe_internal,
                mapping_data, output_data);
}



template <int dim, int spacedim>
template <int dim_1>
void
FESystem<dim,spacedim>::
compute_fill (const Mapping<dim,spacedim>                      &mapping,
              const typename Triangulation<dim,spacedim>::cell_iterator &cell,
              const unsigned int                                face_no,
              const unsigned int                                sub_no,
              const Quadrature<dim_1>                          &quadrature,
              const CellSimilarity::Similarity                  cell_similarity,
              const typename Mapping<dim,spacedim>::InternalDataBase &mapping_internal,
              const typename FiniteElement<dim,spacedim>::InternalDataBase &fe_internal,
              const internal::FEValues::MappingRelatedData<dim,spacedim> &mapping_data,
              internal::FEValues::FiniteElementRelatedData<dim,spacedim> &output_data) const
{
  // convert data object to internal
  // data for this class. fails with
  // an exception if that is not
  // possible
  Assert (dynamic_cast<const InternalData *> (&fe_internal) != 0, ExcInternalError());
  const InternalData &fe_data = static_cast<const InternalData &> (fe_internal);

  // Either dim_1==dim
  // (fill_fe_values) or dim_1==dim-1
  // (fill_fe_(sub)face_values)
  Assert(dim_1==dim || dim_1==dim-1, ExcInternalError());
  const UpdateFlags flags = fe_data.update_each;


  // loop over the base elements, let them compute what they need to compute,
  // and then copy what is necessary.
  //
  // one may think that it would be a good idea to parallelize this over
  // base elements, but it turns out to be not worthwhile: doing so lets
  // multiple threads access data objects that were created by the current
  // thread, leading to many NUMA memory access inefficiencies. we specifically
  // want to avoid this if this class is called in a WorkStream context where
  // we very carefully allocate objects only on the thread where they
  // will actually be used; spawning new tasks here would be counterproductive
  if (flags & (update_values | update_gradients
               | update_hessians | update_3rd_derivatives ))
    for (unsigned int base_no=0; base_no<this->n_base_elements(); ++base_no)
      {
        const FiniteElement<dim,spacedim> &
        base_fe      = base_element(base_no);
        typename FiniteElement<dim,spacedim>::InternalDataBase &
        base_fe_data = fe_data.get_fe_data(base_no);
        internal::FEValues::FiniteElementRelatedData<dim,spacedim> &
        base_data    = fe_data.get_fe_output_object(base_no);

        // fill_fe_face_values needs argument Quadrature<dim-1> for both cases
        // dim_1==dim-1 and dim_1=dim. Hence the following workaround
        const Quadrature<dim>   *cell_quadrature = 0;
        const Quadrature<dim-1> *face_quadrature = 0;
        const unsigned int n_q_points = quadrature.size();

        // static cast to the common base class of quadrature being either
        // Quadrature<dim> or Quadrature<dim-1>:
        const Subscriptor *quadrature_base_pointer = &quadrature;

        if (face_no==invalid_face_number)
          {
            Assert(dim_1==dim, ExcDimensionMismatch(dim_1,dim));
            Assert (dynamic_cast<const Quadrature<dim> *>(quadrature_base_pointer) != 0,
                    ExcInternalError());

            cell_quadrature
              = static_cast<const Quadrature<dim> *>(quadrature_base_pointer);
          }
        else
          {
            Assert(dim_1==dim-1, ExcDimensionMismatch(dim_1,dim-1));
            Assert (dynamic_cast<const Quadrature<dim-1> *>(quadrature_base_pointer) != 0,
                    ExcInternalError());

            face_quadrature
              = static_cast<const Quadrature<dim-1> *>(quadrature_base_pointer);
          }


        // Make sure that in the case of fill_fe_values the data is only
        // copied from base_data to data if base_data is changed. therefore
        // use fe_fe_data.current_update_flags()
        //
        // for the case of fill_fe_(sub)face_values the data needs to be
        // copied from base_data to data on each face, therefore use
        // base_fe_data.update_flags.
        if (face_no==invalid_face_number)
          base_fe.fill_fe_values(cell, cell_similarity,
                                 *cell_quadrature,
                                 mapping, mapping_internal, mapping_data,
                                 base_fe_data, base_data);
        else if (sub_no==invalid_face_number)
          base_fe.fill_fe_face_values(cell, face_no,
                                      *face_quadrature,
                                      mapping, mapping_internal, mapping_data,
                                      base_fe_data, base_data);
        else
          base_fe.fill_fe_subface_values(cell, face_no, sub_no,
                                         *face_quadrature,
                                         mapping, mapping_internal, mapping_data,
                                         base_fe_data, base_data);

        // now data has been generated, so copy it. we used to work by
        // looping over all base elements (i.e. this outer loop), then over
        // multiplicity, then over the shape functions from that base
        // element, but that requires that we can infer the global number of
        // a shape function from its number in the base element. for that we
        // had the component_to_system_table.
        //
        // however, this does of course no longer work since we have
        // non-primitive elements. so we go the other way round: loop over
        // all shape functions of the composed element, and here only treat
        // those shape functions that belong to a given base element
        //TODO: Introduce the needed table and loop only over base element shape functions. This here is not efficient at all AND very bad style
        const UpdateFlags base_flags = base_fe_data.update_each;

        // if the current cell is just a translation of the previous one,
        // the underlying data has not changed, and we don't even need to
        // enter this section
        if (cell_similarity != CellSimilarity::translation)
          for (unsigned int system_index=0; system_index<this->dofs_per_cell;
               ++system_index)
            if (this->system_to_base_table[system_index].first.first == base_no)
              {
                const unsigned int
                base_index = this->system_to_base_table[system_index].second;
                Assert (base_index<base_fe.dofs_per_cell, ExcInternalError());

                // now copy. if the shape function is primitive, then there
                // is only one value to be copied, but for non-primitive
                // elements, there might be more values to be copied
                //
                // so, find out from which index to take this one value, and
                // to which index to put
                unsigned int out_index = 0;
                for (unsigned int i=0; i<system_index; ++i)
                  out_index += this->n_nonzero_components(i);
                unsigned int in_index = 0;
                for (unsigned int i=0; i<base_index; ++i)
                  in_index += base_fe.n_nonzero_components(i);

                // then loop over the number of components to be copied
                Assert (this->n_nonzero_components(system_index) ==
                        base_fe.n_nonzero_components(base_index),
                        ExcInternalError());

                if (base_flags & update_values)
                  for (unsigned int s=0; s<this->n_nonzero_components(system_index); ++s)
                    for (unsigned int q=0; q<n_q_points; ++q)
                      output_data.shape_values[out_index+s][q] =
                        base_data.shape_values(in_index+s,q);

                if (base_flags & update_gradients)
                  for (unsigned int s=0; s<this->n_nonzero_components(system_index); ++s)
                    for (unsigned int q=0; q<n_q_points; ++q)
                      output_data.shape_gradients[out_index+s][q] =
                        base_data.shape_gradients[in_index+s][q];

                if (base_flags & update_hessians)
                  for (unsigned int s=0; s<this->n_nonzero_components(system_index); ++s)
                    for (unsigned int q=0; q<n_q_points; ++q)
                      output_data.shape_hessians[out_index+s][q] =
                        base_data.shape_hessians[in_index+s][q];

                if (base_flags & update_3rd_derivatives)
                  for (unsigned int s=0; s<this->n_nonzero_components(system_index); ++s)
                    for (unsigned int q=0; q<n_q_points; ++q)
                      output_data.shape_3rd_derivatives[out_index+s][q] =
                        base_data.shape_3rd_derivatives[in_index+s][q];

              }
      }
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::build_cell_tables()
{
  // If the system is not primitive, these have not been initialized by
  // FiniteElement
  this->system_to_component_table.resize(this->dofs_per_cell);
  this->face_system_to_component_table.resize(this->dofs_per_face);

  unsigned int total_index = 0;

  for (unsigned int base=0; base < this->n_base_elements(); ++base)
    for (unsigned int m = 0; m < this->element_multiplicity(base); ++m)
      {
        for (unsigned int k=0; k<base_element(base).n_components(); ++k)
          this->component_to_base_table[total_index++]
            = std::make_pair(std::make_pair(base,k), m);
      }
  Assert (total_index == this->component_to_base_table.size(),
          ExcInternalError());

  // Initialize index tables.  Multi-component base elements have to be
  // thought of. For non-primitive shape functions, have a special invalid
  // index.
  const std::pair<unsigned int, unsigned int>
  non_primitive_index (numbers::invalid_unsigned_int,
                       numbers::invalid_unsigned_int);

  // First enumerate vertex indices, where we first enumerate all indices on
  // the first vertex in the order of the base elements, then of the second
  // vertex, etc
  total_index = 0;
  for (unsigned int vertex_number=0;
       vertex_number<GeometryInfo<dim>::vertices_per_cell;
       ++vertex_number)
    {
      unsigned int comp_start = 0;
      for (unsigned int base=0; base<this->n_base_elements(); ++base)
        for (unsigned int m=0; m<this->element_multiplicity(base);
             ++m, comp_start+=base_element(base).n_components())
          for (unsigned int local_index = 0;
               local_index < base_element(base).dofs_per_vertex;
               ++local_index, ++total_index)
            {
              const unsigned int index_in_base
                = (base_element(base).dofs_per_vertex*vertex_number +
                   local_index);

              this->system_to_base_table[total_index]
                = std::make_pair (std::make_pair(base, m), index_in_base);

              if (base_element(base).is_primitive(index_in_base))
                {
                  const unsigned int comp_in_base
                    = base_element(base).system_to_component_index(index_in_base).first;
                  const unsigned int comp
                    = comp_start + comp_in_base;
                  const unsigned int index_in_comp
                    = base_element(base).system_to_component_index(index_in_base).second;
                  this->system_to_component_table[total_index]
                    = std::make_pair (comp, index_in_comp);
                }
              else
                this->system_to_component_table[total_index] = non_primitive_index;
            }
    }

  // 2. Lines
  if (GeometryInfo<dim>::lines_per_cell > 0)
    for (unsigned int line_number= 0;
         line_number != GeometryInfo<dim>::lines_per_cell;
         ++line_number)
      {
        unsigned int comp_start = 0;
        for (unsigned int base=0; base<this->n_base_elements(); ++base)
          for (unsigned int m=0; m<this->element_multiplicity(base);
               ++m, comp_start+=base_element(base).n_components())
            for (unsigned int local_index = 0;
                 local_index < base_element(base).dofs_per_line;
                 ++local_index, ++total_index)
              {
                const unsigned int index_in_base
                  = (base_element(base).dofs_per_line*line_number +
                     local_index +
                     base_element(base).first_line_index);

                this->system_to_base_table[total_index]
                  = std::make_pair (std::make_pair(base,m), index_in_base);

                if (base_element(base).is_primitive(index_in_base))
                  {
                    const unsigned int comp_in_base
                      = base_element(base).system_to_component_index(index_in_base).first;
                    const unsigned int comp
                      = comp_start + comp_in_base;
                    const unsigned int index_in_comp
                      = base_element(base).system_to_component_index(index_in_base).second;
                    this->system_to_component_table[total_index]
                      = std::make_pair (comp, index_in_comp);
                  }
                else
                  this->system_to_component_table[total_index] = non_primitive_index;
              }
      }

  // 3. Quads
  if (GeometryInfo<dim>::quads_per_cell > 0)
    for (unsigned int quad_number= 0;
         quad_number != GeometryInfo<dim>::quads_per_cell;
         ++quad_number)
      {
        unsigned int comp_start = 0;
        for (unsigned int base=0; base<this->n_base_elements(); ++base)
          for (unsigned int m=0; m<this->element_multiplicity(base);
               ++m, comp_start += base_element(base).n_components())
            for (unsigned int local_index = 0;
                 local_index < base_element(base).dofs_per_quad;
                 ++local_index, ++total_index)
              {
                const unsigned int index_in_base
                  = (base_element(base).dofs_per_quad*quad_number +
                     local_index +
                     base_element(base).first_quad_index);

                this->system_to_base_table[total_index]
                  = std::make_pair (std::make_pair(base,m), index_in_base);

                if (base_element(base).is_primitive(index_in_base))
                  {
                    const unsigned int comp_in_base
                      = base_element(base).system_to_component_index(index_in_base).first;
                    const unsigned int comp
                      = comp_start + comp_in_base;
                    const unsigned int index_in_comp
                      = base_element(base).system_to_component_index(index_in_base).second;
                    this->system_to_component_table[total_index]
                      = std::make_pair (comp, index_in_comp);
                  }
                else
                  this->system_to_component_table[total_index] = non_primitive_index;
              }
      }

  // 4. Hexes
  if (GeometryInfo<dim>::hexes_per_cell > 0)
    for (unsigned int hex_number= 0;
         hex_number != GeometryInfo<dim>::hexes_per_cell;
         ++hex_number)
      {
        unsigned int comp_start = 0;
        for (unsigned int base=0; base<this->n_base_elements(); ++base)
          for (unsigned int m=0; m<this->element_multiplicity(base);
               ++m, comp_start+=base_element(base).n_components())
            for (unsigned int local_index = 0;
                 local_index < base_element(base).dofs_per_hex;
                 ++local_index, ++total_index)
              {
                const unsigned int index_in_base
                  = (base_element(base).dofs_per_hex*hex_number +
                     local_index +
                     base_element(base).first_hex_index);

                this->system_to_base_table[total_index]
                  = std::make_pair (std::make_pair(base,m), index_in_base);

                if (base_element(base).is_primitive(index_in_base))
                  {
                    const unsigned int comp_in_base
                      = base_element(base).system_to_component_index(index_in_base).first;
                    const unsigned int comp
                      = comp_start + comp_in_base;
                    const unsigned int index_in_comp
                      = base_element(base).system_to_component_index(index_in_base).second;
                    this->system_to_component_table[total_index]
                      = std::make_pair (comp, index_in_comp);
                  }
                else
                  this->system_to_component_table[total_index] = non_primitive_index;
              }
      }
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::build_face_tables()
{
  // Initialize index tables. do this in the same way as done for the cell
  // tables, except that we now loop over the objects of faces

  // For non-primitive shape functions, have a special invalid index
  const std::pair<unsigned int, unsigned int>
  non_primitive_index (numbers::invalid_unsigned_int,
                       numbers::invalid_unsigned_int);

  // 1. Vertices
  unsigned int total_index = 0;
  for (unsigned int vertex_number=0;
       vertex_number<GeometryInfo<dim>::vertices_per_face;
       ++vertex_number)
    {
      unsigned int comp_start = 0;
      for (unsigned int base=0; base<this->n_base_elements(); ++base)
        for (unsigned int m=0; m<this->element_multiplicity(base);
             ++m, comp_start += base_element(base).n_components())
          for (unsigned int local_index = 0;
               local_index < base_element(base).dofs_per_vertex;
               ++local_index, ++total_index)
            {
              // get (cell) index of this shape function inside the base
              // element to see whether the shape function is primitive
              // (assume that all shape functions on vertices share the same
              // primitivity property; assume likewise for all shape functions
              // located on lines, quads, etc. this way, we can ask for
              // primitivity of only _one_ shape function, which is taken as
              // representative for all others located on the same type of
              // object):
              const unsigned int index_in_base
                = (base_element(base).dofs_per_vertex*vertex_number +
                   local_index);

              const unsigned int face_index_in_base
                = (base_element(base).dofs_per_vertex*vertex_number +
                   local_index);

              this->face_system_to_base_table[total_index]
                = std::make_pair (std::make_pair(base,m), face_index_in_base);

              if (base_element(base).is_primitive(index_in_base))
                {
                  const unsigned int comp_in_base
                    = base_element(base).face_system_to_component_index(face_index_in_base).first;
                  const unsigned int comp
                    = comp_start + comp_in_base;
                  const unsigned int face_index_in_comp
                    = base_element(base).face_system_to_component_index(face_index_in_base).second;
                  this->face_system_to_component_table[total_index]
                    = std::make_pair (comp, face_index_in_comp);
                }
              else
                this->face_system_to_component_table[total_index] = non_primitive_index;
            }
    }

  // 2. Lines
  if (GeometryInfo<dim>::lines_per_face > 0)
    for (unsigned int line_number= 0;
         line_number != GeometryInfo<dim>::lines_per_face;
         ++line_number)
      {
        unsigned int comp_start = 0;
        for (unsigned int base = 0; base < this->n_base_elements(); ++base)
          for (unsigned int m=0; m<this->element_multiplicity(base);
               ++m, comp_start += base_element(base).n_components())
            for (unsigned int local_index = 0;
                 local_index < base_element(base).dofs_per_line;
                 ++local_index, ++total_index)
              {
                // do everything alike for this type of object
                const unsigned int index_in_base
                  = (base_element(base).dofs_per_line*line_number +
                     local_index +
                     base_element(base).first_line_index);

                const unsigned int face_index_in_base
                  = (base_element(base).first_face_line_index +
                     base_element(base).dofs_per_line * line_number +
                     local_index);

                this->face_system_to_base_table[total_index]
                  = std::make_pair (std::make_pair(base,m), face_index_in_base);

                if (base_element(base).is_primitive(index_in_base))
                  {
                    const unsigned int comp_in_base
                      = base_element(base).face_system_to_component_index(face_index_in_base).first;
                    const unsigned int comp
                      = comp_start + comp_in_base;
                    const unsigned int face_index_in_comp
                      = base_element(base).face_system_to_component_index(face_index_in_base).second;
                    this->face_system_to_component_table[total_index]
                      = std::make_pair (comp, face_index_in_comp);
                  }
                else
                  this->face_system_to_component_table[total_index] = non_primitive_index;
              }
      }

  // 3. Quads
  if (GeometryInfo<dim>::quads_per_face > 0)
    for (unsigned int quad_number= 0;
         quad_number != GeometryInfo<dim>::quads_per_face;
         ++quad_number)
      {
        unsigned int comp_start = 0;
        for (unsigned int base=0; base<this->n_base_elements(); ++base)
          for (unsigned int m=0; m<this->element_multiplicity(base);
               ++m, comp_start += base_element(base).n_components())
            for (unsigned int local_index = 0;
                 local_index < base_element(base).dofs_per_quad;
                 ++local_index, ++total_index)
              {
                // do everything alike for this type of object
                const unsigned int index_in_base
                  = (base_element(base).dofs_per_quad*quad_number +
                     local_index +
                     base_element(base).first_quad_index);

                const unsigned int face_index_in_base
                  = (base_element(base).first_face_quad_index +
                     base_element(base).dofs_per_quad * quad_number +
                     local_index);

                this->face_system_to_base_table[total_index]
                  = std::make_pair (std::make_pair(base,m), face_index_in_base);

                if (base_element(base).is_primitive(index_in_base))
                  {
                    const unsigned int comp_in_base
                      = base_element(base).face_system_to_component_index(face_index_in_base).first;
                    const unsigned int comp
                      = comp_start + comp_in_base;
                    const unsigned int face_index_in_comp
                      = base_element(base).face_system_to_component_index(face_index_in_base).second;
                    this->face_system_to_component_table[total_index]
                      = std::make_pair (comp, face_index_in_comp);
                  }
                else
                  this->face_system_to_component_table[total_index] = non_primitive_index;
              }
      }
  Assert (total_index == this->dofs_per_face, ExcInternalError());
  Assert (total_index == this->face_system_to_component_table.size(),
          ExcInternalError());
  Assert (total_index == this->face_system_to_base_table.size(),
          ExcInternalError());
}



template <int dim, int spacedim>
void FESystem<dim,spacedim>::build_interface_constraints ()
{
  // check whether all base elements implement their interface constraint
  // matrices. if this is not the case, then leave the interface costraints of
  // this composed element empty as well; however, the rest of the element is
  // usable
  for (unsigned int base=0; base<this->n_base_elements(); ++base)
    if (base_element(base).constraints_are_implemented() == false)
      return;

  this->interface_constraints.
  TableBase<2,double>::reinit (this->interface_constraints_size());

  // the layout of the constraints matrix is described in the FiniteElement
  // class. you may want to look there first before trying to understand the
  // following, especially the mapping of the @p{m} index.
  //
  // in order to map it to the fe-system class, we have to know which base
  // element a degree of freedom within a vertex, line, etc belongs to. this
  // can be accomplished by the system_to_component_index function in
  // conjunction with the numbers first_{line,quad,...}_index
  for (unsigned int n=0; n<this->interface_constraints.n(); ++n)
    for (unsigned int m=0; m<this->interface_constraints.m(); ++m)
      {
        // for the pair (n,m) find out which base element they belong to and
        // the number therein
        //
        // first for the n index. this is simple since the n indices are in
        // the same order as they are usually on a face. note that for the
        // data type, first value in pair is (base element,instance of base
        // element), second is index within this instance
        const std::pair<std::pair<unsigned int,unsigned int>, unsigned int> n_index
          = this->face_system_to_base_table[n];

        // likewise for the m index. this is more complicated due to the
        // strange ordering we have for the dofs on the refined faces.
        std::pair<std::pair<unsigned int,unsigned int>, unsigned int> m_index;
        switch (dim)
          {
          case 1:
          {
            // we should never get here!  (in 1d, the constraints matrix
            // should be of size zero)
            Assert (false, ExcInternalError());
            break;
          };

          case 2:
          {
            // the indices m=0..d_v-1 are from the center vertex.  their order
            // is the same as for the first vertex of the whole cell, so we
            // can use the system_to_base_table variable (using the
            // face_s_t_base_t function would yield the same)
            if (m < this->dofs_per_vertex)
              m_index = this->system_to_base_table[m];
            else
              // then come the two sets of line indices
              {
                const unsigned int index_in_line
                  = (m-this->dofs_per_vertex) % this->dofs_per_line;
                const unsigned int sub_line
                  = (m-this->dofs_per_vertex) / this->dofs_per_line;
                Assert (sub_line < 2, ExcInternalError());

                // from this information, try to get base element and instance
                // of base element. we do so by constructing the corresponding
                // face index of m in the present element, then use
                // face_system_to_base_table
                const unsigned int tmp1 = 2*this->dofs_per_vertex+index_in_line;
                m_index.first = this->face_system_to_base_table[tmp1].first;

                // what we are still missing is the index of m within the base
                // elements interface_constraints table
                //
                // here, the second value of face_system_to_base_table can
                // help: it denotes the face index of that shape function
                // within the base element. since we know that it is a line
                // dof, we can construct the rest: tmp2 will denote the index
                // of this shape function among the line shape functions:
                Assert (this->face_system_to_base_table[tmp1].second >=
                        2*base_element(m_index.first.first).dofs_per_vertex,
                        ExcInternalError());
                const unsigned int tmp2 = this->face_system_to_base_table[tmp1].second -
                                          2*base_element(m_index.first.first).dofs_per_vertex;
                Assert (tmp2 < base_element(m_index.first.first).dofs_per_line,
                        ExcInternalError());
                m_index.second = base_element(m_index.first.first).dofs_per_vertex +
                                 base_element(m_index.first.first).dofs_per_line*sub_line +
                                 tmp2;
              };
            break;
          };

          case 3:
          {
            // same way as above, although a little more complicated...

            // the indices m=0..5*d_v-1 are from the center and the four
            // subline vertices.  their order is the same as for the first
            // vertex of the whole cell, so we can use the simple arithmetic
            if (m < 5*this->dofs_per_vertex)
              m_index = this->system_to_base_table[m];
            else
              // then come the 12 sets of line indices
              if (m < 5*this->dofs_per_vertex + 12*this->dofs_per_line)
                {
                  // for the meaning of all this, see the 2d part
                  const unsigned int index_in_line
                    = (m-5*this->dofs_per_vertex) % this->dofs_per_line;
                  const unsigned int sub_line
                    = (m-5*this->dofs_per_vertex) / this->dofs_per_line;
                  Assert (sub_line < 12, ExcInternalError());

                  const unsigned int tmp1 = 4*this->dofs_per_vertex+index_in_line;
                  m_index.first = this->face_system_to_base_table[tmp1].first;

                  Assert (this->face_system_to_base_table[tmp1].second >=
                          4*base_element(m_index.first.first).dofs_per_vertex,
                          ExcInternalError());
                  const unsigned int tmp2 = this->face_system_to_base_table[tmp1].second -
                                            4*base_element(m_index.first.first).dofs_per_vertex;
                  Assert (tmp2 < base_element(m_index.first.first).dofs_per_line,
                          ExcInternalError());
                  m_index.second = 5*base_element(m_index.first.first).dofs_per_vertex +
                                   base_element(m_index.first.first).dofs_per_line*sub_line +
                                   tmp2;
                }
              else
                // on one of the four sub-quads
                {
                  // for the meaning of all this, see the 2d part
                  const unsigned int index_in_quad
                    = (m-5*this->dofs_per_vertex-12*this->dofs_per_line) %
                      this->dofs_per_quad;
                  Assert (index_in_quad < this->dofs_per_quad,
                          ExcInternalError());
                  const unsigned int sub_quad
                    = ((m-5*this->dofs_per_vertex-12*this->dofs_per_line) /
                       this->dofs_per_quad);
                  Assert (sub_quad < 4, ExcInternalError());

                  const unsigned int tmp1 = 4*this->dofs_per_vertex +
                                            4*this->dofs_per_line +
                                            index_in_quad;
                  Assert (tmp1 < this->face_system_to_base_table.size(),
                          ExcInternalError());
                  m_index.first = this->face_system_to_base_table[tmp1].first;

                  Assert (this->face_system_to_base_table[tmp1].second >=
                          4*base_element(m_index.first.first).dofs_per_vertex +
                          4*base_element(m_index.first.first).dofs_per_line,
                          ExcInternalError());
                  const unsigned int tmp2 = this->face_system_to_base_table[tmp1].second -
                                            4*base_element(m_index.first.first).dofs_per_vertex -
                                            4*base_element(m_index.first.first).dofs_per_line;
                  Assert (tmp2 < base_element(m_index.first.first).dofs_per_quad,
                          ExcInternalError());
                  m_index.second = 5*base_element(m_index.first.first).dofs_per_vertex +
                                   12*base_element(m_index.first.first).dofs_per_line +
                                   base_element(m_index.first.first).dofs_per_quad*sub_quad +
                                   tmp2;
                };

            break;
          };

          default:
            Assert (false, ExcNotImplemented());
          };

        // now that we gathered all information: use it to build the
        // matrix. note that if n and m belong to different base elements or
        // instances, then there definitely will be no coupling
        if (n_index.first == m_index.first)
          this->interface_constraints(m,n)
            = (base_element(n_index.first.first).constraints()(m_index.second,
                                                               n_index.second));
      };
}



template <int dim, int spacedim>
void FESystem<dim,spacedim>::initialize (const std::vector<const FiniteElement<dim,spacedim>*> &fes,
                                         const std::vector<unsigned int> &multiplicities)
{
  Assert (fes.size() == multiplicities.size(),
          ExcDimensionMismatch (fes.size(), multiplicities.size()) );
  Assert (fes.size() > 0,
          ExcMessage ("Need to pass at least one finite element."));
  Assert (count_nonzeros(multiplicities) > 0,
          ExcMessage("You only passed FiniteElements with multiplicity 0."));

  // Note that we need to skip every fe with multiplicity 0 in the following block of code

  this->base_to_block_indices.reinit(0, 0);

  for (unsigned int i=0; i<fes.size(); i++)
    if (multiplicities[i]>0)
      this->base_to_block_indices.push_back( multiplicities[i] );

  std::vector<Threads::Task<FiniteElement<dim,spacedim>*> > clone_base_elements;

  for (unsigned int i=0; i<fes.size(); i++)
    if (multiplicities[i]>0)
      clone_base_elements.push_back (Threads::new_task (&FiniteElement<dim,spacedim>::clone,
                                                        *fes[i]));

  unsigned int ind=0;
  for (unsigned int i=0; i<fes.size(); i++)
    {
      if (multiplicities[i]>0)
        {
          base_elements[ind] =
            std::make_pair (std_cxx11::shared_ptr<const FiniteElement<dim,spacedim> >
                            (clone_base_elements[ind].return_value()),
                            multiplicities[i]);
          ++ind;
        }
    }

  Assert(ind>0, ExcInternalError());

  build_cell_tables();
  build_face_tables();

  // restriction and prolongation matrices are build on demand

  // now set up the interface constraints.  this is kind'o hairy, so don't try
  // to do it dimension independent
  build_interface_constraints ();

  // finally fill in support points on cell and face
  initialize_unit_support_points ();
  initialize_unit_face_support_points ();

  initialize_quad_dof_index_permutation ();
}






template <int dim, int spacedim>
void
FESystem<dim,spacedim>::
initialize_unit_support_points ()
{
  // if one of the base elements has no support points, then it makes no sense
  // to define support points for the composed element, so return an empty
  // array to demonstrate that fact. Note that we ignore FE_Nothing in this logic.
  for (unsigned int base_el=0; base_el<this->n_base_elements(); ++base_el)
    if (!base_element(base_el).has_support_points() && base_element(base_el).dofs_per_cell!=0)
      {
        this->unit_support_points.resize(0);
        return;
      };

  // generate unit support points from unit support points of sub elements
  this->unit_support_points.resize(this->dofs_per_cell);

  for (unsigned int i=0; i<this->dofs_per_cell; ++i)
    {
      const unsigned int
      base       = this->system_to_base_table[i].first.first,
      base_index = this->system_to_base_table[i].second;
      Assert (base<this->n_base_elements(), ExcInternalError());
      Assert (base_index<base_element(base).unit_support_points.size(),
              ExcInternalError());
      this->unit_support_points[i] = base_element(base).unit_support_points[base_index];
    };
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::
initialize_unit_face_support_points ()
{
  // Nothing to do in 1D
  if (dim == 1)
    return;

  // if one of the base elements has no support points, then it makes no sense
  // to define support points for the composed element. In that case, return
  // an empty array to demonstrate that fact (note that we ask whether the
  // base element has no support points at all, not only none on the face!)
  //
  // on the other hand, if there is an element that simply has no degrees of
  // freedom on the face at all, then we don't care whether it has support
  // points or not. this is, for example, the case for the stable Stokes
  // element Q(p)^dim \times DGP(p-1).
  for (unsigned int base_el=0; base_el<this->n_base_elements(); ++base_el)
    if (!base_element(base_el).has_support_points()
        &&
        (base_element(base_el).dofs_per_face > 0))
      {
        this->unit_face_support_points.resize(0);
        return;
      }


  // generate unit face support points from unit support points of sub
  // elements
  this->unit_face_support_points.resize(this->dofs_per_face);

  for (unsigned int i=0; i<this->dofs_per_face; ++i)
    {
      const unsigned int base_i = this->face_system_to_base_table[i].first.first;
      const unsigned int index_in_base = this->face_system_to_base_table[i].second;

      Assert (index_in_base < base_element(base_i).unit_face_support_points.size(),
              ExcInternalError());

      this->unit_face_support_points[i]
        = base_element(base_i).unit_face_support_points[index_in_base];
    }
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::initialize_quad_dof_index_permutation ()
{
  // nothing to do in other dimensions than 3
  if (dim < 3)
    return;

  // the array into which we want to write should have the correct size
  // already.
  Assert (this->adjust_quad_dof_index_for_face_orientation_table.n_elements()==
          8*this->dofs_per_quad, ExcInternalError());

  // to obtain the shifts for this composed element, copy the shift
  // information of the base elements
  unsigned int index = 0;
  for (unsigned int b=0; b<this->n_base_elements(); ++b)
    {
      const Table<2,int> &temp
        = this->base_element(b).adjust_quad_dof_index_for_face_orientation_table;
      for (unsigned int c=0; c<this->element_multiplicity(b); ++c)
        {
          for (unsigned int i=0; i<temp.size(0); ++i)
            for (unsigned int j=0; j<8; ++j)
              this->adjust_quad_dof_index_for_face_orientation_table(index+i,j)=
                temp(i,j);
          index += temp.size(0);
        }
    }
  Assert (index == this->dofs_per_quad,
          ExcInternalError());

  // aditionally compose the permutation information for lines
  Assert (this->adjust_line_dof_index_for_line_orientation_table.size()==
          this->dofs_per_line, ExcInternalError());
  index = 0;
  for (unsigned int b=0; b<this->n_base_elements(); ++b)
    {
      const std::vector<int> &temp2
        = this->base_element(b).adjust_line_dof_index_for_line_orientation_table;
      for (unsigned int c=0; c<this->element_multiplicity(b); ++c)
        {
          std::copy(temp2.begin(), temp2.end(),
                    this->adjust_line_dof_index_for_line_orientation_table.begin()
                    +index);
          index += temp2.size();
        }
    }
  Assert (index == this->dofs_per_line,
          ExcInternalError());
}



template <int dim, int spacedim>
bool
FESystem<dim,spacedim>::
hp_constraints_are_implemented () const
{
  for (unsigned int b=0; b<this->n_base_elements(); ++b)
    if (base_element(b).hp_constraints_are_implemented() == false)
      return false;

  return true;
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::
get_face_interpolation_matrix (const FiniteElement<dim,spacedim> &x_source_fe,
                               FullMatrix<double>       &interpolation_matrix) const
{
  typedef FiniteElement<dim,spacedim> FEL;
  AssertThrow ((x_source_fe.get_name().find ("FE_System<") == 0)
               ||
               (dynamic_cast<const FESystem<dim,spacedim>*>(&x_source_fe) != 0),
               typename FEL::
               ExcInterpolationNotImplemented());

  Assert (interpolation_matrix.n() == this->dofs_per_face,
          ExcDimensionMismatch (interpolation_matrix.n(),
                                this->dofs_per_face));
  Assert (interpolation_matrix.m() == x_source_fe.dofs_per_face,
          ExcDimensionMismatch (interpolation_matrix.m(),
                                x_source_fe.dofs_per_face));

  // since dofs for each base are independent, we only have to stack things up
  // from base element to base element
  //
  // the problem is that we have to work with two FEs (this and
  // fe_other). only deal with the case that both are FESystems and that they
  // both have the same number of bases (counting multiplicity) each of which
  // match in their number of components. this covers
  // FESystem(FE_Q(p),1,FE_Q(q),2) vs FESystem(FE_Q(r),2,FE_Q(s),1), but not
  // FESystem(FE_Q(p),1,FE_Q(q),2) vs
  // FESystem(FESystem(FE_Q(r),2),1,FE_Q(s),1)
  const FESystem<dim,spacedim> *fe_other_system
    = dynamic_cast<const FESystem<dim,spacedim>*>(&x_source_fe);

  // clear matrix, since we will not get to set all elements
  interpolation_matrix = 0;

  // loop over all the base elements of this and the other element, counting
  // their multiplicities
  unsigned int base_index       = 0,
               base_index_other = 0;
  unsigned int multiplicity       = 0,
               multiplicity_other = 0;

  FullMatrix<double> base_to_base_interpolation;

  while (true)
    {
      const FiniteElement<dim,spacedim>
      &base       = base_element(base_index),
       &base_other = fe_other_system->base_element(base_index_other);

      Assert (base.n_components() == base_other.n_components(),
              ExcNotImplemented());

      // get the interpolation from the bases
      base_to_base_interpolation.reinit (base_other.dofs_per_face,
                                         base.dofs_per_face);
      base.get_face_interpolation_matrix (base_other,
                                          base_to_base_interpolation);

      // now translate entries. we'd like to have something like
      // face_base_to_system_index, but that doesn't exist. rather, all we
      // have is the reverse. well, use that then
      for (unsigned int i=0; i<this->dofs_per_face; ++i)
        if (this->face_system_to_base_index(i).first
            ==
            std::make_pair (base_index, multiplicity))
          for (unsigned int j=0; j<fe_other_system->dofs_per_face; ++j)
            if (fe_other_system->face_system_to_base_index(j).first
                ==
                std::make_pair (base_index_other, multiplicity_other))
              interpolation_matrix(j, i)
                = base_to_base_interpolation(fe_other_system->face_system_to_base_index(j).second,
                                             this->face_system_to_base_index(i).second);

      // advance to the next base element for this and the other fe_system;
      // see if we can simply advance the multiplicity by one, or if have to
      // move on to the next base element
      ++multiplicity;
      if (multiplicity == this->element_multiplicity(base_index))
        {
          multiplicity = 0;
          ++base_index;
        }
      ++multiplicity_other;
      if (multiplicity_other ==
          fe_other_system->element_multiplicity(base_index_other))
        {
          multiplicity_other = 0;
          ++base_index_other;
        }

      // see if we have reached the end of the present element. if so, we
      // should have reached the end of the other one as well
      if (base_index == this->n_base_elements())
        {
          Assert (base_index_other == fe_other_system->n_base_elements(),
                  ExcInternalError());
          break;
        }

      // if we haven't reached the end of this element, we shouldn't have
      // reached the end of the other one either
      Assert (base_index_other != fe_other_system->n_base_elements(),
              ExcInternalError());
    }
}



template <int dim, int spacedim>
void
FESystem<dim,spacedim>::
get_subface_interpolation_matrix (const FiniteElement<dim,spacedim> &x_source_fe,
                                  const unsigned int        subface,
                                  FullMatrix<double>       &interpolation_matrix) const
{
  typedef FiniteElement<dim,spacedim> FEL;
  AssertThrow ((x_source_fe.get_name().find ("FE_System<") == 0)
               ||
               (dynamic_cast<const FESystem<dim,spacedim>*>(&x_source_fe) != 0),
               typename FEL::
               ExcInterpolationNotImplemented());

  Assert (interpolation_matrix.n() == this->dofs_per_face,
          ExcDimensionMismatch (interpolation_matrix.n(),
                                this->dofs_per_face));
  Assert (interpolation_matrix.m() == x_source_fe.dofs_per_face,
          ExcDimensionMismatch (interpolation_matrix.m(),
                                x_source_fe.dofs_per_face));

  // since dofs for each base are independent, we only have to stack things up
  // from base element to base element
  //
  // the problem is that we have to work with two FEs (this and
  // fe_other). only deal with the case that both are FESystems and that they
  // both have the same number of bases (counting multiplicity) each of which
  // match in their number of components. this covers
  // FESystem(FE_Q(p),1,FE_Q(q),2) vs FESystem(FE_Q(r),2,FE_Q(s),1), but not
  // FESystem(FE_Q(p),1,FE_Q(q),2) vs
  // FESystem(FESystem(FE_Q(r),2),1,FE_Q(s),1)
  const FESystem<dim,spacedim> *fe_other_system
    = dynamic_cast<const FESystem<dim,spacedim>*>(&x_source_fe);

  // clear matrix, since we will not get to set all elements
  interpolation_matrix = 0;

  // loop over all the base elements of this and the other element, counting
  // their multiplicities
  unsigned int base_index       = 0,
               base_index_other = 0;
  unsigned int multiplicity       = 0,
               multiplicity_other = 0;

  FullMatrix<double> base_to_base_interpolation;

  while (true)
    {
      const FiniteElement<dim,spacedim>
      &base       = base_element(base_index),
       &base_other = fe_other_system->base_element(base_index_other);

      Assert (base.n_components() == base_other.n_components(),
              ExcNotImplemented());

      // get the interpolation from the bases
      base_to_base_interpolation.reinit (base_other.dofs_per_face,
                                         base.dofs_per_face);
      base.get_subface_interpolation_matrix (base_other,
                                             subface,
                                             base_to_base_interpolation);

      // now translate entries. we'd like to have something like
      // face_base_to_system_index, but that doesn't exist. rather, all we
      // have is the reverse. well, use that then
      for (unsigned int i=0; i<this->dofs_per_face; ++i)
        if (this->face_system_to_base_index(i).first
            ==
            std::make_pair (base_index, multiplicity))
          for (unsigned int j=0; j<fe_other_system->dofs_per_face; ++j)
            if (fe_other_system->face_system_to_base_index(j).first
                ==
                std::make_pair (base_index_other, multiplicity_other))
              interpolation_matrix(j, i)
                = base_to_base_interpolation(fe_other_system->face_system_to_base_index(j).second,
                                             this->face_system_to_base_index(i).second);

      // advance to the next base element for this and the other fe_system;
      // see if we can simply advance the multiplicity by one, or if have to
      // move on to the next base element
      ++multiplicity;
      if (multiplicity == this->element_multiplicity(base_index))
        {
          multiplicity = 0;
          ++base_index;
        }
      ++multiplicity_other;
      if (multiplicity_other ==
          fe_other_system->element_multiplicity(base_index_other))
        {
          multiplicity_other = 0;
          ++base_index_other;
        }

      // see if we have reached the end of the present element. if so, we
      // should have reached the end of the other one as well
      if (base_index == this->n_base_elements())
        {
          Assert (base_index_other == fe_other_system->n_base_elements(),
                  ExcInternalError());
          break;
        }

      // if we haven't reached the end of this element, we shouldn't have
      // reached the end of the other one either
      Assert (base_index_other != fe_other_system->n_base_elements(),
              ExcInternalError());
    }
}



template <int dim, int spacedim>
template <int structdim>
std::vector<std::pair<unsigned int, unsigned int> >
FESystem<dim,spacedim>::hp_object_dof_identities (const FiniteElement<dim,spacedim> &fe_other) const
{
  // since dofs on each subobject (vertex, line, ...) are ordered such that
  // first come all from the first base element all multiplicities, then
  // second base element all multiplicities, etc., we simply have to stack all
  // the identities after each other
  //
  // the problem is that we have to work with two FEs (this and
  // fe_other). only deal with the case that both are FESystems and that they
  // both have the same number of bases (counting multiplicity) each of which
  // match in their number of components. this covers
  // FESystem(FE_Q(p),1,FE_Q(q),2) vs FESystem(FE_Q(r),2,FE_Q(s),1), but not
  // FESystem(FE_Q(p),1,FE_Q(q),2) vs
  // FESystem(FESystem(FE_Q(r),2),1,FE_Q(s),1)
  if (const FESystem<dim,spacedim> *fe_other_system
      = dynamic_cast<const FESystem<dim,spacedim>*>(&fe_other))
    {
      // loop over all the base elements of this and the other element,
      // counting their multiplicities
      unsigned int base_index       = 0,
                   base_index_other = 0;
      unsigned int multiplicity       = 0,
                   multiplicity_other = 0;

      // we also need to keep track of the number of dofs already treated for
      // each of the elements
      unsigned int dof_offset       = 0,
                   dof_offset_other = 0;

      std::vector<std::pair<unsigned int, unsigned int> > identities;

      while (true)
        {
          const FiniteElement<dim,spacedim>
          &base       = base_element(base_index),
           &base_other = fe_other_system->base_element(base_index_other);

          Assert (base.n_components() == base_other.n_components(),
                  ExcNotImplemented());

          // now translate the identities returned by the base elements to the
          // indices of this system element
          std::vector<std::pair<unsigned int, unsigned int> > base_identities;
          switch (structdim)
            {
            case 0:
              base_identities = base.hp_vertex_dof_identities (base_other);
              break;
            case 1:
              base_identities = base.hp_line_dof_identities (base_other);
              break;
            case 2:
              base_identities = base.hp_quad_dof_identities (base_other);
              break;
            default:
              Assert (false, ExcNotImplemented());
            }

          for (unsigned int i=0; i<base_identities.size(); ++i)
            identities.push_back
            (std::make_pair (base_identities[i].first + dof_offset,
                             base_identities[i].second + dof_offset_other));

          // record the dofs treated above as already taken care of
          dof_offset       += base.template n_dofs_per_object<structdim>();
          dof_offset_other += base_other.template n_dofs_per_object<structdim>();

          // advance to the next base element for this and the other
          // fe_system; see if we can simply advance the multiplicity by one,
          // or if have to move on to the next base element
          ++multiplicity;
          if (multiplicity == this->element_multiplicity(base_index))
            {
              multiplicity = 0;
              ++base_index;
            }
          ++multiplicity_other;
          if (multiplicity_other ==
              fe_other_system->element_multiplicity(base_index_other))
            {
              multiplicity_other = 0;
              ++base_index_other;
            }

          // see if we have reached the end of the present element. if so, we
          // should have reached the end of the other one as well
          if (base_index == this->n_base_elements())
            {
              Assert (base_index_other == fe_other_system->n_base_elements(),
                      ExcInternalError());
              break;
            }

          // if we haven't reached the end of this element, we shouldn't have
          // reached the end of the other one either
          Assert (base_index_other != fe_other_system->n_base_elements(),
                  ExcInternalError());
        }

      return identities;
    }
  else
    {
      Assert (false, ExcNotImplemented());
      return std::vector<std::pair<unsigned int, unsigned int> >();
    }
}



template <int dim, int spacedim>
std::vector<std::pair<unsigned int, unsigned int> >
FESystem<dim,spacedim>::hp_vertex_dof_identities (const FiniteElement<dim,spacedim> &fe_other) const
{
  return hp_object_dof_identities<0> (fe_other);
}

template <int dim, int spacedim>
std::vector<std::pair<unsigned int, unsigned int> >
FESystem<dim,spacedim>::hp_line_dof_identities (const FiniteElement<dim,spacedim> &fe_other) const
{
  return hp_object_dof_identities<1> (fe_other);
}



template <int dim, int spacedim>
std::vector<std::pair<unsigned int, unsigned int> >
FESystem<dim,spacedim>::hp_quad_dof_identities (const FiniteElement<dim,spacedim> &fe_other) const
{
  return hp_object_dof_identities<2> (fe_other);
}



template <int dim, int spacedim>
FiniteElementDomination::Domination
FESystem<dim,spacedim>::
compare_for_face_domination (const FiniteElement<dim,spacedim> &fe_other) const
{
  // at present all we can do is to compare with other FESystems that have the
  // same number of components and bases
  if (const FESystem<dim,spacedim> *fe_sys_other
      = dynamic_cast<const FESystem<dim,spacedim>*>(&fe_other))
    {
      Assert (this->n_components() == fe_sys_other->n_components(),
              ExcNotImplemented());
      Assert (this->n_base_elements() == fe_sys_other->n_base_elements(),
              ExcNotImplemented());

      FiniteElementDomination::Domination
      domination = FiniteElementDomination::no_requirements;

      // loop over all base elements and do some sanity checks
      for (unsigned int b=0; b<this->n_base_elements(); ++b)
        {
          Assert (this->base_element(b).n_components() ==
                  fe_sys_other->base_element(b).n_components(),
                  ExcNotImplemented());
          Assert (this->element_multiplicity(b) ==
                  fe_sys_other->element_multiplicity(b),
                  ExcNotImplemented());

          // for this pair of base elements, check who dominates and combine
          // with previous result
          const FiniteElementDomination::Domination
          base_domination = (this->base_element(b)
                             .compare_for_face_domination (fe_sys_other->base_element(b)));
          domination = domination & base_domination;
        }

      return domination;
    }

  Assert (false, ExcNotImplemented());
  return FiniteElementDomination::neither_element_dominates;
}



template <int dim, int spacedim>
const FiniteElement<dim,spacedim> &
FESystem<dim,spacedim>::base_element (const unsigned int index) const
{
  Assert (index < base_elements.size(),
          ExcIndexRange(index, 0, base_elements.size()));
  return *base_elements[index].first;
}



template <int dim, int spacedim>
bool
FESystem<dim,spacedim>::has_support_on_face (const unsigned int shape_index,
                                             const unsigned int face_index) const
{
  return (base_element(this->system_to_base_index(shape_index).first.first)
          .has_support_on_face(this->system_to_base_index(shape_index).second,
                               face_index));
}



template <int dim, int spacedim>
Point<dim>
FESystem<dim,spacedim>::unit_support_point (const unsigned int index) const
{
  Assert (index < this->dofs_per_cell,
          ExcIndexRange (index, 0, this->dofs_per_cell));
  typedef FiniteElement<dim,spacedim> FEL;
  Assert ((this->unit_support_points.size() == this->dofs_per_cell) ||
          (this->unit_support_points.size() == 0),
          typename FEL::ExcFEHasNoSupportPoints ());

  // let's see whether we have the information pre-computed
  if (this->unit_support_points.size() != 0)
    return this->unit_support_points[index];
  else
    // no. ask the base element whether it would like to provide this
    // information
    return (base_element(this->system_to_base_index(index).first.first)
            .unit_support_point(this->system_to_base_index(index).second));
}



template <int dim, int spacedim>
Point<dim-1>
FESystem<dim,spacedim>::unit_face_support_point (const unsigned int index) const
{
  Assert (index < this->dofs_per_face,
          ExcIndexRange (index, 0, this->dofs_per_face));
  typedef  FiniteElement<dim,spacedim> FEL;
  Assert ((this->unit_face_support_points.size() == this->dofs_per_face) ||
          (this->unit_face_support_points.size() == 0),
          typename FEL::ExcFEHasNoSupportPoints ());

  // let's see whether we have the information pre-computed
  if (this->unit_face_support_points.size() != 0)
    return this->unit_face_support_points[index];
  else
    // no. ask the base element whether it would like to provide this
    // information
    return (base_element(this->face_system_to_base_index(index).first.first)
            .unit_face_support_point(this->face_system_to_base_index(index).second));
}



template <int dim, int spacedim>
std::pair<Table<2,bool>, std::vector<unsigned int> >
FESystem<dim,spacedim>::get_constant_modes () const
{
  // Note that this->n_components() is actually only an estimate of how many
  // constant modes we will need. There might be more than one such mode
  // (e.g. FE_Q_DG0).
  Table<2,bool> constant_modes(this->n_components(), this->dofs_per_cell);
  std::vector<unsigned int> components;
  for (unsigned int i=0; i<base_elements.size(); ++i)
    {
      std::pair<Table<2,bool>, std::vector<unsigned int> >
      base_table = base_elements[i].first->get_constant_modes();
      AssertDimension(base_table.first.n_rows(), base_table.second.size());
      const unsigned int element_multiplicity = this->element_multiplicity(i);

      // there might be more than one constant mode for some scalar elements,
      // so make sure the table actually fits: Create a new table with more
      // rows
      const unsigned int comp = components.size();
      if (constant_modes.n_rows() < comp+base_table.first.n_rows()*element_multiplicity)
        {
          Table<2,bool> new_constant_modes(comp+base_table.first.n_rows()*
                                           element_multiplicity,
                                           constant_modes.n_cols());
          for (unsigned int r=0; r<comp; ++r)
            for (unsigned int c=0; c<this->dofs_per_cell; ++c)
              new_constant_modes(r,c) = constant_modes(r,c);
          constant_modes.swap(new_constant_modes);
        }

      // next, fill the constant modes from the individual components as well
      // as the component numbers corresponding to the constant mode rows
      for (unsigned int k=0; k<this->dofs_per_cell; ++k)
        {
          std::pair<std::pair<unsigned int,unsigned int>, unsigned int> ind
            = this->system_to_base_index(k);
          if (ind.first.first == i)
            for (unsigned int c=0; c<base_table.first.n_rows(); ++c)
              constant_modes(comp+ind.first.second*base_table.first.n_rows()+c,k)
                = base_table.first(c,ind.second);
        }
      for (unsigned int r=0; r<element_multiplicity; ++r)
        for (unsigned int c=0; c<base_table.second.size(); ++c)
          components.push_back(comp+r*this->base_elements[i].first->n_components()
                               +base_table.second[c]);
    }
  AssertDimension(components.size(), constant_modes.n_rows());
  return std::pair<Table<2,bool>, std::vector<unsigned int> >(constant_modes,
                                                              components);
}



template <int dim, int spacedim>
std::size_t
FESystem<dim,spacedim>::memory_consumption () const
{
  // neglect size of data stored in @p{base_elements} due to some problems
  // with the compiler. should be neglectable after all, considering the size
  // of the data of the subelements
  std::size_t mem = (FiniteElement<dim,spacedim>::memory_consumption () +
                     sizeof (base_elements));
  for (unsigned int i=0; i<base_elements.size(); ++i)
    mem += MemoryConsumption::memory_consumption (*base_elements[i].first);
  return mem;
}




// explicit instantiations
#include "fe_system.inst"

DEAL_II_NAMESPACE_CLOSE