add.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
 *
 *  add.h
 *  May 7, 2013
 *
 */

#ifndef TILEDARRAY_TILE_OP_ADD_H__INCLUDED
#define TILEDARRAY_TILE_OP_ADD_H__INCLUDED

#include "tile_interface.h"
#include "../tile_interface/add.h"
#include "../tile_interface/scale.h"
#include "../tile_interface/permute.h"
#include "../tile_interface/clone.h"
#include "../zero_tensor.h"

namespace TiledArray {
  namespace detail {


    template <typename Result, typename Left, typename Right,
        bool LeftConsumable, bool RightConsumable>
    class Add {
    public:

      typedef Add<Result, Left, Right, LeftConsumable, RightConsumable>
          Add_; 
      typedef Left left_type; 
      typedef Right right_type; 
      typedef Result result_type; 

      static constexpr bool left_is_consumable =
          LeftConsumable && std::is_same<result_type, left_type>::value;
      static constexpr bool right_is_consumable =
          RightConsumable && std::is_same<result_type, right_type>::value;

    private:

      // Permuting tile evaluation function
      // These operations cannot consume the argument tile since this operation
      // requires temporary storage space.

      static result_type eval(const left_type& first, const right_type& second,
          const Permutation& perm)
      {
        using TiledArray::add;
        return add(first, second, perm);
      }

      static result_type eval(ZeroTensor, const right_type& second,
          const Permutation& perm)
      {
        TiledArray::Permute<result_type, right_type> permute;
        return permute(second, perm);
      }

      static result_type eval(const left_type& first, ZeroTensor,
          const Permutation& perm)
      {
        TiledArray::Permute<result_type, left_type> permute;
        return permute(first, perm);
      }

      // Non-permuting tile evaluation functions
      // The compiler will select the correct functions based on the
      // consumability of the arguments.

      template <bool LC, bool RC,
          typename std::enable_if<!(LC || RC)>::type* = nullptr>
      static result_type
      eval(const left_type& first, const right_type& second) {
        using TiledArray::add;
        return add(first, second);
      }

      template <bool LC, bool RC,
          typename std::enable_if<LC>::type* = nullptr>
      static result_type eval(left_type& first, const right_type& second) {
        using TiledArray::add_to;
        return add_to(first, second);
      }

      template <bool LC, bool RC,
          typename std::enable_if<!LC && RC>::type* = nullptr>
      static result_type eval(const left_type& first, right_type& second) {
        using TiledArray::add_to;
        return add_to(second, first);
      }

      template <bool LC, bool RC,
          typename std::enable_if<!RC>::type* = nullptr>
      static result_type eval(const ZeroTensor&, const right_type& second) {
        TiledArray::Clone<result_type,right_type> clone;
        return clone(second);
      }

      template <bool LC, bool RC,
          typename std::enable_if<RC>::type* = nullptr>
      static result_type eval(const ZeroTensor&, right_type& second) {
        return second;
      }

      template <bool LC, bool RC,
          typename std::enable_if<!LC>::type* = nullptr>
      static result_type eval(const left_type& first, const ZeroTensor&) {
        TiledArray::Clone<result_type,left_type> clone;
        return clone(first);
      }

      template <bool LC, bool RC,
          typename std::enable_if<LC>::type* = nullptr>
      static result_type eval(left_type& first, const ZeroTensor&) {
        return first;
      }

    public:


      template <typename L, typename R>
      result_type
      operator()(L&& left, R&& right, const Permutation& perm) const {
        return eval(std::forward<L>(left), std::forward<R>(right), perm);
      }


      template <typename L, typename R>
      result_type operator()(L&& left, R&& right) const {
        return Add_::template eval<left_is_consumable, right_is_consumable>(
            std::forward<L>(left), std::forward<R>(right));
      }


      template <typename R>
      result_type consume_left(left_type& left, R&& right) const {
        constexpr bool can_consume_left =
            is_consumable_tile<left_type>::value &&
            std::is_same<result_type, left_type>::value;
        constexpr bool can_consume_right = right_is_consumable &&
            ! (std::is_const<R>::value || can_consume_left);
        return Add_::template eval<can_consume_left, can_consume_right>(left,
            std::forward<R>(right));
      }


      template <typename L>
      result_type consume_right(L&& left, right_type& right) const {
        constexpr bool can_consume_right =
            is_consumable_tile<right_type>::value &&
            std::is_same<result_type, right_type>::value;
        constexpr bool can_consume_left = left_is_consumable &&
            ! (std::is_const<L>::value || can_consume_right);
        return Add_::template eval<can_consume_left, can_consume_right>(
            std::forward<L>(left), right);
      }

    }; // class Add


    template <typename Result, typename Left, typename Right, typename Scalar,
        bool LeftConsumable, bool RightConsumable>
    class ScalAdd {
    public:

