localAdjoints.hpp

/*
 * CoDiPack, a Code Differentiation Package
 *
 * Copyright (C) 2015-2024 Chair for Scientific Computing (SciComp), University of Kaiserslautern-Landau
 * Homepage: http://scicomp.rptu.de
 * Contact:  Prof. Nicolas R. Gauger (codi@scicomp.uni-kl.de)
 *
 * Lead developers: Max Sagebaum, Johannes Blühdorn (SciComp, University of Kaiserslautern-Landau)
 *
 * This file is part of CoDiPack (http://scicomp.rptu.de/software/codi).
 *
 * CoDiPack 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.
 *
 * CoDiPack 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 CoDiPack.
 * If not, see <http://www.gnu.org/licenses/>.
 *
 * For other licensing options please contact us.
 *
 * Authors:
 *  - SciComp, University of Kaiserslautern-Landau:
 *    - Max Sagebaum
 *    - Johannes Blühdorn
 *    - Former members:
 *      - Tim Albring
 */
#pragma once
 
#include <algorithm>
#include <vector>
 
#include "../../traits/adjointVectorTraits.hpp"
#include "internalAdjointsInterface.hpp"
 
namespace codi {
 
  template<typename T_Gradient, typename T_Identifier, typename T_Tape>
  struct LocalAdjoints : public InternalAdjointsInterface<T_Gradient, T_Identifier, T_Tape> {
    public:
 
      using Tape = CODI_DD(T_Tape,
                           CODI_T(FullTapeInterface<double, double, int, EmptyPosition>));  
      using Gradient = CODI_DD(T_Gradient, double);                                         
      using Identifier = CODI_DD(T_Identifier, int);                                        
 
    private:
 
      std::vector<Gradient> adjoints;  
 
    public:
 
      LocalAdjoints(size_t initialSize)
          : InternalAdjointsInterface<Gradient, Identifier, Tape>(initialSize), adjoints(initialSize) {}
 
      CODI_INLINE Gradient& operator[](Identifier const& identifier) {
        return adjoints[(size_t)identifier];
      }
 
      CODI_INLINE Gradient const& operator[](Identifier const& identifier) const {
        return adjoints[(size_t)identifier];
      }
 
      CODI_INLINE Gradient* data() {
        return adjoints.data();
      }
 
      CODI_INLINE size_t size() const {
        return adjoints.size();
      }
 
      CODI_NO_INLINE void resize(Identifier const& newSize) {
        adjoints.resize((size_t)newSize);
      }
 
      CODI_INLINE void zeroAll(Identifier const& maxIdentifier) {
        Identifier maxSize = std::min(maxIdentifier + 1, (Identifier)adjoints.size());
        for (Identifier i = 0; i < maxSize; i += 1) {
          adjoints[i] = Gradient();
        }
      }
 
      CODI_INLINE void swap(LocalAdjoints& other) {
        std::swap(adjoints, other.adjoints);
      }
 
      CODI_INLINE void beginUse() {}
 
      CODI_INLINE void endUse() {}
  };
 
#ifndef DOXYGEN_DISABLE
 
  namespace AdjointVectorTraits {
    template<typename T_Gradient, typename T_Identifier, typename T_Tape>
    struct GradientImplementation<LocalAdjoints<T_Gradient, T_Identifier, T_Tape>> {
      public:
        using Gradient = T_Gradient;
    };
  }
#endif
}