@rh-support/utils 0.2.16 → 0.2.17

package/lib/cjs/index.d.ts

@@ -22,4 +22,5 @@ export * from './customElementUtils';
 export * from './userUtils';
 export * from './styleUtils';
 export * from './translation-helper';
+export * from './outlier';
 //# sourceMappingURL=index.d.ts.map

package/lib/cjs/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,yBAAyB,CAAC;AACxC,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,iBAAiB,CAAC;AAChC,cAAc,cAAc,CAAC;AAC7B,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,wBAAwB,CAAC;AACvC,cAAc,iBAAiB,CAAC;AAChC,cAAc,iBAAiB,CAAC;AAChC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC;AAC9B,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,cAAc,sBAAsB,CAAC;AACrC,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,sBAAsB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,yBAAyB,CAAC;AACxC,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,iBAAiB,CAAC;AAChC,cAAc,cAAc,CAAC;AAC7B,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,wBAAwB,CAAC;AACvC,cAAc,iBAAiB,CAAC;AAChC,cAAc,iBAAiB,CAAC;AAChC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC;AAC9B,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,cAAc,sBAAsB,CAAC;AACrC,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,sBAAsB,CAAC;AACrC,cAAc,WAAW,CAAC"}

package/lib/cjs/index.js

@@ -34,3 +34,4 @@ __exportStar(require("./customElementUtils"), exports);
 __exportStar(require("./userUtils"), exports);
 __exportStar(require("./styleUtils"), exports);
 __exportStar(require("./translation-helper"), exports);
+__exportStar(require("./outlier"), exports);

package/lib/cjs/outlier.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Outlier Function
+ * Refer: https://www.cuemath.com/outlier-formula/
+ *
+ * An outlier function which takers array of number and find high outlier and low outlier
+ * 1. Taker array of number and sort then in ascending order.
+ * 2. Calculate first(q1) and third(q3) quartile.
+ * 3. Calculate inter-quartile(iqr) range (q3-q1).
+ * 4. Find the upper boundary value by formula q3 + iqr*1.5.
+ * 5. Find the lower boundary value by formula q1 - iqr*1.5
+ *
+ * @param {number[]} numbers
+ * @returns {number[]} upper and lower boundary value
+ */
+export declare const outlier: (array: Array<number>) => Array<number>;
+//# sourceMappingURL=outlier.d.ts.map

package/lib/cjs/outlier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"outlier.d.ts","sourceRoot":"","sources":["../../src/outlier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,eAAO,MAAM,OAAO,UAAW,MAAM,MAAM,CAAC,KAAG,MAAM,MAAM,CAkC1D,CAAC"}

package/lib/cjs/outlier.js

@@ -0,0 +1,48 @@
+"use strict";
+/**
+ * Outlier Function
+ * Refer: https://www.cuemath.com/outlier-formula/
+ *
+ * An outlier function which takers array of number and find high outlier and low outlier
+ * 1. Taker array of number and sort then in ascending order.
+ * 2. Calculate first(q1) and third(q3) quartile.
+ * 3. Calculate inter-quartile(iqr) range (q3-q1).
+ * 4. Find the upper boundary value by formula q3 + iqr*1.5.
+ * 5. Find the lower boundary value by formula q1 - iqr*1.5
+ *
+ * @param {number[]} numbers
+ * @returns {number[]} upper and lower boundary value
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.outlier = void 0;
+var outlier = function (array) {
+    // Take array length
+    var arrayLength = array.length;
+    // Check if length is smaller than four then return array result as it is
+    if (arrayLength < 4) {
+        return array;
+    }
+    var q1, q3, iqr, upperBoundary, lowerBoundary;
+    // Make a copy of array plus sort it in ascending order
+    var sortedArray = array.slice().sort(function (a, b) { return a - b; });
+    // Find the quartiles range
+    // If median is odd adjust the index by minus one
+    if (((arrayLength - 1) / 4) % 1 === 0 || (arrayLength / 4) % 1 === 0) {
+        q1 = (1 / 2) * (sortedArray[Math.floor(arrayLength / 4) - 1] + sortedArray[Math.floor(arrayLength / 4)]);
+        q3 =
+            (1 / 2) *
+                (sortedArray[Math.ceil(arrayLength * (3 / 4)) - 1] + sortedArray[Math.ceil(arrayLength * (3 / 4))]);
+    }
+    else {
+        q1 = sortedArray[Math.floor(arrayLength / 4)];
+        q3 = sortedArray[Math.floor(arrayLength * (3 / 4))];
+    }
+    // Calculate inter-quartile range
+    iqr = q3 - q1;
+    // upper boundary
+    upperBoundary = q3 + iqr * 1.5;
+    // lower boundary
+    lowerBoundary = q1 - iqr * 1.5;
+    return [upperBoundary, lowerBoundary];
+};
+exports.outlier = outlier;

package/lib/esm/index.d.ts

@@ -22,4 +22,5 @@ export * from './customElementUtils';
 export * from './userUtils';
 export * from './styleUtils';
 export * from './translation-helper';
+export * from './outlier';
 //# sourceMappingURL=index.d.ts.map

package/lib/esm/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,yBAAyB,CAAC;AACxC,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,iBAAiB,CAAC;AAChC,cAAc,cAAc,CAAC;AAC7B,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,wBAAwB,CAAC;AACvC,cAAc,iBAAiB,CAAC;AAChC,cAAc,iBAAiB,CAAC;AAChC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC;AAC9B,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,cAAc,sBAAsB,CAAC;AACrC,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,sBAAsB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,yBAAyB,CAAC;AACxC,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,YAAY,CAAC;AAC3B,cAAc,aAAa,CAAC;AAC5B,cAAc,iBAAiB,CAAC;AAChC,cAAc,cAAc,CAAC;AAC7B,cAAc,iBAAiB,CAAC;AAChC,cAAc,oBAAoB,CAAC;AACnC,cAAc,wBAAwB,CAAC;AACvC,cAAc,iBAAiB,CAAC;AAChC,cAAc,iBAAiB,CAAC;AAChC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,uBAAuB,CAAC;AACtC,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC;AAC9B,cAAc,YAAY,CAAC;AAC3B,cAAc,kBAAkB,CAAC;AACjC,cAAc,sBAAsB,CAAC;AACrC,cAAc,aAAa,CAAC;AAC5B,cAAc,cAAc,CAAC;AAC7B,cAAc,sBAAsB,CAAC;AACrC,cAAc,WAAW,CAAC"}

package/lib/esm/index.js

@@ -22,3 +22,4 @@ export * from './customElementUtils';
 export * from './userUtils';
 export * from './styleUtils';
 export * from './translation-helper';
+export * from './outlier';

package/lib/esm/outlier.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Outlier Function
+ * Refer: https://www.cuemath.com/outlier-formula/
+ *
+ * An outlier function which takers array of number and find high outlier and low outlier
+ * 1. Taker array of number and sort then in ascending order.
+ * 2. Calculate first(q1) and third(q3) quartile.
+ * 3. Calculate inter-quartile(iqr) range (q3-q1).
+ * 4. Find the upper boundary value by formula q3 + iqr*1.5.
+ * 5. Find the lower boundary value by formula q1 - iqr*1.5
+ *
+ * @param {number[]} numbers
+ * @returns {number[]} upper and lower boundary value
+ */
+export declare const outlier: (array: Array<number>) => Array<number>;
+//# sourceMappingURL=outlier.d.ts.map

