reshape.hpp

/*
 *    This file is part of CasADi.
 *
 *    CasADi -- A symbolic framework for dynamic optimization.
 *    Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl,
 *                            KU Leuven. All rights reserved.
 *    Copyright (C) 2011-2014 Greg Horn
 *
 *    CasADi is free software; you can redistribute it and/or
 *    modify it under the terms of the GNU Lesser General Public
 *    License as published by the Free Software Foundation; either
 *    version 3 of the License, or (at your option) any later version.
 *
 *    CasADi 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
 *    Lesser General Public License for more details.
 *
 *    You should have received a copy of the GNU Lesser General Public
 *    License along with CasADi; if not, write to the Free Software
 *    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 *
 */
 
 
#ifndef CASADI_RESHAPE_HPP
#define CASADI_RESHAPE_HPP
 
#include "mx_node.hpp"
#include <map>
#include <stack>
 
 
namespace casadi {
  class CASADI_EXPORT Reshape : public MXNode {
  public:
 
    Reshape(const MX& x, Sparsity sp);
 
    ~Reshape() override {}
 
    template<typename T>
    int eval_gen(const T** arg, T** res, casadi_int* iw, T* w) const;
 
    int eval(const double** arg, double** res, casadi_int* iw, double* w) const override;
 
    int eval_sx(const SXElem** arg, SXElem** res, casadi_int* iw, SXElem* w) const override;
 
    void eval_mx(const std::vector<MX>& arg, std::vector<MX>& res) const override;
 
    void ad_forward(const std::vector<std::vector<MX> >& fseed,
                         std::vector<std::vector<MX> >& fsens) const override;
 
    void ad_reverse(const std::vector<std::vector<MX> >& aseed,
                         std::vector<std::vector<MX> >& asens) const override;
 
    int sp_forward(const bvec_t** arg, bvec_t** res, casadi_int* iw, bvec_t* w) const override;
 
    int sp_reverse(bvec_t** arg, bvec_t** res, casadi_int* iw, bvec_t* w) const override;
 
    std::string disp(const std::vector<std::string>& arg) const override;
 
    void generate(CodeGenerator& g,
                  const std::vector<casadi_int>& arg,
                  const std::vector<casadi_int>& res) const override;
 
    casadi_int op() const override { return OP_RESHAPE;}
 
    casadi_int n_inplace() const override { return 1;}
 
    MX get_reshape(const Sparsity& sp) const override;
 
    bool is_equal(const MXNode* node, casadi_int depth) const override
    { return sameOpAndDeps(node, depth) && sparsity()==node->sparsity();}
 
    MX get_transpose() const override;
 
    bool is_valid_input() const override;
 
    casadi_int n_primitives() const override;
 
    void primitives(std::vector<MX>::iterator& it) const override;
 
    template<typename T>
    void split_primitives_gen(const T& x, typename std::vector<T>::iterator& it) const;
 
 
    void split_primitives(const MX& x, std::vector<MX>::iterator& it) const override;
    void split_primitives(const SX& x, std::vector<SX>::iterator& it) const override;
    void split_primitives(const DM& x, std::vector<DM>::iterator& it) const override;
 
    template<typename T>
    T join_primitives_gen(typename std::vector<T>::const_iterator& it) const;
 
 
    MX join_primitives(std::vector<MX>::const_iterator& it) const override;
    SX join_primitives(std::vector<SX>::const_iterator& it) const override;
    DM join_primitives(std::vector<DM>::const_iterator& it) const override;
 
    bool has_duplicates() const override;
 
    void reset_input() const override;
 
    static MXNode* deserialize(DeserializingStream& s) { return new Reshape(s); }
  protected:
    explicit Reshape(DeserializingStream& s) : MXNode(s) {}
  };
 
} // namespace casadi
 
#endif // CASADI_RESHAPE_HPP