topkat-utils 1.1.13 → 1.1.14

package/dist/src/loop-utils.d.ts

@@ -0,0 +1,40 @@
+import { ObjectGeneric } from "./private/types";
+export declare function forI<T extends any[] | any>(nbIterations: number, callback: (number: number, previousValue: any, arrayOfPreviousValues: any[]) => T): T[];
+export declare function forIasync<T extends any[] | any>(nbIterations: number, callback: (number: any) => T): Promise<T[]>;
+export declare type RecursiveCallback = (item: any, addr: string, lastElementKey: string | number, parent: ObjectGeneric | any[]) => false | any;
+export declare type RecursiveConfig = {
+    disableCircularDependencyRemoval?: boolean;
+};
+/**
+ * @param {any} item the first array or object or whatever you want to recursively browse
+ * @param {function} callback the callback you want to apply on items including the main one
+ *   * this callback has 2 arguments: (item, address) =>
+ *   * `item` => the actual item
+ *   * `addr` => the address of the item, not including root (Eg: subItem1.sub2.[3].[2]) array indexes are juste written as numbers
+ *   * `lastElementKey` => the key of last item. May be a number if last item is an array
+ *   * `parent` => reference the parent object as this is the only way of reassigning a value for the item. Eg: parent[lastElementKey] = myNewItem
+ *   * **NOTE** => if a key of an item contains dots, they will be replaced by '%' in `addr`
+ *   * **NOTE2** => if false is returned by the callback it will stop all other iterations (but not in an array)
+ * @param {string} addr$ optional, the base address for the callback function
+ * @param lastElementKey technical field
+ * NOTE: will remove circular references
+ * /!\ check return values
+ */
+export declare function recursiveGenericFunction(item: ObjectGeneric | any[], callback: RecursiveCallback, config?: RecursiveConfig, addr$?: string, lastElementKey?: string | number, parent?: any, techFieldToAvoidCircularDependency?: any[]): Promise<any[] | ObjectGeneric>;
+/**
+ * @param {any} item the first array or object or whatever you want to recursively browse
+ * @param {function} callback the callback you want to apply on items including the main one
+ *   * this callback has 2 arguments: (item, address) =>
+ *   * `item` => the actual item
+ *   * `addr` => the address of the item, not including root (Eg: subItem1.sub2.[3].[2]) array indexes are juste written as numbers
+ *   * `lastElementKey` => the key of last item. May be a number if last item is an array
+ *   * `parent` => reference the parent object as this is the only way of reassigning a value for the item. Eg: parent[lastElementKey] = myNewItem
+ *   * **NOTE** => if a key of an item contains dots, they will be replaced by '%' in `addr`
+ *   * **NOTE2** => if false is returned by the callback it will stop all other iterations (but not in an array)
+ *   * **NOTE3** => to reassign a key use =>  parent[lastElementKey] = myNewItem
+ * @param {string} addr$ optional, the base address for the callback function
+ * @param lastElementKey technical field
+ * NOTE: will remove circular references
+ * /!\ check return values
+ */
+export declare function recursiveGenericFunctionSync(item: ObjectGeneric | any[], callback: RecursiveCallback, config?: RecursiveConfig, addr$?: string, lastElementKey?: string | number, parent?: any, techFieldToAvoidCircularDependency?: any[]): any[] | ObjectGeneric;

package/dist/src/loop-utils.js

