Intrepid2_ViewIterator.hpp

Go to the documentation of this file.

// @HEADER
// ************************************************************************
//
//                           Intrepid2 Package
//                 Copyright (2007) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Kyungjoo Kim  (kyukim@sandia.gov),
//                    Mauro Perego  (mperego@sandia.gov), or
//                    Nate Roberts  (nvrober@sandia.gov)
//
// ************************************************************************
// @HEADER

#ifndef Intrepid2_ViewIterator_h
#define Intrepid2_ViewIterator_h

namespace Intrepid2
{
  template<class ViewType,typename ScalarType>
  class ViewIterator
  {
    ViewType view_;
    Kokkos::Array<int,7> dims_; // 7 is the maximum rank of a Kokkos view
    Kokkos::Array<int,7> index_;
  public:
    KOKKOS_INLINE_FUNCTION
    ViewIterator(ViewType view)
    :
    view_(view)
    {
      for (unsigned d=0; d<view.rank(); d++)
      {
        dims_[d] = view.extent_int(d);
        index_[d] = 0;
      }
      for (unsigned d=view.rank(); d<7; d++)
      {
        dims_[d] = 1;
        index_[d] = 0;
      }
    }
    
    KOKKOS_INLINE_FUNCTION
    ScalarType get()
    {
      return view_.access(index_[0],index_[1],index_[2],index_[3],index_[4],index_[5],index_[6]);
    }
    
    KOKKOS_INLINE_FUNCTION
    void set(ScalarType &value)
    {
      view_.access(index_[0],index_[1],index_[2],index_[3],index_[4],index_[5],index_[6]) = value;
    }
    
    KOKKOS_INLINE_FUNCTION
    int nextIncrementRank()
    {
      const auto rank = view_.rank();
      for (int r=rank-1; r>=0; r--)
      {
        if (index_[r]+1 < dims_[r]) // can increment without going out of bounds in this dimension
        {
          return r;
        }
      }
      // next increment will take us out of bounds
      return -1;
    }
    
    KOKKOS_INLINE_FUNCTION
    int increment()
    {
      const auto rank = view_.rank();
      for (int r=rank-1; r>=0; r--)
      {
        if (index_[r]+1 < dims_[r]) // can increment without going out of bounds in this dimension
        {
          index_[r]++;
          // we've completed the increment
          return r;
        }
        else
        {
          // next rank should be incremented -- this one should reset to 0
          index_[r] = 0;
        }
      }
      // if we get here, we have run through all ranks, setting them to 0 -- we've cycled around
      // and in that sense have not completed the increment
      return -1;
    }
    
    KOKKOS_INLINE_FUNCTION
    bool decrement()
    {
      const auto rank = view_.rank();
      for (int r=rank-1; r>=0; r--)
      {
        if (index_[r]-1 >= 0) // can decrement without going out of bounds in this dimension
        {
          index_[r]--;
          return true; // we've completed the decrement
        }
        else
        {
          // next rank should be decremented -- this one should cycle round to dim_[r]-1
          index_[r] = dims_[r]-1;
        }
      }
      // if we get here, we've gone past 0 in every dimension, so we should return false
      // -- we have not completed the decrement in an in-bounds fashion, but have cycled round to the last value
      // to maintain a clean state, let's reset
      reset();
      return false;
    }
    
    KOKKOS_INLINE_FUNCTION
    int getEnumerationIndex()
    {
      int index_1D = 0;
      for (int d=0; d<7; d++)
      {
        if (d>0) index_1D *= dims_[d-1];
        index_1D += index_[d];
      }
      
      return index_1D;
    }
    
    KOKKOS_INLINE_FUNCTION
    int getIndex(int dimension)
    {
      return index_[dimension];
    }
    
    KOKKOS_INLINE_FUNCTION
    int getExtent(int dimension)
    {
      return dims_[dimension];
    }
    
    KOKKOS_INLINE_FUNCTION
    void reset(int from_rank_number=0)
    {
      for (unsigned d=from_rank_number; d<view_.rank(); d++)
      {
        index_[d] = 0;
      }
    }
    
    KOKKOS_INLINE_FUNCTION
    void setLocation(const Kokkos::Array<int,7> &location)
    {
      index_ = location;
    }
    
    KOKKOS_INLINE_FUNCTION
    Kokkos::Array<int,7> & getLocation()
    {
      return index_;
    }
  };
} // namespace Intrepid2

#endif /* Intrepid2_ViewIterator_h */