package/lib/esm/outlier.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"outlier.d.ts","sourceRoot":"","sources":["../../src/outlier.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,eAAO,MAAM,OAAO,UAAW,MAAM,MAAM,CAAC,KAAG,MAAM,MAAM,CAkC1D,CAAC"}

package/lib/esm/outlier.js

@@ -0,0 +1,44 @@
+/**
+ * Outlier Function
+ * Refer: https://www.cuemath.com/outlier-formula/
+ *
+ * An outlier function which takers array of number and find high outlier and low outlier
+ * 1. Taker array of number and sort then in ascending order.
+ * 2. Calculate first(q1) and third(q3) quartile.
+ * 3. Calculate inter-quartile(iqr) range (q3-q1).
+ * 4. Find the upper boundary value by formula q3 + iqr*1.5.
+ * 5. Find the lower boundary value by formula q1 - iqr*1.5
+ *
+ * @param {number[]} numbers
+ * @returns {number[]} upper and lower boundary value
+ */
+export const outlier = (array) => {
+    // Take array length
+    const arrayLength = array.length;
+    // Check if length is smaller than four then return array result as it is
+    if (arrayLength < 4) {
+        return array;
+    }
+    let q1, q3, iqr, upperBoundary, lowerBoundary;
+    // Make a copy of array plus sort it in ascending order
+    const sortedArray = array.slice().sort((a, b) => a - b);
+    // Find the quartiles range
+    // If median is odd adjust the index by minus one
+    if (((arrayLength - 1) / 4) % 1 === 0 || (arrayLength / 4) % 1 === 0) {
+        q1 = (1 / 2) * (sortedArray[Math.floor(arrayLength / 4) - 1] + sortedArray[Math.floor(arrayLength / 4)]);
+        q3 =
+            (1 / 2) *
+                (sortedArray[Math.ceil(arrayLength * (3 / 4)) - 1] + sortedArray[Math.ceil(arrayLength * (3 / 4))]);
+    }
+    else {
+        q1 = sortedArray[Math.floor(arrayLength / 4)];
+        q3 = sortedArray[Math.floor(arrayLength * (3 / 4))];
+    }
+    // Calculate inter-quartile range
+    iqr = q3 - q1;
+    // upper boundary
+    upperBoundary = q3 + iqr * 1.5;
+    // lower boundary
+    lowerBoundary = q1 - iqr * 1.5;
+    return [upperBoundary, lowerBoundary];
+};

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@rh-support/utils",
-    "version": "0.2.16",
+    "version": "0.2.17",
     "description": "> TODO: description",
     "author": "Vikas Rathee <vrathee@redhat.com>",
     "license": "ISC",
@@ -87,5 +87,5 @@
         "@types/react-dom": "^17.0.9",
         "moment-timezone": "^0.5.32"
     },
-    "gitHead": "b2165709013e4bfb0d0279915ee378bf8defb414"
+    "gitHead": "2821a4eb373d262b83d3a512900eb68d1fa22d55"
 }