math-exercises 2.0.1 → 2.0.2

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.1",
+  "version": "2.0.2",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [