pimath 0.0.102 → 0.0.104

package/dist/pi.js

@@ -179,11 +179,12 @@ class Equation {
             // Start by moving everything to the left.
             this._left.subtract(this._right);
             this._right.zero();
-            for (let m of this._left.monoms) {
+            let values = [...this._left.monoms];
+            for (let m of values) {
                 if (!m.hasLetter(letter)) {
                     mMove = m.clone();
-                    this._left.add(mMove.clone().opposed());
-                    this._right.add(mMove.clone().opposed());
+                    this._left.subtract(mMove);
+                    this._right.subtract(mMove);
                 }
             }
             // In theory, we should have only one item on the left.
@@ -214,7 +215,7 @@ class Equation {
             if (this._sign !== '=' && F.sign() === -1) {
                 this._reverseSign();
             }
-            return this;
+            return this.reorder();
         };
         /**
          * divide an equation by a given value (transformed as a fraction)
@@ -2717,8 +2718,23 @@ class Polynom {
         };
         this.reorder = (letter = 'x') => {
             // TODO: Must handle multiple setLetter reorder system
+            let otherLetters = this.variables.filter(x => x !== letter);
             this._monoms.sort(function (a, b) {
-                return b.degree(letter).clone().subtract(a.degree(letter)).value;
+                let da = a.degree(letter).value, db = b.degree(letter).value;
+                // Values are different
+                if (da !== db)
+                    return db - da;
+                // if values are equals, check other letters.
+                if (otherLetters.length > 0) {
+                    for (let L of otherLetters) {
+                        let da = a.degree(L).value, db = b.degree(L).value;
+                        // Values are different
+                        if (da !== db)
+                            return db - da;
+                    }
+                }
+                return 0;
+                // return b.degree(letter).clone().subtract(a.degree(letter)).value
             });
             return this;
         };
@@ -3365,6 +3381,7 @@ class Polynom {
         }
         // Remove duplicates.
         V = [...new Set(V)];
+        V.sort();
         return V;
     }
     get numberOfVars() {
@@ -6901,6 +6918,15 @@ class Numeric {
         }
         // Find the periodic if it exists.
     }
+    static decompose(value) {
+        let dividers = Numeric.dividers(value), limit = Math.sqrt(value), arr = [], u, v;
+        while (dividers.length > 0) {
+            u = dividers.shift();
+            v = dividers.length > 0 ? dividers.pop() : +u;
+            arr.push([u, v]);
+        }
+        return arr;
+    }
 }
 exports.Numeric = Numeric;