side.h

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2018 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner

// This library is free software; you can 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.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.

// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA



#ifndef LIBMESH_SIDE_H
#define LIBMESH_SIDE_H

// Local includes
#include "libmesh/libmesh_common.h"
#include "libmesh/elem.h"

namespace libMesh
{

// Forward declarations
class Point;
class Node;

template <class SideType, class ParentType>
class Side : public SideType
{
public:

  Side (const Elem * parent_in,
        const unsigned int side_in) :
    SideType(const_cast<Elem *>(parent_in)),
    _side_number(side_in)
  {
    libmesh_assert(parent_in);
    // may not be true when building infinite element sides
    // libmesh_assert_less (_side_number, this->parent()->n_sides());
    libmesh_assert_equal_to ((this->dim()+1), this->parent()->dim());

    for (auto n : this->node_index_range())
      this->_nodes[n] = this->parent()->node_ptr
        (ParentType::side_nodes_map[_side_number][n]);
  }

  Side (Side &&) = delete;
  Side (const Side &) = delete;
  Side & operator= (const Side &) = delete;
  Side & operator= (Side &&) = delete;
  virtual ~Side() = default;

  virtual Node * & set_node (const unsigned int i) override
  {
    libmesh_assert_less (i, this->n_nodes());
    return this->parent()->set_node (ParentType::side_nodes_map[_side_number][i]);
  }

private:

  const unsigned int _side_number;
};



template <class EdgeType, class ParentType>
class SideEdge : public EdgeType
{
public:

  SideEdge (const Elem * my_parent,
            const unsigned int my_edge) :
    EdgeType(const_cast<Elem *>(my_parent)),
    _edge_number(my_edge)
  {
    libmesh_assert(my_parent);
    libmesh_assert_less (_edge_number, this->parent()->n_edges());
    libmesh_assert_equal_to (this->dim(), 1);

    for (auto n : this->node_index_range())
      this->_nodes[n] = this->parent()->node_ptr
        (ParentType::edge_nodes_map[_edge_number][n]);
  }

  virtual Node * & set_node (const unsigned int i) override
  {
    libmesh_assert_less (i, this->n_nodes());
    return this->parent()->set_node (ParentType::edge_nodes_map[_edge_number][i]);
  }

private:

  const unsigned int _edge_number;
};


} // namespace libMesh

#endif // LIBMESH_SIDE_H