1 #ifndef CPPAD_CG_LANGUAGE_LATEX_ARRAYS_INCLUDED 2 #define CPPAD_CG_LANGUAGE_LATEX_ARRAYS_INCLUDED 22 void LanguageLatex<Base>::printArrayCreationOp(OperationNode<Base>& array) {
23 CPPADCG_ASSERT_KNOWN(array.getArguments().size() > 0,
"Invalid number of arguments for array creation operation");
24 const size_t id = getVariableID(array);
25 const std::vector<Argument<Base> >& args = array.getArguments();
26 const size_t argSize = args.size();
28 size_t startPos =
id - 1;
30 bool firstElement =
true;
31 for (
size_t i = 0; i < argSize; i++) {
32 bool newValue = !isSameArgument(args[i], _tmpArrayValues[startPos + i]);
36 _code << _startAlgLine << _startEq
37 << auxArrayName_ << _assignStr << _nameGen->generateTemporaryArray(array, getVariableID(array))
38 << _endEq << _endAlgLine
39 <<
" % size: " << args.size() << _endline;
44 size_t newI = printArrayCreationUsingLoop(startPos, array, i, _tmpArrayValues);
49 _code << _startAlgLine << _startEq
50 << auxArrayName_ <<
"[" << i <<
"]" << _assignStr;
52 _code << _endEq << _endAlgLine << _endline;
54 _tmpArrayValues[startPos + i] = &args[i];
64 void LanguageLatex<Base>::printSparseArrayCreationOp(OperationNode<Base>& array) {
65 const std::vector<size_t>& info = array.getInfo();
66 CPPADCG_ASSERT_KNOWN(info.size() > 0,
"Invalid number of information elements for sparse array creation operation");
68 const std::vector<Argument<Base> >& args = array.getArguments();
69 const size_t argSize = args.size();
71 CPPADCG_ASSERT_KNOWN(info.size() == argSize + 1,
"Invalid number of arguments for sparse array creation operation");
76 const size_t id = getVariableID(array);
77 size_t startPos =
id - 1;
79 bool firstElement =
true;
80 for (
size_t i = 0; i < argSize; i++) {
81 bool newValue = !isSameArgument(args[i], _tmpSparseArrayValues[startPos + i]);
85 _code << _startAlgLine << _startEq
86 << auxArrayName_ << _assignStr << _nameGen->generateTemporarySparseArray(array, getVariableID(array))
87 << _endEq << _endAlgLine
88 <<
" % nnz: " << args.size() <<
" size:" << info[0] << _endline;
93 size_t newI = printArrayCreationUsingLoop(startPos, array, i, _tmpSparseArrayValues);
98 _code << _startAlgLine << _startEq
99 << auxArrayName_ <<
"[" << i <<
"]" << _assignStr;
105 << _C_SPARSE_INDEX_ARRAY <<
"[";
106 if (startPos != 0) _code << startPos <<
"+";
107 _code << i <<
"]" << _assignStr << info[i + 1]
108 << _endEq << _endAlgLine << _endline;
110 _tmpSparseArrayValues[startPos + i] = &args[i];
114 for (
size_t j = i; j < newI; j++) {
115 _code << _startAlgLine << _startEq
116 << _C_SPARSE_INDEX_ARRAY <<
"[";
117 if (startPos != 0) _code << startPos <<
"+";
118 _code << j <<
"]" << _assignStr << info[j + 1]
119 << _endEq << _endAlgLine << _endline;
128 _code << _startAlgLine << _startEq
129 << _C_SPARSE_INDEX_ARRAY <<
"[";
130 if (startPos != 0) _code << startPos <<
"+";
131 _code << i <<
"]" << _assignStr << info[i + 1]
132 << _endEq << _endAlgLine << _endline;
143 const std::vector<Argument<Base> >& args = array.
getArguments();
144 const size_t argSize = args.size();
145 size_t i = starti + 1;
147 std::ostringstream arrayAssign;
150 if (ref.getOperation() !=
nullptr) {
157 for (; i < argSize; i++) {
158 if (isSameArgument(args[i], tmpArrayValues[startPos + i]))
161 if (args[i].getOperation() ==
nullptr ||
162 args[i].getOperation()->getOperationType() != CGOpCode::Inv ||
163 !_nameGen->isConsecutiveInIndepArray(*args[i - 1].getOperation(), getVariableID(*args[i - 1].getOperation()),
164 *args[i].getOperation(), getVariableID(*args[i].getOperation()))) {
173 const std::string& indep = _nameGen->getIndependentArrayName(refOp, getVariableID(refOp));
174 size_t start = _nameGen->getIndependentArrayIndex(refOp, getVariableID(refOp));
175 long offset = long(start) - starti;
177 arrayAssign << indep <<
"[i]";
179 arrayAssign << indep <<
"[" << offset <<
" + i]";
185 size_t pos = refOp.
getInfo()[1];
186 IndexPattern* refIp = _info->loopIndependentIndexPatterns[pos];
187 if (refIp->getType() != IndexPatternType::Linear) {
193 for (; i < argSize; i++) {
194 if (isSameArgument(args[i], tmpArrayValues[startPos + i]))
197 if (args[i].getOperation() ==
nullptr ||
198 args[i].getOperation()->getOperationType() != CGOpCode::LoopIndexedIndep) {
202 if (!_nameGen->isInSameIndependentArray(refOp, getVariableID(refOp),
203 *args[i].getOperation(), getVariableID(*args[i].getOperation())))
206 pos = args[i].getOperation()->getInfo()[1];
207 const IndexPattern* ip = _info->loopIndependentIndexPatterns[pos];
208 if (ip->getType() != IndexPatternType::Linear) {
212 if (refLIp->getLinearSlopeDx() != lIp->getLinearSlopeDx() ||
213 refLIp->getLinearSlopeDy() != lIp->getLinearSlopeDy() ||
214 refLIp->getXOffset() != lIp->getXOffset() ||
215 refLIp->getLinearConstantTerm() - long(starti) != lIp->getLinearConstantTerm() - long(i)) {
224 lip2->setLinearConstantTerm(lip2->getLinearConstantTerm() - starti);
229 op2->getInfo()[1] = std::numeric_limits<size_t>::max();
230 op2->getArguments().push_back(_info->auxIterationIndexOp);
232 arrayAssign << _nameGen->generateIndexedIndependent(*op2, 0, p2dip);
242 const Base& value = *args[starti].getParameter();
243 for (; i < argSize; i++) {
244 if (args[i].getParameter() ==
nullptr || *args[i].getParameter() != value) {
249 if (oldArg !=
nullptr && oldArg->getParameter() !=
nullptr && *oldArg->getParameter() == value) {
257 arrayAssign << value;
263 _code << _forStart <<
"{$i \\in \\left[" << starti <<
", " << (i - 1) <<
"\\right]$}" << _endline;
265 _code << _startAlgLine << _startEq
266 << auxArrayName_ <<
"[i]" << _assignStr << arrayAssign.str()
267 << _endEq << _endAlgLine << _endline;
269 _code << _forEnd << _endline;
274 for (
size_t ii = starti; ii < i; ii++) {
275 tmpArrayValues[startPos + ii] = &args[ii];
284 return _nameGen->generateTemporaryArray(op);
286 return _nameGen->generateTemporarySparseArray(op);
291 CPPADCG_ASSERT_KNOWN(op.
getArguments().size() == 2,
"Invalid number of arguments for array element operation");
292 CPPADCG_ASSERT_KNOWN(op.
getArguments()[0].getOperation() !=
nullptr,
"Invalid argument for array element operation");
293 CPPADCG_ASSERT_KNOWN(op.
getInfo().size() == 1,
"Invalid number of information indexes for array element operation");
296 std::string arrayName;
297 if (arrayOp.getOperationType() == CGOpCode::ArrayCreation)
298 arrayName = _nameGen->generateTemporaryArray(arrayOp, getVariableID(arrayOp));
300 arrayName = _nameGen->generateTemporarySparseArray(arrayOp, getVariableID(arrayOp));
302 _code <<
"(" << arrayName <<
")[" << op.
getInfo()[0] <<
"]";
311 _ss << dataArrayName <<
"[" << pos <<
"]";
312 printArrayStructInit(_ss.str(), *arrays[k]);
321 const std::string& aName = createVariableName(array);
327 _code << dataArrayName <<
".data = " << aName <<
"; ";
329 _code << dataArrayName <<
".data = NULL; ";
330 _code << dataArrayName <<
".size = " << size <<
"; " 331 << dataArrayName <<
".sparse = " <<
false <<
";";
334 CPPADCG_ASSERT_KNOWN(array.
getOperationType() == CGOpCode::SparseArrayCreation,
"Invalid node type");
337 _code << dataArrayName <<
".data = " << aName <<
"; ";
339 _code << dataArrayName <<
".data = NULL; ";
340 _code << dataArrayName <<
".size = " << array.
getInfo()[0] <<
"; " 341 << dataArrayName <<
".sparse = " <<
true <<
"; " 342 << dataArrayName <<
".nnz = " << nnz <<
"; ";
344 size_t id = getVariableID(array);
345 _code << dataArrayName <<
".idx = &(" << _C_SPARSE_INDEX_ARRAY <<
"[" << (
id - 1) <<
"]);";
353 size_t id = getVariableID(ty);
357 for (
size_t i = 0; i < tySize; i++) {
358 _tmpArrayValues[
id - 1 + i] =
nullptr;
361 for (
size_t i = 0; i < tySize; i++) {
362 _tmpSparseArrayValues[
id - 1 + i] =
nullptr;
const std::vector< Argument< Base > > & getArguments() const
CGOpCode getOperationType() const
size_t printArrayCreationUsingLoop(size_t startPos, Node &array, size_t startj, std::vector< const Arg *> &tmpArrayValues)
const std::vector< size_t > & getInfo() const