/** * SPDX-FileCopyrightText: (C) 2008 Pierre Marchand * SPDX-License-Identifier: GPL-2.0-or-later */ #include "impositionplan.h" #include #include #include #include #include #include #include using namespace std; using namespace PoDoFo::Impose; PageRecord::PageRecord(int s, int d, double r, double tx, double ty, int du, double sx, double sy) : sourcePage(s), destPage(d), rotate(r), transX(tx), transY(ty), scaleX(sx), scaleY(sy), duplicateOf(du) { }; PageRecord::PageRecord() : sourcePage(0), destPage(0), rotate(0), transX(0), transY(0), scaleX(1), scaleY(1), duplicateOf(0) {}; void PageRecord::load(const string& buffer, const map& vars) { unsigned len = (unsigned)buffer.length(); vector tokens; string ts; for (unsigned i = 0; i < len; i++) { char ci(buffer.at(i)); if (ci == ' ') continue; else if (ci == ';') { tokens.push_back(ts); ts.clear(); continue; } ts += ci; } if (tokens.size() != 5 && tokens.size() != 7) { sourcePage = destPage = 0; // will return false for isValid() cerr << "INVALID_RECORD(" << tokens.size() << ") " << buffer << endl; for (unsigned int i = 0; i < tokens.size(); ++i) cerr << "\t+ " << tokens.at(i) << endl; } sourcePage = static_cast(calc(tokens.at(0), vars)); destPage = static_cast(calc(tokens.at(1), vars)); if ((sourcePage < 1) || (destPage < 1)) { sourcePage = destPage = 0; } rotate = calc(tokens.at(2), vars); transX = calc(tokens.at(3), vars); transY = calc(tokens.at(4), vars); if (tokens.size() == 7) { scaleX = calc(tokens.at(5), vars); scaleY = calc(tokens.at(6), vars); } else { scaleX = scaleY = 1.0; } cerr << " " << sourcePage << " " << destPage << " " << rotate << " " << transX << " " << transY << " " << scaleX << " " << scaleY << endl; } double PageRecord::calc(const string& s, const map& vars) { // cerr<< s; vector tokens; unsigned tokenCount = (unsigned)s.length(); string ts; for (unsigned i = 0; i < tokenCount; i++) { char ci(s.at(i)); // if ( ci == 0x20 || ci == 0x9 )// skip spaces and horizontal tabs // continue; if ((ci == '+') || (ci == '-') || (ci == '*') || (ci == '/') || (ci == '%') || (ci == '|') || (ci == '"') || (ci == '(') || (ci == ')')) { // commit current string if (ts.length() > 0) { map::const_iterator vit = vars.find(ts); if (vit != vars.end()) { // cerr<<"A Found "<second <second, vars))); } else { // cerr<<"A Not Found "< 32) { ts += ci; } // else // cerr<<"Wrong char : "<< ci < 0) { map::const_iterator vit2 = vars.find(ts); if (vit2 != vars.end()) { // cerr<second, vars))); } else { // if((ts.length() > 0) && (ts[0] == '$')) // { // cerr<::iterator i(PoDoFoImpose::vars.begin());i != PoDoFoImpose::vars.end(); ++i) // { // // cerr<<"VA \""<< i->first << "\" => " <<(i->first == ts ? "True" : "False") <first.length(); ++c) // { // cerr<< i->first[c]<<"/"; // } // cerr< values; vector ops; ops.push_back("+"); for (unsigned int vi = 0; vi < t.size(); ++vi) { if (t.at(vi) == "(") { vector tokens; int cdeep(0); // cerr<<"("; for (++vi; vi < t.size(); ++vi) { // cerr<> \""< (ret) % static_cast (values.at(vi)); } else if (ops.at(vi) == "|") // Stands for max(a,b), easier than true condition, allow to filter division by 0 ret = std::max(ret, values.at(vi)); else if (ops.at(vi) == "\"") // Stands for min(a,b) ret = std::min(ret, values.at(vi)); // cerr< "<