math-exercises 2.0.0 → 2.0.2

package/lib/tree/nodes/sets/intervalNode.js

@@ -0,0 +1,71 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.IntervalNode = exports.ClosureType = void 0;
+const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const inequationNode_1 = require("../inequations/inequationNode");
+const node_1 = require("../node");
+const constantNode_1 = require("../numbers/constantNode");
+const variableNode_1 = require("../variables/variableNode");
+var ClosureType;
+(function (ClosureType) {
+    ClosureType[ClosureType["FF"] = 0] = "FF";
+    ClosureType[ClosureType["FO"] = 1] = "FO";
+    ClosureType[ClosureType["OF"] = 2] = "OF";
+    ClosureType[ClosureType["OO"] = 3] = "OO";
+})(ClosureType = exports.ClosureType || (exports.ClosureType = {}));
+class IntervalNode {
+    constructor(a, b, closure, opts) {
+        this.type = node_1.NodeType.set;
+        this.closure = closure;
+        this.a = a;
+        this.b = b;
+        this.opts = opts;
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes(this.opts).map((node) => node.toTex());
+    }
+    toEquivalentNodes(opts) {
+        const res = [];
+        const equivs = [
+            this.a.toEquivalentNodes(opts ?? this.opts),
+            this.b.toEquivalentNodes(opts ?? this.opts),
+        ];
+        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
+        cartesians.forEach((product) => {
+            res.push(new IntervalNode(product[0], product[1], this.closure, opts ?? this.opts));
+        });
+        return res;
+    }
+    toInequality(middleChild) {
+        let middle = middleChild ?? new variableNode_1.VariableNode("x");
+        if ((0, constantNode_1.isConstantNode)(this.a) && this.a.tex.includes("infty")) {
+            return new inequationNode_1.InequationNode([middle, this.b], this.closure === ClosureType.OF ? "\\le" : "<");
+        }
+        if ((0, constantNode_1.isConstantNode)(this.b) && this.b.tex.includes("infty")) {
+            return new inequationNode_1.InequationNode([middle, this.a], this.closure === ClosureType.FO ? "\\ge" : ">");
+        }
+        const leftSymbol = this.closure === ClosureType.FO || this.closure === ClosureType.FF
+            ? "\\le"
+            : "<";
+        const rightSymbol = this.closure === ClosureType.FF || this.closure === ClosureType.OF
+            ? "\\le"
+            : "<";
+        return new inequationNode_1.InequationNode([this.a, middle, this.b], [leftSymbol, rightSymbol]);
+    }
+    toMathString() {
+        return this.toTex();
+    }
+    toMathjs() {
+        return this.toTex();
+    }
+    toTex() {
+        const left = this.closure === ClosureType.FF || this.closure === ClosureType.FO
+            ? "["
+            : "]";
+        const right = this.closure === ClosureType.FF || this.closure === ClosureType.OF
+            ? "]"
+            : "[";
+        return `${left}${this.a.toTex()};${this.b.toTex()}${right}`;
+    }
+}
+exports.IntervalNode = IntervalNode;

package/lib/tree/nodes/sets/setNode.d.ts

@@ -0,0 +1,4 @@
+import { Node } from "../node";
+export interface SetNode extends Node {
+}
+//# sourceMappingURL=setNode.d.ts.map

package/lib/tree/nodes/sets/setNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"setNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/setNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAE/B,MAAM,WAAW,OAAQ,SAAQ,IAAI;CAAG"}

package/lib/tree/nodes/sets/setNode.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/lib/tree/nodes/sets/unionIntervalNode.d.ts

@@ -0,0 +1,20 @@
+import { Node, NodeOptions, NodeType } from "../node";
+import { SetNode } from "./setNode";
+export declare enum ClosureType {
+    FF = 0,
+    FO = 1,
+    OF = 2,
+    OO = 3
+}
+export declare class UnionIntervalNode implements Node {
+    type: NodeType;
+    opts?: NodeOptions | undefined;
+    sets: SetNode[];
+    constructor(sets: SetNode[], opts?: NodeOptions);
+    toAllValidTexs(): string[];
+    toEquivalentNodes(opts?: NodeOptions): UnionIntervalNode[];
+    toMathString(): string;
+    toMathjs(): string;
+    toTex(): string;
+}
+//# sourceMappingURL=unionIntervalNode.d.ts.map

