nerdamer 2.0.0-rc.2 → 2.0.0

package/dist/bundle.js.LICENSE.txt

@@ -1,7 +1,7 @@
 /*!
-   *  decimal.js v10.6.0
-   *  An arbitrary-precision Decimal type for JavaScript.
-   *  https://github.com/MikeMcl/decimal.js
-   *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
-   *  MIT Licence
-   */
+ *  decimal.js v10.6.0
+ *  An arbitrary-precision Decimal type for JavaScript.
+ *  https://github.com/MikeMcl/decimal.js
+ *  Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
+ *  MIT Licence
+ */

package/output/algebra/dispatch.js

@@ -1,8 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.loadAlgebraFunctions = loadAlgebraFunctions;
-const dispatch_1 = require("../core/dispatch");
 const constants_1 = require("../core/classes/parser/constants");
+const dispatch_1 = require("../core/dispatch");
 const adapters_1 = require("./adapters");
 const factor_1 = require("./factor/factor");
 const gcd_1 = require("./gcd/gcd");

package/output/algebra/partfrac.js

@@ -344,7 +344,7 @@ function solveLinearSystem(A, b) {
         if (pivot === -1) {
             continue;
         }
-        if (!aug.elements[i][pivot].eq('1')) {
+        if (!aug.elements[i][pivot].eq((0, shortcuts_1.one)())) {
             return undefined;
         }
         if (pivotCols.has(pivot)) {

package/output/algebra/simplify/funcsimp.js

@@ -337,7 +337,7 @@ function simplifyLogs(x) {
     // Principal-log identities such as log(a)+log(b)=log(a*b) and
     // c*log(a)=log(a^c) are only branch-safe when the log arguments are
     // provably positive real values. Preserve unknown-sign terms unchanged.
-    const transformableLogTerms = logTerms.filter(t => !t.arg.isComplex() && t.arg.gt(0));
+    const transformableLogTerms = logTerms.filter(t => !t.arg.isComplex() && t.arg.gt((0, shortcuts_1.zero)()));
     if (transformableLogTerms.length === 0) {
         return x;
     }

package/output/algebra/simplify/ratsimp.js

@@ -72,7 +72,7 @@ function simplifyRadicals(x) {
                 // Principal radicals can be combined when both radicands are known nonnegative.
                 // Reciprocals still require a strictly signed base because a zero denominator
                 // cannot be admitted by the sign proof for a negative power.
-                if (!u.isComplex() && !v.isComplex() && u.gte(0) && v.gte(0)) {
+                if (!u.isComplex() && !v.isComplex() && u.gte((0, shortcuts_1.zero)()) && v.gte((0, shortcuts_1.zero)())) {
                     const multiplier = a.getMultiplier().times(b.getMultiplier());
                     if (u.isNUM() && v.isNUM()) {
                         // Preserve exact numeric reduction when the combined radicand is numeric.

package/output/algebra/utils.d.ts

@@ -1,6 +1,6 @@
 import { Expression } from '../core/classes/expression/Expression';
 import type { ExpressionInput } from '../core/types';
-/** Components of a quadratic rewritten by {@link sqcomp}. */
+/** Components of a quadratic rewritten in completed-square form. */
 export interface CompleteSquareResult {
     /** Original quadratic coefficient. */
     a: Expression;

package/output/algebra/utils.js

@@ -38,11 +38,11 @@ function sqcomp(expr, variable) {
     const b = c.hasPower(1) ? c.getPower(1) : (0, shortcuts_1.zero)();
     const k0 = c.hasPower(0) ? c.getPower(0) : (0, shortcuts_1.zero)();
     // h = b / (2a)
-    const h = b.div(a.times(2));
+    const h = b.div(a.times((0, shortcuts_1.two)()));
     // k = c - b² / (4a)
-    const k = k0.minus(b.pow(2).div(a.times(4)));
+    const k = k0.minus(b.pow((0, shortcuts_1.two)()).div(a.times((0, shortcuts_1.four)())));
     // Build a*(variable + h)^2 + k
     const x = Expression_1.Expression.create(variable);
-    const expression = a.times(x.plus(h).pow(2)).plus(k);
+    const expression = a.times(x.plus(h).pow((0, shortcuts_1.two)())).plus(k);
     return { a, h, k, variable, expression };
 }

package/output/api/algebra.d.ts

@@ -1,10 +1,27 @@
-/** Public symbolic algebra and polynomial APIs. */
+import type { CompleteSquareResult } from '../algebra/utils';
+import type { ExpressionInput } from '../core/types';
 export { factor, pfactor, pfactord, polyFactors } from '../algebra/factor/factor';
 export { gcd, lcm } from '../algebra/gcd/gcd';
 export { groebner } from '../algebra/groebner';
 export { partfrac } from '../algebra/partfrac';
 export { simplify } from '../algebra/simplify/simplify';
-export { sqcomp as completeSquare } from '../algebra/utils';
+/**
+ * Completes the square for a quadratic expression.
+ *
+ * For `a*x^2+b*x+c`, the returned expression has the form
+ * `a*(x+h)^2+k`, with `h=b/(2*a)` and `k=c-b^2/(4*a)`.
+ *
+ * @param expr - Quadratic expression to rewrite.
+ * @param variable - Variable to use. Defaults to the first variable in the expression.
+ * @returns The quadratic coefficient, shift, remainder, selected variable, and rewritten expression.
+ *
+ * @example
+ * ```ts
+ * const result = completeSquare('x^2+6*x+1');
+ * result.expression.text({ sort: true }); // "(3+x)^2-8"
+ * ```
+ */
+export declare const completeSquare: (expr: ExpressionInput, variable?: string) => CompleteSquareResult;
 export type { CompleteSquareResult } from '../algebra/utils';
 export { CoeffObject } from '../core/classes/expression/CoeffObject';
 export { coeffs, content, deg } from '../core/classes/polynomial/functions';

package/output/api/algebra.js

@@ -2,6 +2,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.isPrime = exports.uUnSub = exports.uSub = exports.Term = exports.Polynomial = exports.deg = exports.content = exports.coeffs = exports.CoeffObject = exports.completeSquare = exports.simplify = exports.partfrac = exports.groebner = exports.lcm = exports.gcd = exports.polyFactors = exports.pfactord = exports.pfactor = exports.factor = void 0;
 /** Public symbolic algebra and polynomial APIs. */
+const utils_1 = require("../algebra/utils");
 var factor_1 = require("../algebra/factor/factor");
 Object.defineProperty(exports, "factor", { enumerable: true, get: function () { return factor_1.factor; } });
 Object.defineProperty(exports, "pfactor", { enumerable: true, get: function () { return factor_1.pfactor; } });
@@ -16,8 +17,23 @@ var partfrac_1 = require("../algebra/partfrac");
 Object.defineProperty(exports, "partfrac", { enumerable: true, get: function () { return partfrac_1.partfrac; } });
 var simplify_1 = require("../algebra/simplify/simplify");
 Object.defineProperty(exports, "simplify", { enumerable: true, get: function () { return simplify_1.simplify; } });
-var utils_1 = require("../algebra/utils");
-Object.defineProperty(exports, "completeSquare", { enumerable: true, get: function () { return utils_1.sqcomp; } });
+/**
+ * Completes the square for a quadratic expression.
+ *
+ * For `a*x^2+b*x+c`, the returned expression has the form
+ * `a*(x+h)^2+k`, with `h=b/(2*a)` and `k=c-b^2/(4*a)`.
+ *
+ * @param expr - Quadratic expression to rewrite.
+ * @param variable - Variable to use. Defaults to the first variable in the expression.
+ * @returns The quadratic coefficient, shift, remainder, selected variable, and rewritten expression.
+ *
+ * @example
+ * ```ts
+ * const result = completeSquare('x^2+6*x+1');
+ * result.expression.text({ sort: true }); // "(3+x)^2-8"
+ * ```
+ */
+exports.completeSquare = utils_1.sqcomp;
 var CoeffObject_1 = require("../core/classes/expression/CoeffObject");
 Object.defineProperty(exports, "CoeffObject", { enumerable: true, get: function () { return CoeffObject_1.CoeffObject; } });
 var functions_1 = require("../core/classes/polynomial/functions");

package/output/api/assumptions.d.ts

@@ -1,4 +1,4 @@
-export { assume, clearAssumptions, forgetAssumptionFor, getAssumptionFor, } from '../core/classes/assumption/assume';
+export { assume, clearAssumptions, forgetAssumptionFor, getAssumptionFor, getAssumptions, } from '../core/classes/assumption/assume';
 /** Public process-wide assumption APIs. */
 export { Assumption } from '../core/classes/assumption/Assumption';
 export type { AssumptionComparison, AssumptionValue, Bound, ParsedAssumption, } from '../core/classes/assumption/Assumption';

package/output/api/assumptions.js

@@ -1,11 +1,12 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Assumption = exports.getAssumptionFor = exports.forgetAssumptionFor = exports.clearAssumptions = exports.assume = void 0;
+exports.Assumption = exports.getAssumptions = exports.getAssumptionFor = exports.forgetAssumptionFor = exports.clearAssumptions = exports.assume = void 0;
 var assume_1 = require("../core/classes/assumption/assume");
 Object.defineProperty(exports, "assume", { enumerable: true, get: function () { return assume_1.assume; } });
 Object.defineProperty(exports, "clearAssumptions", { enumerable: true, get: function () { return assume_1.clearAssumptions; } });
 Object.defineProperty(exports, "forgetAssumptionFor", { enumerable: true, get: function () { return assume_1.forgetAssumptionFor; } });
 Object.defineProperty(exports, "getAssumptionFor", { enumerable: true, get: function () { return assume_1.getAssumptionFor; } });
+Object.defineProperty(exports, "getAssumptions", { enumerable: true, get: function () { return assume_1.getAssumptions; } });
 /** Public process-wide assumption APIs. */
 var Assumption_1 = require("../core/classes/assumption/Assumption");
 Object.defineProperty(exports, "Assumption", { enumerable: true, get: function () { return Assumption_1.Assumption; } });

package/output/api/core.d.ts

@@ -1,9 +1,4 @@
-/**
- * Core Nerdamer object model and shared public types.
- *
- * Import from `nerdamer/core` when working directly with Nerdamer values rather
- * than through the callable compatibility root.
- */
+import type { ExpressionInput } from '../core/types';
 export { Equation } from '../core/classes/equation/Equation';
 export { CoeffObject } from '../core/classes/expression/CoeffObject';
 export { Expression } from '../core/classes/expression/Expression';
@@ -13,5 +8,31 @@ export type { JsFunction, OptionValue, OptionsObject, ParserConstants, ParserVal
 export { Rational } from '../core/classes/rational/Rational';
 export { Converter } from '../core/converters/Converter';
 export { AssignmentError, DimensionError, DivisionByZeroError, MathError, MissingReferenceError, NaNError, NotImplementedError, OperatorError, ParserError, ParserSyntaxError, PolynomialError, UndefinedError, UnexpectedDataType, UnexpectedInputError, UnexpectedTokenError, UnsupportedOperationError, ZeroToZeroPowerError, } from '../core/errors';
-export { build as buildFunction } from '../core/functions/build';
+/**
+ * Compiles an expression into a native JavaScript-number function for repeated evaluation.
+ *
+ * @remarks
+ * Function calls are linked to Nerdamer's numerical implementations, including any dependencies
+ * they require. The compiler supports scalar JavaScript-number arithmetic rather than Nerdamer's
+ * full symbolic or structured value model. Symbolic-only operations such as indexed sums,
+ * products, solvers, and matrix operations are rejected if they remain in the expression.
+ *
+ * `buildFunction` uses `new Function`, so it may be unavailable under a Content Security Policy
+ * that forbids dynamic JavaScript evaluation. When `argsArray` is omitted, free variables are
+ * sorted alphabetically.
+ *
+ * @param x - The expression to compile.
+ * @param argsArray - Variable names in the positional order expected by the compiled function.
+ * @returns The compiled JavaScript-number function.
+ * @throws {@link core!UnsupportedOperationError} If the expression contains the imaginary unit or a
+ * function for which no matching JavaScript-number implementation is registered.
+ *
+ * @example
+ * ```ts
+ * buildFunction('x-y')(9, 7);                // 2
+ * buildFunction('x-y', ['y', 'x'])(9, 7);    // -2
+ * buildFunction('erf(x)+2')(9);              // 3
+ * ```
+ */
+export declare const buildFunction: (x: ExpressionInput, argsArray?: string[]) => (...args: number[]) => number;
 export type { ExpressionInput, NerdamerInput, ParserEntity, StructuredEntityType, } from '../core/types';

package/output/api/core.js

@@ -7,6 +7,7 @@ exports.buildFunction = exports.ZeroToZeroPowerError = exports.UnsupportedOperat
  * Import from `nerdamer/core` when working directly with Nerdamer values rather
  * than through the callable compatibility root.
  */
+const build_1 = require("../core/functions/build");
 var Equation_1 = require("../core/classes/equation/Equation");
 Object.defineProperty(exports, "Equation", { enumerable: true, get: function () { return Equation_1.Equation; } });
 var CoeffObject_1 = require("../core/classes/expression/CoeffObject");
@@ -37,5 +38,30 @@ Object.defineProperty(exports, "UnexpectedInputError", { enumerable: true, get:
 Object.defineProperty(exports, "UnexpectedTokenError", { enumerable: true, get: function () { return errors_1.UnexpectedTokenError; } });
 Object.defineProperty(exports, "UnsupportedOperationError", { enumerable: true, get: function () { return errors_1.UnsupportedOperationError; } });
 Object.defineProperty(exports, "ZeroToZeroPowerError", { enumerable: true, get: function () { return errors_1.ZeroToZeroPowerError; } });
-var build_1 = require("../core/functions/build");
-Object.defineProperty(exports, "buildFunction", { enumerable: true, get: function () { return build_1.build; } });
+/**
+ * Compiles an expression into a native JavaScript-number function for repeated evaluation.
+ *
+ * @remarks
+ * Function calls are linked to Nerdamer's numerical implementations, including any dependencies
+ * they require. The compiler supports scalar JavaScript-number arithmetic rather than Nerdamer's
+ * full symbolic or structured value model. Symbolic-only operations such as indexed sums,
+ * products, solvers, and matrix operations are rejected if they remain in the expression.
+ *
+ * `buildFunction` uses `new Function`, so it may be unavailable under a Content Security Policy
+ * that forbids dynamic JavaScript evaluation. When `argsArray` is omitted, free variables are
+ * sorted alphabetically.
+ *
+ * @param x - The expression to compile.
+ * @param argsArray - Variable names in the positional order expected by the compiled function.
+ * @returns The compiled JavaScript-number function.
+ * @throws {@link core!UnsupportedOperationError} If the expression contains the imaginary unit or a
+ * function for which no matching JavaScript-number implementation is registered.
+ *
+ * @example
+ * ```ts
+ * buildFunction('x-y')(9, 7);                // 2
+ * buildFunction('x-y', ['y', 'x'])(9, 7);    // -2
+ * buildFunction('erf(x)+2')(9);              // 3
+ * ```
+ */
+exports.buildFunction = build_1.build;

package/output/calculus/derivative/diff.js

@@ -95,7 +95,7 @@ function diff(x, variable, n) {
         const n = nth ? Number(nth) - 1 : 0;
         // Pull the derivate of the outside. At this point we've already performed all the required checks.
         const m = x.getMultiplier().times(x.getPower());
-        const p = x.getPower().minus('1');
+        const p = x.getPower().minus((0, shortcuts_1.one)());
         const f = Expression_1.Expression.create(x.value);
         const fp = p.isZero() ? m : f.pow(p).times(m);
         // Pull the derivative of the inside

package/output/calculus/dispatch.js

@@ -1,14 +1,14 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.loadCalculusFunctions = loadCalculusFunctions;
+const constants_1 = require("../core/classes/parser/constants");
 const dispatch_1 = require("../core/dispatch");
-const math_1 = require("../math/math");
 const defint_1 = require("../math/defint/defint");
+const math_1 = require("../math/math");
 const adapters_1 = require("./adapters");
 const fresnel_1 = require("./fresnel");
 const ilaplace_1 = require("./laplace/ilaplace");
 const laplace_1 = require("./laplace/laplace");
-const constants_1 = require("../core/classes/parser/constants");
 function loadCalculusFunctions() {
     Object.assign(dispatch_1.mathFunctionRegistry, {
         diff: (0, dispatch_1.systemFunction)({ fn: adapters_1.differentiate, minArgs: 1, maxArgs: 3, equationArgs: [0], distElWise: true }),

package/output/calculus/integrate/integrate.js

@@ -293,7 +293,7 @@ function tryIntegrateSqrtQuadratic(expr, dx) {
         return undefined;
     }
     if (a.lt((0, shortcuts_1.zero)()) && k.gt((0, shortcuts_1.zero)())) {
-        const sqrtNegA = a.times('-1').pow((0, shortcuts_1.half)());
+        const sqrtNegA = a.times((0, shortcuts_1.minusOne)()).pow((0, shortcuts_1.half)());
         const sqrtK = k.pow((0, shortcuts_1.half)());
         const arg = sqrtNegA.times(u).div(sqrtK);
         return leadingTerm.plus(k.div((0, shortcuts_1.two)().times(sqrtNegA)).times(Expression_1.Expression.toFunction(constants_1.ASIN, [arg])));
@@ -412,10 +412,10 @@ function tryIntegrateLinearOverQuadratic(expr, dx) {
         return result;
     }
     const twoAxPlusB = (0, shortcuts_1.two)().times(a).times(x).plus(b);
-    const delta = (0, shortcuts_1.four)().times(a).times(c).minus(b.pow('2'));
+    const delta = (0, shortcuts_1.four)().times(a).times(c).minus(b.pow((0, shortcuts_1.two)()));
     let reciprocalIntegral;
     if (delta.isZero()) {
-        reciprocalIntegral = (0, shortcuts_1.two)().times('-1').div(twoAxPlusB);
+        reciprocalIntegral = (0, shortcuts_1.two)().times((0, shortcuts_1.minusOne)()).div(twoAxPlusB);
     }
     else if (delta.gt((0, shortcuts_1.zero)())) {
         const sqrtDelta = delta.pow((0, shortcuts_1.half)());
@@ -425,7 +425,7 @@ function tryIntegrateLinearOverQuadratic(expr, dx) {
             .times(Expression_1.Expression.toFunction(constants_1.ATAN, [arg]));
     }
     else if (delta.lt((0, shortcuts_1.zero)())) {
-        const sqrtNegDelta = delta.times('-1').pow((0, shortcuts_1.half)());
+        const sqrtNegDelta = delta.times((0, shortcuts_1.minusOne)()).pow((0, shortcuts_1.half)());
         const ratio = twoAxPlusB.minus(sqrtNegDelta).div(twoAxPlusB.plus(sqrtNegDelta));
         reciprocalIntegral = (0, math_1.log)(ratio).div(sqrtNegDelta);
     }

package/output/calculus/integrate/integrationTable.js

@@ -407,7 +407,7 @@ const hyperbolicTrigTable = {
             if (p.get('n2').isOne()) {
                 return p.fromPattern('(a1*atan(sinh(a2*x1)))/a2');
             }
-            else if (p.get('n2').eq(2)) {
+            else if (p.get('n2').eq((0, shortcuts_1.two)())) {
                 return p.fromPattern('(a1*tanh(a2*x1))/a2');
             }
         }
@@ -418,7 +418,7 @@ const hyperbolicTrigTable = {
             if (p.get('n2').isOne()) {
                 return p.fromPattern('(a1*log(tanh((a2*x1)/2)))/a2');
             }
-            else if (p.get('n2').eq(2)) {
+            else if (p.get('n2').eq((0, shortcuts_1.two)())) {
                 return p.fromPattern('-(a1*coth(a2*x1))/a2');
             }
         }
@@ -461,7 +461,7 @@ const hyperbolicTrigTable = {
             if (p.get('n3').isOne()) {
                 return p.fromPattern('(a1*atan(sinh(a2*(a3*x1+a4))))/(a2*a3)');
             }
-            else if (p.get('n3').eq(2)) {
+            else if (p.get('n3').eq((0, shortcuts_1.two)())) {
                 return p.fromPattern('(a1*tanh(a2*(a3*x1+a4)))/(a2*a3)');
             }
         }
@@ -472,7 +472,7 @@ const hyperbolicTrigTable = {
             if (p.get('n3').isOne()) {
                 return p.fromPattern('(a1*log(tanh((a2*(a3*x1+a4))/2)))/(a2*a3)');
             }
-            else if (p.get('n3').eq(2)) {
+            else if (p.get('n3').eq((0, shortcuts_1.two)())) {
                 return p.fromPattern('-(a1*coth(a2*(a3*x1+a4)))/(a2*a3)');
             }
         }
@@ -538,7 +538,7 @@ const hyperbolicTrigTable = {
             if (n4.isOne()) {
                 return p.fromPattern('-(a1*sech(a2*x1)^n2)/(a2*n2)');
             }
-            if (n2.eq(2)) {
+            if (n2.eq((0, shortcuts_1.two)())) {
                 return p.fromPattern('(a1*tanh(a2*x1)^(n4+1))/(a2*(n4+1))');
             }
             if (n4.isOdd()) {
@@ -563,7 +563,7 @@ const hyperbolicTrigTable = {
             if (n2.isOne()) {
                 return p.fromPattern('-(a1*csch(a2*x1)^n4)/(a2*n4)');
             }
-            if (n4.eq(2)) {
+            if (n4.eq((0, shortcuts_1.two)())) {
                 return p.fromPattern('-(a1*coth(a2*x1)^(n2+1))/(a2*(n2+1))');
             }
             if (n2.isOdd()) {
@@ -847,49 +847,49 @@ const specialFunctionTable = {
 const knownIntegralsTable = {
     // sqrt(a-b*x^2)
     'a1*(-a2*x1^n1+a3)^n2': p => {
-        if (p.get('n1').eq(2) && p.get('n2').isHalf()) {
+        if (p.get('n1').eq((0, shortcuts_1.two)()) && p.get('n2').isHalf()) {
             return p.fromPattern('(a1*x1*(-a2*x1^2+a3)^(1/2))/2+(a1*a3*asin((a2^(1/2)*x1)/(a3^(1/2))))/(2*a2^(1/2))');
         }
     },
     // diff(atanh(x)) and diff(asin(x))
     'a1/((-a2*x1^n1+a3)^n2)': p => {
-        if (p.get('n1').eq(2) && p.get('n2').isOne()) {
+        if (p.get('n1').eq((0, shortcuts_1.two)()) && p.get('n2').isOne()) {
             return p.fromPattern('(a1/(a2^(1/2)*a3^(1/2)))*atanh((a2^(1/2)*x1)/(a3^(1/2)))');
         }
-        else if (p.get('n1').eq(2) && p.get('n2').isHalf()) {
+        else if (p.get('n1').eq((0, shortcuts_1.two)()) && p.get('n2').isHalf()) {
             return p.fromPattern('(a1/a2^(1/2))*asin((a2^(1/2)*x1)/(a3^(1/2)))');
         }
     },
     // diff(acos(x))
     '-a1/((-a2*x1^n1+a3)^n2)': p => {
-        if (p.get('n1').eq(2) && p.get('n2').isHalf()) {
+        if (p.get('n1').eq((0, shortcuts_1.two)()) && p.get('n2').isHalf()) {
             return p.fromPattern('(a1/a2^(1/2))*acos((a2^(1/2)*x1)/(a3^(1/2)))');
         }
     },
     // diff(atan(x)) and diff(asinh(x))
     'a1/((a2*x1^n1+a3)^n2)': p => {
-        if (p.get('n1').eq(2) && p.get('n2').isOne()) {
+        if (p.get('n1').eq((0, shortcuts_1.two)()) && p.get('n2').isOne()) {
             return p.fromPattern('(a1/(a2^(1/2)*a3^(1/2)))*atan((a2^(1/2)*x1)/(a3^(1/2)))');
         }
-        else if (p.get('n1').eq(2) && p.get('n2').isHalf()) {
+        else if (p.get('n1').eq((0, shortcuts_1.two)()) && p.get('n2').isHalf()) {
             return p.fromPattern('(a1/a2^(1/2))*asinh((a2^(1/2)*x1)/(a3^(1/2)))');
         }
     },
     // diff(acot(x))
     '-a1/((a2*x1^n1+a3)^n2)': p => {
-        if (p.get('n1').eq(2) && p.get('n2').isOne()) {
+        if (p.get('n1').eq((0, shortcuts_1.two)()) && p.get('n2').isOne()) {
             return p.fromPattern('(a1/(a2^(1/2)*a3^(1/2)))*acot((a2^(1/2)*x1)/(a3^(1/2)))');
         }
     },
     // diff(asec(x))
     'a1/(x1^n1*(-a2/x1^n2+a3)^n3)': p => {
-        if (p.get('n1').isOne() && p.get('n2').eq(2) && p.get('n3').isHalf()) {
+        if (p.get('n1').isOne() && p.get('n2').eq((0, shortcuts_1.two)()) && p.get('n3').isHalf()) {
             return p.fromPattern('(a1/a3^(1/2))*asec((a3^(1/2)*x1)/(a2^(1/2)))');
         }
     },
     // diff(acsc(x))
     '-a1/(x1^n1*(-a2/x1^n2+a3)^n3)': p => {
-        if (p.get('n1').isOne() && p.get('n2').eq(2) && p.get('n3').isHalf()) {
+        if (p.get('n1').isOne() && p.get('n2').eq((0, shortcuts_1.two)()) && p.get('n3').isHalf()) {
             return p.fromPattern('(a1/a3^(1/2))*acsc((a3^(1/2)*x1)/(a2^(1/2)))');
         }
     },
@@ -897,7 +897,7 @@ const knownIntegralsTable = {
     // -1/(x*sqrt(1+1/x^2)) -> -acsch(x^-1)
     // after constant stripping: 1/(x*sqrt(1+1/x^2))
     'a1/(x1^n1*(a2/x1^n2+a3)^n3)': p => {
-        if (p.get('n1').isOne() && p.get('n2').eq(2) && p.get('n3').eq(1 / 2)) {
+        if (p.get('n1').isOne() && p.get('n2').eq((0, shortcuts_1.two)()) && p.get('n3').eq((0, shortcuts_1.half)())) {
             return p.fromPattern('a1*acsch((sqrt(a2/a3))/x1)/sqrt(a2*a3)');
         }
     },

package/output/calculus/laplace/ilaplace.js

@@ -99,7 +99,7 @@ function ilaplace(expr, s, t) {
                 const hasShiftedSquare = den.isSum() &&
                     den
                         .elementsArray()
-                        .some(term => term.getPower().eq(2) && term.getBase().isSum());
+                        .some(term => term.getPower().eq((0, shortcuts_1.two)()) && term.getBase().isSum());
                 if (!h.isZero() && !hasShiftedSquare) {
                     const constant = numCoeffs.hasPower(0) ? numCoeffs.getPower(0) : (0, shortcuts_1.zero)();
                     const linear = numCoeffs.hasPower(1) ? numCoeffs.getPower(1) : (0, shortcuts_1.zero)();

package/output/calculus/laplace/ilaplaceTable.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.tableOfInverseTransforms = void 0;
+const shortcuts_1 = require("../../core/classes/expression/shortcuts");
 const LookupTable_1 = require("../../core/classes/lookupTable/LookupTable");
 const Pattern_1 = require("../../core/converters/Pattern");
 const ilaplaceTable = {
@@ -27,10 +28,10 @@ const ilaplaceTable = {
         if (n1.isOne()) {
             return p.fromPattern('(a1*t^(n2-1)*e^((-a3/a2)*t))/(a2^n2*gamma(n2))');
         }
-        if (n1.eq(2) && n2.isOne()) {
+        if (n1.eq((0, shortcuts_1.two)()) && n2.isOne()) {
             return p.fromPattern('(a1*sin((a3^(1/2)*t)/(a2^(1/2))))/(a2^(1/2)*a3^(1/2))');
         }
-        if (n1.eq(2) && n2.eq(2)) {
+        if (n1.eq((0, shortcuts_1.two)()) && n2.eq((0, shortcuts_1.two)())) {
             return p
                 .fromPattern('(a1*sin((a3^(1/2)*t)/(a2^(1/2))))/(2*a2^(1/2)*a3^(3/2))')
                 .minus(p.fromPattern('(a1*t*cos((a3^(1/2)*t)/(a2^(1/2))))/(2*a2*a3)'));
@@ -45,18 +46,18 @@ const ilaplaceTable = {
     // (a1*t*sin((a3^(1/2)*t)/(a2^(1/2)))) / (2*a2^(3/2)*a3^(1/2))
     '(a1*x1^n1)/((a2*x1^n2+a3)^n3)': p => {
         const { n1, n2, n3 } = p.references;
-        if (!n2.eq(2)) {
+        if (!n2.eq((0, shortcuts_1.two)())) {
             return undefined;
         }
         if (n1.isOne()) {
             if (n3.isOne()) {
                 return p.fromPattern('(a1*cos((a3^(1/2)*t)/(a2^(1/2))))/a2');
             }
-            if (n3.eq(2)) {
+            if (n3.eq((0, shortcuts_1.two)())) {
                 return p.fromPattern('(a1*t*sin((a3^(1/2)*t)/(a2^(1/2))))/(2*a2^(3/2)*a3^(1/2))');
             }
         }
-        if (n1.eq(2) && n3.eq(2)) {
+        if (n1.eq((0, shortcuts_1.two)()) && n3.eq((0, shortcuts_1.two)())) {
             return p
                 .fromPattern('(a1*sin((a3^(1/2)*t)/(a2^(1/2))))/(2*a2^(1/2)*a3^(1/2))')
                 .plus(p.fromPattern('(a1*t*cos((a3^(1/2)*t)/(a2^(1/2))))/(2*a2)'));
@@ -68,7 +69,7 @@ const ilaplaceTable = {
     // 1 / (((s-b)^2 + c^2)^n) and 1 / (((s-b)^2 - c^2)^n)
     'a1/((a2*(a3*x1^n1+a4)^n2+a5)^n3)': p => {
         const { n1, n2, n3, a5 } = p.references;
-        if (!n1.isOne() || !n2.eq(2)) {
+        if (!n1.isOne() || !n2.eq((0, shortcuts_1.two)())) {
             return undefined;
         }
         // Hyperbolic branch: a5 < 0
@@ -76,7 +77,7 @@ const ilaplaceTable = {
             if (n3.isOne()) {
                 return p.fromPattern('(a1*e^((-a4/a3)*t)*sinh((((-a5)^(1/2))*t)/(a2^(1/2)*a3)))/(a2^(1/2)*a3*((-a5)^(1/2)))');
             }
-            if (n3.eq(2)) {
+            if (n3.eq((0, shortcuts_1.two)())) {
                 return p.fromPattern('(a1*e^((-a4/a3)*t)*((((-a5)^(1/2))*t*cosh((((-a5)^(1/2))*t)/(a2^(1/2)*a3)))/(a2^(1/2)*a3)-sinh((((-a5)^(1/2))*t)/(a2^(1/2)*a3))))/(2*a2^(1/2)*a3*((-a5)^(3/2)))');
             }
             return undefined;
@@ -85,7 +86,7 @@ const ilaplaceTable = {
         if (n3.isOne()) {
             return p.fromPattern('(a1*e^((-a4/a3)*t)*sin((a5^(1/2)*t)/(a2^(1/2)*a3)))/(a2^(1/2)*a3*a5^(1/2))');
         }
-        if (n3.eq(2)) {
+        if (n3.eq((0, shortcuts_1.two)())) {
             return p.fromPattern('(a1*e^((-a4/a3)*t)*(sin((a5^(1/2)*t)/(a2^(1/2)*a3))-(a5^(1/2)*t*cos((a5^(1/2)*t)/(a2^(1/2)*a3)))/(a2^(1/2)*a3)))/(2*a2^(1/2)*a3*a5^(3/2))');
         }
         return undefined;
@@ -98,7 +99,7 @@ const ilaplaceTable = {
     // (c*(s-a)) / ((b*(d*(s-a))^2 + e)^n)
     '(a1*((a6*x1^n4+a7)^n5))/((a2*(a3*x1^n1+a4)^n2+a5)^n3)': p => {
         const { n1, n2, n3, n4, n5, a3, a4, a5, a6, a7 } = p.references;
-        if (!n1.isOne() || !n2.eq(2) || !n4.isOne() || !n5.isOne()) {
+        if (!n1.isOne() || !n2.eq((0, shortcuts_1.two)()) || !n4.isOne() || !n5.isOne()) {
             return undefined;
         }
         // numerator affine term must be a scalar multiple of denominator affine term
@@ -110,7 +111,7 @@ const ilaplaceTable = {
             if (n3.isOne()) {
                 return p.fromPattern('(a1*a6*e^((-a4/a3)*t)*cosh((((-a5)^(1/2))*t)/(a2^(1/2)*a3)))/(a2*a3^2)');
             }
-            if (n3.eq(2)) {
+            if (n3.eq((0, shortcuts_1.two)())) {
                 return p.fromPattern('(a1*a6*t*e^((-a4/a3)*t)*sinh((((-a5)^(1/2))*t)/(a2^(1/2)*a3)))/(2*a2^(3/2)*a3^3*((-a5)^(1/2)))');
             }
             return undefined;
@@ -119,7 +120,7 @@ const ilaplaceTable = {
         if (n3.isOne()) {
             return p.fromPattern('(a1*a6*e^((-a4/a3)*t)*cos((a5^(1/2)*t)/(a2^(1/2)*a3)))/(a2*a3^2)');
         }
-        if (n3.eq(2)) {
+        if (n3.eq((0, shortcuts_1.two)())) {
             return p.fromPattern('(a1*a6*t*e^((-a4/a3)*t)*sin((a5^(1/2)*t)/(a2^(1/2)*a3)))/(2*a2^(3/2)*a3^3*a5^(1/2))');
         }
         return undefined;
@@ -127,7 +128,7 @@ const ilaplaceTable = {
     // ((c*(s-a))^2) / ((b*(d*(s-a))^2 + e)^2)
     '(a1*(a6*x1^n4+a7)^n5)/((a2*(a3*x1^n1+a4)^n2+a5)^n3)': p => {
         const { n1, n2, n3, n4, n5, a3, a4, a5, a6, a7 } = p.references;
-        if (!n1.isOne() || !n2.eq(2) || !n3.eq(2) || !n4.isOne() || !n5.eq(2)) {
+        if (!n1.isOne() || !n2.eq((0, shortcuts_1.two)()) || !n3.eq((0, shortcuts_1.two)()) || !n4.isOne() || !n5.eq((0, shortcuts_1.two)())) {
             return undefined;
         }
         // numerator affine term must be a scalar multiple of denominator affine term
@@ -144,7 +145,7 @@ const ilaplaceTable = {
     // a / ((s-b)^2 - c^2)
     'a1/(a2*(a3*x1^n1+a4)^n2-a5)': p => {
         const { n1, n2 } = p.references;
-        if (!n1.isOne() || !n2.eq(2)) {
+        if (!n1.isOne() || !n2.eq((0, shortcuts_1.two)())) {
             return undefined;
         }
         return p.fromPattern('(a1*e^((-a4/a3)*t)*sinh((a5^(1/2)*t)/(a2^(1/2)*a3)))/(a2^(1/2)*a3*a5^(1/2))');
@@ -152,7 +153,7 @@ const ilaplaceTable = {
     // (s-b) / ((s-b)^2 - c^2)
     '(a1*(a6*x1^n3+a7)^n4)/(a2*(a3*x1^n1+a4)^n2-a5)': p => {
         const { n1, n2, n3, n4 } = p.references;
-        if (!n1.isOne() || !n2.eq(2) || !n3.isOne() || !n4.isOne()) {
+        if (!n1.isOne() || !n2.eq((0, shortcuts_1.two)()) || !n3.isOne() || !n4.isOne()) {
             return undefined;
         }
         return p.fromPattern('(a1*e^((-a4/a3)*t)*cosh((a5^(1/2)*t)/(a2^(1/2)*a3)))/(a2*a3^2)');
@@ -160,7 +161,7 @@ const ilaplaceTable = {
     // a / (((s-b)^2 - c^2)^2)
     'a1/((a2*(a3*x1^n1+a4)^n2-a5)^n3)': p => {
         const { n1, n2, n3 } = p.references;
-        if (!n1.isOne() || !n2.eq(2) || !n3.eq(2)) {
+        if (!n1.isOne() || !n2.eq((0, shortcuts_1.two)()) || !n3.eq((0, shortcuts_1.two)())) {
             return undefined;
         }
         return p.fromPattern('(a1*e^((-a4/a3)*t)*(a5^(1/2)*t*cosh((a5^(1/2)*t)/(a2^(1/2)*a3))-a2^(1/2)*a3*sinh((a5^(1/2)*t)/(a2^(1/2)*a3))))/(2*a2*a3^2*a5^(3/2))');
@@ -168,7 +169,7 @@ const ilaplaceTable = {
     // (s-b) / (((s-b)^2 - c^2)^2)
     '(a1*(a6*x1^n3+a7)^n4)/((a2*(a3*x1^n1+a4)^n2-a5)^n5)': p => {
         const { n1, n2, n3, n4, n5 } = p.references;
-        if (!n1.isOne() || !n2.eq(2) || !n3.isOne() || !n4.isOne() || !n5.eq(2)) {
+        if (!n1.isOne() || !n2.eq((0, shortcuts_1.two)()) || !n3.isOne() || !n4.isOne() || !n5.eq((0, shortcuts_1.two)())) {
             return undefined;
         }
         return p.fromPattern('(a1*t*e^((-a4/a3)*t)*sinh((a5^(1/2)*t)/(a2^(1/2)*a3)))/(2*a2^(1/2)*a3*a5^(1/2))');
@@ -176,7 +177,7 @@ const ilaplaceTable = {
     // (A*(B*(s-a)^2+C)) / ((D*(s-a)^2+E)^2)
     '(a1*((a2*(a3*x1^n1+a4)^n2+a5)^n3))/((a6*(a7*x1^n4+a8)^n5+a9)^n6)': p => {
         const { n1, n2, n3, n4, n5, n6, _a2, a3, a4, _a6, a7, a8, _a9 } = p.references;
-        if (!n1.isOne() || !n2.eq(2) || !n3.isOne() || !n4.isOne() || !n5.eq(2) || !n6.eq(2)) {
+        if (!n1.isOne() || !n2.eq((0, shortcuts_1.two)()) || !n3.isOne() || !n4.isOne() || !n5.eq((0, shortcuts_1.two)()) || !n6.eq((0, shortcuts_1.two)())) {
             return undefined;
         }
         if (!a3.eq(a7) || !a4.eq(a8)) {

package/output/calculus/laplace/laplaceTable.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.tableOfTransforms = void 0;
+const shortcuts_1 = require("../../core/classes/expression/shortcuts");
 const LookupTable_1 = require("../../core/classes/lookupTable/LookupTable");
 const diff_1 = require("../derivative/diff");
 const laplaceTable = {
@@ -12,7 +13,7 @@ const laplaceTable = {
     'a1*x1^n1': p => {
         const { n1 } = p.references;
         // Reject Gamma poles: n1 = -1, -2, -3, ...
-        if (n1.isNegative() && n1.plus(1).isInteger()) {
+        if (n1.isNegative() && n1.plus((0, shortcuts_1.one)()).isInteger()) {
             return undefined;
         }
         return p.fromPattern('a1*gamma(n1+1)/s^(n1+1)');
@@ -45,7 +46,7 @@ const laplaceTable = {
             return undefined;
         }
         // Reject the pole at Gamma(0), Gamma(-1), ...
-        if (n2.isNegative() && n2.plus(1).isInteger()) {
+        if (n2.isNegative() && n2.plus((0, shortcuts_1.one)()).isInteger()) {
             return undefined;
         }
         return p.fromPattern('a1*gamma(n2+1)/(s-log(a2)*a3)^(n2+1)');

package/output/calculus/limit/limit.js

@@ -923,7 +923,7 @@ function tryComposition(expr, x, val, dir, depth) {
                     const gPrime = (0, diff_1.diff)(g, x);
                     if (!gPrime.isZero()) {
                         // L'Hôpital on f/(1/g): result = -f'·g²/g'
-                        let lhopitalExpr = (0, simplify_1.simplify)(fPrime.times(g.pow(2)).div(gPrime).neg());
+                        let lhopitalExpr = (0, simplify_1.simplify)(fPrime.times(g.pow((0, shortcuts_1.two)())).div(gPrime).neg());
                         // Multiply back any remaining factors
                         for (let i = 0; i < factors.length; i++) {
                             if (i !== zeroIdx && i !== infIdx) {