pimath 0.1.21 → 0.1.23

package/dist/algebra/polyFactor.d.ts

@@ -14,7 +14,7 @@ export declare class PolyFactor implements IPiMathObject<PolyFactor>, IExpressio
     get asPower(): this;
     get asRoot(): this;
     degree(letter?: string): Fraction;
-    get denominator(): Factor[];
+    get denominator(): PolyFactor;
     derivative(): this;
     develop(): Polynom;
     divide(value: PolyFactor): this;
@@ -30,7 +30,7 @@ export declare class PolyFactor implements IPiMathObject<PolyFactor>, IExpressio
     isOne(): boolean;
     isZero(): boolean;
     multiply(...values: PolyFactor[]): this;
-    get numerator(): Factor[];
+    get numerator(): PolyFactor;
     one(): this;
     opposite(): this;
     pow(value: number | Fraction): this;

package/dist/pimath.interface.d.ts

@@ -58,7 +58,7 @@ export interface ISolution {
     tex: string;
     value: number;
 }
-export type TABLE_OF_SIGNS_VALUES = '-' | '+' | 'h' | 'z' | 't' | 'd' | '';
+export type TABLE_OF_SIGNS_VALUES = '-' | '+' | 'h' | 'z' | 't' | 'd' | 'u' | 'n' | '';
 export interface TABLE_OF_SIGNS {
     roots: ISolution[];
     signs: TABLE_OF_SIGNS_VALUES[];

package/dist/pimath.js

@@ -391,37 +391,37 @@ class vt {
   }
 }
 Z = new WeakMap(), ee = new WeakMap(), ie = new WeakMap(), Xe = new WeakMap();
-var ue, je, P, ot, ye, bi, ti, xi, Ei, Ni;
+var fe, je, P, ot, ye, bi, ti, xi, Ei, Ni;
 const mi = class mi {
   constructor(e, t, i = "x") {
     p(this, P);
-    p(this, ue);
+    p(this, fe);
     p(this, je);
     if (h(this, je, i), Object.hasOwn(e, "moveLeft")) {
       const n = e;
-      h(this, ue, n.left.clone().subtract(n.right));
+      h(this, fe, n.left.clone().subtract(n.right));
     } else
-      h(this, ue, e.clone().subtract(t ?? 0));
+      h(this, fe, e.clone().subtract(t ?? 0));
   }
   solve() {
-    if (s(this, ue).degree().isOne())
+    if (s(this, fe).degree().isOne())
       return q(this, P, xi).call(this);
-    if (s(this, ue).degree().value === 2)
+    if (s(this, fe).degree().value === 2)
       return q(this, P, Ei).call(this);
     const e = q(this, P, bi).call(this);
     if (e.length > 0)
       return e;
-    if (s(this, ue).degree().value === 3)
+    if (s(this, fe).degree().value === 3)
       return q(this, P, ti).call(this);
     throw new Error("The equation degree is too high.");
   }
   solveAsCardan() {
-    if (s(this, ue).degree().value !== 3)
+    if (s(this, fe).degree().value !== 3)
       throw new Error("The equation is not cubic.");
     return q(this, P, ti).call(this);
   }
 };
