refinement.hh

Go to the documentation of this file.

// SPDX-FileCopyrightText: Copyright (C) DUNE Project contributors, see file LICENSE.md in module root
// SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception
// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_ALBERTA_REFINEMENT_HH
#define DUNE_ALBERTA_REFINEMENT_HH
 
#include <cassert>
 
#include <dune/grid/albertagrid/misc.hh>
#include <dune/grid/albertagrid/elementinfo.hh>
 
#if HAVE_ALBERTA
 
namespace Dune
{
 
  namespace Alberta
  {
 
    // Internal Forward Declarations
    // -----------------------------
 
    template< int dim, int codim >
    struct ForEachInteriorSubChild;
 
 
 
    // Patch
    // -----
 
    template< int dim >
    class Patch
    {
      typedef Patch< dim > This;
 
      static_assert(((dim >= 1) && (dim <= 3)),
                    "Alberta supports only dimensions 1, 2, 3");
 
    public:
      static const int dimension = dim;
 
      typedef Alberta::ElementInfo< dimension > ElementInfo;
 
      typedef ALBERTA RC_LIST_EL ElementList;
 
    private:
      ElementList *list_;
      int count_;
 
    public:
      Patch ( ElementList *list, int count )
        : list_( list ),
          count_( count )
      {
        assert( count > 0 );
      }
 
      Element *operator[] ( int i ) const;
 
      int count () const
      {
        return count_;
      }
 
      template< class LevelProvider >
      ElementInfo elementInfo ( int i, const LevelProvider &levelProvider ) const;
 
      int elementType ( int i ) const;
      bool hasNeighbor ( int i, int neighbor ) const;
      int neighborIndex ( int i, int neighbor ) const;
 
      template< class Functor >
      void forEach ( Functor &functor ) const
      {
        for( int i = 0; i < count(); ++i )
          functor( (*this)[ i ] );
      }
 
      template< int codim, class Functor >
      void forEachInteriorSubChild ( Functor &functor ) const
      {
        ForEachInteriorSubChild< dim, codim >::apply( functor, *this );
      }
    };
 
 
    template< int dim >
    inline Element *Patch< dim >::operator[] ( int i ) const
    {
      assert( (i >= 0) && (i < count()) );
      return list_[ i ].el_info.el;
    }
 
 
    template< int dim >
    template< class LevelProvider >
    inline typename Patch< dim >::ElementInfo
    Patch< dim >::elementInfo ( int i, const LevelProvider &levelProvider ) const
    {
      assert( (i >= 0) && (i < count()) );
      return ElementInfo::createFake( list_[ i ].el_info );
    }
 
    template<>
    template< class LevelProvider >
    inline typename Patch< 2 >::ElementInfo
    Patch< 2 >::elementInfo ( int i, const LevelProvider &levelProvider ) const
    {
      assert( (i >= 0) && (i < count()) );
      const MeshPointer< 2 > &mesh = levelProvider.mesh();
      const Element *element = (*this)[ i ];
      const int level = levelProvider( element );
      return ElementInfo::createFake( mesh, element, level );
    }
 
 
    template< int dim >
    inline int Patch< dim >::elementType ( int i ) const
    {
      assert( (i >= 0) && (i < count()) );
      return list_[ i ].el_info.el_type;
    }
 
 
    template< int dim >
    inline bool Patch< dim >::hasNeighbor ( int i, int neighbor ) const
    {
      return (list_[ i ].neigh[ neighbor ] != NULL);
    }
 
    template< int dim >
    inline int Patch< dim >::neighborIndex ( int i, int neighbor ) const
    {
      assert( hasNeighbor( i, neighbor ) );
      return (list_[ i ].neigh[ neighbor ]->no);
    }
 
 
 
    // ForEachInteriorSubChild
    // -----------------------
 
    template< int dim >
    struct ForEachInteriorSubChild< dim, 0 >
    {
      template< class Functor >
      static void apply ( Functor &functor, const Patch< dim > &patch )
      {
        for( int i = 0; i < patch.count(); ++i )
        {
          Element *const father = patch[ i ];
          functor( father->child[ 0 ], 0 );
          functor( father->child[ 1 ], 0 );
        }
      }
    };
 
    template< int dim >
    struct ForEachInteriorSubChild< dim, dim >
    {
      template< class Functor >
      static void apply ( Functor &functor, const Patch< dim > &patch )
      {
        functor( patch[ 0 ]->child[ 0 ], dim );
      }
    };
 
    template<>
    struct ForEachInteriorSubChild< 2, 1 >
    {
      template< class Functor >
      static void apply ( Functor &functor, const Patch< 2 > &patch )
      {
        // see alberta/src/2d/lagrange_2_2d.c for details
        Element *const firstFather = patch[ 0 ];
 
        Element *const firstChild = firstFather->child[ 0 ];
        functor( firstChild, 0 );
        functor( firstChild, 1 );
 
        functor( firstFather->child[ 1 ], 1 );
 
        if( patch.count() > 1 )
        {
          Element *const father = patch[ 1 ];
          functor( father->child[ 0 ], 1 );
        }
      }
    };
 