@@ -0,0 +1,182 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (_) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.recursiveGenericFunctionSync = exports.recursiveGenericFunction = exports.forIasync = exports.forI = void 0;
+var error_utils_1 = require("./error-utils");
+var is_object_1 = require("./is-object");
+function forI(nbIterations, callback) {
+    var results = [];
+    for (var i = 0; i < nbIterations; i++) {
+        var prevValue = results[results.length - 1];
+        results.push(callback(i, prevValue, results));
+    }
+    return results;
+}
+exports.forI = forI;
+function forIasync(nbIterations, callback) {
+    return __awaiter(this, void 0, void 0, function () {
+        var results, i, _a, _b;
+        return __generator(this, function (_c) {
+            switch (_c.label) {
+                case 0:
+                    results = [];
+                    i = 0;
+                    _c.label = 1;
+                case 1:
+                    if (!(i < nbIterations)) return [3 /*break*/, 4];
+                    _b = (_a = results).push;
+                    return [4 /*yield*/, callback(i)];
+                case 2:
+                    _b.apply(_a, [_c.sent()]);
+                    _c.label = 3;
+                case 3:
+                    i++;
+                    return [3 /*break*/, 1];
+                case 4: return [2 /*return*/, results];
+            }
+        });
+    });
+}
+exports.forIasync = forIasync;
+/**
+ * @param {any} item the first array or object or whatever you want to recursively browse
+ * @param {function} callback the callback you want to apply on items including the main one
+ *   * this callback has 2 arguments: (item, address) =>
+ *   * `item` => the actual item
+ *   * `addr` => the address of the item, not including root (Eg: subItem1.sub2.[3].[2]) array indexes are juste written as numbers
+ *   * `lastElementKey` => the key of last item. May be a number if last item is an array
+ *   * `parent` => reference the parent object as this is the only way of reassigning a value for the item. Eg: parent[lastElementKey] = myNewItem
+ *   * **NOTE** => if a key of an item contains dots, they will be replaced by '%' in `addr`
+ *   * **NOTE2** => if false is returned by the callback it will stop all other iterations (but not in an array)
+ * @param {string} addr$ optional, the base address for the callback function
+ * @param lastElementKey technical field
+ * NOTE: will remove circular references
+ * /!\ check return values
+ */
+function recursiveGenericFunction(item, callback, config, addr$, lastElementKey, parent, techFieldToAvoidCircularDependency) {
+    if (config === void 0) { config = {}; }
+    if (addr$ === void 0) { addr$ = ''; }
+    if (lastElementKey === void 0) { lastElementKey = ''; }
+    if (techFieldToAvoidCircularDependency === void 0) { techFieldToAvoidCircularDependency = []; }
+    return __awaiter(this, void 0, void 0, function () {
+        var result, _a, addr_1;
+        return __generator(this, function (_b) {
+            switch (_b.label) {
+                case 0:
+                    (0, error_utils_1.err500IfNotSet)({ callback: callback });
+                    if (!!techFieldToAvoidCircularDependency.includes(item)) return [3 /*break*/, 7];
+                    if (!(addr$ === '')) return [3 /*break*/, 1];
+                    _a = true;
+                    return [3 /*break*/, 3];
+                case 1: return [4 /*yield*/, callback(item, addr$, lastElementKey, parent)];
+                case 2:
+                    _a = _b.sent();
+                    _b.label = 3;
+                case 3:
+                    result = _a;
+                    if (!(result !== false)) return [3 /*break*/, 7];
+                    addr_1 = addr$ ? addr$ + '.' : '';
+                    if (!Array.isArray(item)) return [3 /*break*/, 5];
+                    if ((config === null || config === void 0 ? void 0 : config.disableCircularDependencyRemoval) !== true)
+                        techFieldToAvoidCircularDependency.push(item);
+                    return [4 /*yield*/, Promise.all(item.map(function (e, i) { return recursiveGenericFunction(e, callback, config, addr_1 + '[' + i + ']', i, item, techFieldToAvoidCircularDependency); }))];
+                case 4:
+                    _b.sent();
+                    return [3 /*break*/, 7];
+                case 5:
+                    if (!(0, is_object_1.isObject)(item)) return [3 /*break*/, 7];
+                    if ((config === null || config === void 0 ? void 0 : config.disableCircularDependencyRemoval) !== true)
+                        techFieldToAvoidCircularDependency.push(item);
+                    return [4 /*yield*/, Promise.all(Object.entries(item).map(function (_a) {
+                            var key = _a[0], val = _a[1];
+                            return recursiveGenericFunction(val, callback, config, addr_1 + key.replace(/\./g, '%'), key, item, techFieldToAvoidCircularDependency);
+                        }))];
+                case 6:
+                    _b.sent();
+                    _b.label = 7;
+                case 7: return [2 /*return*/, item];
+            }
+        });
+    });
+}
+exports.recursiveGenericFunction = recursiveGenericFunction;
+/**
+ * @param {any} item the first array or object or whatever you want to recursively browse
+ * @param {function} callback the callback you want to apply on items including the main one
+ *   * this callback has 2 arguments: (item, address) =>
+ *   * `item` => the actual item
+ *   * `addr` => the address of the item, not including root (Eg: subItem1.sub2.[3].[2]) array indexes are juste written as numbers
+ *   * `lastElementKey` => the key of last item. May be a number if last item is an array
+ *   * `parent` => reference the parent object as this is the only way of reassigning a value for the item. Eg: parent[lastElementKey] = myNewItem
+ *   * **NOTE** => if a key of an item contains dots, they will be replaced by '%' in `addr`
+ *   * **NOTE2** => if false is returned by the callback it will stop all other iterations (but not in an array)
+ *   * **NOTE3** => to reassign a key use =>  parent[lastElementKey] = myNewItem
+ * @param {string} addr$ optional, the base address for the callback function
+ * @param lastElementKey technical field
+ * NOTE: will remove circular references
+ * /!\ check return values
+ */
+function recursiveGenericFunctionSync(item, callback, config, addr$, lastElementKey, parent, techFieldToAvoidCircularDependency) {
+    if (config === void 0) { config = {}; }
+    if (addr$ === void 0) { addr$ = ''; }
+    if (lastElementKey === void 0) { lastElementKey = ''; }
+    if (techFieldToAvoidCircularDependency === void 0) { techFieldToAvoidCircularDependency = []; }
+    (0, error_utils_1.err500IfNotSet)({ callback: callback });
+    if (!techFieldToAvoidCircularDependency.includes(item)) {
+        var result = addr$ === '' ? true : callback(item, addr$, lastElementKey, parent);
+        if (result !== false) {
+            var addr_2 = addr$ ? addr$ + '.' : '';
+            if (Array.isArray(item)) {
+                if ((config === null || config === void 0 ? void 0 : config.disableCircularDependencyRemoval) !== true)
+                    techFieldToAvoidCircularDependency.push(item); // do not up one level
+                item.forEach(function (e, i) { return recursiveGenericFunctionSync(e, callback, config, addr_2 + '[' + i + ']', i, item, techFieldToAvoidCircularDependency); });
+            }
+            else if ((0, is_object_1.isObject)(item)) {
+                if ((config === null || config === void 0 ? void 0 : config.disableCircularDependencyRemoval) !== true)
+                    techFieldToAvoidCircularDependency.push(item);
+                Object.entries(item).forEach(function (_a) {
+                    var key = _a[0], val = _a[1];
+                    return recursiveGenericFunctionSync(val, callback, config, addr_2 + key.replace(/\./g, '%'), key, item, techFieldToAvoidCircularDependency);
+                });
+            }
+        }
+    }
+    return item;
+}
+exports.recursiveGenericFunctionSync = recursiveGenericFunctionSync;
+//# sourceMappingURL=loop-utils.js.map

