libMesh::Parallel::Packing< Elem * > Class Reference

#include <parallel_elem.h>

Public Types
typedef largest_id_type	buffer_type

Public Member Functions
template<>
Elem *	unpack (std::vector< largest_id_type >::const_iterator in, MeshBase *mesh)
template<>
Elem *	unpack (std::vector< largest_id_type >::const_iterator in, DistributedMesh *mesh)
template<>
Elem *	unpack (std::vector< largest_id_type >::const_iterator in, ParallelMesh *mesh)

Static Public Member Functions
template<typename OutputIter , typename Context >
static void	pack (Elem *const &object, OutputIter data_out, const Context *context)
template<typename Context >
static unsigned int	packable_size (Elem *const &object, const Context *context)
template<typename BufferIter >
static unsigned int	packed_size (BufferIter iter)
template<typename BufferIter , typename Context >
static Elem *	unpack (BufferIter in, Context *ctx)

Detailed Description

Definition at line 63 of file parallel_elem.h.

Member Typedef Documentation

buffer_type

typedef largest_id_type libMesh::Parallel::Packing< Elem * >::buffer_type

Definition at line 66 of file parallel_elem.h.

Member Function Documentation

pack()

template<typename OutputIter , typename Context >

static void libMesh::Parallel::Packing< Elem * >::pack ( Elem *const &  object, OutputIter  data_out, const Context *  context  )

inlinestatic

Definition at line 69 of file parallel_elem.h.

  { return Packing<const Elem *>::pack(object, data_out, context); }

References libMesh::Parallel::Packing< typename T, typename Enable >::pack().

packable_size()

template<typename Context >

static unsigned int libMesh::Parallel::Packing< Elem * >::packable_size ( Elem *const &  object, const Context *  context  )

inlinestatic

Definition at line 75 of file parallel_elem.h.

  { return Packing<const Elem *>::packable_size(object, context); }

References libMesh::Parallel::Packing< typename T, typename Enable >::packable_size().

packed_size()

template<typename BufferIter >

static unsigned int libMesh::Parallel::Packing< Elem * >::packed_size ( BufferIter  iter )

inlinestatic

Definition at line 80 of file parallel_elem.h.

  { return Packing<const Elem *>::packed_size(iter); }

References libMesh::Parallel::Packing< typename T, typename Enable >::packed_size().

unpack() [1/4]

template<typename BufferIter , typename Context >

static Elem * libMesh::Parallel::Packing< Elem * >::unpack ( BufferIter  in, Context *  ctx  )

static

unpack() [2/4]

template<>

Elem * libMesh::Parallel::Packing< Elem * >::unpack	(	std::vector< largest_id_type >::const_iterator	in,
		DistributedMesh *	mesh
	)

Definition at line 1079 of file parallel_elem.C.

{
  return unpack(in, static_cast<MeshBase*>(mesh));
}

References mesh.

unpack() [3/4]

template<>

Elem * libMesh::Parallel::Packing< Elem * >::unpack	(	std::vector< largest_id_type >::const_iterator	in,
		MeshBase *	mesh
	)

Definition at line 466 of file parallel_elem.C.

