@codecademy/brand 3.26.0-alpha.9d629b471a.0 → 3.26.0-alpha.c0e3f304ed.0

package/dist/AppHeader/Search/hooks/useSearchTracking.js

@@ -1,46 +0,0 @@
-import { useEffect, useRef } from 'react';
-import { useSearchTrackingContext } from '../SearchTrackingProvider';
-import { isSimilarSetOfStrings } from '../../utils/string-similarity';
-import { usePrevious } from 'react-use';
-export const useSearchTracking = ({
-  onSearchAsYouType
-}) => {
-  const {
-    onSearchAsYouTypeParams
-  } = useSearchTrackingContext();
-
-  // store the previous search event params
-  const prevSearchEventParams = usePrevious(onSearchAsYouTypeParams);
-  const lastTrackedQueryRef = useRef('');
-  useEffect(() => {
-    // skip search tracking entirely if tracking function is not provided
-    if (!onSearchAsYouType) {
-      return;
-    }
-
-    // skip empty queries
-    if (onSearchAsYouTypeParams?.query.length === 0) {
-      return;
-    }
-    let searchEventDelay;
-
-    // scenario 1: track when user's search has no results
-    if (onSearchAsYouTypeParams?.resultsCount === 0) {
-      searchEventDelay = setTimeout(() => {
-        onSearchAsYouType(onSearchAsYouTypeParams.query, onSearchAsYouTypeParams.searchId, 0, onSearchAsYouTypeParams.queryLoadTime);
-        lastTrackedQueryRef.current = onSearchAsYouTypeParams.query;
-      }, 1000);
-    }
-
-    // scenario 2: track when user's search has meaningful edits
-    if (prevSearchEventParams && onSearchAsYouTypeParams?.query !== prevSearchEventParams.query && prevSearchEventParams.query !== '' && prevSearchEventParams.resultsCount > 0 && prevSearchEventParams.query !== lastTrackedQueryRef.current && !isSimilarSetOfStrings(onSearchAsYouTypeParams?.query ?? '', prevSearchEventParams.query)) {
-      searchEventDelay = setTimeout(() => {
-        onSearchAsYouType(prevSearchEventParams.query, prevSearchEventParams.searchId, prevSearchEventParams.resultsCount, prevSearchEventParams.queryLoadTime);
-        lastTrackedQueryRef.current = prevSearchEventParams.query;
-      }, 1500);
-    }
-    return () => {
-      clearTimeout(searchEventDelay);
-    };
-  }, [onSearchAsYouType, onSearchAsYouTypeParams, prevSearchEventParams]);
-};

package/dist/AppHeader/utils/string-similarity.d.ts

@@ -1,17 +0,0 @@
-/**
- * Determines whether two sets of words are similar based on the Jaccard index and
- * a specified similarity threshold.
- *
- * @param a - A set of strings to compare against the second set of strings.
- * @param b - A set of strings to compare against the first set of strings.
- * @param threshold - A float between 0 and 1, where 1 means the strings are
- * identical and 0 means the strings are completely different.
- *
- * The threshold is used to determine if the strings are similar.
- * By default, if the threshold is 0.8, then the strings are considered similar
- * if at least 80% of the words in the first set of strings are also in the
- * second set of strings.
- *
- * @returns - It returns true if the strings are similar, false otherwise.
- */
-export declare const isSimilarSetOfStrings: (a: string, b: string, threshold?: number) => boolean;

package/dist/AppHeader/utils/string-similarity.js

@@ -1,30 +0,0 @@
-const transformSanitizedStringToArray = s => s.trim().toLowerCase().split(/\s+/);
-
-/**
- * Determines whether two sets of words are similar based on the Jaccard index and
- * a specified similarity threshold.
- *
- * @param a - A set of strings to compare against the second set of strings.
- * @param b - A set of strings to compare against the first set of strings.
- * @param threshold - A float between 0 and 1, where 1 means the strings are
- * identical and 0 means the strings are completely different.
- *
- * The threshold is used to determine if the strings are similar.
- * By default, if the threshold is 0.8, then the strings are considered similar
- * if at least 80% of the words in the first set of strings are also in the
- * second set of strings.
- *
- * @returns - It returns true if the strings are similar, false otherwise.
- */
-export const isSimilarSetOfStrings = (a, b, threshold = 0.8) => {
-  const setA = Array.from(new Set(transformSanitizedStringToArray(a)));
-  const setB = Array.from(new Set(transformSanitizedStringToArray(b)));
-
-  // manually calculating intersection and union to support older browsers that may not have
-  // the Set.intersection and Set.union methods
-  const intersection = new Set([...setA].filter(s => setB.includes(s)));
-  const union = new Set([...setA, ...setB]);
-
-  // the Jaccard similarity is the ratio between the intersection and union of the two sets of words
-  return threshold <= intersection.size / union.size;
-};