shift.h

Go to the documentation of this file.

/*
 *  This file is a part of TiledArray.
 *  Copyright (C) 2013  Virginia Tech
 *
 *  This program is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 *  Justus Calvin
 *  Department of Chemistry, Virginia Tech
 *
 *  shift.h
 *  June 7, 2015
 *
 */
 
#ifndef TILEDARRAY_TILE_OP_SHIFT_H__INCLUDED
#define TILEDARRAY_TILE_OP_SHIFT_H__INCLUDED
 
#include "../tile_interface/permute.h"
#include "../tile_interface/shift.h"
 
namespace TiledArray {
namespace detail {
 
 
template <typename Result, typename Arg, bool Consumable>
class Shift {
 public:
  typedef Shift<Result, Arg, Consumable> Shift_;  
  typedef Arg argument_type;                      
  typedef Result result_type;                     
 
  static constexpr bool is_consumable =
      Consumable && std::is_same<result_type, argument_type>::value;
 
 private:
  std::vector<long> range_shift_;
 
  // Permuting tile evaluation function
  // These operations cannot consume the argument tile since this operation
  // requires temporary storage space.
  template <typename Perm, typename = std::enable_if_t<
                               TiledArray::detail::is_permutation_v<Perm>>>
  result_type eval(const argument_type& arg, const Perm& perm) const {
    TiledArray::Permute<result_type, argument_type> permute;
    TiledArray::ShiftTo<result_type, result_type> shift_to;
    result_type result = permute(arg, perm);
    shift_to(result, range_shift_);
    return result;
  }
 
  // Non-permuting tile evaluation functions
  // The compiler will select the correct functions based on the
  // consumability of the arguments.
 
  template <bool C, typename = void>
  auto eval(const argument_type& arg) const {
    TiledArray::Shift<result_type, argument_type> shift;
    return shift(arg, range_shift_);
  }
 
  template <bool C, typename = typename std::enable_if<C>::type>
  auto eval(argument_type& arg) const {
    TiledArray::ShiftTo<result_type, argument_type> shift_to;
    shift_to(arg, range_shift_);
    return arg;
  }
 
  template <bool C, typename = typename std::enable_if<C>::type>
  auto eval(argument_type&& arg) const {
    TiledArray::ShiftTo<result_type, argument_type> shift_to;
    shift_to(arg, range_shift_);
    return arg;
  }
 
 public:
  // Compiler generated functions
  Shift() = delete;
  Shift(const Shift_&) = default;
  Shift(Shift_&&) = default;
  ~Shift() = default;
  Shift& operator=(const Shift_&) = default;
  Shift& operator=(Shift_&&) = default;
 
 
  Shift(const std::vector<long>& range_shift) : range_shift_(range_shift) {}
 
 
  template <typename Perm, typename = std::enable_if_t<
                               TiledArray::detail::is_permutation_v<Perm>>>
  result_type operator()(const argument_type& arg, const Perm& perm) const {
    return eval(arg, perm);
  }
 
 
  template <typename A>
  result_type operator()(A&& arg) const {
    return Shift_::template eval<is_consumable>(std::forward<A>(arg));
  }
 
 
  template <typename A>
  result_type consume(A& arg) const {
    constexpr bool can_consume =
        is_consumable_tile<argument_type>::value &&
        std::is_same<result_type, argument_type>::value;
    return Shift_::template eval<can_consume>(arg);
  }
 
};  // class Shift
 
 
template <typename Result, typename Arg, typename Scalar, bool Consumable>
class ScalShift {
 public:
  typedef ScalShift<Result, Arg, Scalar, Consumable>
      ScalShift_;              
  typedef Arg argument_type;   
  typedef Scalar scalar_type;  
  typedef Result result_type;  
 
  static constexpr bool is_consumable =
      Consumable && std::is_same<result_type, argument_type>::value;
 
 private:
  std::vector<long> range_shift_;  
  scalar_type factor_;             
 
 public:
  // Permuting tile evaluation function
  // These operations cannot consume the argument tile since this operation
  // requires temporary storage space.
  template <typename Perm, typename = std::enable_if_t<
                               TiledArray::detail::is_permutation_v<Perm>>>
  result_type eval(const argument_type& arg, const Perm& perm) const {
    using TiledArray::scale;
    using TiledArray::shift_to;
    result_type result = scale(arg, factor_, perm);
    return shift_to(result, range_shift_);
  }
 
  // Non-permuting tile evaluation functions
  // The compiler will select the correct functions based on the
  // consumability of the arguments.
 
  template <bool C>
  typename std::enable_if<!C, result_type>::type eval(
      const argument_type& arg) const {
    using TiledArray::scale;
    using TiledArray::shift_to;
    result_type result = scale(arg, factor_);
    return shift_to(result, range_shift_);
  }
 
  template <bool C>
  typename std::enable_if<C, result_type>::type eval(argument_type& arg) const {
    using TiledArray::scale_to;
    using TiledArray::shift_to;
    scale_to(arg, factor_);
    shift_to(arg, range_shift_);
    return arg;
  }
 
 public:
  // Compiler generated functions
  ScalShift() = delete;
  ScalShift(const ScalShift_&) = default;
  ScalShift(ScalShift_&&) = default;
  ~ScalShift() = default;
  ScalShift_& operator=(const ScalShift_&) = default;
  ScalShift_& operator=(ScalShift_&&) = default;
 
 
  ScalShift(const std::vector<long>& range_shift, const scalar_type factor)
      : range_shift_(range_shift), factor_(factor) {}
 
 
  template <typename Perm, typename = std::enable_if_t<
                               TiledArray::detail::is_permutation_v<Perm>>>
  result_type operator()(const argument_type& arg, const Perm& perm) const {
    return eval(arg, perm);
  }
 
 
  template <typename A>
  result_type operator()(A&& arg) const {
    return ScalShift_::template eval<is_consumable>(std::forward<A>(arg));
  }
 
 
  result_type consume(argument_type& arg) const {
    constexpr bool can_consume =
        is_consumable_tile<argument_type>::value &&
        std::is_same<result_type, argument_type>::value;
    return ScalShift_::template eval<can_consume>(arg);
  }
 
};  // class ScalShift
 
}  // namespace detail
}  // namespace TiledArray
 
#endif  // TILEDARRAY_TILE_OP_SHIFT_H__INCLUDED