multimesh_dg_neighbor_tree.h

#ifndef __H2D_MULTIMESH_DG_NEIGHBOR_TREE_H
#define __H2D_MULTIMESH_DG_NEIGHBOR_TREE_H

#include "multimesh_dg_neighbor_tree_node.h"
#include "mesh/traverse.h"
#include "neighbor_search.h"

namespace Hermes
{
  namespace Hermes2D
  {
    template<typename Scalar>
    class MultimeshDGNeighborTree
    {
    public:
      static void process_edge(NeighborSearch<Scalar>** neighbor_searches, unsigned char num_neighbor_searches, unsigned int& num_neighbors, bool*& processed);

    private:
      static void build_multimesh_tree(MultimeshDGNeighborTreeNode* root, NeighborSearch<Scalar>** neighbor_searches, int number);

      static void insert_into_multimesh_tree(MultimeshDGNeighborTreeNode* node, unsigned int* transformations, unsigned int transformation_count);

      static std::vector<std::vector<unsigned int>*> get_multimesh_neighbors_transformations(MultimeshDGNeighborTreeNode* multimesh_tree);

      static void traverse_multimesh_tree(MultimeshDGNeighborTreeNode* node, std::vector<std::vector<unsigned int>*>& running_transformations);

      static void update_neighbor_search(NeighborSearch<Scalar>* ns, MultimeshDGNeighborTreeNode* multimesh_tree);

      static MultimeshDGNeighborTreeNode* find_node(unsigned int* transformations, unsigned int transformation_count, MultimeshDGNeighborTreeNode* node);

      static int update_ns_subtree(NeighborSearch<Scalar>* ns, MultimeshDGNeighborTreeNode* node, unsigned int ith_neighbor);

      static void traverse_multimesh_subtree(MultimeshDGNeighborTreeNode* node, std::vector<std::vector<unsigned int>*>& running_central_transformations,
        std::vector<std::vector<unsigned int>*>& running_neighbor_transformations, const typename NeighborSearch<Scalar>::NeighborEdgeInfo& edge_info, const int& active_edge, const int& mode);

      friend class DiscreteProblem < Scalar > ;
      friend class DiscreteProblemDGAssembler < Scalar > ;
      friend class KellyTypeAdapt < Scalar > ;
    };
  }
}
#endif