pimath 0.0.120 → 0.0.121

package/esm/maths/algebra/equation.js

@@ -1,786 +1,797 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Equation = exports.PARTICULAR_SOLUTION = void 0;
-const polynom_1 = require("./polynom");
-const numeric_1 = require("../numeric");
-const fraction_1 = require("../coefficients/fraction");
-const nthRoot_1 = require("../coefficients/nthRoot");
-var PARTICULAR_SOLUTION;
-(function (PARTICULAR_SOLUTION) {
-    PARTICULAR_SOLUTION["real"] = "\\mathbb{R}";
-    PARTICULAR_SOLUTION["varnothing"] = "\\varnothing";
-})(PARTICULAR_SOLUTION = exports.PARTICULAR_SOLUTION || (exports.PARTICULAR_SOLUTION = {}));
-class Equation {
-    /**
-     * Create an Equation using two polynoms.
-     * Markdown *support* is cool
-     * @param equations
-     */
-    constructor(...equations) {
-        // Undetermined texSolutions.
-        this._varnothing = PARTICULAR_SOLUTION.varnothing;
-        this._real = PARTICULAR_SOLUTION.real;
-        this.hasVariable = (letter) => {
-            return this.variables.includes(letter);
-        };
-        // ------------------------------------------
-        // Creation / parsing functions
-        // -----------------------------------------------
-        this._randomizeDefaults = {
-            degree: 2
-        };
-        // ------------------------------------------
-        this.parse = (equationString) => {
-            let pStr, strSign;
-            // Find the string separator
-            strSign = this._findSign(equationString);
-            if (strSign === false) {
-                console.error('The equation is not valid (no sign found)');
-                return;
-            }
-            // The StrSign is found
-            pStr = equationString.split(strSign);
-            return this.create(new polynom_1.Polynom(pStr[0]), new polynom_1.Polynom(pStr[1]), this._formatSign(strSign));
-        };
-        this.create = (left, right, sign) => {
-            this._left = left;
-            this._right = right;
-            this._sign = this._formatSign(sign);
-            return this;
-        };
-        this.clone = () => {
-            return new Equation().create(this._left.clone(), this._right.clone(), this._sign + '');
-        };
-        // -----------------------------------------------
-        // Equations generators and randomizers
-        this.randomize = (opts, sign) => {
-            // TODO: Generate equations randomly, using config.
-            return new Equation().create(new polynom_1.Polynom(), new polynom_1.Polynom(), sign);
-        };
-        // -----------------------------------------------
-        /**
-         * Reorder will move all monoms containing a letter on the left, all the other on the right.
-         */
-        this.moveLeft = () => {
-            this._left = this._left.clone().subtract(this._right);
-            this._right.zero();
-            return this;
-        };
-        this.reorder = (allLeft) => {
-            // Move all monoms of degree greater than 0 to the left.
-            // and all zero degree monoms to the right.
-            this._left.subtract(this._right);
-            this._right.zero();
-            this._left.reorder();
-            // we eant all left (so equal zero) : it's done !
-            if (allLeft)
-                return this;
-            // Fetch all zero degree monoms.
-            this._left.monoms
-                .filter(m => m.degree().isZero())
-                .forEach(m => {
-                const move = m.clone();
-                this._left.subtract(move);
-                this._right.subtract(move);
-            });
-            // Reorder the left and right polynoms
-            this._left.reorder();
-            this._right.reorder();
-            return this;
-        };
-        /**
-         * Multiply by the lcm denominator and divide by the gcm numerators.
-         */
-        this.simplify = () => {
-            this.multiply(numeric_1.Numeric.lcm(...this._left.getDenominators(), ...this._right.getDenominators()));
-            this.divide(numeric_1.Numeric.gcd(...this._left.getNumerators(), ...this._right.getNumerators()));
-            return this;
-        };
-        // -----------------------------------------------
-        // Equations operations
-        /**
-         * Reorder the polynom to have only one letter on the left, the rest on the right.
-         * @param letter
-         */
-        this.isolate = (letter) => {
-            // Determine if we can isolate the variables.
-            // Both part of the equations must be of the first degree.
-            //TODO: handle equations of degree two or more ?
-            if (!this.degree(letter).isOne()) {
-                return false;
-            }
-            // Modify the equation to isolate the asked variable.
-            // TODO: must handle equations like 3xy+5y=4 => y = 4/(3x-5)
-            if (this.isMultiVariable()) {
-                return false;
-            }
-            // Isolate the letter.
-            let mMove, cMove;
-            // Start by moving everything to the left.
-            this._left.subtract(this._right);
-            this._right.zero();
-            let values = [...this._left.monoms];
-            for (let m of values) {
-                if (!m.hasLetter(letter)) {
-                    mMove = m.clone();
-                    this._left.subtract(mMove);
-                    this._right.subtract(mMove);
-                }
-            }
-            // In theory, we should have only one item on the left.
-            if (this._left.length !== 1) {
-                return false;
-            }
-            cMove = this._left.monoms[0].coefficient.clone();
-            this._left.divide(cMove);
-            this._right.divide(cMove);
-            return this;
-        };
-        this.replaceBy = (letter, P) => {
-            this._left.replaceBy(letter, P);
-            this._right.replaceBy(letter, P);
-            return this;
-        };
-        /**
-         * Multiple an equation by a fraction value.
-         * @param value
-         */
-        this.multiply = (value) => {
-            // Make sure we have a fraction.
-            let F = new fraction_1.Fraction(value);
-            // Multiply each part of the equation by the fraction
-            this._left.multiply(F);
-            this._right.multiply(F);
-            // The sign of the inequation must be changed.
-            if (this._sign !== '=' && F.sign() === -1) {
-                this._reverseSign();
-            }
-            return this;
-        };
-        /**
-         * divide an equation by a given value (transformed as a fraction)
-         *
-         * ```
-         * 8x+10=6x \vert 2
-         * 4x+5=3x
-         * ```
-         *
-         * |>Alternatively with $3x-4$ maybe it's working ?
-         * $$\frac{3x}{5}$$
-         *
-         * @param value
-         * @returns {Equation}
-         */
-        this.divide = (value) => {
-            // Make sure we have a fraction.
-            let F = new fraction_1.Fraction(value);
-            if (F.isZero()) {
-                return this;
-            }
-            else {
-                return this.multiply(F.invert());
-            }
-        };
-        /**
-         * Get the degree of the equation
-         * @param letter
-         */
-        this.degree = (letter) => {
-            return fraction_1.Fraction.max(this._left.degree(letter), this._right.degree(letter));
-        };
-        /**
-         * Determine if the equation contains more than one letter/variable.
-         */
-        this.isMultiVariable = () => {
-            return this._left.isMultiVariable || this._right.isMultiVariable;
-        };
-        this.letters = () => {
-            // @ts-ignore
-            return [...new Set([...this._left.letters(), ...this._right.letters()])];
-        };
-        // -----------------------------------------------
-        // Equations helpers
-        // -----------------------------------------------
-        // -----------------------------------------------
-        this.solve = () => {
-            // Initialise the variables:
-            this._solutions = [];
-            // TODO: consolidate solving equations (inequations vs equations)
-            // TODO: work with not natural degrees ?
-            this._polynom = this._left.clone().subtract(this._right);
-            switch (this._polynom.degree().value) {
-                case 0:
-                case 1:
-                    this._solveDegree1();
-                    break;
-                case 2:
-                    this._solveDegree2();
-                    break;
-                default:
-                    this._solveDegree3plus();
-            }
-            // cleanup the solutions.
-            this._solutions = Equation.makeSolutionsUnique(this._solutions);
-            return this;
-        };
-        this.test = (values) => {
-            return this.left.evaluate(values).isEqual(this.right.evaluate(values));
-        };
-        this._findSign = (equationString) => {
-            let strSign = '';
-            if (equationString.includes('geq')) {
-                return (equationString.includes('\\geq')) ? '\\geq' : 'geq';
-            }
-            else if (equationString.includes('leq')) {
-                return (equationString.includes('\\leq')) ? '\\leq' : 'leq';
-            }
-            else if (equationString.includes('>=')) {
-                return '>=';
-            }
-            else if (equationString.includes('=>')) {
-                return '=>';
-            }
-            else if (equationString.includes('>')) {
-                return '>';
-            }
-            else if (equationString.includes('<=')) {
-                return '<=';
-            }
-            else if (equationString.includes('=<')) {
-                return '=<';
-            }
-            else if (equationString.includes('<')) {
-                return '<';
-            }
-            else if (equationString.includes('=')) {
-                return '=';
-            }
-            if (strSign === '') {
-                console.log('Equation: parse string : sign not found');
-                return false;
-            }
-        };
-        // -----------------------------------------------
-        // Equations solving algorithms
-        this._formatSign = (signStr) => {
-            if (signStr === undefined) {
-                return '=';
-            }
-            if (signStr.includes('geq')) {
-                return '>=';
-            }
-            else if (signStr.includes('>=')) {
-                return '>=';
-            }
-            else if (signStr.includes('=>')) {
-                return '>=';
-            }
-            else if (signStr.includes('>')) {
-                return '>';
-            }
-            else if (signStr.includes('leq')) {
-                return '<=';
-            }
-            else if (signStr.includes('<=')) {
-                return '<=';
-            }
-            else if (signStr.includes('=<')) {
-                return '<=';
-            }
-            else if (signStr.includes('<')) {
-                return '<';
-            }
-            else {
-                return '=';
-            }
-        };
-        this._reverseSign = () => {
-            if (this._sign === '=') {
-                return this;
-            }
-            if (this._sign.includes('<')) {
-                this._sign.replace('<', '>');
-                return this;
-            }
-            if (this._sign.includes('>')) {
-                this._sign.replace('>', '<');
-                return this;
-            }
-            return this;
-        };
-        this.isGreater = () => {
-            if (this._sign.indexOf('>') !== -1) {
-                return true;
-            }
-            return this._sign.indexOf('geq') !== -1;
-        };
-        this.isStrictEqual = () => {
-            return this._sign === '=';
-        };
-        this.isAlsoEqual = () => {
-            if (this._sign.indexOf('=') !== -1) {
-                return true;
-            }
-            if (this._sign.indexOf('geq') !== -1) {
-                return true;
-            }
-            if (this._sign.indexOf('leq') !== -1) {
-                return true;
-            }
-        };
-        this._solveDegree1 = (letter) => {
-            const m1 = this._polynom.monomByDegree(1, letter).coefficient, m0 = this._polynom.monomByDegree(0, letter).coefficient, v = m0.clone().opposed().divide(m1);
-            let s, d;
-            if (this.isStrictEqual()) {
-                if (m1.value === 0) {
-                    // In this case, the coefficient of the x variable is zero.
-                    if (m0.value === 0) {
-                        this._solutions = [{
-                                tex: this._real,
-                                display: "RR",
-                                value: NaN,
-                                exact: false
-                            }];
-                    }
-                    else {
-                        this._solutions = [{
-                                tex: this._varnothing,
-                                display: "O/",
-                                value: NaN,
-                                exact: false
-                            }];
-                    }
-                }
-                else {
-                    this._solutions = [{
-                            tex: v.tex,
-                            display: v.display,
-                            value: v.value,
-                            exact: v
-                        }];
-                }
-            }
-            else {
-                if (m1.value === 0) {
-                    // In this case, the coefficient of the x variable is zero.
-                    if (m0.value === 0 && this.isAlsoEqual()) {
-                        s = '\\mathbb{R}';
-                        d = "RR";
-                    }
-                    else {
-                        if (m0.value > 0) {
-                            s = this.isGreater() ? this._real : this._varnothing;
-                            s = this.isGreater() ? "RR" : "O/";
-                        }
-                        else {
-                            s = !this.isGreater() ? this._real : this._varnothing;
-                            s = !this.isGreater() ? "RR" : "O/";
-                        }
-                    }
-                }
-                else {
-                    // Must handle the case if the m1 monom is negative.
-                    if ((this.isGreater() && m1.sign() === 1) || (!this.isGreater() && m1.sign() === -1)) {
-                        s = `\\left${this.isAlsoEqual() ? '[' : ']'}${v.tex};+\\infty\\right[`;
-                        d = `${this.isAlsoEqual() ? '[' : ']'}${v.tex};+oo[`;
-                    }
-                    else {
-                        s = `\\left]-\\infty;${v.tex} \\right${this.isAlsoEqual() ? ']' : '['}`;
-                        d = `]-oo;${v.tex}${this.isAlsoEqual() ? ']' : '['}`;
-                    }
-                }
-                this._solutions = [{
-                        tex: s,
-                        display: d,
-                        value: NaN,
-                        exact: false
-                    }];
-            }
-            return this._solutions;
-        };
-        this._solveDegree2 = (letter) => {
-            let aF = this._polynom.monomByDegree(2, letter).coefficient, bF = this._polynom.monomByDegree(1, letter).coefficient, cF = this._polynom.monomByDegree(0, letter).coefficient, delta, nthDelta, lcm = numeric_1.Numeric.lcm(aF.denominator, bF.denominator, cF.denominator), a = aF.multiply(lcm).value, b = bF.multiply(lcm).value, c = cF.multiply(lcm).value, realX1, realX2, sX1, sX2;
-            delta = b * b - 4 * a * c;
-            if (delta > 0) {
-                realX1 = (-b - Math.sqrt(delta)) / (2 * a);
-                realX2 = (-b + Math.sqrt(delta)) / (2 * a);
-                if (delta > 1.0e5) {
-                    // The delta is too big to be parsed !
-                    let v1 = ((-b - Math.sqrt(delta)) / (2 * a)).toFixed(5), v2 = ((-b + Math.sqrt(delta)) / (2 * a)).toFixed(5);
-                    this._solutions = [
-                        {
-                            tex: v1,
-                            display: v1,
-                            value: realX1,
-                            exact: false
-                        },
-                        {
-                            tex: v2,
-                            display: v2,
-                            value: realX2,
-                            exact: false
-                        }
-                    ];
-                }
-                else {
-                    nthDelta = new nthRoot_1.NthRoot(delta).reduce();
-                    if (nthDelta.hasRadical()) {
-                        // -b +- coeff\sqrt{radical}
-                        // -------------------------
-                        //           2a
-                        let gcd = numeric_1.Numeric.gcd(b, 2 * a, nthDelta.coefficient), am = a / gcd, bm = b / gcd;
-                        nthDelta.coefficient = nthDelta.coefficient / gcd;
-                        if (a < 0) {
-                            am = -am;
-                            bm = -bm;
-                        }
-                        let tex1 = "", tex2 = "", display1 = "", display2 = "";
-                        tex1 = `${bm !== 0 ? ((-bm) + ' - ') : ''}${nthDelta.tex}`;
-                        tex2 = `${bm !== 0 ? ((-bm) + ' + ') : ''}${nthDelta.tex}`;
-                        display1 = `${bm !== 0 ? ((-bm) + ' - ') : ''}${nthDelta.display}`;
-                        display2 = `${bm !== 0 ? ((-bm) + ' + ') : ''}${nthDelta.display}`;
-                        if (am !== 1) {
-                            tex1 = `\\frac{ ${tex1} }{ ${2 * am} }`;
-                            tex2 = `\\frac{ ${tex2} }{ ${2 * am} }`;
-                        }
-                        this._solutions = [
-                            {
-                                tex: tex1,
-                                display: tex1,
-                                value: realX1,
-                                exact: false
-                            },
-                            {
-                                tex: tex2,
-                                display: tex2,
-                                value: realX2,
-                                exact: false
-                            },
-                        ];
-                        // if (b !== 0) {
-                        //     if (2 * a / gcd === 1) {
-                        //         this._solutions = [
-                        //             {
-                        //                 tex: `${-b / gcd} - ${nthDelta.tex}`,
-                        //                 value: realX1,
-                        //                 exact: false // TODO: implement exact value with nthroot
-                        //             },
-                        //             {
-                        //                 tex: `${-b / gcd} + ${nthDelta.tex}`,
-                        //                 value: realX2,
-                        //                 exact: false
-                        //             },
-                        //
-                        //         ]
-                        //     } else {
-                        //         this._solutions = [
-                        //             {
-                        //                 tex: `\\frac{${-b / gcd} - ${nthDelta.tex} }{ ${2 * a / gcd} }`,
-                        //                 value: realX1,
-                        //                 exact: false
-                        //             },
-                        //             {
-                        //                 tex: `\\frac{${-b / gcd} + ${nthDelta.tex} }{ ${2 * a / gcd} }`,
-                        //                 value: realX2,
-                        //                 exact: false
-                        //             },
-                        //         ]
-                        //     }
-                        // } else {
-                        //     if (2 * a / gcd === 1) {
-                        //         this._solutions = [
-                        //             {
-                        //                 tex: `- ${nthDelta.tex}`,
-                        //                 value: realX1,
-                        //                 exact: false
-                        //             },
-                        //             {
-                        //                 tex: `${nthDelta.tex}`,
-                        //                 value: realX2,
-                        //                 exact: false
-                        //             },
-                        //         ]
-                        //     } else {
-                        //         this._solutions = [
-                        //             {
-                        //                 tex: `\\frac{- ${nthDelta.tex} }{ ${2 * a / gcd} }`,
-                        //                 value: realX1,
-                        //                 exact: false
-                        //             },
-                        //             {
-                        //                 tex: `\\frac{${nthDelta.tex} }{ ${2 * a / gcd} }`,
-                        //                 value: realX2,
-                        //                 exact: false
-                        //             },
-                        //         ]
-                        //     }
-                        // }
-                    }
-                    else {
-                        // -b +- d / 2a
-                        const S1 = new fraction_1.Fraction(-b - nthDelta.coefficient, 2 * a).reduce(), S2 = new fraction_1.Fraction(-b + nthDelta.coefficient, 2 * a).reduce();
-                        this._solutions = [
-                            {
-                                tex: S1.frac,
-                                display: S1.display,
-                                value: realX1,
-                                exact: S1
-                            },
-                            {
-                                tex: S2.frac,
-                                display: S2.display,
-                                value: realX2,
-                                exact: S2
-                            }
-                        ];
-                    }
-                }
-            }
-            else if (delta === 0) {
-                const sol = new fraction_1.Fraction(-b, 2 * a).reduce();
-                this._solutions = [{
-                        tex: sol.frac,
-                        display: sol.display,
-                        value: sol.value,
-                        exact: sol
-                    }];
-            }
-            else {
-                this._solutions = [{
-                        tex: this._varnothing,
-                        display: "O/",
-                        value: NaN,
-                        exact: false
-                    }];
-            }
-            // Handle now the inequations.
-            if (!this.isStrictEqual()) {
-                if (this._solutions.length === 2) {
-                    sX1 = (realX1 < realX2) ? this._solutions[0].tex : this._solutions[1].tex;
-                    sX2 = (realX1 < realX2) ? this._solutions[1].tex : this._solutions[0].tex;
-                    if ((this.isGreater() && aF.sign() === 1) || (!this.isGreater() && aF.sign() === -1)) {
-                        this._solutions = [{
-                                tex: `\\left]-\\infty ; ${sX1}\\right${this.isAlsoEqual() ? ']' : '['} \\cup \\left${this.isAlsoEqual() ? '[' : ']'}${sX2};+\\infty\\right[`,
-                                display: `]-oo;${sX1}${this.isAlsoEqual() ? ']' : '['}uu${this.isAlsoEqual() ? '[' : ']'}${sX2};+oo[`,
-                                value: NaN,
-                                exact: false
-                            }
-                        ];
-                    }
-                    else {
-                        this._solutions = [{
-                                tex: `\\left${this.isAlsoEqual() ? '[' : ']'}${sX1} ; ${sX2}\\right${this.isAlsoEqual() ? ']' : '['}`,
-                                display: `${this.isAlsoEqual() ? '[' : ']'}${sX1};${sX2}${this.isAlsoEqual() ? ']' : '['}`,
-                                value: NaN,
-                                exact: false
-                            }];
-                    }
-                }
-                else if (this._solutions.length === 1 && this._solutions[0].tex !== this._varnothing) {
-                    if (!this.isAlsoEqual()) {
-                        if ((this.isGreater() && aF.sign() === 1) || (!this.isGreater() && aF.sign() === -1)) {
-                            this._solutions = [{
-                                    tex: `\\left]-\\infty ; ${this._solutions[0].tex}\\right[ \\cup \\left]${this._solutions[0].tex};+\\infty\\right[`,
-                                    display: `]-oo;${this._solutions[0].tex}[uu]${this._solutions[0].tex};+oo[`,
-                                    value: NaN,
-                                    exact: false
-                                }
-                            ];
-                        }
-                        else {
-                            this._solutions = [{
-                                    tex: this._varnothing,
-                                    display: "O/",
-                                    value: NaN,
-                                    exact: false
-                                }];
-                        }
-                    }
-                    else {
-                        if ((this.isGreater() && aF.sign() === 1) || (!this.isGreater() && aF.sign() === -1)) {
-                            this._solutions = [{
-                                    tex: this._real,
-                                    display: "RR",
-                                    value: NaN,
-                                    exact: false
-                                }];
-                        }
-                        else {
-                            // this._texSolutions = [ this._texSolutions[0] ];
-                        }
-                    }
-                }
-                else {
-                    if (this.isGreater()) {
-                        this._solutions = [{
-                                tex: aF.sign() === 1 ? this._real : this._varnothing,
-                                display: aF.sign() === 1 ? "RR" : "O/",
-                                value: NaN,
-                                exact: false
-                            }];
-                    }
-                    else {
-                        this._solutions = [{
-                                tex: aF.sign() === -1 ? this._real : this._varnothing,
-                                display: aF.sign() === -1 ? "RR" : "O/",
-                                value: NaN,
-                                exact: false
-                            }];
-                    }
-                }
-            }
-            return this._solutions;
-        };
-        this._solveDegree3plus = (letter) => {
-            // Push everything to the left
-            // factorize
-            // solve each factors.
-            let equ = this.clone().moveLeft();
-            equ.left.factorize();
-            this._solutions = [];
-            equ.left.factors.forEach(factor => {
-                if (factor.degree(letter).leq(2)) {
-                    let factorAsEquation = new Equation(factor, 0);
-                    factorAsEquation.solve();
-                    factorAsEquation.solutions.forEach(solution => {
-                        this._solutions.push(solution);
-                    });
-                }
-                else {
-                    console.log(factor.tex, ': cannot actually get the solution of this equation');
-                }
-            });
-            // TODO: check equation resolution for more than degree 2
-            // this._solutions = [{tex: 'solve x - not yet handled', value: NaN, exact: false}];  // ESLint remove system :(
-            return this._solutions;
-        };
-        // Default equation
-        this._left = new polynom_1.Polynom().zero();
-        this._right = new polynom_1.Polynom().zero();
-        this._sign = '=';
-        if (equations.length === 1) {
-            if (equations[0] instanceof Equation) {
-                return equations[0].clone();
-            }
-            else if (typeof equations[0] === 'string') {
-                this.parse(equations[0]);
-            }
-        }
-        else if (equations.length === 2) {
-            if (equations[0] instanceof polynom_1.Polynom) {
-                this.left = equations[0].clone();
-            }
-            else if (typeof equations[0] === 'string') {
-                this.left = new polynom_1.Polynom(equations[0]);
-            }
-            if (equations[1] instanceof polynom_1.Polynom) {
-                this.right = equations[1].clone();
-            }
-            else if (typeof equations[1] === 'string') {
-                this.right = new polynom_1.Polynom(equations[1]);
-            }
-        }
-        else {
-            // Return default empty equation
-            return this;
-        }
-        return this;
-    }
-    get left() {
-        return this._left;
-    }
-    set left(value) {
-        this._left = value;
-    }
-    get right() {
-        return this._right;
-    }
-    // ------------------------------------------
-    // Getter and setter
-    set right(value) {
-        this._right = value;
-    }
-    get sign() {
-        return this._sign;
-    }
-    set sign(value) {
-        // Set the sign value as formatted.
-        this._sign = this._formatSign(value);
-    }
-    // ------------------------------------------
-    get solutions() {
-        return this._solutions;
-    }
-    get isEquation() {
-        return true;
-    }
-    get solution() {
-        if (this._solutions.length === 1
-            &&
-                (this._solutions[0].tex === this._real
-                    || this._solutions[0].tex === this._varnothing
-                    || this._solutions[0].tex.includes('\\left'))) {
-            return `S = ${this._solutions[0]}`;
-        }
-        return `S = \\left{ ${this._solutions.map(x => x.tex).join(';')} \\right}`;
-    }
-    get isReal() {
-        if (this._solutions === undefined) {
-            this.solve();
-        }
-        return this._solutions[0].tex === this._real;
-    }
-    get isVarnothing() {
-        if (this._solutions === undefined) {
-            this.solve();
-        }
-        return this._solutions[0].tex === this._varnothing;
-    }
-    get signAsTex() {
-        if (this._sign === '>=' || this._sign === '=>' || this._sign === 'geq') {
-            return '\\geq';
-        }
-        if (this._sign === '<=' || this._sign === '=<' || this._sign === 'leq') {
-            return '\\leq';
-        }
-        return this._sign;
-    }
-    get tex() {
-        return `${this._left.tex}${this.signAsTex}${this._right.tex}`;
-    }
-    get display() {
-        return `${this._left.display}${this.signAsTex}${this._right.display}`;
-    }
-    get raw() {
-        return `${this._left.raw}${this.signAsTex}${this._right.raw}`;
-    }
-    get variables() {
-        return [...new Set(this._right.variables.concat(this._left.variables))];
-    }
-    get numberOfVars() {
-        return this.variables.length;
-    }
-    get randomizeDefaults() {
-        return this._randomizeDefaults;
-    }
-    set randomizeDefaults(value) {
-        this._randomizeDefaults = value;
-    }
-    static makeSolutionsUnique(solutions, sorted) {
-        let solutionAsTex = [], uniqueSolutions = solutions.filter(sol => {
-            if (!solutionAsTex.includes(sol.tex)) {
-                solutionAsTex.push(sol.tex);
-                return true;
-            }
-            else {
-                return false;
-            }
-        });
-        if (sorted === true) {
-            uniqueSolutions.sort((a, b) => a.value - b.value);
-        }
-        return uniqueSolutions;
-    }
-}
-exports.Equation = Equation;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Equation = exports.PARTICULAR_SOLUTION = void 0;
+const polynom_1 = require("./polynom");
+const numeric_1 = require("../numeric");
+const fraction_1 = require("../coefficients/fraction");
+const nthRoot_1 = require("../coefficients/nthRoot");
+var PARTICULAR_SOLUTION;
+(function (PARTICULAR_SOLUTION) {
+    PARTICULAR_SOLUTION["real"] = "\\mathbb{R}";
+    PARTICULAR_SOLUTION["varnothing"] = "\\varnothing";
+})(PARTICULAR_SOLUTION || (exports.PARTICULAR_SOLUTION = PARTICULAR_SOLUTION = {}));
+class Equation {
+    /**
+     * Create an Equation using two polynoms.
+     * Markdown *support* is cool
+     * @param equations
+     */
+    constructor(...equations) {
+        // Undetermined texSolutions.
+        this._varnothing = PARTICULAR_SOLUTION.varnothing;
+        this._real = PARTICULAR_SOLUTION.real;
+        this.hasVariable = (letter) => {
+            return this.variables.includes(letter);
+        };
+        // ------------------------------------------
+        // Creation / parsing functions
+        // -----------------------------------------------
+        this._randomizeDefaults = {
+            degree: 2
+        };
+        // ------------------------------------------
+        this.parse = (equationString) => {
+            let pStr, strSign;
+            // Find the string separator
+            strSign = this._findSign(equationString);
+            if (strSign === false) {
+                console.error('The equation is not valid (no sign found)');
+                return;
+            }
+            // The StrSign is found
+            pStr = equationString.split(strSign);
+            return this.create(new polynom_1.Polynom(pStr[0]), new polynom_1.Polynom(pStr[1]), this._formatSign(strSign));
+        };
+        this.create = (left, right, sign) => {
+            this._left = left;
+            this._right = right;
+            this._sign = this._formatSign(sign);
+            return this;
+        };
+        this.clone = () => {
+            return new Equation().create(this._left.clone(), this._right.clone(), this._sign + '');
+        };
+        // -----------------------------------------------
+        // Equations generators and randomizers
+        this.randomize = (opts, sign) => {
+            // TODO: Generate equations randomly, using config.
+            return new Equation().create(new polynom_1.Polynom(), new polynom_1.Polynom(), sign);
+        };
+        // -----------------------------------------------
+        /**
+         * Reorder will move all monoms containing a letter on the left, all the other on the right.
+         */
+        this.moveLeft = () => {
+            this._left = this._left.clone().subtract(this._right);
+            this._right.zero();
+            return this;
+        };
+        this.reorder = (allLeft) => {
+            // Move all monoms of degree greater than 0 to the left.
+            // and all zero degree monoms to the right.
+            this._left.subtract(this._right);
+            this._right.zero();
+            this._left.reorder();
+            // we eant all left (so equal zero) : it's done !
+            if (allLeft)
+                return this;
+            // Fetch all zero degree monoms.
+            this._left.monoms
+                .filter(m => m.degree().isZero())
+                .forEach(m => {
+                const move = m.clone();
+                this._left.subtract(move);
+                this._right.subtract(move);
+            });
+            // Reorder the left and right polynoms
+            this._left.reorder();
+            this._right.reorder();
+            return this;
+        };
+        /**
+         * Multiply by the lcm denominator and divide by the gcm numerators.
+         */
+        this.simplify = () => {
+            this.multiply(numeric_1.Numeric.lcm(...this._left.getDenominators(), ...this._right.getDenominators()));
+            this.divide(numeric_1.Numeric.gcd(...this._left.getNumerators(), ...this._right.getNumerators()));
+            return this;
+        };
+        // -----------------------------------------------
+        // Equations operations
+        /**
+         * Reorder the polynom to have only one letter on the left, the rest on the right.
+         * @param letter
+         */
+        this.isolate = (letter) => {
+            // Determine if we can isolate the variables.
+            // Both part of the equations must be of the first degree.
+            //TODO: handle equations of degree two or more ?
+            if (!this.degree(letter).isOne()) {
+                return false;
+            }
+            // Modify the equation to isolate the asked variable.
+            // TODO: must handle equations like 3xy+5y=4 => y = 4/(3x-5)
+            if (this.isMultiVariable()) {
+                return false;
+            }
+            // Isolate the letter.
+            let mMove, cMove;
+            // Start by moving everything to the left.
+            this._left.subtract(this._right);
+            this._right.zero();
+            let values = [...this._left.monoms];
+            for (let m of values) {
+                if (!m.hasLetter(letter)) {
+                    mMove = m.clone();
+                    this._left.subtract(mMove);
+                    this._right.subtract(mMove);
+                }
+            }
+            // In theory, we should have only one item on the left.
+            if (this._left.length !== 1) {
+                return false;
+            }
+            cMove = this._left.monoms[0].coefficient.clone();
+            this._left.divide(cMove);
+            this._right.divide(cMove);
+            return this;
+        };
+        this.replaceBy = (letter, P) => {
+            this._left.replaceBy(letter, P);
+            this._right.replaceBy(letter, P);
+            return this;
+        };
+        /**
+         * Multiple an equation by a fraction value.
+         * @param value
+         */
+        this.multiply = (value) => {
+            // Make sure we have a fraction.
+            let F = new fraction_1.Fraction(value);
+            // Multiply each part of the equation by the fraction
+            this._left.multiply(F);
+            this._right.multiply(F);
+            // The sign of the inequation must be changed.
+            if (this._sign !== '=' && F.sign() === -1) {
+                this._reverseSign();
+            }
+            return this;
+        };
+        /**
+         * divide an equation by a given value (transformed as a fraction)
+         *
+         * ```
+         * 8x+10=6x \vert 2
+         * 4x+5=3x
+         * ```
+         *
+         * |>Alternatively with $3x-4$ maybe it's working ?
+         * $$\frac{3x}{5}$$
+         *
+         * @param value
+         * @returns {Equation}
+         */
+        this.divide = (value) => {
+            // Make sure we have a fraction.
+            let F = new fraction_1.Fraction(value);
+            if (F.isZero()) {
+                return this;
+            }
+            else {
+                return this.multiply(F.invert());
+            }
+        };
+        /**
+         * Get the degree of the equation
+         * @param letter
+         */
+        this.degree = (letter) => {
+            return fraction_1.Fraction.max(this._left.degree(letter), this._right.degree(letter));
+        };
+        /**
+         * Determine if the equation contains more than one letter/variable.
+         */
+        this.isMultiVariable = () => {
+            return this._left.isMultiVariable || this._right.isMultiVariable;
+        };
+        this.letters = () => {
+            // @ts-ignore
+            return [...new Set([...this._left.letters(), ...this._right.letters()])];
+        };
+        // -----------------------------------------------
+        // Equations helpers
+        // -----------------------------------------------
+        // -----------------------------------------------
+        this.solve = () => {
+            // Initialise the variables:
+            this._solutions = [];
+            // TODO: consolidate solving equations (inequations vs equations)
+            // TODO: work with not natural degrees ?
+            this._polynom = this._left.clone().subtract(this._right);
+            switch (this._polynom.degree().value) {
+                case 0:
+                case 1:
+                    this._solveDegree1();
+                    break;
+                case 2:
+                    this._solveDegree2();
+                    break;
+                default:
+                    this._solveDegree3plus();
+            }
+            // cleanup the solutions.
+            this._solutions = Equation.makeSolutionsUnique(this._solutions);
+            return this;
+        };
+        this.test = (values) => {
+            return this.left.evaluate(values).isEqual(this.right.evaluate(values));
+        };
+        this.isSameAs = (equ) => {
+            let p1 = equ.clone().moveLeft().left, p2 = this.clone().moveLeft().left;
+            // They are the same.
+            return p1.isEqual(p2) || p1.isOpposedAt(p2);
+        };
+        this.isLinearTo = (equ) => {
+            // Move all left.
+            let p1 = equ.clone().moveLeft().simplify().left, p2 = this.clone().moveLeft().simplify().left;
+            // They are the same.
+            return p1.isEqual(p2) || p1.isOpposedAt(p2);
+        };
+        this._findSign = (equationString) => {
+            let strSign = '';
+            if (equationString.includes('geq')) {
+                return (equationString.includes('\\geq')) ? '\\geq' : 'geq';
+            }
+            else if (equationString.includes('leq')) {
+                return (equationString.includes('\\leq')) ? '\\leq' : 'leq';
+            }
+            else if (equationString.includes('>=')) {
+                return '>=';
+            }
+            else if (equationString.includes('=>')) {
+                return '=>';
+            }
+            else if (equationString.includes('>')) {
+                return '>';
+            }
+            else if (equationString.includes('<=')) {
+                return '<=';
+            }
+            else if (equationString.includes('=<')) {
+                return '=<';
+            }
+            else if (equationString.includes('<')) {
+                return '<';
+            }
+            else if (equationString.includes('=')) {
+                return '=';
+            }
+            if (strSign === '') {
+                console.log('Equation: parse string : sign not found');
+                return false;
+            }
+        };
+        // -----------------------------------------------
+        // Equations solving algorithms
+        this._formatSign = (signStr) => {
+            if (signStr === undefined) {
+                return '=';
+            }
+            if (signStr.includes('geq')) {
+                return '>=';
+            }
+            else if (signStr.includes('>=')) {
+                return '>=';
+            }
+            else if (signStr.includes('=>')) {
+                return '>=';
+            }
+            else if (signStr.includes('>')) {
+                return '>';
+            }
+            else if (signStr.includes('leq')) {
+                return '<=';
+            }
+            else if (signStr.includes('<=')) {
+                return '<=';
+            }
+            else if (signStr.includes('=<')) {
+                return '<=';
+            }
+            else if (signStr.includes('<')) {
+                return '<';
+            }
+            else {
+                return '=';
+            }
+        };
+        this._reverseSign = () => {
+            if (this._sign === '=') {
+                return this;
+            }
+            if (this._sign.includes('<')) {
+                this._sign.replace('<', '>');
+                return this;
+            }
+            if (this._sign.includes('>')) {
+                this._sign.replace('>', '<');
+                return this;
+            }
+            return this;
+        };
+        this.isGreater = () => {
+            if (this._sign.indexOf('>') !== -1) {
+                return true;
+            }
+            return this._sign.indexOf('geq') !== -1;
+        };
+        this.isStrictEqual = () => {
+            return this._sign === '=';
+        };
+        this.isAlsoEqual = () => {
+            if (this._sign.indexOf('=') !== -1) {
+                return true;
+            }
+            if (this._sign.indexOf('geq') !== -1) {
+                return true;
+            }
+            if (this._sign.indexOf('leq') !== -1) {
+                return true;
+            }
+        };
+        this._solveDegree1 = (letter) => {
+            const m1 = this._polynom.monomByDegree(1, letter).coefficient, m0 = this._polynom.monomByDegree(0, letter).coefficient, v = m0.clone().opposed().divide(m1);
+            let s, d;
+            if (this.isStrictEqual()) {
+                if (m1.value === 0) {
+                    // In this case, the coefficient of the x variable is zero.
+                    if (m0.value === 0) {
+                        this._solutions = [{
+                                tex: this._real,
+                                display: "RR",
+                                value: NaN,
+                                exact: false
+                            }];
+                    }
+                    else {
+                        this._solutions = [{
+                                tex: this._varnothing,
+                                display: "O/",
+                                value: NaN,
+                                exact: false
+                            }];
+                    }
+                }
+                else {
+                    this._solutions = [{
+                            tex: v.tex,
+                            display: v.display,
+                            value: v.value,
+                            exact: v
+                        }];
+                }
+            }
+            else {
+                if (m1.value === 0) {
+                    // In this case, the coefficient of the x variable is zero.
+                    if (m0.value === 0 && this.isAlsoEqual()) {
+                        s = '\\mathbb{R}';
+                        d = "RR";
+                    }
+                    else {
+                        if (m0.value > 0) {
+                            s = this.isGreater() ? this._real : this._varnothing;
+                            s = this.isGreater() ? "RR" : "O/";
+                        }
+                        else {
+                            s = !this.isGreater() ? this._real : this._varnothing;
+                            s = !this.isGreater() ? "RR" : "O/";
+                        }
+                    }
+                }
+                else {
+                    // Must handle the case if the m1 monom is negative.
+                    if ((this.isGreater() && m1.sign() === 1) || (!this.isGreater() && m1.sign() === -1)) {
+                        s = `\\left${this.isAlsoEqual() ? '[' : ']'}${v.tex};+\\infty\\right[`;
+                        d = `${this.isAlsoEqual() ? '[' : ']'}${v.tex};+oo[`;
+                    }
+                    else {
+                        s = `\\left]-\\infty;${v.tex} \\right${this.isAlsoEqual() ? ']' : '['}`;
+                        d = `]-oo;${v.tex}${this.isAlsoEqual() ? ']' : '['}`;
+                    }
+                }
+                this._solutions = [{
+                        tex: s,
+                        display: d,
+                        value: NaN,
+                        exact: false
+                    }];
+            }
+            return this._solutions;
+        };
+        this._solveDegree2 = (letter) => {
+            let aF = this._polynom.monomByDegree(2, letter).coefficient, bF = this._polynom.monomByDegree(1, letter).coefficient, cF = this._polynom.monomByDegree(0, letter).coefficient, delta, nthDelta, lcm = numeric_1.Numeric.lcm(aF.denominator, bF.denominator, cF.denominator), a = aF.multiply(lcm).value, b = bF.multiply(lcm).value, c = cF.multiply(lcm).value, realX1, realX2, sX1, sX2;
+            delta = b * b - 4 * a * c;
+            if (delta > 0) {
+                realX1 = (-b - Math.sqrt(delta)) / (2 * a);
+                realX2 = (-b + Math.sqrt(delta)) / (2 * a);
+                if (delta > 1.0e5) {
+                    // The delta is too big to be parsed !
+                    let v1 = ((-b - Math.sqrt(delta)) / (2 * a)).toFixed(5), v2 = ((-b + Math.sqrt(delta)) / (2 * a)).toFixed(5);
+                    this._solutions = [
+                        {
+                            tex: v1,
+                            display: v1,
+                            value: realX1,
+                            exact: false
+                        },
+                        {
+                            tex: v2,
+                            display: v2,
+                            value: realX2,
+                            exact: false
+                        }
+                    ];
+                }
+                else {
+                    nthDelta = new nthRoot_1.NthRoot(delta).reduce();
+                    if (nthDelta.hasRadical()) {
+                        // -b +- coeff\sqrt{radical}
+                        // -------------------------
+                        //           2a
+                        let gcd = numeric_1.Numeric.gcd(b, 2 * a, nthDelta.coefficient), am = a / gcd, bm = b / gcd;
+                        nthDelta.coefficient = nthDelta.coefficient / gcd;
+                        if (a < 0) {
+                            am = -am;
+                            bm = -bm;
+                        }
+                        let tex1 = "", tex2 = "", display1 = "", display2 = "";
+                        tex1 = `${bm !== 0 ? ((-bm) + ' - ') : ''}${nthDelta.tex}`;
+                        tex2 = `${bm !== 0 ? ((-bm) + ' + ') : ''}${nthDelta.tex}`;
+                        display1 = `${bm !== 0 ? ((-bm) + ' - ') : ''}${nthDelta.display}`;
+                        display2 = `${bm !== 0 ? ((-bm) + ' + ') : ''}${nthDelta.display}`;
+                        if (am !== 1) {
+                            tex1 = `\\frac{ ${tex1} }{ ${2 * am} }`;
+                            tex2 = `\\frac{ ${tex2} }{ ${2 * am} }`;
+                        }
+                        this._solutions = [
+                            {
+                                tex: tex1,
+                                display: tex1,
+                                value: realX1,
+                                exact: false
+                            },
+                            {
+                                tex: tex2,
+                                display: tex2,
+                                value: realX2,
+                                exact: false
+                            },
+                        ];
+                        // if (b !== 0) {
+                        //     if (2 * a / gcd === 1) {
+                        //         this._solutions = [
+                        //             {
+                        //                 tex: `${-b / gcd} - ${nthDelta.tex}`,
+                        //                 value: realX1,
+                        //                 exact: false // TODO: implement exact value with nthroot
+                        //             },
+                        //             {
+                        //                 tex: `${-b / gcd} + ${nthDelta.tex}`,
+                        //                 value: realX2,
+                        //                 exact: false
+                        //             },
+                        //
+                        //         ]
+                        //     } else {
+                        //         this._solutions = [
+                        //             {
+                        //                 tex: `\\frac{${-b / gcd} - ${nthDelta.tex} }{ ${2 * a / gcd} }`,
+                        //                 value: realX1,
+                        //                 exact: false
+                        //             },
+                        //             {
+                        //                 tex: `\\frac{${-b / gcd} + ${nthDelta.tex} }{ ${2 * a / gcd} }`,
+                        //                 value: realX2,
+                        //                 exact: false
+                        //             },
+                        //         ]
+                        //     }
+                        // } else {
+                        //     if (2 * a / gcd === 1) {
+                        //         this._solutions = [
+                        //             {
+                        //                 tex: `- ${nthDelta.tex}`,
+                        //                 value: realX1,
+                        //                 exact: false
+                        //             },
+                        //             {
+                        //                 tex: `${nthDelta.tex}`,
+                        //                 value: realX2,
+                        //                 exact: false
+                        //             },
+                        //         ]
+                        //     } else {
+                        //         this._solutions = [
+                        //             {
+                        //                 tex: `\\frac{- ${nthDelta.tex} }{ ${2 * a / gcd} }`,
+                        //                 value: realX1,
+                        //                 exact: false
+                        //             },
+                        //             {
+                        //                 tex: `\\frac{${nthDelta.tex} }{ ${2 * a / gcd} }`,
+                        //                 value: realX2,
+                        //                 exact: false
+                        //             },
+                        //         ]
+                        //     }
+                        // }
+                    }
+                    else {
+                        // -b +- d / 2a
+                        const S1 = new fraction_1.Fraction(-b - nthDelta.coefficient, 2 * a).reduce(), S2 = new fraction_1.Fraction(-b + nthDelta.coefficient, 2 * a).reduce();
+                        this._solutions = [
+                            {
+                                tex: S1.frac,
+                                display: S1.display,
+                                value: realX1,
+                                exact: S1
+                            },
+                            {
+                                tex: S2.frac,
+                                display: S2.display,
+                                value: realX2,
+                                exact: S2
+                            }
+                        ];
+                    }
+                }
+            }
+            else if (delta === 0) {
+                const sol = new fraction_1.Fraction(-b, 2 * a).reduce();
+                this._solutions = [{
+                        tex: sol.frac,
+                        display: sol.display,
+                        value: sol.value,
+                        exact: sol
+                    }];
+            }
+            else {
+                this._solutions = [{
+                        tex: this._varnothing,
+                        display: "O/",
+                        value: NaN,
+                        exact: false
+                    }];
+            }
+            // Handle now the inequations.
+            if (!this.isStrictEqual()) {
+                if (this._solutions.length === 2) {
+                    sX1 = (realX1 < realX2) ? this._solutions[0].tex : this._solutions[1].tex;
+                    sX2 = (realX1 < realX2) ? this._solutions[1].tex : this._solutions[0].tex;
+                    if ((this.isGreater() && aF.sign() === 1) || (!this.isGreater() && aF.sign() === -1)) {
+                        this._solutions = [{
+                                tex: `\\left]-\\infty ; ${sX1}\\right${this.isAlsoEqual() ? ']' : '['} \\cup \\left${this.isAlsoEqual() ? '[' : ']'}${sX2};+\\infty\\right[`,
+                                display: `]-oo;${sX1}${this.isAlsoEqual() ? ']' : '['}uu${this.isAlsoEqual() ? '[' : ']'}${sX2};+oo[`,
+                                value: NaN,
+                                exact: false
+                            }
+                        ];
+                    }
+                    else {
+                        this._solutions = [{
+                                tex: `\\left${this.isAlsoEqual() ? '[' : ']'}${sX1} ; ${sX2}\\right${this.isAlsoEqual() ? ']' : '['}`,
+                                display: `${this.isAlsoEqual() ? '[' : ']'}${sX1};${sX2}${this.isAlsoEqual() ? ']' : '['}`,
+                                value: NaN,
+                                exact: false
+                            }];
+                    }
+                }
+                else if (this._solutions.length === 1 && this._solutions[0].tex !== this._varnothing) {
+                    if (!this.isAlsoEqual()) {
+                        if ((this.isGreater() && aF.sign() === 1) || (!this.isGreater() && aF.sign() === -1)) {
+                            this._solutions = [{
+                                    tex: `\\left]-\\infty ; ${this._solutions[0].tex}\\right[ \\cup \\left]${this._solutions[0].tex};+\\infty\\right[`,
+                                    display: `]-oo;${this._solutions[0].tex}[uu]${this._solutions[0].tex};+oo[`,
+                                    value: NaN,
+                                    exact: false
+                                }
+                            ];
+                        }
+                        else {
+                            this._solutions = [{
+                                    tex: this._varnothing,
+                                    display: "O/",
+                                    value: NaN,
+                                    exact: false
+                                }];
+                        }
+                    }
+                    else {
+                        if ((this.isGreater() && aF.sign() === 1) || (!this.isGreater() && aF.sign() === -1)) {
+                            this._solutions = [{
+                                    tex: this._real,
+                                    display: "RR",
+                                    value: NaN,
+                                    exact: false
+                                }];
+                        }
+                        else {
+                            // this._texSolutions = [ this._texSolutions[0] ];
+                        }
+                    }
+                }
+                else {
+                    if (this.isGreater()) {
+                        this._solutions = [{
+                                tex: aF.sign() === 1 ? this._real : this._varnothing,
+                                display: aF.sign() === 1 ? "RR" : "O/",
+                                value: NaN,
+                                exact: false
+                            }];
+                    }
+                    else {
+                        this._solutions = [{
+                                tex: aF.sign() === -1 ? this._real : this._varnothing,
+                                display: aF.sign() === -1 ? "RR" : "O/",
+                                value: NaN,
+                                exact: false
+                            }];
+                    }
+                }
+            }
+            return this._solutions;
+        };
+        this._solveDegree3plus = (letter) => {
+            // Push everything to the left
+            // factorize
+            // solve each factors.
+            let equ = this.clone().moveLeft();
+            equ.left.factorize();
+            this._solutions = [];
+            equ.left.factors.forEach(factor => {
+                if (factor.degree(letter).leq(2)) {
+                    let factorAsEquation = new Equation(factor, 0);
+                    factorAsEquation.solve();
+                    factorAsEquation.solutions.forEach(solution => {
+                        this._solutions.push(solution);
+                    });
+                }
+                else {
+                    console.log(factor.tex, ': cannot actually get the solution of this equation');
+                }
+            });
+            // TODO: check equation resolution for more than degree 2
+            // this._solutions = [{tex: 'solve x - not yet handled', value: NaN, exact: false}];  // ESLint remove system :(
+            return this._solutions;
+        };
+        // Default equation
+        this._left = new polynom_1.Polynom().zero();
+        this._right = new polynom_1.Polynom().zero();
+        this._sign = '=';
+        if (equations.length === 1) {
+            if (equations[0] instanceof Equation) {
+                return equations[0].clone();
+            }
+            else if (typeof equations[0] === 'string') {
+                this.parse(equations[0]);
+            }
+        }
+        else if (equations.length === 2) {
+            if (equations[0] instanceof polynom_1.Polynom) {
+                this.left = equations[0].clone();
+            }
+            else if (typeof equations[0] === 'string') {
+                this.left = new polynom_1.Polynom(equations[0]);
+            }
+            if (equations[1] instanceof polynom_1.Polynom) {
+                this.right = equations[1].clone();
+            }
+            else if (typeof equations[1] === 'string') {
+                this.right = new polynom_1.Polynom(equations[1]);
+            }
+        }
+        else {
+            // Return default empty equation
+            return this;
+        }
+        return this;
+    }
+    get left() {
+        return this._left;
+    }
+    set left(value) {
+        this._left = value;
+    }
+    get right() {
+        return this._right;
+    }
+    // ------------------------------------------
+    // Getter and setter
+    set right(value) {
+        this._right = value;
+    }
+    get sign() {
+        return this._sign;
+    }
+    set sign(value) {
+        // Set the sign value as formatted.
+        this._sign = this._formatSign(value);
+    }
+    // ------------------------------------------
+    get solutions() {
+        return this._solutions;
+    }
+    get isEquation() {
+        return true;
+    }
+    get solution() {
+        if (this._solutions.length === 1
+            &&
+                (this._solutions[0].tex === this._real
+                    || this._solutions[0].tex === this._varnothing
+                    || this._solutions[0].tex.includes('\\left'))) {
+            return `S = ${this._solutions[0]}`;
+        }
+        return `S = \\left{ ${this._solutions.map(x => x.tex).join(';')} \\right}`;
+    }
+    get isReal() {
+        if (this._solutions === undefined) {
+            this.solve();
+        }
+        return this._solutions[0].tex === this._real;
+    }
+    get isVarnothing() {
+        if (this._solutions === undefined) {
+            this.solve();
+        }
+        return this._solutions[0].tex === this._varnothing;
+    }
+    get signAsTex() {
+        if (this._sign === '>=' || this._sign === '=>' || this._sign === 'geq') {
+            return '\\geq';
+        }
+        if (this._sign === '<=' || this._sign === '=<' || this._sign === 'leq') {
+            return '\\leq';
+        }
+        return this._sign;
+    }
+    get tex() {
+        return `${this._left.tex}${this.signAsTex}${this._right.tex}`;
+    }
+    get display() {
+        return `${this._left.display}${this.signAsTex}${this._right.display}`;
+    }
+    get raw() {
+        return `${this._left.raw}${this.signAsTex}${this._right.raw}`;
+    }
+    get variables() {
+        return [...new Set(this._right.variables.concat(this._left.variables))];
+    }
+    get numberOfVars() {
+        return this.variables.length;
+    }
+    get randomizeDefaults() {
+        return this._randomizeDefaults;
+    }
+    set randomizeDefaults(value) {
+        this._randomizeDefaults = value;
+    }
+    static makeSolutionsUnique(solutions, sorted) {
+        let solutionAsTex = [], uniqueSolutions = solutions.filter(sol => {
+            if (!solutionAsTex.includes(sol.tex)) {
+                solutionAsTex.push(sol.tex);
+                return true;
+            }
+            else {
+                return false;
+            }
+        });
+        if (sorted === true) {
+            uniqueSolutions.sort((a, b) => a.value - b.value);
+        }
+        return uniqueSolutions;
+    }
+}
+exports.Equation = Equation;
 //# sourceMappingURL=equation.js.map