@rh-support/utils 0.2.31 → 0.2.34

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/insightRuleInfoUtils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"insightRuleInfoUtils.d.ts","sourceRoot":"","sources":["../../src/insightRuleInfoUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,yCAAyC,CAAC;AASlE,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,UAM3E;AAOD,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,OAIzE"}
+{"version":3,"file":"insightRuleInfoUtils.d.ts","sourceRoot":"","sources":["../../src/insightRuleInfoUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,yCAAyC,CAAC;AASlE,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,UAI3E;AAED,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,OAIzE"}

package/lib/cjs/insightRuleInfoUtils.js

@@ -14,15 +14,9 @@ doT_1.default.templateSettings = assign_1.default({}, doT_1.default.templateSett
 function getRuleReasonHtml(ruleReason, reportDetails) {
     var resultText = parseDotTemplate(ruleReason, reportDetails);
     var html = ui_toolkit_1.markdownToHTML(resultText);
-    var anchorTagRegex = new RegExp("<a", 'g');
-    var modifiedHtml = html.toString().replace(anchorTagRegex, '<a class="pf-c-button pf-m-link anchor-tag-button"');
-    return modifiedHtml;
+    return html;
 }
 exports.getRuleReasonHtml = getRuleReasonHtml;
-// TODO: Remove modifiedHtml once Accordion Bug is fixed and Replace with below code
-// const resultText = parseDotTemplate(ruleReason, reportDetails);
-// const html = markdownToHTML(resultText);
-// return html as string;
 function parseDotTemplate(dotString, reportDetails) {
     var tempFn = doT_1.default.template(dotString);
     var parsedDotString = tempFn(reportDetails);

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/cjs/productsUtils.d.ts

@@ -4,7 +4,7 @@ export interface ITroubleshootProductResponse {
     otherProducts: Partial<ISEProduct>[];
     productsResult: Partial<ISEProduct>[];
 }
-export declare const handleProductSearchResponse: (productsResultAll: ISEProduct[], productsResultEntitled?: IProductV2[]) => ITroubleshootProductResponse;
+export declare const handleProductSearchResponse: (productsResultAll: ISEProduct[], productsResultEntitled?: IProductV2[], topCount?: number) => ITroubleshootProductResponse;
 /**
  * This method is used for parsing `hydra/rest/products/contact/{userName}` response form API
  * and need to create partial response like method `handleProductSearchResponse`
@@ -13,11 +13,11 @@ export declare const handleProductSearchResponse: (productsResultAll: ISEProduct
  */
 export declare const handleEntitledProductResponse: (productsResultEntitled?: IProductV2[]) => ITroubleshootProductResponse;
 /**
- * Tries to get top 5 products with priority given to recentlyFiledAgainst
+ * Tries to get top products with priority given to recentlyFiledAgainst
  * before checking general top products from un-authed SE API
  * @param products Partial<ISEProduct>
  */
-export declare function getTopProducts(products: Partial<ISEProduct>[]): Partial<ISEProduct>[];
+export declare function getTopProducts(products: Partial<ISEProduct>[], topCount?: number): Partial<ISEProduct>[];
 export declare function isOnlyVersion(versions: string[]): boolean;
 export declare function getVersionIfOnlyVersion(versions: string[]): string;
 export declare function getUniqueSortedVersions(versions: string[]): string[];

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

@@ -1 +1 @@
-{"version":3,"file":"productsUtils.d.ts","sourceRoot":"","sources":["../../src/productsUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,wCAAwC,CAAC;AAWhF,MAAM,WAAW,4BAA4B;IACzC,WAAW,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;IACnC,aAAa,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;IACrC,cAAc,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;CACzC;AAED,eAAO,MAAM,2BAA2B,sBACjB,UAAU,EAAE,2BACP,UAAU,EAAE,KACrC,4BA6BF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,6BAA6B,4BACd,UAAU,EAAE,KACrC,4BAcF,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,yBAO7D;AAED,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,WAE/C;AAED,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,UAEzD;AAED,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,YAEzD;AAED,eAAO,MAAM,aAAa,OAAQ,MAAM,MAAM,MAAM,eAmBnD,CAAC;AAEF,eAAO,MAAM,WAAW,QAAS,MAAM,EAAE,aAExC,CAAC;AAEF,UAAU,sBAAsB;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,sBAAsB,CAkBlE"}
+{"version":3,"file":"productsUtils.d.ts","sourceRoot":"","sources":["../../src/productsUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,wCAAwC,CAAC;AAWhF,MAAM,WAAW,4BAA4B;IACzC,WAAW,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;IACnC,aAAa,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;IACrC,cAAc,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;CACzC;AAED,eAAO,MAAM,2BAA2B,sBACjB,UAAU,EAAE,2BACP,UAAU,EAAE,aAC1B,MAAM,KACjB,4BA4BF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,6BAA6B,4BACd,UAAU,EAAE,KACrC,4BAcF,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,EAAE,QAAQ,SAAI,GAAG,OAAO,CAAC,UAAU,CAAC,EAAE,CAOnG;AAED,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,WAE/C;AAED,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,UAEzD;AAED,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,YAEzD;AAED,eAAO,MAAM,aAAa,OAAQ,MAAM,MAAM,MAAM,eAmBnD,CAAC;AAEF,eAAO,MAAM,WAAW,QAAS,MAAM,EAAE,aAExC,CAAC;AAEF,UAAU,sBAAsB;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,sBAAsB,CAkBlE"}

package/lib/cjs/productsUtils.js

@@ -44,8 +44,9 @@ var orderBy_1 = __importDefault(require("lodash/orderBy"));
 var remove_1 = __importDefault(require("lodash/remove"));
 var uniq_1 = __importDefault(require("lodash/uniq"));
 var validatorUtils_1 = require("./validatorUtils");
-var handleProductSearchResponse = function (productsResultAll, productsResultEntitled) {
+var handleProductSearchResponse = function (productsResultAll, productsResultEntitled, topCount) {
     if (productsResultEntitled === void 0) { productsResultEntitled = []; }
+    if (topCount === void 0) { topCount = 5; }
     var productsResultEntitledMap = {};
     forEach_1.default(productsResultEntitled, function (p) {
         // if (p.supportedForCustomer) { // Needs confirmation froom CCM team before adding
@@ -60,9 +61,8 @@ var handleProductSearchResponse = function (productsResultAll, productsResultEnt
                 ? product.featuredVersion
                 : (_d = product === null || product === void 0 ? void 0 : product.versions[0]) !== null && _d !== void 0 ? _d : '' });
     });
-    // first top 5 products before sorting
     // we get products based on the highest number of support cases
-    var topProducts = getTopProducts(productsResult);
+    var topProducts = getTopProducts(productsResult, topCount);
     var productsResultSorted = orderBy_1.default(productsResult, ['product'], ['asc']);
     return {
         productsResult: productsResultSorted,
@@ -92,17 +92,18 @@ var handleEntitledProductResponse = function (productsResultEntitled) {
 };
 exports.handleEntitledProductResponse = handleEntitledProductResponse;
 /**
- * Tries to get top 5 products with priority given to recentlyFiledAgainst
+ * Tries to get top products with priority given to recentlyFiledAgainst
  * before checking general top products from un-authed SE API
  * @param products Partial<ISEProduct>
  */
-function getTopProducts(products) {
+function getTopProducts(products, topCount) {
+    if (topCount === void 0) { topCount = 5; }
     var toReturn = remove_1.default(__spreadArray([], __read(products)), function (o) { return o.recentlyFiledAgainst; });
-    if (toReturn.length < 5) {
+    if (toReturn.length < topCount) {
         var generalTopProducts = remove_1.default(__spreadArray([], __read(products)), function (o) { return !o.recentlyFiledAgainst && o.isTopProduct; });
         toReturn.push.apply(toReturn, __spreadArray([], __read(generalTopProducts)));
     }
-    return toReturn.slice(0, 5);
+    return toReturn.slice(0, topCount);
 }
 exports.getTopProducts = getTopProducts;
 function isOnlyVersion(versions) {

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/insightRuleInfoUtils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"insightRuleInfoUtils.d.ts","sourceRoot":"","sources":["../../src/insightRuleInfoUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,yCAAyC,CAAC;AASlE,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,UAM3E;AAOD,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,OAIzE"}
+{"version":3,"file":"insightRuleInfoUtils.d.ts","sourceRoot":"","sources":["../../src/insightRuleInfoUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,yCAAyC,CAAC;AASlE,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,UAI3E;AAED,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,OAIzE"}

package/lib/esm/insightRuleInfoUtils.js

@@ -8,14 +8,8 @@ doT.templateSettings = assign({}, doT.templateSettings, {
 export function getRuleReasonHtml(ruleReason, reportDetails) {
     const resultText = parseDotTemplate(ruleReason, reportDetails);
     const html = markdownToHTML(resultText);
-    const anchorTagRegex = new RegExp(`<a`, 'g');
-    const modifiedHtml = html.toString().replace(anchorTagRegex, '<a class="pf-c-button pf-m-link anchor-tag-button"');
-    return modifiedHtml;
+    return html;
 }
-// TODO: Remove modifiedHtml once Accordion Bug is fixed and Replace with below code
-// const resultText = parseDotTemplate(ruleReason, reportDetails);
-// const html = markdownToHTML(resultText);
-// return html as string;
 export function parseDotTemplate(dotString, reportDetails) {
     const tempFn = doT.template(dotString);
     const parsedDotString = tempFn(reportDetails);

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/lib/esm/productsUtils.d.ts

@@ -4,7 +4,7 @@ export interface ITroubleshootProductResponse {
     otherProducts: Partial<ISEProduct>[];
     productsResult: Partial<ISEProduct>[];
 }
-export declare const handleProductSearchResponse: (productsResultAll: ISEProduct[], productsResultEntitled?: IProductV2[]) => ITroubleshootProductResponse;
+export declare const handleProductSearchResponse: (productsResultAll: ISEProduct[], productsResultEntitled?: IProductV2[], topCount?: number) => ITroubleshootProductResponse;
 /**
  * This method is used for parsing `hydra/rest/products/contact/{userName}` response form API
  * and need to create partial response like method `handleProductSearchResponse`
@@ -13,11 +13,11 @@ export declare const handleProductSearchResponse: (productsResultAll: ISEProduct
  */
 export declare const handleEntitledProductResponse: (productsResultEntitled?: IProductV2[]) => ITroubleshootProductResponse;
 /**
- * Tries to get top 5 products with priority given to recentlyFiledAgainst
+ * Tries to get top products with priority given to recentlyFiledAgainst
  * before checking general top products from un-authed SE API
  * @param products Partial<ISEProduct>
  */
-export declare function getTopProducts(products: Partial<ISEProduct>[]): Partial<ISEProduct>[];
+export declare function getTopProducts(products: Partial<ISEProduct>[], topCount?: number): Partial<ISEProduct>[];
 export declare function isOnlyVersion(versions: string[]): boolean;
 export declare function getVersionIfOnlyVersion(versions: string[]): string;
 export declare function getUniqueSortedVersions(versions: string[]): string[];

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

@@ -1 +1 @@
-{"version":3,"file":"productsUtils.d.ts","sourceRoot":"","sources":["../../src/productsUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,wCAAwC,CAAC;AAWhF,MAAM,WAAW,4BAA4B;IACzC,WAAW,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;IACnC,aAAa,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;IACrC,cAAc,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;CACzC;AAED,eAAO,MAAM,2BAA2B,sBACjB,UAAU,EAAE,2BACP,UAAU,EAAE,KACrC,4BA6BF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,6BAA6B,4BACd,UAAU,EAAE,KACrC,4BAcF,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,yBAO7D;AAED,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,WAE/C;AAED,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,UAEzD;AAED,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,YAEzD;AAED,eAAO,MAAM,aAAa,OAAQ,MAAM,MAAM,MAAM,eAmBnD,CAAC;AAEF,eAAO,MAAM,WAAW,QAAS,MAAM,EAAE,aAExC,CAAC;AAEF,UAAU,sBAAsB;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,sBAAsB,CAkBlE"}
+{"version":3,"file":"productsUtils.d.ts","sourceRoot":"","sources":["../../src/productsUtils.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,wCAAwC,CAAC;AAWhF,MAAM,WAAW,4BAA4B;IACzC,WAAW,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;IACnC,aAAa,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;IACrC,cAAc,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;CACzC;AAED,eAAO,MAAM,2BAA2B,sBACjB,UAAU,EAAE,2BACP,UAAU,EAAE,aAC1B,MAAM,KACjB,4BA4BF,CAAC;AAEF;;;;;GAKG;AACH,eAAO,MAAM,6BAA6B,4BACd,UAAU,EAAE,KACrC,4BAcF,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,EAAE,QAAQ,SAAI,GAAG,OAAO,CAAC,UAAU,CAAC,EAAE,CAOnG;AAED,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,WAE/C;AAED,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,UAEzD;AAED,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,YAEzD;AAED,eAAO,MAAM,aAAa,OAAQ,MAAM,MAAM,MAAM,eAmBnD,CAAC;AAEF,eAAO,MAAM,WAAW,QAAS,MAAM,EAAE,aAExC,CAAC;AAEF,UAAU,sBAAsB;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,wBAAgB,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,sBAAsB,CAkBlE"}

package/lib/esm/productsUtils.js

@@ -6,7 +6,7 @@ import orderBy from 'lodash/orderBy';
 import filter from 'lodash/remove';
 import uniq from 'lodash/uniq';
 import { isNumber } from './validatorUtils';
-export const handleProductSearchResponse = (productsResultAll, productsResultEntitled = []) => {
+export const handleProductSearchResponse = (productsResultAll, productsResultEntitled = [], topCount = 5) => {
     const productsResultEntitledMap = {};
     forEach(productsResultEntitled, (p) => {
         // if (p.supportedForCustomer) { // Needs confirmation froom CCM team before adding
@@ -21,9 +21,8 @@ export const handleProductSearchResponse = (productsResultAll, productsResultEnt
                 ? product.featuredVersion
                 : (_d = product === null || product === void 0 ? void 0 : product.versions[0]) !== null && _d !== void 0 ? _d : '' });
     });
-    // first top 5 products before sorting
     // we get products based on the highest number of support cases
-    const topProducts = getTopProducts(productsResult);
+    const topProducts = getTopProducts(productsResult, topCount);
     const productsResultSorted = orderBy(productsResult, ['product'], ['asc']);
     return {
         productsResult: productsResultSorted,
@@ -50,17 +49,17 @@ export const handleEntitledProductResponse = (productsResultEntitled = []) => {
     };
 };
 /**
- * Tries to get top 5 products with priority given to recentlyFiledAgainst
+ * Tries to get top products with priority given to recentlyFiledAgainst
  * before checking general top products from un-authed SE API
  * @param products Partial<ISEProduct>
  */
-export function getTopProducts(products) {
+export function getTopProducts(products, topCount = 5) {
     const toReturn = filter([...products], (o) => o.recentlyFiledAgainst);
-    if (toReturn.length < 5) {
+    if (toReturn.length < topCount) {
         const generalTopProducts = filter([...products], (o) => !o.recentlyFiledAgainst && o.isTopProduct);
         toReturn.push(...generalTopProducts);
     }
-    return toReturn.slice(0, 5);
+    return toReturn.slice(0, topCount);
 }
 export function isOnlyVersion(versions) {
     return (versions === null || versions === void 0 ? void 0 : versions.length) && versions.length === 1;

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "@rh-support/utils",
-    "version": "0.2.31",
+    "version": "0.2.34",
     "description": "> TODO: description",
     "author": "Vikas Rathee <vrathee@redhat.com>",
     "license": "ISC",
@@ -45,7 +45,7 @@
         "prepublishOnly": "npm run build"
     },
     "peerDependencies": {
-        "@cee-eng/hydrajs": "4.7.20",
+        "@cee-eng/hydrajs": "4.7.22",
         "@cee-eng/ui-toolkit": "1.1.6",
         "@rh-support/api": "0.3.9",
         "@rh-support/types": "0.2.0",
@@ -61,9 +61,9 @@
         "solr-query-builder": "1.0.1"
     },
     "dependencies": {
-        "@cee-eng/hydrajs": "4.7.20",
+        "@cee-eng/hydrajs": "4.7.22",
         "@cee-eng/ui-toolkit": "1.1.6",
-        "@rh-support/api": "0.3.10",
+        "@rh-support/api": "0.3.13",
         "@rh-support/types": "0.2.0",
         "dompurify": "^2.2.6",
         "dot": "^1.1.3",
@@ -87,5 +87,5 @@
         "@types/react-dom": "^17.0.9",
         "moment-timezone": "^0.5.32"
     },
-    "gitHead": "274324da926ca7deeaeba9fe702cacd0129941a1"
+    "gitHead": "68dba2e1af032b0f24ddb0fac3d2ad3273b5364f"
 }