nerdamer 2.0.0-rc.1 → 2.0.0

package/output/api/structures.js

@@ -1,6 +1,6 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Vector = exports.dot = exports.cross = exports.ValuesSet = exports.imatrix = exports.Matrix = exports.nullspace = exports.determinant = exports.Dictionary = exports.Collection = void 0;
+exports.Vector = exports.dot = exports.cross = exports.ValuesSet = exports.imatrix = exports.Matrix = exports.nullspace = exports.invert = exports.determinant = exports.Dictionary = exports.Collection = void 0;
 /** Public structured-value and finite-set APIs. */
 var Collection_1 = require("../core/classes/collection/Collection");
 Object.defineProperty(exports, "Collection", { enumerable: true, get: function () { return Collection_1.Collection; } });
@@ -8,6 +8,7 @@ var Dictionary_1 = require("../core/classes/dictionary/Dictionary");
 Object.defineProperty(exports, "Dictionary", { enumerable: true, get: function () { return Dictionary_1.Dictionary; } });
 var functions_1 = require("../core/classes/matrix/functions");
 Object.defineProperty(exports, "determinant", { enumerable: true, get: function () { return functions_1.determinant; } });
+Object.defineProperty(exports, "invert", { enumerable: true, get: function () { return functions_1.invert; } });
 Object.defineProperty(exports, "nullspace", { enumerable: true, get: function () { return functions_1.nullspace; } });
 var Matrix_1 = require("../core/classes/matrix/Matrix");
 Object.defineProperty(exports, "Matrix", { enumerable: true, get: function () { return Matrix_1.Matrix; } });

package/output/calculus/adapters.d.ts

@@ -0,0 +1,8 @@
+import type { Expression } from '../core/classes/expression/Expression';
+import type { ParserEntity } from '../core/types';
+/** Applies differentiation to both sides when the parser supplies an Equation. */
+export declare function differentiate(expr: ParserEntity, variable?: ParserEntity, n?: ParserEntity): ParserEntity;
+/** Applies integration to both sides when the parser supplies an Equation. */
+export declare function integrateEquation(expr: ParserEntity, variable?: ParserEntity): ParserEntity;
+/** Maps a symbolic direction token to the direction accepted by limit. */
+export declare function directionalLimit(expr: Expression, x: Expression, val: Expression, dir?: Expression): Expression;

package/output/calculus/adapters.js

@@ -0,0 +1,41 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.differentiate = differentiate;
+exports.integrateEquation = integrateEquation;
+exports.directionalLimit = directionalLimit;
+const Equation_1 = require("../core/classes/equation/Equation");
+const utils_1 = require("../core/classes/expression/utils");
+const diff_1 = require("./derivative/diff");
+const integrate_1 = require("./integrate/integrate");
+const limit_1 = require("./limit/limit");
+/** Applies differentiation to both sides when the parser supplies an Equation. */
+function differentiate(expr, variable, n) {
+    let retval;
+    if (Equation_1.Equation.isEquation(expr)) {
+        retval = expr.each(e => differentiate(e, variable, n));
+    }
+    else {
+        retval = (0, diff_1.diff)(expr, variable, n);
+    }
+    return retval;
+}
+/** Applies integration to both sides when the parser supplies an Equation. */
+function integrateEquation(expr, variable) {
+    let retval;
+    if (Equation_1.Equation.isEquation(expr)) {
+        retval = expr.each(e => integrateEquation(e, variable));
+    }
+    else {
+        retval = (0, integrate_1.integrate)(expr, variable);
+    }
+    return retval;
+}
+/** Maps a symbolic direction token to the direction accepted by limit. */
+function directionalLimit(expr, x, val, dir) {
+    let direction = 'both';
+    if (dir) {
+        direction = (0, utils_1.assertPlainVariableAndGetString)(dir);
+    }
+    const retval = (0, limit_1.limit)(expr, x, val, direction);
+    return retval;
+}

package/output/calculus/derivative/diff.js

@@ -72,7 +72,10 @@ function diff(x, variable, n) {
         throw new errors_1.UnsupportedOperationError((0, errors_1.message)('unsupportedOperation'));
     }
     let retval;
