boundaryiterators.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_GRID_IO_FILE_VTK_BOUNDARYITERATORS_HH
#define DUNE_GRID_IO_FILE_VTK_BOUNDARYITERATORS_HH
 
#include <iterator>
#include <memory>
 
#include <dune/common/iteratorfacades.hh>
 
#include <dune/grid/io/file/vtk/corner.hh>
#include <dune/grid/io/file/vtk/corneriterator.hh>
#include <dune/grid/io/file/vtk/functionwriter.hh>
 
namespace Dune {
 
 
  namespace VTK {
 
 
    template<typename GV>
    class BoundaryIterator
      : public ForwardIteratorFacade
        < BoundaryIterator<GV>,
            const typename GV::Intersection,
            const typename GV::Intersection&,
            typename std::iterator_traits<typename GV::template Codim<0>::
                Iterator>::difference_type>
    {
    public:
      // reiterator the facades typedefs here
      typedef BoundaryIterator<GV> DerivedType;
      typedef const typename GV::Intersection Value;
      typedef Value& Reference;
      typedef typename GV::template Codim<0>::Iterator ElementIterator;
      typedef typename GV::IntersectionIterator IntersectionIterator;
      typedef typename std::iterator_traits<ElementIterator>::difference_type
      DifferenceType;
 
    private:
      typedef ForwardIteratorFacade<DerivedType, Value, Reference,
          DifferenceType> Facade;
 
      const GV* gv;
      ElementIterator eit;
      std::shared_ptr<IntersectionIterator> iit;
 
      bool valid() const {
        // we're valid if we're passed-the-end
        if(eit == gv->template end<0>()) return true;
        // or if we're on a boundary
        if((*iit)->boundary() && !(*iit)->neighbor()) return true;
        // otherwise we're invalid
        return false;
      }
 
      void basic_increment() {
        ++*iit;
        if(*iit == gv->iend(*eit)) {
          iit.reset();
          ++eit;
          if(eit != gv->template end<0>())
            iit.reset(new IntersectionIterator(gv->ibegin(*eit)));
        }
      }
 
    public:
      Reference dereference() const {
        return **iit;
      }
      bool equals(const DerivedType& other) const {
        if(eit != other.eit) return false;
 
        // this is a bit tricky, since we may not compare iit if we are
        // passed-the-end
        bool mePassedTheEnd = eit == gv->template end<0>();
        bool otherPassedTheEnd = other.eit == other.gv->template end<0>();
 
        // both passed-the-end => consider them equal
        if(mePassedTheEnd && otherPassedTheEnd) return true;
 
        // one passed the end => not equal
        if(mePassedTheEnd || otherPassedTheEnd) return false;
 
        // none passed-the-end => do their iit iterators match?
        return *iit == *other.iit;
      }
 
      void increment() {
        basic_increment();
        while(!valid()) basic_increment();
      }
 
 
      BoundaryIterator(const GV& gv_, const ElementIterator& eit_,
                       const IntersectionIterator& iit_)
        : gv(&gv_), eit(eit_), iit(new IntersectionIterator(iit_))
      {
        while(!valid()) basic_increment();
      }
 
      BoundaryIterator(const GV& gv_, const ElementIterator& eit_)
        : gv(&gv_), eit(eit_)
      {
        if(eit != gv->template end<0>())
          iit.reset(new IntersectionIterator(gv->ibegin(*eit)));
 
        while(!valid()) basic_increment();
      }
 
      BoundaryIterator(const GV& gv_, bool end = false)
        : gv(&gv_), eit(end ? gv->template end<0>() : gv->template begin<0>())
      {
        if(eit != gv->template end<0>())
          iit.reset(new IntersectionIterator(gv->ibegin(*eit)));
 
        while(!valid()) basic_increment();
      }
    };
 
    template<typename ElementIndexSet>
    class IntersectionIndexSet {
      const ElementIndexSet& eis;
 
    public:
      IntersectionIndexSet(const ElementIndexSet& eis_)
        : eis(eis_)
      { }
    };
 
    template<typename GV>
    class NonConformingBoundaryIteratorFactory {
      const GV& gv;
 
    public:
      static const unsigned dimCell = GV::dimension-1;
 
      typedef typename GV::Intersection Cell;
      typedef BoundaryIterator<GV> CellIterator;
 
      typedef VTK::Corner<Cell> Corner;
      typedef VTK::CornerIterator<CellIterator> CornerIterator;
 
      typedef Corner Point;
      typedef CornerIterator PointIterator;
 
      typedef NonConformingConnectivityWriter<Cell> ConnectivityWriter;
      typedef typename GV::Communication Communication;
 
      explicit NonConformingBoundaryIteratorFactory(const GV& gv_)
        : gv(gv_)
      { }
 
      CellIterator beginCells() const {
        return CellIterator(gv);
      }
      CellIterator endCells() const {
        return CellIterator(gv, true);
      }
 
      CornerIterator beginCorners() const {
        return CornerIterator(beginCells(), endCells());
      }
      CornerIterator endCorners() const {
        return CornerIterator(endCells());
      }
 
      PointIterator beginPoints() const { return beginCorners(); }
      PointIterator endPoints() const { return endCorners(); }
 
      ConnectivityWriter makeConnectivity() const {
        return ConnectivityWriter();
      }
      const Communication& comm() const {
        return gv.comm();
      }
    };
 
  } // namespace VTK
 
 
} // namespace Dune
 
#endif // DUNE_GRID_IO_FILE_VTK_BOUNDARYITERATORS_HH