-ue = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
+fe = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
   return {
     variable: s(this, je),
     exact: !1,
@@ -441,7 +441,7 @@ ue = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
     display: t.display
   };
 }, bi = function() {
-  let e = s(this, ue).clone(), t = [];
+  let e = s(this, fe).clone(), t = [];
   const i = e.lcmDenominator();
   i !== 1 && e.multiply(i);
   const n = e.monomByDegree().coefficient;
@@ -457,7 +457,7 @@ ue = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
   for (const f of t) {
     if (f.exact !== !1 && f.exact.isZero())
       continue;
-    const g = s(this, ue).clone().parse("x", f.exact.denominator, -f.exact.numerator);
+    const g = s(this, fe).clone().parse("x", f.exact.denominator, -f.exact.numerator);
     for (; e.isDividableBy(g); )
       e = e.divide(g);
   }
@@ -468,32 +468,32 @@ ue = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
   const d = new mi(e, e.clone().parse("0"), s(this, je));
   return t = t.concat(d.solve()), t.sort((f, g) => f.value - g.value);
 }, ti = function() {
-  const e = s(this, ue), t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, n = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, l = i.clone().divide(t), c = n.clone().divide(t), d = r.clone().divide(t), f = c.clone().subtract(l.clone().pow(2).divide(3)), g = d.clone().subtract(l.clone().multiply(c).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), N = g.clone().opposite(), V = f.clone().opposite().pow(3).divide(27), de = N.clone().pow(2).subtract(V.clone().multiply(4)).opposite();
-  if (de.isNegative()) {
-    const he = g.clone().opposite().add(de.clone().opposite().sqrt()).divide(2).root(3), ae = g.clone().opposite().subtract(de.clone().opposite().sqrt()).divide(2).root(3), ge = he.clone().add(ae).subtract(l.clone().divide(3));
+  const e = s(this, fe), t = e.monomByDegree(3).coefficient, i = e.monomByDegree(2).coefficient, n = e.monomByDegree(1).coefficient, r = e.monomByDegree(0).coefficient, l = i.clone().divide(t), c = n.clone().divide(t), d = r.clone().divide(t), f = c.clone().subtract(l.clone().pow(2).divide(3)), g = d.clone().subtract(l.clone().multiply(c).divide(3)).add(l.clone().pow(3).multiply(2).divide(27)), N = g.clone().opposite(), V = f.clone().opposite().pow(3).divide(27), pe = N.clone().pow(2).subtract(V.clone().multiply(4)).opposite();
+  if (pe.isNegative()) {
+    const he = g.clone().opposite().add(pe.clone().opposite().sqrt()).divide(2).root(3), ae = g.clone().opposite().subtract(pe.clone().opposite().sqrt()).divide(2).root(3), ge = he.clone().add(ae).subtract(l.clone().divide(3));
     return [q(this, P, ye).call(this, ge)];
   }
-  if (de.isZero()) {
+  if (pe.isZero()) {
     const he = g.clone().opposite().divide(2).root(3), ae = he.clone().opposite().subtract(l.clone().divide(3)), ge = he.clone().multiply(2).subtract(l.clone().divide(3));
     return ae.isEqual(ge) ? [q(this, P, ye).call(this, ae)] : [
       q(this, P, ye).call(this, ge),
       q(this, P, ye).call(this, ae)
-    ].sort((pe, ce) => pe.value - ce.value);
+    ].sort((me, ce) => me.value - ce.value);
   }
-  if (de.isPositive()) {
-    const he = [], ae = f.value, ge = g.value, pe = l.value;
+  if (pe.isPositive()) {
+    const he = [], ae = f.value, ge = g.value, me = l.value;
     for (let ce = 0; ce < 3; ce++)
-      he.push(2 * Math.sqrt(-ae / 3) * Math.cos(Math.acos(3 * ge / (2 * ae) * Math.sqrt(-3 / ae)) / 3 + 2 * Math.PI * ce / 3) - pe / 3);
+      he.push(2 * Math.sqrt(-ae / 3) * Math.cos(Math.acos(3 * ge / (2 * ae) * Math.sqrt(-3 / ae)) / 3 + 2 * Math.PI * ce / 3) - me / 3);
     return he.map((ce) => q(this, P, ot).call(this, ce)).sort((ce, nt) => ce.value - nt.value);
   }
   return [];
 }, xi = function() {
-  const e = s(this, ue).monomByDegree(0).coefficient.clone().opposite().divide(s(this, ue).monomByDegree(1).coefficient);
+  const e = s(this, fe).monomByDegree(0).coefficient.clone().opposite().divide(s(this, fe).monomByDegree(1).coefficient);
   return [
     q(this, P, ye).call(this, e)
   ];
 }, Ei = function() {
-  const e = s(this, ue), t = e.monomByDegree(2).coefficient, i = e.monomByDegree(1).coefficient, n = e.monomByDegree(0).coefficient, r = i.clone().pow(2).subtract(t.clone().multiply(n).multiply(4));
+  const e = s(this, fe), t = e.monomByDegree(2).coefficient, i = e.monomByDegree(1).coefficient, n = e.monomByDegree(0).coefficient, r = i.clone().pow(2).subtract(t.clone().multiply(n).multiply(4));
   if (r.isNegative())
     return [];
   if (r.isSquare()) {
@@ -505,24 +505,24 @@ ue = new WeakMap(), je = new WeakMap(), P = new WeakSet(), ot = function(e, t) {
   }
   return q(this, P, Ni).call(this, t, i, r);
 }, Ni = function(e, t, i) {
-  const n = G.dividers(i.value).filter((pe) => Math.sqrt(pe) % 1 === 0).map((pe) => Math.sqrt(pe)).pop() ?? 1, r = G.gcd(2 * e.value, t.value, n) * (e.isNegative() ? -1 : 1), l = t.clone().divide(r).opposite(), c = e.clone().divide(r).multiply(2), d = i.clone().divide(n ** 2), f = Math.abs(n / r), g = n === 1 ? "-" : `-${f} `, N = n === 1 ? "+" : `+${f} `;
-  function V(pe, ce, nt, Kt) {
-    return `\\frac{ ${ce} ${nt}\\sqrt{ ${Kt} } }{ ${pe} }`;
+  const n = G.dividers(i.value).filter((me) => Math.sqrt(me) % 1 === 0).map((me) => Math.sqrt(me)).pop() ?? 1, r = G.gcd(2 * e.value, t.value, n) * (e.isNegative() ? -1 : 1), l = t.clone().divide(r).opposite(), c = e.clone().divide(r).multiply(2), d = i.clone().divide(n ** 2), f = Math.abs(n / r), g = n === 1 ? "-" : `-${f} `, N = n === 1 ? "+" : `+${f} `;
+  function V(me, ce, nt, Kt) {
+    return `\\frac{ ${ce} ${nt}\\sqrt{ ${Kt} } }{ ${me} }`;
   }
-  function de(pe, ce, nt, Kt) {
-    return `(${ce}${nt}sqrt(${Kt}))/${pe}`;
+  function pe(me, ce, nt, Kt) {
+    return `(${ce}${nt}sqrt(${Kt}))/${me}`;
   }
   const he = i.value ** 0.5, ae = (-t.value - he) / (2 * e.value), ge = (-t.value + he) / (2 * e.value);
   return [
     q(this, P, ot).call(this, ae, {
       tex: V(c.tex, l.tex, g.toString(), d.tex),
-      display: de(c.display, l.display, g.toString(), d.display)
+      display: pe(c.display, l.display, g.toString(), d.display)
     }),
     q(this, P, ot).call(this, ge, {
       tex: V(c.tex, l.tex, N.toString(), d.tex),
-      display: de(c.display, l.display, N.toString(), d.display)
+      display: pe(c.display, l.display, N.toString(), d.display)
     })
-  ].sort((pe, ce) => pe.value - ce.value);
+  ].sort((me, ce) => me.value - ce.value);
 };
 let Nt = mi;
 var Gi = Object.defineProperty, Ti = (o) => {
@@ -1470,8 +1470,8 @@ const C = class C {
             else {
               const f = i.euclidean(d);
               t.push(d), i = f.quotient.clone(), c = c.filter((g) => {
-                const N = i.monoms[0], V = i.monoms[i.monoms.length - 1], de = g.monoms[0], he = g.monoms[g.monoms.length - 1];
-                return V.isDivisible(he) ? N.isDivisible(de) : !1;
+                const N = i.monoms[0], V = i.monoms[i.monoms.length - 1], pe = g.monoms[0], he = g.monoms[g.monoms.length - 1];
+                return V.isDivisible(he) ? N.isDivisible(pe) : !1;
               });
             }
           }
@@ -1689,10 +1689,10 @@ const C = class C {
           new C(e).subtract(f.display).multiply(f.denominator)
         ]) : [this.clone()];
       if (n = this.monomByDegree(2, e), r = this.monomByDegree(1, e), l = this.monomByDegree(0, e), n.isLiteralSquare() && l.isLiteralSquare() && r.clone().pow(2).isSameAs(n.clone().multiply(l))) {
-        const V = new C("x", n.coefficient, r.coefficient, l.coefficient), de = s(N = V, $t).call(N, "x"), he = [];
+        const V = new C("x", n.coefficient, r.coefficient, l.coefficient), pe = s(N = V, $t).call(N, "x"), he = [];
         let ae;
-        if (de.length >= 2) {
-          for (const ge of de)
+        if (pe.length >= 2) {
+          for (const ge of pe)
             ge.degree().isZero() ? he.push(ge.clone()) : (ae = ge.clone(), ae.monoms[0].literal = n.literalSqrt, ae.monoms[1].literal = l.literalSqrt, he.push(ae.clone()));
           return he;
         }
@@ -2610,7 +2610,7 @@ Oe = new WeakMap(), pt = new WeakSet(), si = function(e, t) {
   return [...i[0]].sort();
 };
 var tt, E, mt, ri, gt, oi;
-const me = class me {
+const ue = class ue {
   constructor(...e) {
     p(this, gt);
     p(this, tt, at.POWER);
@@ -2622,11 +2622,11 @@ const me = class me {
       if (typeof t == "string") {
         const i = t.split(")(").join(")*(").split("*");
         s(this, E).push(...i.map((n) => new le(n)));
-      } else t instanceof me ? s(this, E).push(...t.factors.map((i) => i.clone())) : s(this, E).push(new le(t));
+      } else t instanceof ue ? s(this, E).push(...t.factors.map((i) => i.clone())) : s(this, E).push(new le(t));
     }), this);
   }
   clone() {
-    return new me(...s(this, E).map((e) => e.clone()));
+    return new ue(...s(this, E).map((e) => e.clone()));
   }
   get tex() {
     const { num: e, den: t } = q(this, gt, oi).call(this);
@@ -2645,20 +2645,20 @@ const me = class me {
   static gcd(...e) {
     var i;
     if (e.length === 0)
-      return new me().one();
+      return new ue().one();
     if (e.length === 1)
       return e[0];
     if (e.length === 2)
-      return q(i = me, mt, ri).call(i, e[0], e[1]);
+      return q(i = ue, mt, ri).call(i, e[0], e[1]);
     let t = e[0];
     return e.shift(), e.forEach((n) => {
       var r;
-      return t = q(r = me, mt, ri).call(r, t, n);
+      return t = q(r = ue, mt, ri).call(r, t, n);
     }), t;
   }
   add(...e) {
     let t = [this, ...e];
-    const i = me.gcd(...t);
+    const i = ue.gcd(...t);
     t = t.map((r) => r.divide(i).reduce());
     const n = new O("0");
     return t.forEach((r) => n.add(r.develop())), h(this, E, [
@@ -2676,13 +2676,13 @@ const me = class me {
     return s(this, E).reduce((t, i) => t.add(i.degree(e)), new u("0"));
   }
   get denominator() {
-    return s(this, E).filter((e) => e.power.isNegative());
+    return new ue(...s(this, E).filter((e) => e.power.isNegative()));
   }
   derivative() {
     const e = [], t = s(this, E).length;
     for (let n = 0; n < t; n++) {
       const r = s(this, E).slice(), l = r.splice(n, 1)[0];
-      e.push(new me(...r).multiply(new me(...l.derivative())));
+      e.push(new ue(...r).multiply(new ue(...l.derivative())));
     }
     e.forEach((n) => n.reduce());
     const i = e.shift();
@@ -2727,7 +2727,7 @@ const me = class me {
     return h(this, E, s(this, E).map((e) => e.inverse())), this;
   }
   isEqual(e) {
-    const t = me.gcd(this, e), i = this.clone().divide(t).reduce(), n = e.clone().divide(t).reduce();
+    const t = ue.gcd(this, e), i = this.clone().divide(t).reduce(), n = e.clone().divide(t).reduce();
     return i.isOne() && n.isOne();
   }
   isOne() {
@@ -2742,7 +2742,7 @@ const me = class me {
     }), this;
   }
   get numerator() {
-    return s(this, E).filter((e) => e.power.isPositive());
+    return new ue(...s(this, E).filter((e) => e.power.isPositive()));
   }
   one() {
     return h(this, E, [new le("1", "1")]), this;
@@ -2807,12 +2807,12 @@ tt = new WeakMap(), E = new WeakMap(), mt = new WeakSet(), ri = function(e, t) {
     const d = i[c].reduce((g, N) => g.add(N.power), new u("0")), f = n[c].reduce((g, N) => g.add(N.power), new u("0"));
     return new le(c, u.min(d, f));
   });
-  return new me(...l);
+  return new ue(...l);
 }, gt = new WeakSet(), oi = function() {
   let e, t = [];
-  return s(this, tt) === at.ROOT ? (e = this.numerator, t = this.denominator.map((i) => i.clone().inverse())) : e = s(this, E), e.length === 0 && (e = [new le("1")]), { num: e, den: t };
-}, p(me, mt);
-let ni = me;
+  return s(this, tt) === at.ROOT ? (e = this.numerator.factors, t = this.denominator.factors.map((i) => i.clone().inverse())) : e = s(this, E), e.length === 0 && (e = [new le("1")]), { num: e, den: t };
+}, p(ue, mt);
+let ni = ue;
 function ei(o) {
   const e = new u().one(), t = o.factors.reduce((i, n) => {
     if (n.polynom.degree().isZero())
@@ -3041,22 +3041,22 @@ var we = /* @__PURE__ */ ((o) => (o.None = "none", o.Parallel = "parallel", o.Pe
 function qi(o = 0.5) {
   return Math.random() < o;
 }
-function fe(o, e, t) {
+function de(o, e, t) {
   if (e === void 0)
-    return o >= 0 ? fe(0, o) : fe(o, 0);
+    return o >= 0 ? de(0, o) : de(o, 0);
   if (o === e)
     return o;
   if (t === void 0)
     return Math.floor(Math.random() * (e - o + 1) + o);
   if (Math.abs(e - o) <= t.length)
     throw new Error("The number of excluded values is too high.");
-  let i = fe(o, e);
+  let i = de(o, e);
   for (; t.includes(i); )
-    i = fe(o, e);
+    i = de(o, e);
   return i;
 }
 function Y(o, e) {
-  return e === !1 ? qi() ? fe(1, o) : -fe(1, o) : fe(-o, o);
+  return e === !1 ? qi() ? de(1, o) : -de(1, o) : de(-o, o);
 }
 function rs(o) {
   let e = G.primes();
@@ -3066,7 +3066,7 @@ function os(o, e) {
   return e === void 0 && (e = 1), o.length <= 0 ? Object.values(o) : ki(o).slice(0, e);
 }
 function pi(o) {
-  return o.length === 0 ? null : o[fe(0, o.length - 1)];
+  return o.length === 0 ? null : o[de(0, o.length - 1)];
 }
 function ki(o) {
   const e = Object.values(o);
@@ -3984,12 +3984,12 @@ function Ot(o) {
     },
     o
   ), t = new u();
-  if (e.negative ? t.numerator = Y(e.max, e.zero) : t.numerator = fe(e.zero ? 0 : 1, e.max), e.natural)
+  if (e.negative ? t.numerator = Y(e.max, e.zero) : t.numerator = de(e.zero ? 0 : 1, e.max), e.natural)
     t.denominator = 1;
   else {
     let i = 0;
     for (; t.isRelative() && i < 10; )
-      t.denominator = fe(1, e.max), i++;
+      t.denominator = de(1, e.max), i++;
   }
   return e.reduced ? t.reduce() : t;
 }
@@ -4044,7 +4044,7 @@ function Bi(o) {
     }), e.unit && e.degree === n && i.coefficient.one(), t.add(i);
   if (e.positive && t.monomByDegree().coefficient.isNegative() && t.monomByDegree().coefficient.opposite(), e.numberOfMonoms && e.numberOfMonoms > 0 && e.numberOfMonoms < t.length)
     for (; t.length > e.numberOfMonoms; ) {
-      const n = fe(1, t.length - 1);
+      const n = de(1, t.length - 1);
       t.monoms.splice(n, 1);
     }
   return t.reduce();
@@ -4106,7 +4106,7 @@ function cs(o) {
     o
   ), t = ui(e.center);
   let i, n;
-  return e.pointsOnCircle === 8 ? (i = fe(1, 3), n = i ** 2 + (i + 1) ** 2) : n = fe(1, 20), new Tt(t, n, !0);
+  return e.pointsOnCircle === 8 ? (i = de(1, 3), n = i ** 2 + (i + 1) ** 2) : n = de(1, 20), new Tt(t, n, !0);
 }
 function us(o) {
   const e = Object.assign(
@@ -4148,7 +4148,7 @@ const ds = {
   polynom: (o) => Bi(o),
   monom: (o) => Pi(o),
   fraction: (o) => Ot(o),
-  number: (o, e, t) => fe(o, e, t),
+  number: (o, e, t) => de(o, e, t),
   numberSym: (o, e) => Y(o, e),
   prime: (o) => rs(o),
   bool: (o) => qi(o),