sparsity_cast.hpp
1 /*
2  * This file is part of CasADi.
3  *
4  * CasADi -- A symbolic framework for dynamic optimization.
5  * Copyright (C) 2010-2023 Joel Andersson, Joris Gillis, Moritz Diehl,
6  * KU Leuven. All rights reserved.
7  * Copyright (C) 2011-2014 Greg Horn
8  *
9  * CasADi is free software; you can redistribute it and/or
10  * modify it under the terms of the GNU Lesser General Public
11  * License as published by the Free Software Foundation; either
12  * version 3 of the License, or (at your option) any later version.
13  *
14  * CasADi is distributed in the hope that it will be useful,
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
17  * Lesser General Public License for more details.
18  *
19  * You should have received a copy of the GNU Lesser General Public
20  * License along with CasADi; if not, write to the Free Software
21  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
22  *
23  */
24 
25 
26 #ifndef CASADI_SPARSITY_CAST_HPP
27 #define CASADI_SPARSITY_CAST_HPP
28 
29 #include "mx_node.hpp"
30 #include <map>
31 #include <stack>
32 
34 
35 namespace casadi {
36 
37  class CASADI_EXPORT SparsityCast : public MXNode {
38  public:
39 
41  SparsityCast(const MX& x, Sparsity sp);
42 
44  ~SparsityCast() override {}
45 
47  template<typename T>
48  int eval_gen(const T** arg, T** res, casadi_int* iw, T* w) const;
49 
51  int eval(const double** arg, double** res, casadi_int* iw, double* w) const override;
52 
54  int eval_sx(const SXElem** arg, SXElem** res, casadi_int* iw, SXElem* w) const override;
55 
59  void eval_linear(const std::vector<std::array<MX, 3> >& arg,
60  std::vector<std::array<MX, 3> >& res) const override {
61  eval_linear_rearrange(arg, res);
62  }
63 
67  void eval_mx(const std::vector<MX>& arg, std::vector<MX>& res) const override;
68 
72  void ad_forward(const std::vector<std::vector<MX> >& fseed,
73  std::vector<std::vector<MX> >& fsens) const override;
74 
78  void ad_reverse(const std::vector<std::vector<MX> >& aseed,
79  std::vector<std::vector<MX> >& asens) const override;
80 
84  int sp_forward(const bvec_t** arg, bvec_t** res, casadi_int* iw, bvec_t* w) const override;
85 
89  int sp_reverse(bvec_t** arg, bvec_t** res, casadi_int* iw, bvec_t* w) const override;
90 
94  std::string disp(const std::vector<std::string>& arg) const override;
95 
99  void generate(CodeGenerator& g,
100  const std::vector<casadi_int>& arg,
101  const std::vector<casadi_int>& res,
102  const std::vector<bool>& arg_is_ref,
103  std::vector<bool>& res_is_ref) const override;
104 
108  casadi_int op() const override { return OP_SPARSITY_CAST;}
109 
111  casadi_int n_inplace() const override { return 1;}
112 
114  MX get_reshape(const Sparsity& sp) const override;
115 
119  MX get_nzref(const Sparsity& sp, const std::vector<casadi_int>& nz) const override;
120 
122  MX get_sparsity_cast(const Sparsity& sp) const override;
123 
127  bool is_equal(const MXNode* node, casadi_int depth) const override
128  { return sameOpAndDeps(node, depth) && sparsity()==node->sparsity();}
129 
131  MX get_transpose() const override;
132 
136  bool is_valid_input() const override;
137 
141  casadi_int n_primitives() const override;
142 
146  void primitives(std::vector<MX>::iterator& it) const override;
147 
149  template<typename T>
150  void split_primitives_gen(const T& x, typename std::vector<T>::iterator& it) const;
151 
153 
156  void split_primitives(const MX& x, std::vector<MX>::iterator& it) const override;
157  void split_primitives(const SX& x, std::vector<SX>::iterator& it) const override;
158  void split_primitives(const DM& x, std::vector<DM>::iterator& it) const override;
160 
162  template<typename T>
163  T join_primitives_gen(typename std::vector<T>::const_iterator& it) const;
164 
166 
169  MX join_primitives(std::vector<MX>::const_iterator& it) const override;
170  SX join_primitives(std::vector<SX>::const_iterator& it) const override;
171  DM join_primitives(std::vector<DM>::const_iterator& it) const override;
173 
177  bool has_duplicates() const override;
178 
182  void reset_input() const override;
183 
187  static MXNode* deserialize(DeserializingStream& s) { return new SparsityCast(s); }
188  protected:
193  };
194 
195 } // namespace casadi
197 
198 #endif // CASADI_SPARSITY_CAST_HPP
Helper class for C code generation.
Helper class for Serialization.
Node class for MX objects.
Definition: mx_node.hpp:51
const Sparsity & sparsity() const
Get the sparsity.
Definition: mx_node.hpp:372
MX - Matrix expression.
Definition: mx.hpp:92
Sparse matrix class. SX and DM are specializations.
Definition: matrix_decl.hpp:99
The basic scalar symbolic class of CasADi.
Definition: sx_elem.hpp:75
SparsityCast(DeserializingStream &s)
Deserializing constructor.
bool is_equal(const MXNode *node, casadi_int depth) const override
Check if two nodes are equivalent up to a given depth.
~SparsityCast() override
Destructor.
static MXNode * deserialize(DeserializingStream &s)
Deserialize without type information.
void eval_linear(const std::vector< std::array< MX, 3 > > &arg, std::vector< std::array< MX, 3 > > &res) const override
Evaluate the MX node on a const/linear/nonlinear partition.
casadi_int n_inplace() const override
Can the operation be performed inplace (i.e. overwrite the result)
casadi_int op() const override
Get the operation.
General sparsity class.
Definition: sparsity.hpp:106
The casadi namespace.
Definition: archiver.cpp:28
unsigned long long bvec_t
@ OP_SPARSITY_CAST
Definition: calculus.hpp:200