      typedef ScalAdd<Result, Left, Right, Scalar, LeftConsumable,
          RightConsumable> ScalAdd_; 
      typedef Left left_type; 
      typedef Right right_type; 
      typedef Scalar scalar_type; 
      typedef Result result_type; 

      static constexpr bool left_is_consumable =
          LeftConsumable && std::is_same<result_type, left_type>::value;
      static constexpr bool right_is_consumable =
          RightConsumable && std::is_same<result_type, right_type>::value;

    private:

      scalar_type factor_; 

      // Permuting tile evaluation function
      // These operations cannot consume the argument tile since this operation
      // requires temporary storage space.

      result_type eval(const left_type& first, const right_type& second,
          const Permutation& perm) const
      {
        using TiledArray::add;
        return add(first, second, factor_, perm);
      }

      result_type eval(ZeroTensor, const right_type& second,
          const Permutation& perm) const
      {
        using TiledArray::scale;
        return scale(second, factor_, perm);
      }

      result_type eval(const left_type& first, ZeroTensor,
          const Permutation& perm) const
      {
        using TiledArray::scale;
        return scale(first, factor_, perm);
      }

      // Non-permuting tile evaluation functions
      // The compiler will select the correct functions based on the
      // consumability of the arguments.

      template <bool LC, bool RC,
          typename std::enable_if<!(LC || RC)>::type* = nullptr>
      result_type eval(const left_type& first, const right_type& second) const {
        using TiledArray::add;
        return add(first, second, factor_);
      }

      template <bool LC, bool RC,
          typename std::enable_if<LC>::type* = nullptr>
      result_type eval(left_type& first, const right_type& second) const {
        using TiledArray::add_to;
        return add_to(first, second, factor_);
      }

      template <bool LC, bool RC,
          typename std::enable_if<!LC && RC>::type* = nullptr>
      result_type eval(const left_type& first, right_type& second) const {
        using TiledArray::add_to;
        return add_to(second, first, factor_);
      }

      template <bool LC, bool RC,
          typename std::enable_if<!RC>::type* = nullptr>
      result_type eval(const ZeroTensor&, const right_type& second) const {
        using TiledArray::scale;
        return scale(second, factor_);
      }

      template <bool LC, bool RC,
          typename std::enable_if<RC>::type* = nullptr>
      result_type eval(const ZeroTensor&, right_type& second) const {
        using TiledArray::scale_to;
        return scale_to(second, factor_);
      }

      template <bool LC, bool RC,
          typename std::enable_if<!LC>::type* = nullptr>
      result_type eval(const left_type& first, const ZeroTensor&) const {
        using TiledArray::scale;
        return scale(first, factor_);
      }

      template <bool LC, bool RC,
          typename std::enable_if<LC>::type* = nullptr>
      result_type eval(left_type& first, const ZeroTensor&) const {
        using TiledArray::scale_to;
        return scale_to(first, factor_);
      }

    public:

      // Compiler generated functions
      ScalAdd(const ScalAdd_&) = default;
      ScalAdd(ScalAdd_&&) = default;
      ~ScalAdd() = default;
      ScalAdd_& operator=(const ScalAdd_&) = default;
      ScalAdd_& operator=(ScalAdd_&&) = default;


      explicit ScalAdd(const Scalar factor) : factor_(factor) { }


      template <typename L, typename R>
      result_type
      operator()(L&& left, R&& right, const Permutation& perm) const {
        return eval(std::forward<L>(left), std::forward<R>(right), perm);
      }


      template <typename L, typename R>
      result_type operator()(L&& left, R&& right) const {
        return ScalAdd_::template eval<left_is_consumable,
            right_is_consumable>(std::forward<L>(left), std::forward<R>(right));
      }


      template <typename R>
      result_type consume_left(left_type& left, R&& right) const {
        constexpr bool can_consume_left =
            is_consumable_tile<left_type>::value &&
            std::is_same<result_type, left_type>::value;
        constexpr bool can_consume_right = right_is_consumable &&
            ! (std::is_const<R>::value || can_consume_left);
        return ScalAdd_::template eval<can_consume_left, can_consume_right>(left,
            std::forward<R>(right));
      }


      template <typename L>
      result_type consume_right(L&& left, right_type& right) const {
        constexpr bool can_consume_right =
            is_consumable_tile<right_type>::value &&
            std::is_same<result_type, right_type>::value;
        constexpr bool can_consume_left = left_is_consumable &&
            ! (std::is_const<L>::value || can_consume_right);
        return ScalAdd_::template eval<can_consume_left, can_consume_right>(
            std::forward<L>(left), right);
      }

    }; // class ScalAdd

  } // namespace detail
} // namespace TiledArray

#endif // TILEDARRAY_TILE_OP_ADD_H__INCLUDED