-    if (variables.length === 0 || !x.hasVariable(variable.value) || x.isConstant()) {
+    if (x.hasFunction(constants_1.SYMBOLIC_ACCESSOR, true)) {
+        retval = Expression_1.Expression.toFunction(constants_1.DIFF, [x, variable, nth]);
+    }
+    else if (variables.length === 0 || !x.hasVariable(variable.value) || x.isConstant()) {
         retval = (0, shortcuts_1.zero)();
     }
     // If the variable is not of type VAR or nth is not an integer then return it untouched until either or both are resolved
@@ -92,9 +95,9 @@ 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 = f.pow(p).times(m);
+        const fp = p.isZero() ? m : f.pow(p).times(m);
         // Pull the derivative of the inside
         if (f.isVAR()) {
             retval = (0, shortcuts_1.one)();

package/output/calculus/dispatch.d.ts

@@ -0,0 +1 @@
+export declare function loadCalculusFunctions(): void;

package/output/calculus/dispatch.js

@@ -0,0 +1,25 @@
+"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 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");
+function loadCalculusFunctions() {
+    Object.assign(dispatch_1.mathFunctionRegistry, {
+        diff: (0, dispatch_1.systemFunction)({ fn: adapters_1.differentiate, minArgs: 1, maxArgs: 3, equationArgs: [0], distElWise: true }),
+        integrate: (0, dispatch_1.systemFunction)({ fn: adapters_1.integrateEquation, minArgs: 1, maxArgs: 2, equationArgs: [0], distElWise: true }),
+        limit: (0, dispatch_1.systemFunction)({ fn: adapters_1.directionalLimit, minArgs: 3, maxArgs: 4, distElWise: true }),
+        laplace: (0, dispatch_1.systemFunction)({ fn: laplace_1.laplace, minArgs: 3, maxArgs: 3, distElWise: true }),
+        ilaplace: (0, dispatch_1.systemFunction)({ fn: ilaplace_1.ilaplace, minArgs: 3, maxArgs: 3, distElWise: true }),
+        sum: (0, dispatch_1.systemFunction)({ fn: math_1.sum, minArgs: 4, maxArgs: 4, distElWise: true }),
+        product: (0, dispatch_1.systemFunction)({ fn: math_1.product, minArgs: 4, maxArgs: 4, distElWise: true }),
+        defint: (0, dispatch_1.systemFunction)({ fn: defint_1.defint, minArgs: 4, maxArgs: 4, distElWise: true }),
+        [constants_1.FRESNEL_S]: (0, dispatch_1.systemFunction)({ fn: fresnel_1.S, minArgs: 1, maxArgs: 1, distElWise: true }),
+        [constants_1.FRESNEL_C]: (0, dispatch_1.systemFunction)({ fn: fresnel_1.C, minArgs: 1, maxArgs: 1, 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) {

package/output/core/classes/assumption/Assumption.js

@@ -6,6 +6,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.Assumption = void 0;
 const decimal_js_1 = __importDefault(require("decimal.js"));
 const common_1 = require("../../common/common");
+const errors_1 = require("../../errors");
 const Expression_1 = require("../expression/Expression");
 const constants_1 = require("../parser/constants");
 const Rational_1 = require("../rational/Rational");
@@ -19,7 +20,7 @@ function normalizeAssumptionValue(value) {
     let decimal;
     let exact;
     if (Rational_1.Rational.isRational(value)) {
-        exact = Rational_1.Rational.makeCopy(value);
+        exact = value.copy();
         decimal = exact.toDecimal();
     }
     else {
@@ -63,7 +64,7 @@ function parseNumber(value) {
     }
     const n = new decimal_js_1.default(v);
     if (n.isNaN()) {
-        throw new Error(`Invalid Decimal: "${value}"`);
+        throw new Error((0, errors_1.message)('invalidDecimal', { value: String(value) }));
     }
     return n;
 }
@@ -158,7 +159,10 @@ class Assumption {
         if (boundComparison === undefined ||
             boundComparison > 0 ||
             (boundComparison === 0 && !(normalizedStartInclusive && normalizedEndInclusive))) {
-            throw new Error(`Invalid interval: (${startValue}, ${endValue})`);
+            throw new Error((0, errors_1.message)('invalidInterval', {
+                start: startValue.toString(),
+                end: endValue.toString(),
+            }));
         }
         this.start = Object.freeze({
             value: startValue,
@@ -226,21 +230,21 @@ class Assumption {
      */
     static parse(expr) {
         if (typeof expr !== 'string') {
-            throw new Error(`Invalid assumption: "${String(expr)}"`);
+            throw new Error((0, errors_1.message)('invalidAssumption', { input: String(expr) }));
         }
         const s = expr.replace(/\s+/g, '');
         if (!s) {
-            throw new Error(`Invalid assumption: "${expr}"`);
+            throw new Error((0, errors_1.message)('invalidAssumption', { input: expr }));
         }
         // Must have at least a one-character identifier, operator, and value.
         if (s.length < 3) {
-            throw new Error(`Invalid assumption: "${expr}"`);
+            throw new Error((0, errors_1.message)('invalidAssumption', { input: expr }));
         }
         let i = 0;
         // Parse the variable identifier first. Assumptions are attached to plain
         // variables rather than arbitrary symbolic expressions.
         if (!isIdentStart(s[i])) {
-            throw new Error(`Expected identifier`);
+            throw new Error((0, errors_1.message)('assumptionIdentifierExpected'));
         }
         let j = i + 1;
         while (j < s.length && isIdentChar(s[j])) {
@@ -262,11 +266,11 @@ class Assumption {
             }
         }
         if (!op) {
-            throw new Error(`Missing operator`);
+            throw new Error((0, errors_1.message)('assumptionOperatorMissing'));
         }
         const valueStr = s.slice(i);
         if (!valueStr) {
-            throw new Error(`Missing value`);
+            throw new Error((0, errors_1.message)('assumptionValueMissing'));
         }
         const value = parseNumber(valueStr);
         let retval;
@@ -288,7 +292,7 @@ class Assumption {
                 retval = { symbol, assumption: Assumption.exactly(value) };
                 break;
             default:
-                throw new Error(`Unsupported operator "${op}"`);
+                throw new Error((0, errors_1.message)('assumptionOperatorUnsupported', { operator: op }));
         }
         return retval;
     }

package/output/core/classes/assumption/assume.d.ts

@@ -74,6 +74,12 @@ export declare function forgetAssumptionFor(x: Expression | string): void;
  * @param x - Plain variable expression or variable name.
  * @returns The registered interval, or `undefined` when no assumption is available.
  */
+/**
+ * Returns a snapshot of all currently registered assumptions.
+ *
+ * Changing the returned Map does not change Nerdamer's active assumptions.
+ */
+export declare function getAssumptions(): Map<string, Assumption>;
 export declare function getAssumptionFor(x: Expression | string): Assumption | undefined;
 /**
  * Parser marker used by `assume(...)` so comparison operators register constraints

package/output/core/classes/assumption/assume.js

@@ -4,6 +4,7 @@ exports.hasAssumptions = hasAssumptions;
 exports.assume = assume;
 exports.clearAssumptions = clearAssumptions;
 exports.forgetAssumptionFor = forgetAssumptionFor;
+exports.getAssumptions = getAssumptions;
 exports.getAssumptionFor = getAssumptionFor;
 exports.assuming = assuming;
 exports.forget = forget;
@@ -110,6 +111,14 @@ function forgetAssumptionFor(x) {
  * @param x - Plain variable expression or variable name.
  * @returns The registered interval, or `undefined` when no assumption is available.
  */
+/**
+ * Returns a snapshot of all currently registered assumptions.
+ *
+ * Changing the returned Map does not change Nerdamer's active assumptions.
+ */
+function getAssumptions() {
+    return new Map(ASSUMPTIONS);
+}
 function getAssumptionFor(x) {
     let symbol;
     if (Expression_1.Expression.isExpression(x) && x.isPlainVariable()) {

package/output/core/classes/assumption/dispatch.d.ts

@@ -0,0 +1 @@
+export declare function loadAssumptionFunctions(): void;

package/output/core/classes/assumption/dispatch.js

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.loadAssumptionFunctions = loadAssumptionFunctions;
+const dispatch_1 = require("../../dispatch");
+const assume_1 = require("./assume");
+function loadAssumptionFunctions() {
+    Object.assign(dispatch_1.mathFunctionRegistry, {
+        assume: (0, dispatch_1.systemFunction)({ fn: assume_1.assuming, minArgs: 1, maxArgs: 1, distElWise: false }),
+        forget: (0, dispatch_1.systemFunction)({ fn: assume_1.forget, minArgs: 1, maxArgs: 1, distElWise: false }),
+    });
+}

package/output/core/classes/collection/Collection.js

@@ -3,6 +3,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.Collection = void 0;
 const StructuredEntity_1 = require("../../common/classes/StructuredEntity");
 const common_1 = require("../../common/common");
+const errors_1 = require("../../errors");
 const constants_1 = require("../parser/constants");
 /**
  * An ordered heterogeneous collection of parser entities.
@@ -56,7 +57,11 @@ class Collection extends StructuredEntity_1.StructuredEntity {
     __get__(indices) {
         const index = indices[0];
         if (index < 0 || index >= this.elements.length) {
-            throw new RangeError(`Index ${index} out of bounds for Collection of length ${this.elements.length}`);
+            throw new RangeError((0, errors_1.message)('indexOutOfBounds', {
+                index: String(index),
+                type: 'Collection',
+                length: String(this.elements.length),
+            }));
         }
         return this.elements[index];
     }
@@ -68,7 +73,11 @@ class Collection extends StructuredEntity_1.StructuredEntity {
     __set__(indices, value) {
         const index = indices[0];
         if (index < 0 || index >= this.elements.length) {
-            throw new RangeError(`Index ${index} out of bounds for Collection of length ${this.elements.length}`);
+            throw new RangeError((0, errors_1.message)('indexOutOfBounds', {
+                index: String(index),
+                type: 'Collection',
+                length: String(this.elements.length),
+            }));
         }
         this.elements[index] = value;
     }