package/dist/src/loop-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"loop-utils.js","sourceRoot":"","sources":["../../src/loop-utils.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAIA,6CAA8C;AAC9C,yCAAsC;AAEtC,SAAgB,IAAI,CAAwB,YAAoB,EAAE,QAA4E;IAC1I,IAAM,OAAO,GAAG,EAAE,CAAA;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;QACnC,IAAM,SAAS,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAC7C,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC,CAAA;KAChD;IACD,OAAO,OAAO,CAAA;AAClB,CAAC;AAPD,oBAOC;AAED,SAAsB,SAAS,CAAwB,YAAoB,EAAE,QAAuB;;;;;;oBAC1F,OAAO,GAAG,EAAE,CAAA;oBACT,CAAC,GAAG,CAAC;;;yBAAE,CAAA,CAAC,GAAG,YAAY,CAAA;oBAC5B,KAAA,CAAA,KAAA,OAAO,CAAA,CAAC,IAAI,CAAA;oBAAC,qBAAM,QAAQ,CAAC,CAAC,CAAC,EAAA;;oBAA9B,cAAa,SAAiB,EAAC,CAAA;;;oBADD,CAAC,EAAE,CAAA;;wBAGrC,sBAAO,OAAO,EAAA;;;;CACjB;AAND,8BAMC;AAMD;;;;;;;;;;;;;;GAcG;AACH,SAAsB,wBAAwB,CAAC,IAA2B,EAAE,QAA2B,EAAE,MAA4B,EAAE,KAAU,EAAE,cAAoC,EAAE,MAAO,EAAE,kCAAuC;IAAhI,uBAAA,EAAA,WAA4B;IAAE,sBAAA,EAAA,UAAU;IAAE,+BAAA,EAAA,mBAAoC;IAAW,mDAAA,EAAA,uCAAuC;;;;;;oBACrO,IAAA,4BAAc,EAAC,EAAE,QAAQ,UAAA,EAAE,CAAC,CAAA;yBAExB,CAAC,kCAAkC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAlD,wBAAkD;yBACnC,CAAA,KAAK,KAAK,EAAE,CAAA,EAAZ,wBAAY;oBAAG,KAAA,IAAI,CAAA;;wBAAG,qBAAM,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,CAAC,EAAA;;oBAAnD,KAAA,SAAmD,CAAA;;;oBAAlF,MAAM,KAA4E;yBAEpF,CAAA,MAAM,KAAK,KAAK,CAAA,EAAhB,wBAAgB;oBACV,SAAO,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA;yBACjC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAnB,wBAAmB;oBACnB,IAAI,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,gCAAgC,MAAK,IAAI;wBAAE,kCAAkC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBACpG,qBAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CACtB,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,wBAAwB,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAI,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,kCAAkC,CAAC,EAAhH,CAAgH,CAC7H,CAAC,EAAA;;oBAFF,SAEE,CAAA;;;yBACK,IAAA,oBAAQ,EAAC,IAAI,CAAC,EAAd,wBAAc;oBACrB,IAAI,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,gCAAgC,MAAK,IAAI;wBAAE,kCAAkC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBACpG,qBAAM,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CACtC,UAAC,EAAU;gCAAT,GAAG,QAAA,EAAE,GAAG,QAAA;4BAAM,OAAA,wBAAwB,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAI,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,kCAAkC,CAAC;wBAA9H,CAA8H,CACjJ,CAAC,EAAA;;oBAFF,SAEE,CAAA;;wBAId,sBAAO,IAAI,EAAA;;;;CACd;AAtBD,4DAsBC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,4BAA4B,CAAC,IAA2B,EAAE,QAA2B,EAAE,MAA4B,EAAE,KAAU,EAAE,cAAoC,EAAE,MAAO,EAAE,kCAAuC;IAAhI,uBAAA,EAAA,WAA4B;IAAE,sBAAA,EAAA,UAAU;IAAE,+BAAA,EAAA,mBAAoC;IAAW,mDAAA,EAAA,uCAAuC;IACnO,IAAA,4BAAc,EAAC,EAAE,QAAQ,UAAA,EAAE,CAAC,CAAA;IAE5B,IAAI,CAAC,kCAAkC,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;QACpD,IAAM,MAAM,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,CAAC,CAAA;QAElF,IAAI,MAAM,KAAK,KAAK,EAAE;YAClB,IAAM,MAAI,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA;YACrC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACrB,IAAI,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,gCAAgC,MAAK,IAAI;oBAAE,kCAAkC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA,CAAC,sBAAsB;gBAC3H,IAAI,CAAC,OAAO,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,4BAA4B,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAI,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,kCAAkC,CAAC,EAApH,CAAoH,CAAC,CAAA;aAC/I;iBAAM,IAAI,IAAA,oBAAQ,EAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,gCAAgC,MAAK,IAAI;oBAAE,kCAAkC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACpG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,UAAC,EAAU;wBAAT,GAAG,QAAA,EAAE,GAAG,QAAA;oBAAM,OAAA,4BAA4B,CAAC,GAAG,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAI,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,kCAAkC,CAAC;gBAAlI,CAAkI,CAAC,CAAA;aACnL;SACJ;KACJ;IACD,OAAO,IAAI,CAAA;AACf,CAAC;AAlBD,oEAkBC"}