    template<>
    struct ForEachInteriorSubChild< 3, 1 >
    {
      template< class Functor >
      static void apply ( Functor &functor, const Patch< 3 > &patch )
      {
        // see alberta/src/3d/lagrange_3_3d.c for details
        Element *const firstFather = patch[ 0 ];
 
        Element *const firstChild = firstFather->child[ 0 ];
        functor( firstChild, 0 );
        functor( firstChild, 1 );
        functor( firstChild, 2 );
 
        Element *const secondChild = firstFather->child[ 1 ];
        functor( secondChild, 1 );
        functor( secondChild, 2 );
 
        for( int i = 1; i < patch.count(); ++i )
        {
          Element *const father = patch[ i ];
          const int type = patch.elementType( i );
 
          int lr_set = 0;
          if( patch.hasNeighbor( i, 0 ) && (patch.neighborIndex( i, 0 ) < i) )
            lr_set |= 1;
          if( patch.hasNeighbor( i, 1 ) && (patch.neighborIndex( i, 1 ) < i) )
            lr_set |= 2;
          assert( lr_set != 0 );
 
          functor( father->child[ 0 ], 0 );
          switch( lr_set )
          {
          case 1 :
            functor( father->child[ 0 ], 2 );
            functor( father->child[ 1 ], (type == 0 ? 1 : 2) );
            break;
 
          case 2 :
            functor( father->child[ 0 ], 1 );
            functor( father->child[ 1 ], (type == 0 ? 2 : 1) );
            break;
          }
        }
      }
    };
 
    template<>
    struct ForEachInteriorSubChild< 3, 2 >
    {
      template< class Functor >
      static void apply ( Functor &functor, const Patch< 3 > &patch )
      {
        // see alberta/src/3d/lagrange_2_3d.c for details
        Element *const firstFather = patch[ 0 ];
 
        Element *const firstChild = firstFather->child[ 0 ];
        functor( firstChild, 2 );
        functor( firstChild, 4 );
        functor( firstChild, 5 );
 
        functor( firstFather->child[ 1 ], 2 );
 
        for( int i = 1; i < patch.count(); ++i )
        {
          Element *const father = patch[ i ];
 
          int lr_set = 0;
          if( patch.hasNeighbor( i, 0 ) && (patch.neighborIndex( i, 0 ) < i) )
            lr_set = 1;
          if( patch.hasNeighbor( i, 1 ) && (patch.neighborIndex( i, 1 ) < i) )
            lr_set += 2;
          assert( lr_set != 0 );
 
          switch( lr_set )
          {
          case 1 :
            functor( father->child[ 0 ], 4 );
            break;
 
          case 2 :
            functor( father->child[ 0 ], 5 );
            break;
          }
        }
      }
    };
 
 
 
    // GeometryInFather
    // ----------------
 
    template< int dim >
    struct GeometryInFather;
 
    template<>
    struct GeometryInFather< 1 >
    {
      static const int dim = 1;
 
      typedef Real LocalVector[ dim ];
 
      static const LocalVector &
      coordinate ( int child, int /* orientation */, int i )
      {
        static const Real coords[ 2 ][ dim+1 ][ dim ]
          = { { {0.0}, {0.5} }, { {0.5}, {1.0} } };
        assert( (i >= 0) && (i <= dim) );
        return coords[ child ][ i ];
      }
    };
 
    template<>
    struct GeometryInFather< 2 >
    {
      static const int dim = 2;
 
      typedef Real LocalVector[ dim ];
 
      static const LocalVector &
      coordinate ( int child, int /* orientation */, int i )
      {
        static const Real coords[ 2 ][ dim+1 ][ dim ]
          = { { {0.0, 1.0}, {0.0, 0.0}, {0.5, 0.0} },
              { {1.0, 0.0}, {0.0, 1.0}, {0.5, 0.0} } };
        assert( (i >= 0) && (i <= dim) );
        return coords[ child ][ i ];
      }
    };
 
    template<>
    struct GeometryInFather< 3 >
    {
      static const int dim = 3;
 
      typedef Real LocalVector[ dim ];
 
      static const LocalVector &
      coordinate ( int child, int orientation, int i )
      {
        static const Real coords[ 2 ][ dim+1 ][ dim ]
          = { { {0.0, 0.0, 0.0}, {0.0, 1.0, 0.0}, {0.0, 0.0, 1.0}, {0.5, 0.0, 0.0} },
              { {1.0, 0.0, 0.0}, {0.0, 1.0, 0.0}, {0.0, 0.0, 1.0}, {0.5, 0.0, 0.0} } };
        static const int flip[ 2 ][ 2 ][ dim+1 ]
          = { { {0, 1, 2, 3}, {0, 1, 2, 3} }, { {0, 2, 1, 3}, {0, 1, 2, 3} } };
        assert( (i >= 0) && (i <= dim) );
        i = flip[ child ][ orientation ][ i ];
        return coords[ child ][ i ];
      }
    };
 
  }
 
}
 
#endif // #if HAVE_ALBERTA
 
#endif