package/lib/tree/nodes/sets/unionIntervalNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unionIntervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/unionIntervalNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,oBAAY,WAAW;IACrB,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;IACF,EAAE,IAAA;CACH;AAED,qBAAa,iBAAkB,YAAW,IAAI;IAC5C,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,IAAI,EAAE,OAAO,EAAE,CAAC;gBACJ,IAAI,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAM/C,cAAc;IAId,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAcpC,YAAY;IAIZ,QAAQ;IAIR,KAAK;CAGN"}

package/lib/tree/nodes/sets/unionIntervalNode.js

@@ -0,0 +1,44 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.UnionIntervalNode = exports.ClosureType = void 0;
+const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const permutations_1 = require("../../../utils/permutations");
+const node_1 = require("../node");
+var ClosureType;
+(function (ClosureType) {
+    ClosureType[ClosureType["FF"] = 0] = "FF";
+    ClosureType[ClosureType["FO"] = 1] = "FO";
+    ClosureType[ClosureType["OF"] = 2] = "OF";
+    ClosureType[ClosureType["OO"] = 3] = "OO";
+})(ClosureType = exports.ClosureType || (exports.ClosureType = {}));
+class UnionIntervalNode {
+    constructor(sets, opts) {
+        this.type = node_1.NodeType.set;
+        this.sets = sets;
+        this.opts = opts;
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes(this.opts).map((node) => node.toTex());
+    }
+    toEquivalentNodes(opts) {
+        const options = opts ?? this.opts;
+        const res = [];
+        const equivs = this.sets.map((s) => s.toEquivalentNodes(options));
+        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
+        cartesians.forEach((product) => {
+            const permutations = (0, permutations_1.permute)(product);
+            permutations.forEach((permutation) => res.push(new UnionIntervalNode(permutation, options)));
+        });
+        return res;
+    }
+    toMathString() {
+        return this.toTex();
+    }
+    toMathjs() {
+        return this.toTex();
+    }
+    toTex() {
+        return this.sets.map((set) => set.toTex()).join("\\cup");
+    }
+}
+exports.UnionIntervalNode = UnionIntervalNode;

package/lib/tree/nodes/variables/variableNode.d.ts

@@ -1,4 +1,5 @@
-import { Node, NodeType } from '../node';
+import { Node, NodeType } from "../node";
+export declare function isVariableNode(a: Node): a is VariableNode;
 export declare class VariableNode implements Node {
     name: string;
     type: NodeType;

package/lib/tree/nodes/variables/variableNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"variableNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/variables/variableNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEzC,qBAAa,YAAa,YAAW,IAAI;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,WAAqB;gBAEb,IAAI,EAAE,MAAM;IAIxB,KAAK,IAAI,MAAM;IAGf,YAAY,IAAI,MAAM;IAGtB,QAAQ;IAGR,cAAc;IAGd,iBAAiB;CAMlB"}
+{"version":3,"file":"variableNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/variables/variableNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEzC,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,qBAAa,YAAa,YAAW,IAAI;IACvC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,WAAqB;gBAEb,IAAI,EAAE,MAAM;IAIxB,KAAK,IAAI,MAAM;IAGf,YAAY,IAAI,MAAM;IAGtB,QAAQ;IAGR,cAAc;IAGd,iBAAiB;CAMlB"}

package/lib/tree/nodes/variables/variableNode.js

@@ -1,7 +1,11 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.VariableNode = void 0;
+exports.VariableNode = exports.isVariableNode = void 0;
 const node_1 = require("../node");
