fix(sonarlint): code smells and security reviews (#303)

Endava · Jul 3, 2023 · 7862ba6 · 7862ba6
1 parent 00fd221
commit 7862ba6
Show file tree

Hide file tree

Showing 4 changed files with 10 additions and 11 deletions.
diff --git a/packages/bee-q/src/components/notification/_storybook/bq-notification.stories.tsx b/packages/bee-q/src/components/notification/_storybook/bq-notification.stories.tsx
@@ -3,6 +3,7 @@ import { html } from 'lit-html';
 
 import mdx from './bq-notification.mdx';
 
+import { getRandomFromArray } from '../../../shared/utils';
 import { NOTIFICATION_TYPE } from '../bq-notification.types';
 
 const meta: Meta = {
@@ -132,9 +133,7 @@ export const Warning: Story = {
 export const Stacked: Story = {
   render: (args: Args) => {
     const onButtonClick = () => {
-      const getRandom = (arr: string[]) => arr[Math.floor(Math.random() * arr.length)];
-      const type = getRandom(NOTIFICATION_TYPE as unknown as string[]);
-
+      const [type] = getRandomFromArray(NOTIFICATION_TYPE as unknown as string[], 1);
       const notification = Object.assign(document.createElement('bq-notification'), {
         type,
         autoDismiss: args['auto-dismiss'],

diff --git a/packages/bee-q/src/shared/test-utils/computedStyle.ts b/packages/bee-q/src/shared/test-utils/computedStyle.ts
@@ -21,7 +21,7 @@ export const computedStyle = <T extends keyof CSSStyleDeclaration>(
         throw new Error(`Could not find element ${lightDomSelector}`);
       }
 
-      if (!!shadowDomSelector) {
+      if (shadowDomSelector) {
         element = element.shadowRoot.querySelector(shadowDomSelector);
 
         if (!element) {

diff --git a/packages/bee-q/src/shared/utils/getRandom.ts b/packages/bee-q/src/shared/utils/getRandom.ts
@@ -5,17 +5,17 @@
  * @param {Number} n - The number of random items to take
  * @returns {Array} An array with the number of random items specified
  */
-export const getRandomFromArray = (arr: Array<unknown>, n: number): Array<unknown> => {
-  let len = arr.length;
+export const getRandomFromArray = <T>(arr: T[], n: number): T[] => {
+  let length = arr.length;
   const result = new Array(n);
-  const taken = new Array(len);
+  const taken = new Array(length);
 
-  if (n > len) throw new RangeError('getRandom: more elements taken than available');
+  if (n > length) throw new RangeError('getRandom: more elements taken than available');
 
   while (n--) {
-    const x = Math.floor(Math.random() * len);
+    const x = Date.now() % length;
     result[n] = arr[x in taken ? taken[x] : x];
-    taken[x] = --len in taken ? taken[len] : len;
+    taken[x] = --length in taken ? taken[length] : length;
   }
   return result;
 };
diff --git a/sonar-project.properties b/sonar-project.properties
@@ -1,7 +1,7 @@
 sonar.organization=endava
 sonar.projectKey=Endava_bee-q
 
-sonar.cpd.exclusions=packages/bee-q/src/components/*.tsx
+sonar.cpd.exclusions=packages/bee-q/src/components/*.ts,packages/bee-q/src/components/*.tsx
 sonar.test.inclusions=**/*.spec.*
 sonar.testExecutionReportPaths=packages/bee-q/test-report.xml
 sonar.javascript.lcov.reportPaths=packages/bee-q/coverage/lcov.info