{
#ifndef NDEBUG
  const std::vector<largest_id_type>::const_iterator original_in = in;
 
  const largest_id_type incoming_header = *in++;
  libmesh_assert_equal_to (incoming_header, elem_magic_header);
#endif
 
  // int 0: level
  const unsigned int level =
    cast_int<unsigned int>(*in++);
 
#ifdef LIBMESH_ENABLE_AMR
  // int 1: p level
  const unsigned int p_level =
    cast_int<unsigned int>(*in++);
 
  // int 2: refinement flag and encoded has_children
  const int rflag = cast_int<int>(*in++);
  const int invalid_rflag =
    cast_int<int>(Elem::INVALID_REFINEMENTSTATE);
  libmesh_assert_greater_equal (rflag, 0);
 
  libmesh_assert_less (rflag, invalid_rflag*2+1);
 
  const bool has_children = (rflag > invalid_rflag);
 
  const Elem::RefinementState refinement_flag = has_children ?
    cast_int<Elem::RefinementState>(rflag - invalid_rflag - 1) :
    cast_int<Elem::RefinementState>(rflag);
 
  // int 3: p refinement flag
  const int pflag = cast_int<int>(*in++);
  libmesh_assert_greater_equal (pflag, 0);
  libmesh_assert_less (pflag, Elem::INVALID_REFINEMENTSTATE);
  const Elem::RefinementState p_refinement_flag =
    cast_int<Elem::RefinementState>(pflag);
#else
  in += 3;
#endif // LIBMESH_ENABLE_AMR
 
  // int 4: element type
  const int typeint = cast_int<int>(*in++);
  libmesh_assert_greater_equal (typeint, 0);
  libmesh_assert_less (typeint, INVALID_ELEM);
  const ElemType type =
    cast_int<ElemType>(typeint);
 
  unsigned int n_nodes = Elem::type_to_n_nodes_map[type];
  unsigned int n_sides = Elem::type_to_n_sides_map[type];
  unsigned int n_edges = Elem::type_to_n_edges_map[type];
  // No Elem exists yet, so use the static-count sentinel corresponding
  // to Elem::runtime_topology().
  const bool has_runtime_topology = (n_nodes == invalid_uint);
 
  // int 5: processor id
  const processor_id_type processor_id =
    cast_int<processor_id_type>(*in++);
  libmesh_assert (processor_id < mesh->n_processors() ||
                  processor_id == DofObject::invalid_processor_id);
 
  // int 6: subdomain id
  const subdomain_id_type subdomain_id =
    cast_int<subdomain_id_type>(*in++);
 
  // int 7: dof object id
  const dof_id_type id =
    cast_int<dof_id_type>(*in++);
  libmesh_assert_not_equal_to (id, DofObject::invalid_id);
 
#ifdef LIBMESH_ENABLE_UNIQUE_ID
  // int 8: dof object unique id
  const unique_id_type unique_id =
    cast_int<unique_id_type>(*in++);
#endif
 
#ifdef LIBMESH_ENABLE_AMR
  // int 9: parent dof object id.
  // Note: If level==0, then (*in) == invalid_id.  In
  // this case, the equality check in cast_int<unsigned>(*in) will
  // never succeed.  Therefore, we should only attempt the more
  // rigorous cast verification in cases where level != 0.
  const dof_id_type parent_id =
    (level == 0)
    ? static_cast<dof_id_type>(*in++)
    : cast_int<dof_id_type>(*in++);
  libmesh_assert (level == 0 || parent_id != DofObject::invalid_id);
  libmesh_assert (level != 0 || parent_id == DofObject::invalid_id);
 
  // int 10: local child id
  // Note: If level==0, then which_child_am_i is not valid, so don't
  // do the more rigorous cast verification.
  const unsigned int which_child_am_i =
    (level == 0)
    ? static_cast<unsigned int>(*in++)
    : cast_int<unsigned int>(*in++);
#else
  in += 2;
#endif // LIBMESH_ENABLE_AMR
 
  const dof_id_type interior_parent_id =
    static_cast<dof_id_type>(*in++);
 
  // Make sure we don't miscount above when adding the "magic" header
  // plus the real data header
  libmesh_assert_equal_to (in - original_in, header_size + 1);
 
  if (has_runtime_topology)
    {
      n_nodes = cast_int<unsigned int>(*in++);
      n_sides = cast_int<unsigned int>(*in++);
      n_edges = cast_int<unsigned int>(*in++);
 
      if (Elem::type_to_dim_map[type] == 2)
        {
          libmesh_assert_less (2, n_sides);
          libmesh_assert_equal_to (n_nodes % n_sides, 0);
          libmesh_assert_equal_to (n_edges, n_sides);
        }
      else if (Elem::type_to_dim_map[type] == 3)
        {
          libmesh_assert_less (3, n_nodes);
          libmesh_assert_less (3, n_sides);
        }
    }
  libmesh_ignore(n_edges); // unused outside dbg/devel
 
  const auto node_ids_in = in;
  in += n_nodes;
 
  std::vector<std::vector<unsigned int>> polyhedron_side_nodes;
  if (has_runtime_topology && Elem::type_to_dim_map[type] == 3)
    {
      polyhedron_side_nodes.resize(n_sides);
#ifndef NDEBUG
      std::vector<bool> node_seen(n_nodes, false);
      unsigned int next_new_node = 0;
#endif
      for (auto & side_nodes : polyhedron_side_nodes)
        {
          const unsigned int n_side_nodes =
            cast_int<unsigned int>(*in++);
          libmesh_assert_less (2, n_side_nodes);
          side_nodes.resize(n_side_nodes);
          for (auto & node : side_nodes)
            {
              node = cast_int<unsigned int>(*in++);
              libmesh_assert_less (node, n_nodes);
 
#ifndef NDEBUG
              if (type == C0POLYHEDRON && !node_seen[node])
                {
                  libmesh_assert_equal_to (node, next_new_node);
                  node_seen[node] = true;
                  ++next_new_node;
                }
#endif
            }
        }
 
#ifndef NDEBUG
      if (type == C0POLYHEDRON)
        libmesh_assert (next_new_node == n_nodes ||
                        next_new_node + 1 == n_nodes);
#endif
    }
 
  Elem * elem = mesh->query_elem_ptr(id);
 
  // if we already have this element, make sure its
  // properties match, and update any missing neighbor
  // links, but then go on
  if (elem)
    {
      libmesh_assert_equal_to (elem->level(), level);
      libmesh_assert_equal_to (elem->id(), id);
      //#ifdef LIBMESH_ENABLE_UNIQUE_ID
      // No check for unique id sanity
      //#endif
      libmesh_assert_equal_to (elem->processor_id(), processor_id);
      libmesh_assert_equal_to (elem->subdomain_id(), subdomain_id);
      libmesh_assert_equal_to (elem->type(), type);
      libmesh_assert_equal_to (elem->n_nodes(), n_nodes);
      libmesh_assert_equal_to (elem->n_sides(), n_sides);
      libmesh_assert_equal_to (elem->n_edges(), n_edges);
 
#ifndef NDEBUG
      if (elem->runtime_topology() && elem->dim() == 3)
        for (auto s : elem->side_index_range())
          libmesh_assert(elem->nodes_on_side(s) ==
                         polyhedron_side_nodes[s]);
#endif
 
#ifndef NDEBUG
      // All our nodes should be correct
      for (unsigned int i=0; i != n_nodes; ++i)
        libmesh_assert_equal_to
          (elem->node_id(i),
           cast_int<dof_id_type>(*(node_ids_in + i)));
#endif
 
#ifdef LIBMESH_ENABLE_AMR
      libmesh_assert_equal_to (elem->refinement_flag(), refinement_flag);
      libmesh_assert_equal_to (elem->has_children(), has_children);
 
#ifdef DEBUG
      if (elem->active())
        {
          libmesh_assert_equal_to (elem->p_level(), p_level);
          libmesh_assert_equal_to (elem->p_refinement_flag(), p_refinement_flag);
        }
#endif
 
      libmesh_assert (!level || elem->parent() != nullptr);
      libmesh_assert (!level || elem->parent()->id() == parent_id);
      libmesh_assert (!level || elem->parent()->child_ptr(which_child_am_i) == elem);
#endif
      // Our interior_parent link should be "close to" correct - we
      // may have to update it, but we can check for some
      // inconsistencies.
      {
        // If the sending processor sees no interior_parent here, we'd
        // better agree.
        if (interior_parent_id == DofObject::invalid_id)
          {
            if (elem->dim() < LIBMESH_DIM)
              libmesh_assert (!(elem->interior_parent()));
          }
 
        // If the sending processor has a remote_elem interior_parent,
        // then all we know is that we'd better have *some*
        // interior_parent
        else if (interior_parent_id == remote_elem->id())
          {
            libmesh_assert(elem->interior_parent());
          }
        else
          {
            Elem * ip =
              mesh->interior_mesh().query_elem_ptr(interior_parent_id);
 
            // The sending processor sees an interior parent here, so
            // if we don't have that interior element, then we'd
            // better have a remote_elem signifying that fact.
            if (!ip)
              libmesh_assert_equal_to (elem->interior_parent(), remote_elem);
            else
              {
                // The sending processor has an interior_parent here,
                // and we have that element, but that does *NOT* mean
                // we're already linking to it.  Perhaps we initially
                // received elem from a processor on which the
                // interior_parent link was remote?
                libmesh_assert(elem->interior_parent() == ip ||
                               elem->interior_parent() == remote_elem);
 
                // If the link was originally remote, update it
                if (elem->interior_parent() == remote_elem)
                  {
                    elem->set_interior_parent(ip);
                  }
              }
          }
      }
 
      // Our neighbor links should be "close to" correct - we may have
      // to update a remote_elem link, and we can check for possible
      // inconsistencies along the way.
      //
      // Even for subactive elements, we'll try to keep neighbor links
      // in good shape now, if only so any future find_neighbors() is
      // idempotent.
      for (auto n : elem->side_index_range())
        {
          const dof_id_type neighbor_id =
            cast_int<dof_id_type>(*in++);
 
          const dof_id_type neighbor_side =
            cast_int<dof_id_type>(*in++);
 
          // If the sending processor sees a domain boundary here,
          // we'd better agree ... unless all we see is a remote_elem?
          // In that case maybe we just couldn't keep up with a user's
          // delete_elem.  Let's trust them.
          if (neighbor_id == DofObject::invalid_id)
            {
              const Elem * my_neigh = elem->neighbor_ptr(n);
              if (my_neigh == remote_elem)
                elem->set_neighbor(n, nullptr);
              else
                libmesh_assert (!my_neigh);
              continue;
            }
 
          // If the sending processor has a remote_elem neighbor here,
          // then all we know is that we'd better *not* have a domain
          // boundary ... except that maybe it's the *sending*
          // processor who missed a delete_elem we saw.
          if (neighbor_id == remote_elem->id())
            {
              // At this level of the code we can't even assert in
              // cases where the neighbor should know what they're
              // talking about, so skip it.
 
              // libmesh_assert(elem->neighbor_ptr(n));
              continue;
            }
 
          Elem * neigh = mesh->query_elem_ptr(neighbor_id);
 
          // The sending processor sees a neighbor here, so if we
          // don't have that neighboring element, then we'd better
          // have a remote_elem signifying that fact.
          if (!neigh)
            {
              libmesh_assert_equal_to (elem->neighbor_ptr(n), remote_elem);
              continue;
            }
 
          // The sending processor has a neighbor here, and we have
          // that element, but that does *NOT* mean we're already
          // linking to it.  Perhaps we initially received both elem
          // and neigh from processors on which their mutual link was
          // remote?
          libmesh_assert(elem->neighbor_ptr(n) == neigh ||
                         elem->neighbor_ptr(n) == remote_elem);
 
          // If the link was originally remote, we should update it,
          // and make sure the appropriate parts of its family link
          // back to us.
          if (elem->neighbor_ptr(n) == remote_elem)
            {
              elem->set_neighbor(n, neigh);
            }
          else
            libmesh_assert(elem->subactive() ||
                           neigh->level() < elem->level() ||
                           neigh->neighbor_ptr(neighbor_side) == elem);
 
          if (neighbor_side != libMesh::invalid_uint)
            elem->make_links_to_me_local(n, neighbor_side);
        }
 
      // Our p level and refinement flags should be "close to" correct
      // if we're not an active element - we might have a p level
      // increased or decreased by changes in remote_elem children.
      //
      // But if we have remote_elem children, then we shouldn't be
      // doing a projection on this inactive element on this
      // processor, so we won't need correct p settings.  Couldn't
      // hurt to update, though.
#ifdef LIBMESH_ENABLE_AMR
      if (elem->processor_id() != mesh->processor_id())
        {
          // Do this simultaneously; otherwise we can get a false
          // positive when a hack_p_level or set_p_refineemnt_flag
          // assertion sees inconsistency between an old flag and new
          // value or vice-versa
          elem->hack_p_level_and_refinement_flag(p_level, p_refinement_flag);
        }
#endif // LIBMESH_ENABLE_AMR
 
      // FIXME: We should add some debug mode tests to ensure that the
      // encoded indexing and boundary conditions are consistent.
    }
  else
    {
      // We don't already have the element, so we need to create it.
 
      // Find the parent if necessary
      Elem * parent = nullptr;
#ifdef LIBMESH_ENABLE_AMR
      // Find a child element's parent
      if (level > 0)
        {
          // Note that we must be very careful to construct the send
          // connectivity so that parents are encountered before
          // children.  If we get here and can't find the parent that
          // is a fatal error.
          parent = mesh->elem_ptr(parent_id);
        }
      // Or assert that the sending processor sees no parent
      else
        libmesh_assert_equal_to (parent_id, DofObject::invalid_id);
#else
      // No non-level-0 elements without AMR
      libmesh_assert_equal_to (level, 0);
#endif
 
      if (type == C0POLYGON)
        elem = std::make_unique<C0Polygon>(n_nodes, parent).release();
      else if (type == C0POLYHEDRON)
        {
          std::vector<std::shared_ptr<Polygon>> sides(n_sides);
          for (auto s : index_range(sides))
            {
              const auto & side_nodes = polyhedron_side_nodes[s];
              auto side = std::make_shared<C0Polygon>
                (cast_int<unsigned int>(side_nodes.size()));
              for (auto n : index_range(side_nodes))
                {
                  const dof_id_type node_id =
                    cast_int<dof_id_type>
                    (*(node_ids_in + side_nodes[n]));
                  side->set_node(n, mesh->node_ptr(node_id));
                }
              sides[s] = std::move(side);
            }
 
          std::unique_ptr<Node> generated_mid_node;
          auto polyhedron = std::make_unique<C0Polyhedron>
            (sides, generated_mid_node, parent);
 
          libmesh_assert_equal_to (polyhedron->n_nodes(), n_nodes);
 
          if (generated_mid_node)
            {
              const dof_id_type mid_node_id =
                cast_int<dof_id_type>(*(node_ids_in + n_nodes - 1));
              polyhedron->set_node(n_nodes - 1,
                                   mesh->node_ptr(mid_node_id));
            }
 
          elem = polyhedron.release();
        }
      else
        elem = Elem::build(type,parent).release();
      libmesh_assert (elem);
 
#ifdef LIBMESH_ENABLE_AMR
      if (level != 0)
        {
          // Since this is a newly created element, the parent must
          // have previously thought of this child as a remote element.
          libmesh_assert_equal_to (parent->child_ptr(which_child_am_i), remote_elem);
 
          parent->add_child(elem, which_child_am_i);
        }
 
      // Assign the refinement flags and levels
      elem->set_p_level(p_level);
      elem->set_refinement_flag(refinement_flag);
      elem->set_p_refinement_flag(p_refinement_flag);
      libmesh_assert_equal_to (elem->level(), level);
 
      // If this element should have children, assign remote_elem to
      // all of them for now, for consistency.  Later unpacked
      // elements may overwrite that.
      if (has_children)
        {
          const unsigned int nc = elem->n_children();
          for (unsigned int c=0; c != nc; ++c)
            elem->add_child(const_cast<RemoteElem *>(remote_elem), c);
        }
 
#endif // LIBMESH_ENABLE_AMR
 
      // Assign the IDs
      elem->subdomain_id()  = subdomain_id;
      elem->processor_id()  = processor_id;
      elem->set_id()        = id;
#ifdef LIBMESH_ENABLE_UNIQUE_ID
      elem->set_unique_id(unique_id);
#endif
 
      // Assign the connectivity
      libmesh_assert_equal_to (elem->n_nodes(), n_nodes);
      libmesh_assert_equal_to (elem->n_sides(), n_sides);
      libmesh_assert_equal_to (elem->n_edges(), n_edges);
 
      if (!elem->runtime_topology() || elem->dim() != 3)
        for (unsigned int n=0; n != n_nodes; n++)
          elem->set_node
            (n, mesh->node_ptr
             (cast_int<dof_id_type>(*(node_ids_in + n))));
 
#ifndef NDEBUG
      for (unsigned int n = 0; n != n_nodes; ++n)
        libmesh_assert_equal_to
          (elem->node_id(n),
           cast_int<dof_id_type>(*(node_ids_in + n)));
#endif
 
      // Set interior_parent if found
      {
        // We may be unpacking an element that was a ghost element on the
        // sender, in which case the element's interior_parent may not be
        // known by the packed element.  We'll have to set such
        // interior_parents to remote_elem ourselves and wait for a
        // later packed element to give us better information.
        if (interior_parent_id == remote_elem->id())
          {
            elem->set_interior_parent
              (const_cast<RemoteElem *>(remote_elem));
          }
        else if (interior_parent_id != DofObject::invalid_id)
          {
            // If we don't have the interior parent element, then it's
            // a remote_elem until we get it.
            Elem * ip =
              mesh->interior_mesh().query_elem_ptr(interior_parent_id);
            if (!ip )
              elem->set_interior_parent
                (const_cast<RemoteElem *>(remote_elem));
            else
              elem->set_interior_parent(ip);
          }
      }
 
      for (auto n : elem->side_index_range())
        {
          const dof_id_type neighbor_id =
            cast_int<dof_id_type>(*in++);
 
            const dof_id_type neighbor_side =
              cast_int<dof_id_type>(*in++);
 
          if (neighbor_id == DofObject::invalid_id)
            continue;
 
          // We may be unpacking an element that was a ghost element on the
          // sender, in which case the element's neighbors may not all be
          // known by the packed element.  We'll have to set such
          // neighbors to remote_elem ourselves and wait for a later
          // packed element to give us better information.
          if (neighbor_id == remote_elem->id())
            {
              elem->set_neighbor(n, const_cast<RemoteElem *>(remote_elem));
              continue;
            }
 
          // If we don't have the neighbor element, then it's a
          // remote_elem until we get it.
          Elem * neigh = mesh->query_elem_ptr(neighbor_id);
          if (!neigh)
            {
              elem->set_neighbor(n, const_cast<RemoteElem *>(remote_elem));
              continue;
            }
 
          // If we have the neighbor element, then link to it, and
          // make sure any appropriate parts of its family link back
          // to us.
          elem->set_neighbor(n, neigh);
 
          if (neighbor_side != libMesh::invalid_uint)
            elem->make_links_to_me_local(n, neighbor_side);
        }
 
      elem->unpack_indexing(in);
 
      mesh->add_elem(elem);
    }
 
  in += elem->packed_indexing_size();
 
  // We check if this is cell holds a boundary ID or not
  auto on_boundary = *in++;
  if (on_boundary)
  {
    // Only treat the sides with caution. This is because we might hold boundary IDs
    // on the sides of the children. This is not supported for edges and shell faces, thus
    // they are treated assuming that only top parents can hold the IDs.
    auto children_on_boundary = *in++;
    if (elem->level() == 0 || children_on_boundary)
    {
      for (auto s : elem->side_index_range())
        {
          const boundary_id_type num_bcs =
            cast_int<boundary_id_type>(*in++);
 
          for (boundary_id_type bc_it=0; bc_it < num_bcs; bc_it++)
            mesh->get_boundary_info().add_side
              (elem, s, cast_int<boundary_id_type>(*in++));
        }
    }
  }
 
  // If this is a coarse element,
  // add any element side or edge boundary condition ids
  if (level == 0)
    {
      for (auto e : elem->edge_index_range())
        {
          const boundary_id_type num_bcs =
            cast_int<boundary_id_type>(*in++);
 
          for (boundary_id_type bc_it=0; bc_it < num_bcs; bc_it++)
            mesh->get_boundary_info().add_edge
              (elem, e, cast_int<boundary_id_type>(*in++));
        }
 
      for (unsigned short sf=0; sf != 2; ++sf)
        {
          const boundary_id_type num_bcs =
            cast_int<boundary_id_type>(*in++);
 
          for (boundary_id_type bc_it=0; bc_it < num_bcs; bc_it++)
            mesh->get_boundary_info().add_shellface
              (elem, sf, cast_int<boundary_id_type>(*in++));
        }
    }
 
  // Return the new element
  return elem;
}

