Forgot to add thoses files (latex.js is not used yet, but might be used in the future with a potential latex rendered).

.gitignore

@@ -10,6 +10,7 @@ linux/flatpak/.flatpak-builder
 *.zip
 **/**.qmlc
 **/**.jsc
+**/**.pyc
 *.jsc
 *.qmlc
 .DS_Store

LogarithmPlotter/qml/eu/ad5001/LogarithmPlotter/js/latex.js

@@ -0,0 +1,160 @@
+/**
+ *  LogarithmPlotter - Create graphs with logarithm scales.
+ *  Copyright (C) 2022  Ad5001
+ * 
+ *  This program 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.
+ * 
+ *  This program 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 this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+
+
+.import "expr-eval.js" as ExprEval
+
+// Puts element within parenthesis
+function par(elem) {
+    return '(' + elem + ')'
+}
+
+// checks if the element contains a string, and returns the parenthesis version if so.
+function parif(elem, contents) {
+    return contents.some(elem.includes) ? par(elem) : elem
+}
+
+// Adpation of expressionToString for latex
+function expressionToLatex(tokens) {
+    var nstack = [];
+    var n1, n2, n3;
+    var f, args, argCount;
+    for (var i = 0; i < tokens.length; i++) {
+        var item = tokens[i];
+        var type = item.type;
+        
+        switch(type) {
+            case ExprEval.INUMBER:
+                if (typeof item.value === 'number' && item.value < 0) {
+                    nstack.push(par(item.value));
+                } else if (Array.isArray(item.value)) {
+                    nstack.push('[' + item.value.map(escapeValue).join(', ') + ']');
+                } else {
+                    nstack.push(escapeValue(item.value));
+                }
+                break;
+            case ExprEval.IOP2:
+                n2 = nstack.pop();
+                n1 = nstack.pop();
+                f = item.value;
+                switch(f) {
+                    case '-':
+                    case '+':
+                        nstack.push(n1 + this.ope + n2);
+                        break;
+                    case '||':
+                    case 'or':
+                    case '&&':
+                    case 'and':
+                    case '==':
+                    case '!=':
+                        nstack.push(par(n1) + this.ope + par(n2));
+                        break;
+                    case '*':
+                        nstack.push(parif(n1,['+','-']) + " \\times " + parif(n2,['+','-']));
+                        break;
+                    case '/':
+                        nstack.push("\\frac{" + n1 + "}{" + n2 + "}");
+                        break;
+                    case '^':
+                        nstack.push(parif(n1,['+','-','*','/','!'])  + "^{" + n2 + "}");
+                        break;
+                    case '%':
+                        nstack.push(parif(n1,['+','-','*','/','!','^']) + " \\mathrm{mod} " + parif(n2,['+','-','*','/','!','^']));
+                        break;
+                    case '[':
+                        nstack.push(n1 + '[' + n2 + ']');
+                        break;
+                    default:
+                        throw new EvalError("Unknown operator " + ope + ".");
+                }
+                break;
+            case ExprEval.IOP3: // Thirdiary operator
+                n3 = nstack.pop();
+                n2 = nstack.pop();
+                n1 = nstack.pop();
+                f = item.value;
+                if (f === '?') {
+                    nstack.push('(' + n1 + ' ? ' + n2 + ' : ' + n3 + ')');
+                } else {
+                    throw new EvalError('Unknown operator ' + ope + '.');
+                }
+                break;
+            case ExprEval.IVAR:
+            case ExprEval.IVARNAME:
+                nstack.push(item.value);
+                break;
+            case ExprEval.IOP1: // Unary operator
+                n1 = nstack.pop();
+                f = item.value;
+                switch(f) {
+                    case '-':
+                    case '+':
+                        nstack.push(par(f + n1));
+                        break;
+                    case '!':
+                        nstack.push(parif(n1,['+','-','*','/','^']) + '!');
+                        break;
+                    default:
+                        nstack.push(f + parif(n1,['+','-','*','/','^']));
+                        break;
+                }
+                break;
+            case ExprEval.IFUNCALL:
+                argCount = item.value;
+                args = [];
+                while (argCount-- > 0) {
+                    args.unshift(nstack.pop());
+                }
+                f = nstack.pop();
+                nstack.push(f + '(' + args.join(', ') + ')');
+                break;
+            case ExprEval.IFUNDEF:
+                nstack.push(par(n1 + '(' + args.join(', ') + ') = ' + n2));
+                break;
+            case ExprEval.IMEMBER:
+                n1 = nstack.pop();
+                nstack.push(n1 + '.' + item.value);
+                break;
+            case ExprEval.IARRAY:
+                argCount = item.value;
+                args = [];
+                while (argCount-- > 0) {
+                    args.unshift(nstack.pop());
+                }
+                nstack.push('[' + args.join(', ') + ']');
+                break;
+            case ExprEval.IEXPR:
+                nstack.push('(' + expressionToLatex(item.value) + ')');
+                break;
+            case ExprEval.IENDSTATEMENT:
+                break;
+            default:
+                throw new EvalError('invalid Expression');
+                break;
+        }
+    }
+    if (nstack.length > 1) {
+        if (toJS) {
+            nstack = [ nstack.join(',') ];
+        } else {
+            nstack = [ nstack.join(';') ];
+        }
+    }
+    return Utils.makeExpressionReadable(String(nstack[0]));
+}

linux/flatpak/logarithmplotter.desktop

@@ -0,0 +1,16 @@
+[Desktop Entry]
+Version=1.0
+Type=Application
+Name=LogarithmPlotter
+GenericName=2D plotter software
+GenericName[fr]=Logiciel de traçage 2D
+Comment=Create BODE diagrams, sequences and repartition functions.
+Comment[fr]=Créer des diagrammes de BODE, des suites et des fonctions de répartition.
+
+TryExec=logarithmplotter
+Exec=logarithmplotter --no-check-for-updates %f
+Icon=logarithmplotter
+MimeType=application/x-logarithm-plot;
+Terminal=false
+StartupNotify=false
+Categories=Math