package/dist/src/math-utils.d.ts

@@ -0,0 +1,23 @@
+/** Round with custom number of decimals (default:0) */
+export declare function round(number: number | string, decimals?: number): number;
+/** Round with custom number of decimals (default:2) */
+export declare function round2(number: number | string, decimals?: number): number;
+/** Is number between two numbers (including those numbers) */
+export declare function isBetween(number: number, min: number, max: number, inclusive?: boolean): boolean;
+/** Random number between two values with 0 decimals by default */
+export declare function random(nb1: number, nb2: number, nbOfDecimals?: number): number;
+/** Sum all values of an array, all values MUST be numbers */
+export declare function sumArray(array: number[]): number;
+/** Moyenne / average between array of values
+ * @param {Number} round number of decimals to keep. Default:2
+*/
+export declare function moyenne(array: number[], nbOfDecimals?: number): number;
+/** length default 2, shortcut for 1 to 01 */
+export declare function pad(numberOrStr: number | string, length?: number): string;
+/** return the number or the closest number of the range
+ * * nb min max  => returns
+ * * 7  5   10   => 7 // in the range
+ * * 2  5   10   => 5 // below the min value
+ * * 99 5   10   => 10// above the max value
+ */
+export declare function minMax(nb: number, min: number, max: number): number;