References libMesh::Elem::active(), libMesh::Elem::add_child(), libMesh::BoundaryInfo::add_edge(), libMesh::MeshBase::add_elem(), libMesh::BoundaryInfo::add_shellface(), libMesh::BoundaryInfo::add_side(), libMesh::Elem::build(), libMesh::C0POLYGON, libMesh::C0POLYHEDRON, libMesh::Elem::child_ptr(), libMesh::Elem::dim(), libMesh::Elem::edge_index_range(), libMesh::MeshBase::elem_ptr(), libMesh::MeshBase::get_boundary_info(), libMesh::Elem::hack_p_level_and_refinement_flag(), libMesh::Elem::has_children(), libMesh::DofObject::id(), libMesh::index_range(), libMesh::MeshBase::interior_mesh(), libMesh::Elem::interior_parent(), libMesh::INVALID_ELEM, libMesh::DofObject::invalid_id, libMesh::DofObject::invalid_processor_id, libMesh::Elem::INVALID_REFINEMENTSTATE, libMesh::invalid_uint, libMesh::Elem::level(), libMesh::libmesh_assert(), libMesh::libmesh_ignore(), libMesh::Elem::make_links_to_me_local(), mesh, libMesh::Elem::n_children(), libMesh::Elem::n_edges(), libMesh::Elem::n_nodes(), n_nodes, libMesh::Elem::n_sides(), libMesh::Elem::neighbor_ptr(), libMesh::Elem::node_id(), libMesh::MeshBase::node_ptr(), libMesh::Elem::nodes_on_side(), libMesh::Elem::p_level(), libMesh::Elem::p_refinement_flag(), libMesh::DofObject::packed_indexing_size(), libMesh::Elem::parent(), libMesh::DofObject::processor_id(), libMesh::ParallelObject::processor_id(), libMesh::MeshBase::query_elem_ptr(), libMesh::Elem::refinement_flag(), libMesh::remote_elem, libMesh::Elem::runtime_topology(), libMesh::DofObject::set_id(), libMesh::Elem::set_interior_parent(), libMesh::Elem::set_neighbor(), libMesh::Elem::set_node(), libMesh::Elem::set_p_level(), libMesh::Elem::set_p_refinement_flag(), libMesh::Elem::set_refinement_flag(), libMesh::DofObject::set_unique_id(), libMesh::Elem::side_index_range(), libMesh::Elem::subactive(), libMesh::Elem::subdomain_id(), libMesh::Elem::type(), libMesh::Elem::type_to_dim_map, libMesh::Elem::type_to_n_edges_map, libMesh::Elem::type_to_n_nodes_map, libMesh::Elem::type_to_n_sides_map, and libMesh::DofObject::unpack_indexing().

unpack() [4/4]

template<>

Elem * libMesh::Parallel::Packing< Elem * >::unpack	(	std::vector< largest_id_type >::const_iterator	in,
		ParallelMesh *	mesh
	)

Definition at line 1089 of file parallel_elem.C.

{
  return unpack(in, static_cast<MeshBase*>(mesh));
}

References mesh.

---

The documentation for this class was generated from the following files:

• include/parallel/parallel_elem.h
• src/parallel/parallel_elem.C