pimath 0.0.123 → 0.0.125

package/.idea/shelf/Uncommitted_changes_before_Checkout_at_09_11_2023_11_01__Default_Changelist_.xml

@@ -0,0 +1,4 @@
+<changelist name="Uncommitted_changes_before_Checkout_at_09_11_2023_11_01_[Default_Changelist]" date="1699524101881" recycled="false" toDelete="true">
+  <option name="PATH" value="$PROJECT_DIR$/.idea/shelf/Uncommitted_changes_before_Checkout_at_09_11_2023_11_01_[Default_Changelist]/shelved.patch" />
+  <option name="DESCRIPTION" value="Uncommitted changes before Checkout at 09.11.2023 11:01 [Default Changelist]" />
+</changelist>

package/dist/pimath.js

@@ -3581,7 +3581,15 @@ class Rational {
         this.reduce = () => {
             this._numerator.factorize();
             for (let f of this._numerator.factors) {
-                this.simplify(f);
+                if (f.degree().isZero()) {
+                    // Do the simplify only if the factor can divide the denominator
+                    if (this._denominator.commonMonom().coefficient.clone().divide(f.monomByDegree().coefficient).isNatural()) {
+                        this.simplify(f);
+                    }
+                }
+                else {
+                    this.simplify(f);
+                }
             }
             return this;
         };
@@ -3687,6 +3695,9 @@ class Rational {
     get tex() {
         return `\\frac{ ${this._numerator.tex} }{ ${this._denominator.tex} }`;
     }
+    get display() {
+        return `(${this._numerator.display})/(${this._denominator.display})`;
+    }
     get texFactors() {
         return `\\frac{ ${this._numerator.texFactors} }{ ${this._denominator.texFactors} }`;
     }
@@ -6140,6 +6151,7 @@ class Triangle {
             return new vector_1.Vector(this.getPointByName(ptName1), this.getPointByName(ptName2));
         };
         this._calculateRemarquableLines = () => {
+            const bA = this._calculateBisectors('A'), bB = this._calculateBisectors('B'), bC = this._calculateBisectors('C');
             let remarquables = {
                 'medians': {
                     'A': new line_1.Line(this._A, this._middles.BC),
@@ -6160,9 +6172,15 @@ class Triangle {
                     'intersection': null
                 },
                 'bisectors': {
-                    'A': this._calculateBisectors('A'),
-                    'B': this._calculateBisectors('B'),
-                    'C': this._calculateBisectors('C'),
+                    'A': bA.internal,
+                    'B': bB.internal,
+                    'C': bB.internal,
+                    'intersection': null
+                },
+                externalBisectors: {
+                    'A': bA.external,
+                    'B': bB.external,
+                    'C': bC.external,
                     'intersection': null
                 }
             };
@@ -6191,16 +6209,16 @@ class Triangle {
             let b1 = new line_1.Line(new equation_1.Equation(d1.equation.left.clone().multiply(d2.n.simplify().norm), d2.equation.left.clone().multiply(d1.n.simplify().norm)).reorder(true).simplify()), b2 = new line_1.Line(new equation_1.Equation(d1.equation.left.clone().multiply(d2.n.simplify().norm), d2.equation.left.clone().multiply(d1.n.simplify().norm).opposed()).reorder(true).simplify());
             // Must determine which bisectors is in the triangle
             if (pt === 'A') {
-                return b1.hitSegment(this.B, this.C) ? b1 : b2;
+                return b1.hitSegment(this.B, this.C) ? { internal: b1, external: b2 } : { internal: b2, external: b1 };
             }
             if (pt === 'B') {
-                return b1.hitSegment(this.A, this.C) ? b1 : b2;
+                return b1.hitSegment(this.A, this.C) ? { internal: b1, external: b2 } : { internal: b2, external: b1 };
             }
             if (pt === 'C') {
-                return b1.hitSegment(this.B, this.A) ? b1 : b2;
+                return b1.hitSegment(this.B, this.A) ? { internal: b1, external: b2 } : { internal: b2, external: b1 };
             }
             // Default returns the first bisector
-            return b1;
+            return { internal: b1, external: b2 };
         };
         if (values.length > 0) {
             this.parse(...values);
@@ -6894,8 +6912,8 @@ var Random;
         return (new rndFraction_1.rndFraction(config)).generate();
     }
     Random.fraction = fraction;
-    function number(from, to) {
-        return rndHelpers_1.rndHelpers.randomInt(from, to);
+    function number(from, to, exclude) {
+        return rndHelpers_1.rndHelpers.randomInt(from, to, exclude);
     }
     Random.number = number;
     function numberSym(max, allowZero) {
@@ -7158,11 +7176,32 @@ class rndHelpers {
      * @param a (number) : From this value to the second value. If the second is ommited, this value is the max value.
      * @param b (number) : To this value. If this is ommited.
      */
-    static randomInt(a, b) {
+    static randomInt(a, b, exclude) {
         if (b === undefined) {
-            return this.randomInt(0, a);
+            if (a >= 0) {
+                return this.randomInt(0, a);
+            }
+            else {
+                return this.randomInt(a, 0);
+            }
+        }
+        // Same start and end values
+        if (a === b) {
+            return a;
+        }
+        // No exclusion
+        if (exclude === undefined) {
+            return Math.floor(Math.random() * (b - a + 1) + a);
+        }
+        // With exclusion
+        if (Math.abs(b - a) <= exclude.length) {
+            throw new Error('The number of excluded values is too high.');
+        }
+        let r = this.randomInt(a, b);
+        while (exclude.includes(r)) {
+            r = this.randomInt(a, b);
         }
-        return Math.floor(Math.random() * (b - a + 1) + a);
+        return r;
     }
     /**
      * Random integer between -max and max value.
@@ -7199,7 +7238,7 @@ class rndHelpers {
         if (arr.length === 0) {
             return '';
         }
-        return this.randomArray(arr, 1)[0];
+        return arr[this.randomInt(0, arr.length - 1)];
     }
     static shuffleArray(arr) {
         // The Fisher-Yates algorithm