package/dist/src/math-utils.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.minMax = exports.pad = exports.moyenne = exports.sumArray = exports.random = exports.isBetween = exports.round2 = exports.round = void 0;
+//----------------------------------------
+// MATH UTILS
+//----------------------------------------
+var isset_1 = require("./isset");
+/** Round with custom number of decimals (default:0) */
+function round(number, decimals) {
+    if (decimals === void 0) { decimals = 0; }
+    return Math.round((typeof number === 'number' ? number : parseFloat(number)) * Math.pow(10, decimals)) / Math.pow(10, decimals);
+}
+exports.round = round;
+/** Round with custom number of decimals (default:2) */
+function round2(number, decimals) {
+    if (decimals === void 0) { decimals = 2; }
+    return round(number, decimals);
+}
+exports.round2 = round2;
+/** Is number between two numbers (including those numbers) */
+function isBetween(number, min, max, inclusive) {
+    if (inclusive === void 0) { inclusive = true; }
+    return inclusive ? number <= max && number >= min : number < max && number > min;
+}
+exports.isBetween = isBetween;
+/** Random number between two values with 0 decimals by default */
+function random(nb1, nb2, nbOfDecimals) {
+    if (nbOfDecimals === void 0) { nbOfDecimals = 0; }
+    return round(Math.random() * (nb2 - nb1) + nb1, nbOfDecimals);
+}
+exports.random = random;
+/** Sum all values of an array, all values MUST be numbers */
+function sumArray(array) {
+    return array.filter(function (item) { return typeof item === 'number'; }).reduce(function (sum, val) { return (0, isset_1.isset)(val) ? val + sum : sum; }, 0);
+}
+exports.sumArray = sumArray;
+/** Moyenne / average between array of values
+ * @param {Number} round number of decimals to keep. Default:2
+*/
+function moyenne(array, nbOfDecimals) {
+    if (nbOfDecimals === void 0) { nbOfDecimals = 2; }
+    return round(sumArray(array) / array.length, nbOfDecimals);
+}
+exports.moyenne = moyenne;
+/** length default 2, shortcut for 1 to 01 */
+function pad(numberOrStr, length) {
+    if (length === void 0) { length = 2; }
+    return ('' + numberOrStr).padStart(length, '0');
+}
+exports.pad = pad;
+/** return the number or the closest number of the range
+ * * nb min max  => returns
+ * * 7  5   10   => 7 // in the range
+ * * 2  5   10   => 5 // below the min value
+ * * 99 5   10   => 10// above the max value
+ */
+function minMax(nb, min, max) { return Math.max(min, Math.min(nb, max)); }
+exports.minMax = minMax;
+//# sourceMappingURL=math-utils.js.map

package/dist/src/math-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"math-utils.js","sourceRoot":"","sources":["../../src/math-utils.ts"],"names":[],"mappings":";;;AAAA,0CAA0C;AAC1C,aAAa;AACb,0CAA0C;AAC1C,iCAA+B;AAE/B,uDAAuD;AACvD,SAAgB,KAAK,CAAC,MAAuB,EAAE,QAAY;IAAZ,yBAAA,EAAA,YAAY;IAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;AAAC,CAAC;AAAhM,sBAAgM;AAChM,uDAAuD;AACvD,SAAgB,MAAM,CAAC,MAAuB,EAAE,QAAY;IAAZ,yBAAA,EAAA,YAAY;IAAI,OAAO,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;AAAC,CAAC;AAAhG,wBAAgG;AAEhG,8DAA8D;AAC9D,SAAgB,SAAS,CAAC,MAAc,EAAE,GAAW,EAAE,GAAW,EAAE,SAAgB;IAAhB,0BAAA,EAAA,gBAAgB;IAAI,OAAO,SAAS,CAAC,CAAC,CAAC,MAAM,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG,IAAI,MAAM,GAAG,GAAG,CAAA;AAAC,CAAC;AAA1K,8BAA0K;AAE1K,kEAAkE;AAClE,SAAgB,MAAM,CAAC,GAAW,EAAE,GAAW,EAAE,YAAgB;IAAhB,6BAAA,EAAA,gBAAgB;IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,YAAY,CAAC,CAAA;AAAC,CAAC;AAApI,wBAAoI;AAEpI,6DAA6D;AAC7D,SAAgB,QAAQ,CAAC,KAAe;IACpC,OAAO,KAAK,CAAC,MAAM,CAAC,UAAA,IAAI,IAAI,OAAA,OAAO,IAAI,KAAK,QAAQ,EAAxB,CAAwB,CAAC,CAAC,MAAM,CAAC,UAAC,GAAG,EAAE,GAAG,IAAK,OAAA,IAAA,aAAK,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,EAA5B,CAA4B,EAAE,CAAC,CAAC,CAAA;AAC/G,CAAC;AAFD,4BAEC;AAED;;EAEE;AACF,SAAgB,OAAO,CAAC,KAAe,EAAE,YAAgB;IAAhB,6BAAA,EAAA,gBAAgB;IACrD,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;AAC9D,CAAC;AAFD,0BAEC;AAED,6CAA6C;AAC7C,SAAgB,GAAG,CAAC,WAA4B,EAAE,MAAU;IAAV,uBAAA,EAAA,UAAU;IAAI,OAAO,CAAC,EAAE,GAAG,WAAW,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;AAAC,CAAC;AAAjH,kBAAiH;AAEjH;;;;;GAKG;AACH,SAAgB,MAAM,CAAC,EAAU,EAAE,GAAW,EAAE,GAAW,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAA,CAAC,CAAC;AAAxG,wBAAwG"}

package/dist/src/mongo-utils.d.ts

@@ -0,0 +1,11 @@
+/** @return undefined if cannot find _id */
+export declare function getId(obj?: any): string;
+/** Merge filter with correct handling of OR and AND
+ * @param {Object} filterA
+ * @param {Object} filterB
+ * @param {Boolean} assignToFilterA defualt false: if true, it will modify filterA, else it will return merged filters as a new object
+ */
+export declare function mongoFilterMerger(filterA: any, filterB: any, assignToFilterA?: boolean): any;
+export declare function mongoPush(field: string, value: any, fields: {
+    [k: string]: any;
+}): void;

package/dist/src/mongo-utils.js

@@ -0,0 +1,63 @@
+"use strict";
+var __assign = (this && this.__assign) || function () {
+    __assign = Object.assign || function(t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+                t[p] = s[p];
+        }
+        return t;
+    };
+    return __assign.apply(this, arguments);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mongoPush = exports.mongoFilterMerger = exports.getId = void 0;
+//----------------------------------------
+// MONGO UTILS
+//----------------------------------------
+var validation_utils_1 = require("./validation-utils");
+var isset_1 = require("./isset");
+/** @return undefined if cannot find _id */
+function getId(obj) {
+    if (obj === void 0) { obj = {}; }
+    if (!obj)
+        return; // null case
+    if (obj._id)
+        return obj._id.toString();
+    else if ((0, validation_utils_1.isType)(obj, 'objectId'))
+        return obj.toString();
+}
+exports.getId = getId;
+/** Merge filter with correct handling of OR and AND
+ * @param {Object} filterA
+ * @param {Object} filterB
+ * @param {Boolean} assignToFilterA defualt false: if true, it will modify filterA, else it will return merged filters as a new object
+ */
+function mongoFilterMerger(filterA, filterB, assignToFilterA) {
+    var _a;
+    if (assignToFilterA === void 0) { assignToFilterA = false; }
+    if ((0, isset_1.isset)(filterA.$and) && (0, isset_1.isset)(filterB.$and)) {
+        (_a = filterA.$and).push.apply(_a, filterB.$and);
+        delete filterB.$and;
+    }
+    if ((0, isset_1.isset)(filterA.$or) && (0, isset_1.isset)(filterB.$or)) {
+        if (!(0, isset_1.isset)(filterA.$and))
+            filterA.$and = [];
+        filterA.$and.push({ $or: filterA.$or }, { $or: filterA.$or });
+        delete filterB.$or;
+    }
+    if (assignToFilterA) {
+        Object.assign(filterA, filterB);
+        return filterA;
+    }
+    else
+        return __assign(__assign({}, filterA), filterB);
+}
+exports.mongoFilterMerger = mongoFilterMerger;
+function mongoPush(field, value, fields) {
+    if (!(0, isset_1.isset)(fields.$push))
+        fields.$push = {};
+    fields.$push[field] = value;
+}
+exports.mongoPush = mongoPush;
+//# sourceMappingURL=mongo-utils.js.map

package/dist/src/mongo-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mongo-utils.js","sourceRoot":"","sources":["../../src/mongo-utils.ts"],"names":[],"mappings":";;;;;;;;;;;;;;AAAA,0CAA0C;AAC1C,cAAc;AACd,0CAA0C;AAC1C,uDAA2C;AAC3C,iCAA+B;AAE/B,2CAA2C;AAC3C,SAAgB,KAAK,CAAC,GAAa;IAAb,oBAAA,EAAA,QAAa;IAC/B,IAAI,CAAC,GAAG;QAAE,OAAM,CAAC,YAAY;IAC7B,IAAI,GAAG,CAAC,GAAG;QAAE,OAAO,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAA;SACjC,IAAI,IAAA,yBAAM,EAAC,GAAG,EAAE,UAAU,CAAC;QAAE,OAAO,GAAG,CAAC,QAAQ,EAAE,CAAA;AAC3D,CAAC;AAJD,sBAIC;AAED;;;;GAIG;AACH,SAAgB,iBAAiB,CAAC,OAAO,EAAE,OAAO,EAAE,eAAuB;;IAAvB,gCAAA,EAAA,uBAAuB;IACvE,IAAI,IAAA,aAAK,EAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAA,aAAK,EAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QAC5C,CAAA,KAAA,OAAO,CAAC,IAAI,CAAA,CAAC,IAAI,WAAI,OAAO,CAAC,IAAI,EAAC;QAClC,OAAO,OAAO,CAAC,IAAI,CAAA;KACtB;IACD,IAAI,IAAA,aAAK,EAAC,OAAO,CAAC,GAAG,CAAC,IAAI,IAAA,aAAK,EAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QAC1C,IAAI,CAAC,IAAA,aAAK,EAAC,OAAO,CAAC,IAAI,CAAC;YAAE,OAAO,CAAC,IAAI,GAAG,EAAE,CAAA;QAC3C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;QAC7D,OAAO,OAAO,CAAC,GAAG,CAAA;KACrB;IACD,IAAI,eAAe,EAAE;QACjB,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAA;QAC/B,OAAO,OAAO,CAAA;KACjB;;QAAM,6BAAY,OAAO,GAAK,OAAO,EAAE;AAC5C,CAAC;AAdD,8CAcC;AAED,SAAgB,SAAS,CAAC,KAAa,EAAE,KAAU,EAAE,MAA4B;IAC7E,IAAI,CAAC,IAAA,aAAK,EAAC,MAAM,CAAC,KAAK,CAAC;QAAE,MAAM,CAAC,KAAK,GAAG,EAAE,CAAA;IAC3C,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;AAC/B,CAAC;AAHD,8BAGC"}

package/dist/src/object-utils.d.ts