+function isVariableNode(a) {
+    return a.type === node_1.NodeType.variable;
+}
+exports.isVariableNode = isVariableNode;
 class VariableNode {
     constructor(name) {
         this.type = node_1.NodeType.variable;

package/lib/tree/parsers/simplify.d.ts

@@ -1,4 +1,4 @@
-import { Node } from '../nodes/node';
+import { Node } from "../nodes/node";
 export declare const simplifyComplex: (node: Node) => Node;
 export declare const simplifyNode: (node: Node) => Node;
 //# sourceMappingURL=simplify.d.ts.map

package/lib/tree/parsers/simplify.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"simplify.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/simplify.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AA0BrC,eAAO,MAAM,eAAe,SAAU,IAAI,KAAG,IAE5C,CAAC;AAMF,eAAO,MAAM,YAAY,SAAU,IAAI,KAAG,IAEzC,CAAC"}
+{"version":3,"file":"simplify.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/simplify.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AA0BrC,eAAO,MAAM,eAAe,SAAU,IAAI,KAAG,IAE5C,CAAC;AASF,eAAO,MAAM,YAAY,SAAU,IAAI,KAAG,IAIzC,CAAC"}

package/lib/tree/parsers/simplify.js

@@ -22,7 +22,7 @@ const simplifyComplex = (node) => {
 };
 exports.simplifyComplex = simplifyComplex;
 const mathjsComplexToNode = (complex) => {
-    return new complexNode_1.ComplexNode(complex.re, complex.im);
+    return new complexNode_1.ComplexNode(new numberNode_1.NumberNode(complex.re), new numberNode_1.NumberNode(complex.im));
 };
 const simplifyNode = (node) => {
     return mathjsNodeToNode((0, mathjs_1.simplify)(node.toMathString()));
@@ -30,7 +30,7 @@ const simplifyNode = (node) => {
 exports.simplifyNode = simplifyNode;
 const mathjsNodeToNode = (mathjsNode) => {
     if (mathjsNode.isSymbolNode) {
-        if (mathjsNode.name === 'pi')
+        if (mathjsNode.name === "pi")
             return piNode_1.PiNode;
         return new variableNode_1.VariableNode(mathjsNode.name);
     }
@@ -39,17 +39,17 @@ const mathjsNodeToNode = (mathjsNode) => {
     }
     else if (mathjsNode.isOperatorNode) {
         switch (mathjsNode.fn) {
-            case 'add':
+            case "add":
                 return new addNode_1.AddNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
-            case 'subtract':
+            case "subtract":
                 return new substractNode_1.SubstractNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
-            case 'unaryMinus':
+            case "unaryMinus":
                 return new oppositeNode_1.OppositeNode(mathjsNodeToNode(mathjsNode.args[0]));
-            case 'divide':
+            case "divide":
                 return new fractionNode_1.FractionNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
-            case 'multiply':
+            case "multiply":
                 return new multiplyNode_1.MultiplyNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
-            case 'pow':
+            case "pow":
                 return new powerNode_1.PowerNode(mathjsNodeToNode(mathjsNode.args[0]), mathjsNodeToNode(mathjsNode.args[1]));
         }
     }
@@ -57,20 +57,20 @@ const mathjsNodeToNode = (mathjsNode) => {
         const fn = mathjsNode.fn;
         switch (fn.name) {
             //mathjs arrondit les racines carrées, on truc avec sqr pour bypass
-            case 'sqr':
+            case "sqr":
                 return new sqrtNode_1.SqrtNode(mathjsNodeToNode(mathjsNode.args[0]));
-            case 'sqrt':
+            case "sqrt":
                 return new sqrtNode_1.SqrtNode(mathjsNodeToNode(mathjsNode.args[0]));
-            case 'log':
+            case "log":
                 return new logNode_1.LogNode(mathjsNodeToNode(mathjsNode.args[0]));
-            case 'exp':
+            case "exp":
                 return new expNode_1.ExpNode(mathjsNodeToNode(mathjsNode.args[0]));
-            case 'cos':
+            case "cos":
                 return new cosNode_1.CosNode(mathjsNodeToNode(mathjsNode.args[0]));
-            case 'sin':
+            case "sin":
                 return new sinNode_1.SinNode(mathjsNodeToNode(mathjsNode.args[0]));
         }
     }
     console.log(mathjsNode);
-    throw Error('unrecognized mathjs node');
+    throw Error("unrecognized mathjs node");
 };

package/lib/tree/utilities/functionComposition.d.ts

@@ -0,0 +1,5 @@
+import { Class } from '../../types/class';
+import { FunctionNode } from '../nodes/functions/functionNode';
+import { Node } from '../nodes/node';
+export declare const functionComposition: <T extends Class<FunctionNode>>(Compositor: T, arr: Node[]) => FunctionNode;
+//# sourceMappingURL=functionComposition.d.ts.map

package/lib/tree/utilities/functionComposition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"functionComposition.d.ts","sourceRoot":"","sources":["../../../src/tree/utilities/functionComposition.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AAErC,eAAO,MAAM,mBAAmB,sDAAuD,IAAI,EAAE,iBAU5F,CAAC"}

package/lib/tree/utilities/functionComposition.js

@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.functionComposition = void 0;
+const functionComposition = (Compositor, arr) => {
+    let res;
+    if (arr.length < 1)
+        throw Error(`received ${arr.length} nodes for operator composition`);
+    res = new Compositor(arr[0]);
+    for (let i = 1; i < arr.length; i++) {
+        res = new Compositor(res, arr[i]);
+    }
+    return res;
+};
+exports.functionComposition = functionComposition;

package/lib/tree/utilities/operatorComposition.d.ts

@@ -0,0 +1,5 @@
+import { Class } from "../../types/class";
+import { Node } from "../nodes/node";
+import { CommutativeOperatorNode } from "../nodes/operators/operatorNode";
+export declare const operatorComposition: <T extends Class<CommutativeOperatorNode>>(Compositor: T, arr: Node[]) => InstanceType<T>;
+//# sourceMappingURL=operatorComposition.d.ts.map

package/lib/tree/utilities/operatorComposition.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"operatorComposition.d.ts","sourceRoot":"","sources":["../../../src/tree/utilities/operatorComposition.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EACL,uBAAuB,EAExB,MAAM,iCAAiC,CAAC;AAEzC,eAAO,MAAM,mBAAmB,iEAEzB,IAAI,EAAE,oBAYZ,CAAC"}

package/lib/tree/utilities/operatorComposition.js

@@ -0,0 +1,14 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.operatorComposition = void 0;
+const operatorComposition = (Compositor, arr) => {
+    let res;
+    if (arr.length < 2)
+        throw Error(`received ${arr.length} nodes for operator composition`);
+    res = new Compositor(arr[0], arr[1]);
+    for (let i = 2; i < arr.length; i++) {
+        res = new Compositor(res, arr[i]);
+    }
+    return res;
+};
+exports.operatorComposition = operatorComposition;

package/lib/types/class.d.ts

@@ -0,0 +1,4 @@
+export interface Class<T> extends Function {
+    new (...args: any[]): T;
+}
+//# sourceMappingURL=class.d.ts.map

package/lib/types/class.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"class.d.ts","sourceRoot":"","sources":["../../src/types/class.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,KAAK,CAAC,CAAC,CAAE,SAAQ,QAAQ;IACxC,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;CACzB"}

package/lib/types/class.js

@@ -0,0 +1,2 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });

package/lib/utils/cartesianProducts.d.ts

@@ -0,0 +1,13 @@
+/**
+ * exp [[1,2],[3],[4,5]] donnera [[1,3,4], [1,3,5], [2,3,4],[2,3,5]]
+ * @param arr
+ * @returns
+ */
+export declare function getCartesiansProducts<T>(arr: T[][]): T[][];
+/**
+ * exp [[1], [[5, 5], 6], [7, [8, 9]]]  -> [1,5,5,7] [1,5,5,8,9] [1,6,7] [1,6,8,9]
+ * @param arr
+ * @returns
+ */
+export declare function getFlatCartesianProducts<T>(arr: (T | T[])[][]): T[][];
+//# sourceMappingURL=cartesianProducts.d.ts.map

package/lib/utils/cartesianProducts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cartesianProducts.d.ts","sourceRoot":"","sources":["../../src/utils/cartesianProducts.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,SAkBlD;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,SA8B7D"}

package/lib/utils/cartesianProducts.js

@@ -0,0 +1,64 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getFlatCartesianProducts = exports.getCartesiansProducts = void 0;
+/**
+ * exp [[1,2],[3],[4,5]] donnera [[1,3,4], [1,3,5], [2,3,4],[2,3,5]]
+ * @param arr
+ * @returns
+ */
+function getCartesiansProducts(arr) {
+    const res = [];
+    for (let i = 0; i < arr.length; i++) {
+        const currentRes = [...res];
+        for (let j = 0; j < arr[i].length; j++) {
+            if (i === 0)
+                res.push([arr[i][j]]);
+            else {
+                if (j === 0) {
+                    currentRes.forEach((el) => el.push(arr[i][j]));
+                }
+                else {
+                    currentRes.forEach((el) => res.push([...el.slice(0, el.length - 1), arr[i][j]]));
+                }
+            }
+        }
+    }
+    return res;
+}
+exports.getCartesiansProducts = getCartesiansProducts;
+/**
+ * exp [[1], [[5, 5], 6], [7, [8, 9]]]  -> [1,5,5,7] [1,5,5,8,9] [1,6,7] [1,6,8,9]
+ * @param arr
+ * @returns
+ */
+function getFlatCartesianProducts(arr) {
+    const res = [];
+    for (let i = 0; i < arr.length; i++) {
+        const currentRes = [...res];
+        for (let j = 0; j < arr[i].length; j++) {
+            const isArray = Array.isArray(arr[i][j]);
+            const eltToArray = isArray
+                ? arr[i][j]
+                : [arr[i][j]];
+            if (i === 0)
+                res.push([...eltToArray]);
+            else {
+                if (j === 0) {
+                    res.forEach((el) => el.push(...eltToArray));
+                }
+                else {
+                    const isPrevArray = Array.isArray(arr[i][0]);
+                    const prevEltToArray = isPrevArray
+                        ? arr[i][0]
+                        : [arr[i][0]];
+                    currentRes.forEach((el) => res.push([
+                        ...el.slice(0, el.length - prevEltToArray.length),
+                        ...eltToArray,
+                    ]));
+                }
+            }
+        }
+    }
+    return res;
+}
+exports.getFlatCartesianProducts = getFlatCartesianProducts;

package/lib/utils/isInt.d.ts

@@ -0,0 +1,2 @@
+export declare const isInt: (n: number) => boolean;
+//# sourceMappingURL=isInt.d.ts.map

package/lib/utils/isInt.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"isInt.d.ts","sourceRoot":"","sources":["../../src/utils/isInt.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,KAAK,MAAO,MAAM,YAE9B,CAAC"}

package/lib/utils/isInt.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isInt = void 0;
+const isInt = (n) => {
+    return n === Math.floor(n);
+};
+exports.isInt = isInt;

package/lib/utils/isLetter.d.ts

@@ -0,0 +1,2 @@
+export declare const isLetter: (str: string) => false | RegExpMatchArray | null;
+//# sourceMappingURL=isLetter.d.ts.map

package/lib/utils/isLetter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"isLetter.d.ts","sourceRoot":"","sources":["../../src/utils/isLetter.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,QAAQ,QAAS,MAAM,oCAEnC,CAAC"}

package/lib/utils/isLetter.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isLetter = void 0;
+const isLetter = (str) => {
+    return str.length === 1 && str.match(/[a-z]/i);
+};
+exports.isLetter = isLetter;

package/lib/utils/permutations.d.ts

@@ -0,0 +1,2 @@
+export declare function permute<T>(arr: T[]): T[][];
+//# sourceMappingURL=permutations.d.ts.map

package/lib/utils/permutations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"permutations.d.ts","sourceRoot":"","sources":["../../src/utils/permutations.ts"],"names":[],"mappings":"AAAA,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,SAclC"}

package/lib/utils/permutations.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.permute = void 0;
+function permute(arr) {
+    const result = [];
+    if (arr.length === 0)
+        return [];
+    if (arr.length === 1)
+        return [arr];
+    for (let i = 0; i < arr.length; i++) {
+        const currentNum = arr[i];
+        const remainingNums = arr.slice(0, i).concat(arr.slice(i + 1));
+        const remainingNumsPermuted = permute(remainingNums);
+        for (let j = 0; j < remainingNumsPermuted.length; j++) {
+            const permutedArray = [currentNum].concat(remainingNumsPermuted[j]);
+            result.push(permutedArray);
+        }
+    }
+    return result;
+}
+exports.permute = permute;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-exercises",
-  "version": "2.0.0",
+  "version": "2.0.2",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [