sea-platform-helpers 1.0.0

package/dist/utils/string/index.js

@@ -0,0 +1,29 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.isEmail = exports.isPhoneNumber = exports.emailRegex = exports.phoneRegExp = exports.generateRandomString = exports.normalizeString = void 0;
+const characters = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
+const normalizeString = (str) => {
+    if (str)
+        return str.trim().toLowerCase();
+    return null;
+};
+exports.normalizeString = normalizeString;
+const generateRandomString = (length = 6) => {
+    let result = "";
+    for (let i = 0; i < length; i++) {
+        const randomIndex = Math.floor(Math.random() * characters.length);
+        result += characters[randomIndex];
+    }
+    return result;
+};
+exports.generateRandomString = generateRandomString;
+exports.phoneRegExp = /^\+?[1-9]\d{1,3}\d{6,14}$/;
+exports.emailRegex = /^[a-zA-Z0-9._-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,6}$/;
+const isPhoneNumber = (str) => {
+    return exports.phoneRegExp.test(str);
+};
+exports.isPhoneNumber = isPhoneNumber;
+const isEmail = (str) => {
+    return exports.emailRegex.test(str);
+};
+exports.isEmail = isEmail;

package/dist/utils/tree/index.d.ts

@@ -0,0 +1,6 @@
+export declare const editTree: <T, G>(root: T, editFn: (value: T) => G, childrenKey: keyof T) => G;
+export declare const DFS: <T>(root: T, walk: (value: T) => void, childrenKey: keyof T) => void;
+export declare const findNode: <T>(root: T, predicate: (node: T) => boolean, childrenKey: keyof T) => T | undefined;
+export declare const flattenTree: <T, K extends keyof T>(node: T, childrenKey: K) => T[];
+export declare const getAllLeafNodes: <T, K extends keyof T>(node: T, childrenKey: K) => T[];
+//# sourceMappingURL=index.d.ts.map

package/dist/utils/tree/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/utils/tree/index.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,CAAC,QACrB,CAAC,UACC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,eACV,MAAM,CAAC,KACnB,CAeF,CAAC;AAEF,eAAO,MAAM,GAAG,GAAI,CAAC,QACb,CAAC,QACD,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,eACX,MAAM,CAAC,KACnB,IAOF,CAAC;AAEF,eAAO,MAAM,QAAQ,GAAI,CAAC,QAClB,CAAC,aACI,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,eAClB,MAAM,CAAC,KACnB,CAAC,GAAG,SAgBN,CAAC;AAEF,eAAO,MAAM,WAAW,GAAI,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,QACxC,CAAC,eACM,CAAC,KACb,CAAC,EAeH,CAAC;AAEF,eAAO,MAAM,eAAe,GAAI,CAAC,EAAE,CAAC,SAAS,MAAM,CAAC,QAC5C,CAAC,eACM,CAAC,KACb,CAAC,EAeH,CAAC"}

package/dist/utils/tree/index.js

@@ -0,0 +1,69 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getAllLeafNodes = exports.flattenTree = exports.findNode = exports.DFS = exports.editTree = void 0;
+const editTree = (root, editFn, childrenKey) => {
+    // Access children using the provided key
+    const children = root[childrenKey];
+    let newChildren = [];
+    if (children) {
+        // Update the children recursively
+        newChildren = children.map((child) => (0, exports.editTree)(child, editFn, childrenKey));
+    }
+    // Apply the edit function to the root value
+    const updated = editFn(root);
+    updated[childrenKey] = newChildren;
+    return updated;
+};
+exports.editTree = editTree;
+const DFS = (root, walk, childrenKey) => {
+    const children = root[childrenKey];
+    if (children) {
+        children.forEach((child) => (0, exports.DFS)(child, walk, childrenKey));
+    }
+    walk(root);
+};
+exports.DFS = DFS;
+const findNode = (root, predicate, childrenKey) => {
+    if (predicate(root)) {
+        return root;
+    }
+    const children = root[childrenKey];
+    if (children) {
+        for (const child of children) {
+            const result = (0, exports.findNode)(child, predicate, childrenKey);
+            if (result) {
+                return result;
+            }
+        }
+    }
+    return undefined;
+};
+exports.findNode = findNode;
+const flattenTree = (node, childrenKey) => {
+    // Start with the current node
+    const result = [node];
+    // Retrieve children from the given key, ensuring it's not null or undefined
+    const children = node[childrenKey];
+    // If children exist, recursively process them and add to the result
+    if (children) {
+        for (let child of children) {
+            result.push(...(0, exports.flattenTree)(child, childrenKey)); // Flatten the results
+        }
+    }
+    return result;
+};
+exports.flattenTree = flattenTree;
+const getAllLeafNodes = (node, childrenKey) => {
+    const children = node[childrenKey];
+    // If the node has no children or the children array is empty, it's a leaf
+    if (!children || children.length === 0) {
+        return [node];
+    }
+    // Otherwise, recursively get leaf nodes from all children
+    const leafNodes = [];
+    for (let child of children) {
+        leafNodes.push(...(0, exports.getAllLeafNodes)(child, childrenKey));
+    }
+    return leafNodes;
+};
+exports.getAllLeafNodes = getAllLeafNodes;

package/package.json

@@ -0,0 +1,36 @@
+{
+  "name": "sea-platform-helpers",
+  "description": "SEA platform helpers library",
+  "version": "1.0.0",
+  "main": "dist/index.js",
+  "scripts": {
+    "build": "tsc --build",
+    "watch": "tsc --watch"
+  },
+  "files": [
+    "dist/**/*"
+  ],
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "keywords": [],
+  "author": "",
+  "license": "ISC",
+  "dependencies": {
+    "@nestjs/swagger": "^8.0.7",
+    "bcrypt": "^5.1.1",
+    "class-transformer": "^0.5.1",
+    "class-validator": "^0.14.1",
+    "moment": "^2.30.1",
+    "moment-timezone": "^0.5.46",
+    "numeral": "^2.0.6",
+    "sea-platform-helpers": "file:"
+  },
+  "devDependencies": {
+    "@types/bcrypt": "^5.0.2",
+    "@types/numeral": "^2.0.5"
+  }
+}