@@ -0,0 +1,96 @@
+import { ObjectGeneric } from "./private/types";
+/**
+ *
+ * @param {Object} object main object
+ * @param {String[]} maskedOrSelectedFields array of fields
+ * @param {Boolean} isMask default: true; determine the behavior of the function. If is mask, selected fields will not appear in the resulting object. If it's a select, only selected fields will appear.
+ * @param {Boolean} deleteKeysInsteadOfReturningAnewObject default:false; modify the existing object instead of creating a new instance
+ */
+export declare function simpleObjectMaskOrSelect(object: ObjectGeneric, maskedOrSelectedFields: string[], isMask?: boolean, deleteKeysInsteadOfReturningAnewObject?: boolean): ObjectGeneric;
+/**
+ * check if **object OR array** has property Safely (avoid cannot read property x of null and such)
+ * @param {Object} obj object to test against
+ * @param {string} addr `a.b.c.0.1` will test if myObject has props a that has prop b. Work wit arrays as well (like `arr.0`)
+ */
+export declare function has(obj: ObjectGeneric, addr: string): boolean;
+/** Find address in an object "a.b.c" IN { a : { b : {c : 'blah' }}} RETURNS 'blah'
+ * @param obj
+ * @param addr accept syntax like "obj.subItem.[0].sub2" OR "obj.subItem.0.sub2" OR "obj.subItem[0].sub2"
+ * @returns the last item of the chain OR undefined if not found
+ */
+export declare function findByAddress(obj: ObjectGeneric, addr: string): any | undefined;
+/** Will return all objects matching that path. Eg: user.*.myVar */
+export declare function findByAddressAll(obj: any, addr: any, returnAddresses?: true): Array<[string, any]>;
+export declare function findByAddressAll(obj: any, addr: any, returnAddresses?: false): Array<any>;
+/** Enforce writing subItems. Eg: user.name.blah will ensure all are set until the writing of the last item
+ * NOTE: doesn't work with arrays
+ */
+export declare function objForceWrite(obj: ObjectGeneric, addr: string, item: any): void;
+/** Enforce writing subItems, only if obj.addr is empty.
+ * Eg: user.name.blah will ensure all are set until the writing of the last item
+ * if user.name.blah has a value it will not change it.
+ * NOTE: doesn't work with arrays
+ */
+export declare function objForceWriteIfNotSet(obj: ObjectGeneric, addr: string, item: any): void;
+/** Merge mixins into class. Use it in the constructor like: mergeMixins(this, {myMixin: true}) */
+export declare function mergeMixins(that: any, ...mixins: any[]): void;
+export declare function cloneObject(o: any): any;
+/** Deep clone. WILL REMOVE circular references */
+export declare function deepClone<T>(obj: T, cache?: any[]): T;
+/**
+ * @param {Object} obj the object on which we want to filter the keys
+ * @param {function} filterFunc function that returns true if the key match the wanted criteria
+ */
+export declare function filterKeys(obj: object, filter: any): any;
+/**
+ * @param {Object} obj the object on which we want to delete a property
+ * @param {Array} addr addressArray on which to delete the property
+ */
+export declare function deleteByAddress(obj: object, addr: string[]): void;
+/** Remove all key/values pair if value is undefined  */
+export declare function objFilterUndefined(o: any): any;
+/** Lock all 1st level props of an object to read only */
+export declare function readOnly(o: any): any;
+/** Fields of the object can be created BUT NOT reassignated */
+export declare function reassignForbidden(o: any): any;
+/** All fileds and subFields of the object will become readOnly */
+export declare function readOnlyForAll(object: any): any;
+export declare function objFilterUndefinedRecursive(obj: any): any;
+export declare function sortObjKeyAccordingToValue(unorderedObj: any, ascending?: boolean): {};
+/**
+ * Make default value if object key do not exist
+ * @param {object} obj
+ * @param {string} addr
+ * @param {any} defaultValue
+ * @param {function} callback (obj[addr]) => processValue. Eg: myObjAddr => myObjAddr.push('bikou')
+ * @return obj[addr] eventually processed by the callback
+ */
+export declare function ensureObjectProp(obj: object, addr: string, defaultValue: any, callback?: (o: any) => any): any;
+/** object and array merge
+ * @warn /!\ Array will be merged and duplicate values will be deleted /!\
+ * @return {Object} new object result from merge
+ * NOTE: objects in params will NOT be modified*/
+export declare function mergeDeep(...objects: any[]): any;
+/** object and array merge
+ * @warn /!\ Array will be replaced by the latest object /!\
+ * @return {Object} new object result from merge
+ * NOTE: objects in params will NOT be modified */
+export declare function mergeDeepOverrideArrays(...objects: any[]): any;
+/** object and array merge
+ * @param {Function} replacerForArrays item[key] = (prevValue, currentVal) => () When 2 values are arrays,
+ * @param {Function} replacerForObjects item[key] = (prevValue, currentVal) => () When 2 values are objects,
+ * @param {Function} replacerDefault item[key] = (prevValue, currentVal) => () For all other values
+ * @param  {...Object} objects
+ * @return {Object} new object result from merge
+ * NOTE: objects in params will NOT be modified
+ */
+export declare function mergeDeepConfigurable(replacerForArrays: (prev: any, curr: any) => any, replacerForObjects: any, replacerDefault?: (prev: any, curr: any) => any, ...objects: any[]): any;
+/** { a: {b:2}} => {'a.b':2} useful for translations
+ * NOTE: will remove circular references
+ */
+export declare function flattenObject(data: any, config?: {
+    withoutArraySyntax?: boolean;
+    withArraySyntaxMinified?: boolean;
+}): {};
+/** {'a.b':2} => { a: {b:2}} */
+export declare function unflattenObject(data: any): {};