@codecademy/brand 4.0.0 → 5.0.0-alpha.19accb830.0

package/dist/AppHeader/Search/SearchWorker/src.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"src.cjs","names":["getPortalOrigin","origin","window","location","envs","some","s","includes","replace","serializeSearchWorkerSrc","BASE_URL","fnAsStr","worker","toString","trim","slice","indexOf","replaceAll","search","preloadTitlesPromise","fetch","then","f","json","rawTitles","map","preparseTitle","value","popularity","lower","toLowerCase","words","getWordSet","title","preparseQuery","query","wordSplitters","str","split","w","filter","Boolean","Set","handlers","autocomplete","autocompleteHandler","searchAsYouTypeHandler","onmessage","data","action","handler","getScoredTitle","q","t","charScores","getCharScores","score","getTotalScore","maxResults","titles","scoredTitles","topAutocompleteTitles","x","sort","a","b","segments","getHighlightSegments","postMessage","result","body","JSON","stringify","max","method","searchAsYouTypeResults","i","top","length","entry","key","popularityStrength","fromChars","fromPopularity","bonus","forEach","qw","has","startsWith","Math","abs","currentSegment","shouldHighlight","isDifferentFromPrev","highlight","push","cmcsForTitleChars","Array","fill","shift","cmc","startOverlap","endOverlap","min","avgQueryWordLength","size","minMatchLength","ceil","cmcs","j"],"sources":["../../../../src/AppHeader/Search/SearchWorker/src.ts"],"sourcesContent":["/*\n * A web worker to handle search-as-you-type and autocomplete\n *\n * This worker implements an algorithm for text matching that tests\n * a query string against a set of titles, and gives a score to\n * each character in a given title.\n *\n * e.g. matching query \"abcde\" to title \"ab cde\"\n * \"a\" and \"b\" each get a score of 2, because each is part of the match \"ab\"\n * \"c\", \"d\", and \"e\" each get a score of 3, because each is part of the match \"cde\"\n *\n * For autocomplete, a large list of titles is preloaded, and this\n * scoring algorithm is used both to find the top 5 matches, and to\n * determine which characters should be highlighted.\n * (These titles have certain phrases like \"Intro to\" removed so that they\n * better resemble something that a user would type.)\n *\n * For search-as-you-type, we rely on typesense to find matches,\n * but we still use this algorithm for character highlighting.\n */\n\nimport {\n  AutocompleteSuggestion,\n  HighlightSegment,\n  SearchAsYouTypeResults,\n} from './types';\n\nfunction getPortalOrigin() {\n  const { origin } = window.location;\n  const envs = ['tengu', 'tayra', 'staging', 'www'];\n\n  // for standard envs, use portal app in the same env\n  if (envs.some((s) => `https://${s}.codecademy.com` === origin)) return origin;\n\n  // for PR envs (e.g. pr-40229-monolith.dev-eks.codecademy.com)\n  if (origin.includes('.dev-eks.codecademy.com')) return origin;\n\n  // for local, use local portal-app, replace if origin port is monolith or le\n  if (origin.includes('localhost')) return origin.replace(/:\\d{4}/, ':3100');\n\n  // otherwise (e.g. in monolith pr env) use staging portal-app\n  return 'https://staging.codecademy.com';\n}\n\nexport function serializeSearchWorkerSrc() {\n  const BASE_URL = `${getPortalOrigin()}/api/portal/search`;\n  const fnAsStr = worker.toString().trim();\n\n  // in a prod build, webpack will handle removing comments\n\n  return fnAsStr\n    .slice(fnAsStr.indexOf('{') + 1, -1) // remove wrapping function, which may have been renamed by minification\n    .replaceAll('  ', '') // remove indentation\n    .replaceAll('{BASE_URL}', BASE_URL) // interpolate base url\n    .replaceAll('{SEARCH}', window.location.search); // interpolate search query\n}\n\n/*\n * This function contains the code that is serialized to run in the worker. It\n * can't reference anything outside of itself (except types). Data is passed to\n * the worker via onmessage and passed back to the main thread via postMessage.\n */\nfunction worker() {\n  type RawTitle = {\n    value: string;\n    popularity: number;\n  };\n  type PreparsedTitle = {\n    title: string;\n    lower: string;\n    words: Set<string>;\n    popularity: number;\n  };\n  type PreparsedQuery = {\n    query: string;\n    words: Set<string>;\n  };\n  type ScoredTitle = {\n    title: string;\n    charScores: number[];\n    score: number;\n  };\n  type ConsecutiveMatchingChars = { value: string };\n\n  const preloadTitlesPromise = fetch('{BASE_URL}/autocomplete-preload{SEARCH}')\n    .then((f) => f.json())\n    .then((rawTitles) => rawTitles.map(preparseTitle));\n\n  function preparseTitle({ value, popularity }: RawTitle): PreparsedTitle {\n    const lower = value.toLowerCase();\n    const words = getWordSet(lower);\n    return { title: value, lower, words, popularity };\n  }\n\n  function preparseQuery(query: string): PreparsedQuery {\n    const words = getWordSet(query);\n    return { query, words };\n  }\n\n  const wordSplitters = /[ :-]/g;\n\n  function getWordSet(str: string) {\n    const words = str\n      .split(wordSplitters)\n      .map((w) => w.trim())\n      .filter(Boolean);\n    return new Set(words);\n  }\n\n  const handlers: { [action: string]: (q: PreparsedQuery) => void } = {\n    autocomplete: autocompleteHandler,\n    'search-as-you-type': searchAsYouTypeHandler,\n  };\n\n  onmessage = ({ data }: MessageEvent<{ action: string; query: string }>) => {\n    const { query, action } = data;\n    const handler = handlers[action];\n    if (handler) {\n      handler(preparseQuery(query));\n    }\n  };\n\n  function getScoredTitle(q: PreparsedQuery, t: PreparsedTitle): ScoredTitle {\n    const charScores = getCharScores(q, t);\n    const score = getTotalScore(q, t, charScores);\n    return { title: t.title, charScores, score };\n  }\n\n  const maxResults = 5;\n\n  function autocompleteHandler(q: PreparsedQuery) {\n    preloadTitlesPromise.then((titles: PreparsedTitle[]) => {\n      const scoredTitles = titles.map((t: PreparsedTitle) =>\n        getScoredTitle(q, t)\n      );\n\n      const topAutocompleteTitles: AutocompleteSuggestion[] = scoredTitles\n        .filter((x: ScoredTitle) => x.score > 0)\n        .sort((a: ScoredTitle, b: ScoredTitle) => (a.score > b.score ? -1 : 1))\n        .slice(0, maxResults)\n        .map((t: ScoredTitle) => ({\n          title: t.title,\n          segments: getHighlightSegments(t.title, t.charScores),\n        }));\n\n      postMessage({\n        query: q.query,\n        result: topAutocompleteTitles,\n        action: 'autocomplete',\n      });\n    });\n  }\n\n  function searchAsYouTypeHandler(q: PreparsedQuery) {\n    fetch('{BASE_URL}/search-as-you-type{SEARCH}', {\n      body: JSON.stringify({ query: q.query, max: maxResults }),\n      method: 'POST',\n    })\n      .then((f) => f.json())\n      .then((searchAsYouTypeResults: SearchAsYouTypeResults) => {\n        for (let i = 0; i < searchAsYouTypeResults.top.length; i++) {\n          const entry = searchAsYouTypeResults.top[i];\n          const t = preparseTitle({ value: entry.title, popularity: 0 });\n          const charScores = getCharScores(q, t);\n          entry.segments = getHighlightSegments(entry.title, charScores);\n          entry.key = q.query + ':' + entry.title;\n        }\n        postMessage({\n          query: q.query,\n          result: searchAsYouTypeResults,\n          action: 'search-as-you-type',\n        });\n      });\n  }\n\n  /*\n   * For the search \"alge\", .04 is just low enough so that \"Linear algebra\"\n   * (which matches on 4 letters) comes in above \"Data structures and algorithms\"\n   * (which only matches on 3 letters, but has a high popularity score).\n   */\n  const popularityStrength = 0.04;\n\n  // Total used in sorting to find autocomplet top 5\n  // Bonus scores are includes in certain cases\n  function getTotalScore(\n    q: PreparsedQuery,\n    t: PreparsedTitle,\n    charScores: number[]\n  ) {\n    let fromChars = 0;\n    for (let i = 0; i < charScores.length; i++) {\n      fromChars += charScores[i];\n    }\n\n    const fromPopularity = (t.popularity || 0) * popularityStrength;\n\n    let bonus = 0;\n    // for each complete word present in both the title and query\n    q.words.forEach((qw) => {\n      if (t.words.has(qw)) {\n        bonus += 100;\n      }\n    });\n\n    // if the title starts with the query\n    if (t.lower.startsWith(q.query)) {\n      bonus += 200;\n    } else if (t.lower.startsWith(q.query.slice(0, 3))) {\n      // or at least the first 3 chars\n      bonus += 100;\n    }\n\n    // if the title is an exact match with the query\n    if (t.lower === q.query) {\n      bonus += 100;\n    }\n\n    // if there are some matching chars and the title is within 3 chars length of the query\n    if (fromChars > 1 && Math.abs(t.lower.length - q.query.length) <= 3) {\n      bonus += 100;\n    }\n\n    return fromChars + (fromChars > 1 ? fromPopularity : 0) + bonus;\n  }\n\n  // returns { value: string, highlight: boolean }[]\n  function getHighlightSegments(title: string, charScores: number[]) {\n    let currentSegment: HighlightSegment | null = null;\n    const segments: HighlightSegment[] = [];\n\n    const shouldHighlight = (i: number) => charScores[i] > 0;\n\n    const isDifferentFromPrev = (i: number) =>\n      shouldHighlight(i - 1) !== shouldHighlight(i);\n\n    for (let i = 0; i < title.length; i++) {\n      if (i === 0 || isDifferentFromPrev(i)) {\n        // If this char should be highlighted, but the prev one should not\n        // or vice versa, start a new segment.\n        currentSegment = { value: '', highlight: shouldHighlight(i) };\n        segments.push(currentSegment);\n      }\n      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      currentSegment!.value += title[i];\n    }\n    return segments;\n  }\n\n  // Used by autocomplete, both for finding top 5, and for highlighting\n  // Used by search-as-you-type, only for highlighting\n  // Returns number[], where each number is the match score for a char in the title\n  function getCharScores(q: PreparsedQuery, t: PreparsedTitle) {\n    /*\n     * Prefill the array for each char in the title.\n     * For each char, we keep an array of the consecutive matches the char is a part of.\n     */\n    const cmcsForTitleChars = Array(t.lower.length)\n      .fill(0)\n      .map(() => []) as ConsecutiveMatchingChars[][];\n\n    /*\n     * Overlay the query onto the title to see which chars match.\n     * Shift to align at different positions.\n     * e.g.\n     *   shift: 0\n     *   query: python3 learn\n     *   title: learn python 3\n     *   (no matches)\n     *\n     *   shift: 6\n     *   query:       python3 learn\n     *   title: learn python 3\n     *   (the word \"python\" matches)\n     *\n     *   shift: 7\n     *   query:        python3 learn\n     *   title: learn python 3\n     *   (\"3\" matches)\n     *\n     *   shift: -8\n     *   query: python3 learn\n     *   title:         learn python 3\n     *   (\"learn\" matches)\n     */\n    for (let shift = 1 - q.query.length; shift < t.lower.length; shift++) {\n      // for each shift position\n\n      let cmc: ConsecutiveMatchingChars | null = null;\n      const startOverlap = Math.max(shift, 0);\n      const endOverlap = Math.min(q.query.length + shift, t.lower.length);\n\n      // i is the index of a char in the title\n      for (let i = startOverlap; i < endOverlap; i++) {\n        // for each char position in the potentially overlapping area\n\n        // if char at this position matches (and isn't a space)\n        if (q.query[i - shift] === t.lower[i] && t.lower[i] !== ' ') {\n          if (!cmc) {\n            // start a new cmc if needed\n            cmc = { value: '' };\n          }\n\n          /*\n           * Append this char to the current cmc.\n           * We use an object with {value} so that we can modify by reference,\n           * since we want to modify the cmc, not only for this char, but also\n           * for any previous chars that this cmc was pushed to, since those\n           * chars are part of this same consecutive match.\n           */\n          cmc.value += q.query[i - shift];\n\n          // include this cmc for this char\n          cmcsForTitleChars[i].push(cmc);\n        } else if (cmc) {\n          // set to null so that the next match starts a new cmc\n          cmc = null;\n        }\n      }\n    }\n\n    const avgQueryWordLength = q.query.length / q.words.size;\n\n    // If avgQueryWordLength is 1-3, we want to the min match to be about that same size.\n    // If avgQueryWordLength is longer, we want min match to be longer...but not too long.\n    // e.g. For avgQueryWordLength of 9, min should be 5\n    // The misspelling \"regresion\" should still match \"regression\", but not \"encryption\",\n    // \"authentication\" or other words ending in \"ion\"\n    const minMatchLength = Math.ceil(avgQueryWordLength ** 0.65);\n\n    const charScores: number[] = [];\n    for (let i = 0; i < cmcsForTitleChars.length; i++) {\n      const cmcs = cmcsForTitleChars[i];\n      let score = 0;\n      for (let j = 0; j < cmcs.length; j++) {\n        const cmc = cmcs[j];\n        // if the string of consecutive matching chars meets the minMatchLength\n        // or if it's a standalone word in the query (e.g \"C\")\n        if (cmc.value.length >= minMatchLength || q.words.has(cmc.value)) {\n          score += cmc.value.length;\n        }\n      }\n      charScores.push(score);\n    }\n    return charScores;\n  }\n}\n"],"mappings":";;AA2BA,SAASA,kBAAAA;CACP,MAAM,EAAEC,WAAWC,OAAOC;AAI1B,KAHa;EAAC;EAAS;EAAS;EAAW;EAAM,CAGxCE,MAAMC,MAAM,WAAWA,EAAE,qBAAqBL,OAAAA,CAAS,QAAOA;AAGvE,KAAIA,OAAOM,SAAS,0BAAA,CAA4B,QAAON;AAGvD,KAAIA,OAAOM,SAAS,YAAA,CAAc,QAAON,OAAOO,QAAQ,UAAU,QAAA;AAGlE,QAAO;;AAGT,SAAgBC,2BAAAA;CACd,MAAMC,WAAW,GAAGV,iBAAAA,CAAkB;CACtC,MAAMW,UAAUC,OAAOC,UAAQ,CAAGC,MAAI;AAItC,QAAOH,QACJI,MAAMJ,QAAQK,QAAQ,IAAA,GAAO,GAAG,GAAC,CACjCC,WAAW,MAAM,GAAA,CACjBA,WAAW,cAAcP,SAAAA,CACzBO,WAAW,YAAYf,OAAOC,SAASe,OAAM;;AAQlD,SAASN,SAAAA;CAsBP,MAAMO,uBAAuBC,MAAM,0CAAA,CAChCC,MAAMC,MAAMA,EAAEC,MAAI,CAAA,CAClBF,MAAMG,cAAcA,UAAUC,IAAIC,cAAAA,CAAAA;CAErC,SAASA,cAAc,EAAEC,OAAOC,cAAsB;EACpD,MAAMC,QAAQF,MAAMG,aAAW;AAE/B,SAAO;GAAEG,OAAON;GAAOE;GAAOE,OADhBC,WAAWH,MAAAA;GACYD;GAAW;;CAGlD,SAASM,cAAcC,OAAa;AAElC,SAAO;GAAEA;GAAOJ,OADFC,WAAWG,MAAAA;GACH;;CAGxB,MAAMC,gBAAgB;CAEtB,SAASJ,WAAWK,KAAW;EAC7B,MAAMN,QAAQM,IACXC,MAAMF,cAAAA,CACNX,KAAKc,MAAMA,EAAEzB,MAAI,CAAA,CACjB0B,OAAOC,QAAAA;AACV,SAAO,IAAIC,IAAIX,MAAAA;;CAGjB,MAAMY,WAA8D;EAClEC,cAAcC;EACd,sBAAsBC;EACxB;AAEAC,cAAa,EAAEC,WAAuD;EACpE,MAAM,EAAEb,OAAOc,WAAWD;EAC1B,MAAME,UAAUP,SAASM;AACzB,MAAIC,QACFA,SAAQhB,cAAcC,MAAAA,CAAAA;;CAI1B,SAASgB,eAAeC,GAAmBC,GAAiB;EAC1D,MAAMC,aAAaC,cAAcH,GAAGC,EAAAA;EACpC,MAAMG,QAAQC,cAAcL,GAAGC,GAAGC,WAAAA;AAClC,SAAO;GAAErB,OAAOoB,EAAEpB;GAAOqB;GAAYE;GAAM;;CAG7C,MAAME,aAAa;CAEnB,SAASb,oBAAoBO,GAAiB;AAC5CjC,uBAAqBE,MAAMsC,WAAAA;GAKzB,MAAME,wBAJeF,OAAOlC,KAAK4B,MAC/BF,eAAeC,GAAGC,EAAAA,CAAAA,CAIjBb,QAAQsB,MAAmBA,EAAEN,QAAQ,EAAA,CACrCO,MAAMC,GAAgBC,MAAoBD,EAAER,QAAQS,EAAET,QAAQ,KAAK,EAAA,CACnEzC,MAAM,GAAG2C,WAAAA,CACTjC,KAAK4B,OAAoB;IACxBpB,OAAOoB,EAAEpB;IACTiC,UAAUC,qBAAqBd,EAAEpB,OAAOoB,EAAEC,WAAU;IACtD,EAAA;AAEFc,eAAY;IACVjC,OAAOiB,EAAEjB;IACTkC,QAAQR;IACRZ,QAAQ;IACV,CAAA;IACF;;CAGF,SAASH,uBAAuBM,GAAiB;AAC/ChC,QAAM,yCAAyC;GAC7CkD,MAAMC,KAAKC,UAAU;IAAErC,OAAOiB,EAAEjB;IAAOsC,KAAKf;IAAW,CAAA;GACvDgB,QAAQ;GACV,CAAA,CACGrD,MAAMC,MAAMA,EAAEC,MAAI,CAAA,CAClBF,MAAMsD,2BAAAA;AACL,QAAK,IAAIC,IAAI,GAAGA,IAAID,uBAAuBE,IAAIC,QAAQF,KAAK;IAC1D,MAAMG,QAAQJ,uBAAuBE,IAAID;IAEzC,MAAMtB,aAAaC,cAAcH,GADvB1B,cAAc;KAAEC,OAAOoD,MAAM9C;KAAOL,YAAY;KAAE,CAAA,CACxByB;AACpC0B,UAAMb,WAAWC,qBAAqBY,MAAM9C,OAAOqB,WAAAA;AACnDyB,UAAMC,MAAM5B,EAAEjB,QAAQ,MAAM4C,MAAM9C;;AAEpCmC,eAAY;IACVjC,OAAOiB,EAAEjB;IACTkC,QAAQM;IACR1B,QAAQ;IACV,CAAA;IACF;;CAQJ,MAAMgC,qBAAqB;CAI3B,SAASxB,cACPL,GACAC,GACAC,YAAoB;EAEpB,IAAI4B,YAAY;AAChB,OAAK,IAAIN,IAAI,GAAGA,IAAItB,WAAWwB,QAAQF,IACrCM,cAAa5B,WAAWsB;EAG1B,MAAMO,kBAAkB9B,EAAEzB,cAAc,KAAKqD;EAE7C,IAAIG,QAAQ;AAEZhC,IAAErB,MAAMsD,SAASC,OAAAA;AACf,OAAIjC,EAAEtB,MAAMwD,IAAID,GAAAA,CACdF,UAAS;IAEb;AAGA,MAAI/B,EAAExB,MAAM2D,WAAWpC,EAAEjB,MAAK,CAC5BiD,UAAS;WACA/B,EAAExB,MAAM2D,WAAWpC,EAAEjB,MAAMpB,MAAM,GAAG,EAAA,CAAA,CAE7CqE,UAAS;AAIX,MAAI/B,EAAExB,UAAUuB,EAAEjB,MAChBiD,UAAS;AAIX,MAAIF,YAAY,KAAKO,KAAKC,IAAIrC,EAAExB,MAAMiD,SAAS1B,EAAEjB,MAAM2C,OAAM,IAAK,EAChEM,UAAS;AAGX,SAAOF,aAAaA,YAAY,IAAIC,iBAAiB,KAAKC;;CAI5D,SAASjB,qBAAqBlC,OAAeqB,YAAoB;EAC/D,IAAIqC,iBAA0C;EAC9C,MAAMzB,WAA+B,EAAE;EAEvC,MAAM0B,mBAAmBhB,MAActB,WAAWsB,KAAK;EAEvD,MAAMiB,uBAAuBjB,MAC3BgB,gBAAgBhB,IAAI,EAAA,KAAOgB,gBAAgBhB,EAAAA;AAE7C,OAAK,IAAIA,IAAI,GAAGA,IAAI3C,MAAM6C,QAAQF,KAAK;AACrC,OAAIA,MAAM,KAAKiB,oBAAoBjB,EAAAA,EAAI;AAGrCe,qBAAiB;KAAEhE,OAAO;KAAImE,WAAWF,gBAAgBhB,EAAAA;KAAG;AAC5DV,aAAS6B,KAAKJ,eAAAA;;AAGhBA,kBAAgBhE,SAASM,MAAM2C;;AAEjC,SAAOV;;CAMT,SAASX,cAAcH,GAAmBC,GAAiB;EAKzD,MAAM2C,oBAAoBC,MAAM5C,EAAExB,MAAMiD,OAAM,CAC3CoB,KAAK,EAAA,CACLzE,UAAU,EAAE,CAAA;AA0Bf,OAAK,IAAI0E,QAAQ,IAAI/C,EAAEjB,MAAM2C,QAAQqB,QAAQ9C,EAAExB,MAAMiD,QAAQqB,SAAS;GAGpE,IAAIC,MAAuC;GAC3C,MAAMC,eAAeZ,KAAKhB,IAAI0B,OAAO,EAAA;GACrC,MAAMG,aAAab,KAAKc,IAAInD,EAAEjB,MAAM2C,SAASqB,OAAO9C,EAAExB,MAAMiD,OAAM;AAGlE,QAAK,IAAIF,IAAIyB,cAAczB,IAAI0B,YAAY1B,IAIzC,KAAIxB,EAAEjB,MAAMyC,IAAIuB,WAAW9C,EAAExB,MAAM+C,MAAMvB,EAAExB,MAAM+C,OAAO,KAAK;AAC3D,QAAI,CAACwB,IAEHA,OAAM,EAAEzE,OAAO,IAAG;AAUpByE,QAAIzE,SAASyB,EAAEjB,MAAMyC,IAAIuB;AAGzBH,sBAAkBpB,GAAGmB,KAAKK,IAAAA;cACjBA,IAETA,OAAM;;EAKZ,MAAMI,qBAAqBpD,EAAEjB,MAAM2C,SAAS1B,EAAErB,MAAM0E;EAOpD,MAAMC,iBAAiBjB,KAAKkB,KAAKH,sBAAsB,IAAA;EAEvD,MAAMlD,aAAuB,EAAE;AAC/B,OAAK,IAAIsB,IAAI,GAAGA,IAAIoB,kBAAkBlB,QAAQF,KAAK;GACjD,MAAMgC,OAAOZ,kBAAkBpB;GAC/B,IAAIpB,QAAQ;AACZ,QAAK,IAAIqD,IAAI,GAAGA,IAAID,KAAK9B,QAAQ+B,KAAK;IACpC,MAAMT,MAAMQ,KAAKC;AAGjB,QAAIT,IAAIzE,MAAMmD,UAAU4B,kBAAkBtD,EAAErB,MAAMwD,IAAIa,IAAIzE,MAAK,CAC7D6B,UAAS4C,IAAIzE,MAAMmD;;AAGvBxB,cAAWyC,KAAKvC,MAAAA;;AAElB,SAAOF"}

package/dist/AppHeader/Search/SearchWorker/src.js

@@ -1,310 +1,159 @@
-/*
- * A web worker to handle search-as-you-type and autocomplete
- *
- * This worker implements an algorithm for text matching that tests
- * a query string against a set of titles, and gives a score to
- * each character in a given title.
- *
- * e.g. matching query "abcde" to title "ab cde"
- * "a" and "b" each get a score of 2, because each is part of the match "ab"
- * "c", "d", and "e" each get a score of 3, because each is part of the match "cde"
- *
- * For autocomplete, a large list of titles is preloaded, and this
- * scoring algorithm is used both to find the top 5 matches, and to
- * determine which characters should be highlighted.
- * (These titles have certain phrases like "Intro to" removed so that they
- * better resemble something that a user would type.)
- *
- * For search-as-you-type, we rely on typesense to find matches,
- * but we still use this algorithm for character highlighting.
- */
-
+//#region src/AppHeader/Search/SearchWorker/src.ts
 function getPortalOrigin() {
-  const {
-    origin
-  } = window.location;
-  const envs = ['tengu', 'tayra', 'staging', 'www'];
-
-  // for standard envs, use portal app in the same env
-  if (envs.some(s => `https://${s}.codecademy.com` === origin)) return origin;
-
-  // for PR envs (e.g. pr-40229-monolith.dev-eks.codecademy.com)
-  if (origin.includes('.dev-eks.codecademy.com')) return origin;
-
-  // for local, use local portal-app, replace if origin port is monolith or le
-  if (origin.includes('localhost')) return origin.replace(/:\d{4}/, ':3100');
-
-  // otherwise (e.g. in monolith pr env) use staging portal-app
-  return 'https://staging.codecademy.com';
+	const { origin } = window.location;
+	if ([
+		"tengu",
+		"tayra",
+		"staging",
+		"www"
+	].some((s) => `https://${s}.codecademy.com` === origin)) return origin;
+	if (origin.includes(".dev-eks.codecademy.com")) return origin;
+	if (origin.includes("localhost")) return origin.replace(/:\d{4}/, ":3100");
+	return "https://staging.codecademy.com";
 }
-export function serializeSearchWorkerSrc() {
-  const BASE_URL = `${getPortalOrigin()}/api/portal/search`;
-  const fnAsStr = worker.toString().trim();
-
-  // in a prod build, webpack will handle removing comments
-
-  return fnAsStr.slice(fnAsStr.indexOf('{') + 1, -1) // remove wrapping function, which may have been renamed by minification
-  .replaceAll('  ', '') // remove indentation
-  .replaceAll('{BASE_URL}', BASE_URL) // interpolate base url
-  .replaceAll('{SEARCH}', window.location.search); // interpolate search query
+function serializeSearchWorkerSrc() {
+	const BASE_URL = `${getPortalOrigin()}/api/portal/search`;
+	const fnAsStr = worker.toString().trim();
+	return fnAsStr.slice(fnAsStr.indexOf("{") + 1, -1).replaceAll("  ", "").replaceAll("{BASE_URL}", BASE_URL).replaceAll("{SEARCH}", window.location.search);
 }
-
-/*
- * This function contains the code that is serialized to run in the worker. It
- * can't reference anything outside of itself (except types). Data is passed to
- * the worker via onmessage and passed back to the main thread via postMessage.
- */
 function worker() {
-  const preloadTitlesPromise = fetch('{BASE_URL}/autocomplete-preload{SEARCH}').then(f => f.json()).then(rawTitles => rawTitles.map(preparseTitle));
-  function preparseTitle({
-    value,
-    popularity
-  }) {
-    const lower = value.toLowerCase();
-    const words = getWordSet(lower);
-    return {
-      title: value,
-      lower,
-      words,
-      popularity
-    };
-  }
-  function preparseQuery(query) {
-    const words = getWordSet(query);
-    return {
-      query,
-      words
-    };
-  }
-  const wordSplitters = /[ :-]/g;
-  function getWordSet(str) {
-    const words = str.split(wordSplitters).map(w => w.trim()).filter(Boolean);
-    return new Set(words);
-  }
-  const handlers = {
-    autocomplete: autocompleteHandler,
-    'search-as-you-type': searchAsYouTypeHandler
-  };
-  onmessage = ({
-    data
-  }) => {
-    const {
-      query,
-      action
-    } = data;
-    const handler = handlers[action];
-    if (handler) {
-      handler(preparseQuery(query));
-    }
-  };
-  function getScoredTitle(q, t) {
-    const charScores = getCharScores(q, t);
-    const score = getTotalScore(q, t, charScores);
-    return {
-      title: t.title,
-      charScores,
-      score
-    };
-  }
-  const maxResults = 5;
-  function autocompleteHandler(q) {
-    preloadTitlesPromise.then(titles => {
-      const scoredTitles = titles.map(t => getScoredTitle(q, t));
-      const topAutocompleteTitles = scoredTitles.filter(x => x.score > 0).sort((a, b) => a.score > b.score ? -1 : 1).slice(0, maxResults).map(t => ({
-        title: t.title,
-        segments: getHighlightSegments(t.title, t.charScores)
-      }));
-      postMessage({
-        query: q.query,
-        result: topAutocompleteTitles,
-        action: 'autocomplete'
-      });
-    });
-  }
-  function searchAsYouTypeHandler(q) {
-    fetch('{BASE_URL}/search-as-you-type{SEARCH}', {
-      body: JSON.stringify({
-        query: q.query,
-        max: maxResults
-      }),
-      method: 'POST'
-    }).then(f => f.json()).then(searchAsYouTypeResults => {
-      for (let i = 0; i < searchAsYouTypeResults.top.length; i++) {
-        const entry = searchAsYouTypeResults.top[i];
-        const t = preparseTitle({
-          value: entry.title,
-          popularity: 0
-        });
-        const charScores = getCharScores(q, t);
-        entry.segments = getHighlightSegments(entry.title, charScores);
-        entry.key = q.query + ':' + entry.title;
-      }
-      postMessage({
-        query: q.query,
-        result: searchAsYouTypeResults,
-        action: 'search-as-you-type'
-      });
-    });
-  }
-
-  /*
-   * For the search "alge", .04 is just low enough so that "Linear algebra"
-   * (which matches on 4 letters) comes in above "Data structures and algorithms"
-   * (which only matches on 3 letters, but has a high popularity score).
-   */
-  const popularityStrength = 0.04;
-
-  // Total used in sorting to find autocomplet top 5
-  // Bonus scores are includes in certain cases
-  function getTotalScore(q, t, charScores) {
-    let fromChars = 0;
-    for (let i = 0; i < charScores.length; i++) {
-      fromChars += charScores[i];
-    }
-    const fromPopularity = (t.popularity || 0) * popularityStrength;
-    let bonus = 0;
-    // for each complete word present in both the title and query
-    q.words.forEach(qw => {
-      if (t.words.has(qw)) {
-        bonus += 100;
-      }
-    });
-
-    // if the title starts with the query
-    if (t.lower.startsWith(q.query)) {
-      bonus += 200;
-    } else if (t.lower.startsWith(q.query.slice(0, 3))) {
-      // or at least the first 3 chars
-      bonus += 100;
-    }
-
-    // if the title is an exact match with the query
-    if (t.lower === q.query) {
-      bonus += 100;
-    }
-
-    // if there are some matching chars and the title is within 3 chars length of the query
-    if (fromChars > 1 && Math.abs(t.lower.length - q.query.length) <= 3) {
-      bonus += 100;
-    }
-    return fromChars + (fromChars > 1 ? fromPopularity : 0) + bonus;
-  }
-
-  // returns { value: string, highlight: boolean }[]
-  function getHighlightSegments(title, charScores) {
-    let currentSegment = null;
-    const segments = [];
-    const shouldHighlight = i => charScores[i] > 0;
-    const isDifferentFromPrev = i => shouldHighlight(i - 1) !== shouldHighlight(i);
-    for (let i = 0; i < title.length; i++) {
-      if (i === 0 || isDifferentFromPrev(i)) {
-        // If this char should be highlighted, but the prev one should not
-        // or vice versa, start a new segment.
-        currentSegment = {
-          value: '',
-          highlight: shouldHighlight(i)
-        };
-        segments.push(currentSegment);
-      }
-      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-      currentSegment.value += title[i];
-    }
-    return segments;
-  }
-
-  // Used by autocomplete, both for finding top 5, and for highlighting
-  // Used by search-as-you-type, only for highlighting
-  // Returns number[], where each number is the match score for a char in the title
-  function getCharScores(q, t) {
-    /*
-     * Prefill the array for each char in the title.
-     * For each char, we keep an array of the consecutive matches the char is a part of.
-     */
-    const cmcsForTitleChars = Array(t.lower.length).fill(0).map(() => []);
-
-    /*
-     * Overlay the query onto the title to see which chars match.
-     * Shift to align at different positions.
-     * e.g.
-     *   shift: 0
-     *   query: python3 learn
-     *   title: learn python 3
-     *   (no matches)
-     *
-     *   shift: 6
-     *   query:       python3 learn
-     *   title: learn python 3
-     *   (the word "python" matches)
-     *
-     *   shift: 7
-     *   query:        python3 learn
-     *   title: learn python 3
-     *   ("3" matches)
-     *
-     *   shift: -8
-     *   query: python3 learn
-     *   title:         learn python 3
-     *   ("learn" matches)
-     */
-    for (let shift = 1 - q.query.length; shift < t.lower.length; shift++) {
-      // for each shift position
-
-      let cmc = null;
-      const startOverlap = Math.max(shift, 0);
-      const endOverlap = Math.min(q.query.length + shift, t.lower.length);
-
-      // i is the index of a char in the title
-      for (let i = startOverlap; i < endOverlap; i++) {
-        // for each char position in the potentially overlapping area
-
-        // if char at this position matches (and isn't a space)
-        if (q.query[i - shift] === t.lower[i] && t.lower[i] !== ' ') {
-          if (!cmc) {
-            // start a new cmc if needed
-            cmc = {
-              value: ''
-            };
-          }
-
-          /*
-           * Append this char to the current cmc.
-           * We use an object with {value} so that we can modify by reference,
-           * since we want to modify the cmc, not only for this char, but also
-           * for any previous chars that this cmc was pushed to, since those
-           * chars are part of this same consecutive match.
-           */
-          cmc.value += q.query[i - shift];
-
-          // include this cmc for this char
-          cmcsForTitleChars[i].push(cmc);
-        } else if (cmc) {
-          // set to null so that the next match starts a new cmc
-          cmc = null;
-        }
-      }
-    }
-    const avgQueryWordLength = q.query.length / q.words.size;
+	const preloadTitlesPromise = fetch("{BASE_URL}/autocomplete-preload{SEARCH}").then((f) => f.json()).then((rawTitles) => rawTitles.map(preparseTitle));
+	function preparseTitle({ value, popularity }) {
+		const lower = value.toLowerCase();
+		return {
+			title: value,
+			lower,
+			words: getWordSet(lower),
+			popularity
+		};
+	}
+	function preparseQuery(query) {
+		return {
+			query,
+			words: getWordSet(query)
+		};
+	}
+	const wordSplitters = /[ :-]/g;
+	function getWordSet(str) {
+		const words = str.split(wordSplitters).map((w) => w.trim()).filter(Boolean);
+		return new Set(words);
+	}
+	const handlers = {
+		autocomplete: autocompleteHandler,
+		"search-as-you-type": searchAsYouTypeHandler
+	};
+	onmessage = ({ data }) => {
+		const { query, action } = data;
+		const handler = handlers[action];
+		if (handler) handler(preparseQuery(query));
+	};
+	function getScoredTitle(q, t) {
+		const charScores = getCharScores(q, t);
+		const score = getTotalScore(q, t, charScores);
+		return {
+			title: t.title,
+			charScores,
+			score
+		};
+	}
+	const maxResults = 5;
+	function autocompleteHandler(q) {
+		preloadTitlesPromise.then((titles) => {
+			const topAutocompleteTitles = titles.map((t) => getScoredTitle(q, t)).filter((x) => x.score > 0).sort((a, b) => a.score > b.score ? -1 : 1).slice(0, maxResults).map((t) => ({
+				title: t.title,
+				segments: getHighlightSegments(t.title, t.charScores)
+			}));
+			postMessage({
+				query: q.query,
+				result: topAutocompleteTitles,
+				action: "autocomplete"
+			});
+		});
+	}
+	function searchAsYouTypeHandler(q) {
+		fetch("{BASE_URL}/search-as-you-type{SEARCH}", {
+			body: JSON.stringify({
+				query: q.query,
+				max: maxResults
+			}),
+			method: "POST"
+		}).then((f) => f.json()).then((searchAsYouTypeResults) => {
+			for (let i = 0; i < searchAsYouTypeResults.top.length; i++) {
+				const entry = searchAsYouTypeResults.top[i];
+				const charScores = getCharScores(q, preparseTitle({
+					value: entry.title,
+					popularity: 0
+				}));
+				entry.segments = getHighlightSegments(entry.title, charScores);
+				entry.key = q.query + ":" + entry.title;
+			}
+			postMessage({
+				query: q.query,
+				result: searchAsYouTypeResults,
+				action: "search-as-you-type"
+			});
+		});
+	}
+	const popularityStrength = .04;
+	function getTotalScore(q, t, charScores) {
+		let fromChars = 0;
+		for (let i = 0; i < charScores.length; i++) fromChars += charScores[i];
+		const fromPopularity = (t.popularity || 0) * popularityStrength;
+		let bonus = 0;
+		q.words.forEach((qw) => {
+			if (t.words.has(qw)) bonus += 100;
+		});
+		if (t.lower.startsWith(q.query)) bonus += 200;
+		else if (t.lower.startsWith(q.query.slice(0, 3))) bonus += 100;
+		if (t.lower === q.query) bonus += 100;
+		if (fromChars > 1 && Math.abs(t.lower.length - q.query.length) <= 3) bonus += 100;
+		return fromChars + (fromChars > 1 ? fromPopularity : 0) + bonus;
+	}
+	function getHighlightSegments(title, charScores) {
+		let currentSegment = null;
+		const segments = [];
+		const shouldHighlight = (i) => charScores[i] > 0;
+		const isDifferentFromPrev = (i) => shouldHighlight(i - 1) !== shouldHighlight(i);
+		for (let i = 0; i < title.length; i++) {
+			if (i === 0 || isDifferentFromPrev(i)) {
+				currentSegment = {
+					value: "",
+					highlight: shouldHighlight(i)
+				};
+				segments.push(currentSegment);
+			}
+			currentSegment.value += title[i];
+		}
+		return segments;
+	}
+	function getCharScores(q, t) {
+		const cmcsForTitleChars = Array(t.lower.length).fill(0).map(() => []);
+		for (let shift = 1 - q.query.length; shift < t.lower.length; shift++) {
+			let cmc = null;
+			const startOverlap = Math.max(shift, 0);
+			const endOverlap = Math.min(q.query.length + shift, t.lower.length);
+			for (let i = startOverlap; i < endOverlap; i++) if (q.query[i - shift] === t.lower[i] && t.lower[i] !== " ") {
+				if (!cmc) cmc = { value: "" };
+				cmc.value += q.query[i - shift];
+				cmcsForTitleChars[i].push(cmc);
+			} else if (cmc) cmc = null;
+		}
+		const avgQueryWordLength = q.query.length / q.words.size;
+		const minMatchLength = Math.ceil(avgQueryWordLength ** .65);
+		const charScores = [];
+		for (let i = 0; i < cmcsForTitleChars.length; i++) {
+			const cmcs = cmcsForTitleChars[i];
+			let score = 0;
+			for (let j = 0; j < cmcs.length; j++) {
+				const cmc = cmcs[j];
+				if (cmc.value.length >= minMatchLength || q.words.has(cmc.value)) score += cmc.value.length;
+			}
+			charScores.push(score);
+		}
+		return charScores;
+	}
+}
 
-    // If avgQueryWordLength is 1-3, we want to the min match to be about that same size.
-    // If avgQueryWordLength is longer, we want min match to be longer...but not too long.
-    // e.g. For avgQueryWordLength of 9, min should be 5
-    // The misspelling "regresion" should still match "regression", but not "encryption",
-    // "authentication" or other words ending in "ion"
-    const minMatchLength = Math.ceil(avgQueryWordLength ** 0.65);
-    const charScores = [];
-    for (let i = 0; i < cmcsForTitleChars.length; i++) {
-      const cmcs = cmcsForTitleChars[i];
-      let score = 0;
-      for (let j = 0; j < cmcs.length; j++) {
-        const cmc = cmcs[j];
-        // if the string of consecutive matching chars meets the minMatchLength
-        // or if it's a standalone word in the query (e.g "C")
-        if (cmc.value.length >= minMatchLength || q.words.has(cmc.value)) {
-          score += cmc.value.length;
-        }
-      }
-      charScores.push(score);
-    }
-    return charScores;
-  }
-}
+//#endregion
+export { serializeSearchWorkerSrc };
+//# sourceMappingURL=src.js.map

package/dist/AppHeader/Search/SearchWorker/src.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"src.js","names":["getPortalOrigin","origin","window","location","envs","some","s","includes","replace","serializeSearchWorkerSrc","BASE_URL","fnAsStr","worker","toString","trim","slice","indexOf","replaceAll","search","preloadTitlesPromise","fetch","then","f","json","rawTitles","map","preparseTitle","value","popularity","lower","toLowerCase","words","getWordSet","title","preparseQuery","query","wordSplitters","str","split","w","filter","Boolean","Set","handlers","autocomplete","autocompleteHandler","searchAsYouTypeHandler","onmessage","data","action","handler","getScoredTitle","q","t","charScores","getCharScores","score","getTotalScore","maxResults","titles","scoredTitles","topAutocompleteTitles","x","sort","a","b","segments","getHighlightSegments","postMessage","result","body","JSON","stringify","max","method","searchAsYouTypeResults","i","top","length","entry","key","popularityStrength","fromChars","fromPopularity","bonus","forEach","qw","has","startsWith","Math","abs","currentSegment","shouldHighlight","isDifferentFromPrev","highlight","push","cmcsForTitleChars","Array","fill","shift","cmc","startOverlap","endOverlap","min","avgQueryWordLength","size","minMatchLength","ceil","cmcs","j"],"sources":["../../../../src/AppHeader/Search/SearchWorker/src.ts"],"sourcesContent":["/*\n * A web worker to handle search-as-you-type and autocomplete\n *\n * This worker implements an algorithm for text matching that tests\n * a query string against a set of titles, and gives a score to\n * each character in a given title.\n *\n * e.g. matching query \"abcde\" to title \"ab cde\"\n * \"a\" and \"b\" each get a score of 2, because each is part of the match \"ab\"\n * \"c\", \"d\", and \"e\" each get a score of 3, because each is part of the match \"cde\"\n *\n * For autocomplete, a large list of titles is preloaded, and this\n * scoring algorithm is used both to find the top 5 matches, and to\n * determine which characters should be highlighted.\n * (These titles have certain phrases like \"Intro to\" removed so that they\n * better resemble something that a user would type.)\n *\n * For search-as-you-type, we rely on typesense to find matches,\n * but we still use this algorithm for character highlighting.\n */\n\nimport {\n  AutocompleteSuggestion,\n  HighlightSegment,\n  SearchAsYouTypeResults,\n} from './types';\n\nfunction getPortalOrigin() {\n  const { origin } = window.location;\n  const envs = ['tengu', 'tayra', 'staging', 'www'];\n\n  // for standard envs, use portal app in the same env\n  if (envs.some((s) => `https://${s}.codecademy.com` === origin)) return origin;\n\n  // for PR envs (e.g. pr-40229-monolith.dev-eks.codecademy.com)\n  if (origin.includes('.dev-eks.codecademy.com')) return origin;\n\n  // for local, use local portal-app, replace if origin port is monolith or le\n  if (origin.includes('localhost')) return origin.replace(/:\\d{4}/, ':3100');\n\n  // otherwise (e.g. in monolith pr env) use staging portal-app\n  return 'https://staging.codecademy.com';\n}\n\nexport function serializeSearchWorkerSrc() {\n  const BASE_URL = `${getPortalOrigin()}/api/portal/search`;\n  const fnAsStr = worker.toString().trim();\n\n  // in a prod build, webpack will handle removing comments\n\n  return fnAsStr\n    .slice(fnAsStr.indexOf('{') + 1, -1) // remove wrapping function, which may have been renamed by minification\n    .replaceAll('  ', '') // remove indentation\n    .replaceAll('{BASE_URL}', BASE_URL) // interpolate base url\n    .replaceAll('{SEARCH}', window.location.search); // interpolate search query\n}\n\n/*\n * This function contains the code that is serialized to run in the worker. It\n * can't reference anything outside of itself (except types). Data is passed to\n * the worker via onmessage and passed back to the main thread via postMessage.\n */\nfunction worker() {\n  type RawTitle = {\n    value: string;\n    popularity: number;\n  };\n  type PreparsedTitle = {\n    title: string;\n    lower: string;\n    words: Set<string>;\n    popularity: number;\n  };\n  type PreparsedQuery = {\n    query: string;\n    words: Set<string>;\n  };\n  type ScoredTitle = {\n    title: string;\n    charScores: number[];\n    score: number;\n  };\n  type ConsecutiveMatchingChars = { value: string };\n\n  const preloadTitlesPromise = fetch('{BASE_URL}/autocomplete-preload{SEARCH}')\n    .then((f) => f.json())\n    .then((rawTitles) => rawTitles.map(preparseTitle));\n\n  function preparseTitle({ value, popularity }: RawTitle): PreparsedTitle {\n    const lower = value.toLowerCase();\n    const words = getWordSet(lower);\n    return { title: value, lower, words, popularity };\n  }\n\n  function preparseQuery(query: string): PreparsedQuery {\n    const words = getWordSet(query);\n    return { query, words };\n  }\n\n  const wordSplitters = /[ :-]/g;\n\n  function getWordSet(str: string) {\n    const words = str\n      .split(wordSplitters)\n      .map((w) => w.trim())\n      .filter(Boolean);\n    return new Set(words);\n  }\n\n  const handlers: { [action: string]: (q: PreparsedQuery) => void } = {\n    autocomplete: autocompleteHandler,\n    'search-as-you-type': searchAsYouTypeHandler,\n  };\n\n  onmessage = ({ data }: MessageEvent<{ action: string; query: string }>) => {\n    const { query, action } = data;\n    const handler = handlers[action];\n    if (handler) {\n      handler(preparseQuery(query));\n    }\n  };\n\n  function getScoredTitle(q: PreparsedQuery, t: PreparsedTitle): ScoredTitle {\n    const charScores = getCharScores(q, t);\n    const score = getTotalScore(q, t, charScores);\n    return { title: t.title, charScores, score };\n  }\n\n  const maxResults = 5;\n\n  function autocompleteHandler(q: PreparsedQuery) {\n    preloadTitlesPromise.then((titles: PreparsedTitle[]) => {\n      const scoredTitles = titles.map((t: PreparsedTitle) =>\n        getScoredTitle(q, t)\n      );\n\n      const topAutocompleteTitles: AutocompleteSuggestion[] = scoredTitles\n        .filter((x: ScoredTitle) => x.score > 0)\n        .sort((a: ScoredTitle, b: ScoredTitle) => (a.score > b.score ? -1 : 1))\n        .slice(0, maxResults)\n        .map((t: ScoredTitle) => ({\n          title: t.title,\n          segments: getHighlightSegments(t.title, t.charScores),\n        }));\n\n      postMessage({\n        query: q.query,\n        result: topAutocompleteTitles,\n        action: 'autocomplete',\n      });\n    });\n  }\n\n  function searchAsYouTypeHandler(q: PreparsedQuery) {\n    fetch('{BASE_URL}/search-as-you-type{SEARCH}', {\n      body: JSON.stringify({ query: q.query, max: maxResults }),\n      method: 'POST',\n    })\n      .then((f) => f.json())\n      .then((searchAsYouTypeResults: SearchAsYouTypeResults) => {\n        for (let i = 0; i < searchAsYouTypeResults.top.length; i++) {\n          const entry = searchAsYouTypeResults.top[i];\n          const t = preparseTitle({ value: entry.title, popularity: 0 });\n          const charScores = getCharScores(q, t);\n          entry.segments = getHighlightSegments(entry.title, charScores);\n          entry.key = q.query + ':' + entry.title;\n        }\n        postMessage({\n          query: q.query,\n          result: searchAsYouTypeResults,\n          action: 'search-as-you-type',\n        });\n      });\n  }\n\n  /*\n   * For the search \"alge\", .04 is just low enough so that \"Linear algebra\"\n   * (which matches on 4 letters) comes in above \"Data structures and algorithms\"\n   * (which only matches on 3 letters, but has a high popularity score).\n   */\n  const popularityStrength = 0.04;\n\n  // Total used in sorting to find autocomplet top 5\n  // Bonus scores are includes in certain cases\n  function getTotalScore(\n    q: PreparsedQuery,\n    t: PreparsedTitle,\n    charScores: number[]\n  ) {\n    let fromChars = 0;\n    for (let i = 0; i < charScores.length; i++) {\n      fromChars += charScores[i];\n    }\n\n    const fromPopularity = (t.popularity || 0) * popularityStrength;\n\n    let bonus = 0;\n    // for each complete word present in both the title and query\n    q.words.forEach((qw) => {\n      if (t.words.has(qw)) {\n        bonus += 100;\n      }\n    });\n\n    // if the title starts with the query\n    if (t.lower.startsWith(q.query)) {\n      bonus += 200;\n    } else if (t.lower.startsWith(q.query.slice(0, 3))) {\n      // or at least the first 3 chars\n      bonus += 100;\n    }\n\n    // if the title is an exact match with the query\n    if (t.lower === q.query) {\n      bonus += 100;\n    }\n\n    // if there are some matching chars and the title is within 3 chars length of the query\n    if (fromChars > 1 && Math.abs(t.lower.length - q.query.length) <= 3) {\n      bonus += 100;\n    }\n\n    return fromChars + (fromChars > 1 ? fromPopularity : 0) + bonus;\n  }\n\n  // returns { value: string, highlight: boolean }[]\n  function getHighlightSegments(title: string, charScores: number[]) {\n    let currentSegment: HighlightSegment | null = null;\n    const segments: HighlightSegment[] = [];\n\n    const shouldHighlight = (i: number) => charScores[i] > 0;\n\n    const isDifferentFromPrev = (i: number) =>\n      shouldHighlight(i - 1) !== shouldHighlight(i);\n\n    for (let i = 0; i < title.length; i++) {\n      if (i === 0 || isDifferentFromPrev(i)) {\n        // If this char should be highlighted, but the prev one should not\n        // or vice versa, start a new segment.\n        currentSegment = { value: '', highlight: shouldHighlight(i) };\n        segments.push(currentSegment);\n      }\n      // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n      currentSegment!.value += title[i];\n    }\n    return segments;\n  }\n\n  // Used by autocomplete, both for finding top 5, and for highlighting\n  // Used by search-as-you-type, only for highlighting\n  // Returns number[], where each number is the match score for a char in the title\n  function getCharScores(q: PreparsedQuery, t: PreparsedTitle) {\n    /*\n     * Prefill the array for each char in the title.\n     * For each char, we keep an array of the consecutive matches the char is a part of.\n     */\n    const cmcsForTitleChars = Array(t.lower.length)\n      .fill(0)\n      .map(() => []) as ConsecutiveMatchingChars[][];\n\n    /*\n     * Overlay the query onto the title to see which chars match.\n     * Shift to align at different positions.\n     * e.g.\n     *   shift: 0\n     *   query: python3 learn\n     *   title: learn python 3\n     *   (no matches)\n     *\n     *   shift: 6\n     *   query:       python3 learn\n     *   title: learn python 3\n     *   (the word \"python\" matches)\n     *\n     *   shift: 7\n     *   query:        python3 learn\n     *   title: learn python 3\n     *   (\"3\" matches)\n     *\n     *   shift: -8\n     *   query: python3 learn\n     *   title:         learn python 3\n     *   (\"learn\" matches)\n     */\n    for (let shift = 1 - q.query.length; shift < t.lower.length; shift++) {\n      // for each shift position\n\n      let cmc: ConsecutiveMatchingChars | null = null;\n      const startOverlap = Math.max(shift, 0);\n      const endOverlap = Math.min(q.query.length + shift, t.lower.length);\n\n      // i is the index of a char in the title\n      for (let i = startOverlap; i < endOverlap; i++) {\n        // for each char position in the potentially overlapping area\n\n        // if char at this position matches (and isn't a space)\n        if (q.query[i - shift] === t.lower[i] && t.lower[i] !== ' ') {\n          if (!cmc) {\n            // start a new cmc if needed\n            cmc = { value: '' };\n          }\n\n          /*\n           * Append this char to the current cmc.\n           * We use an object with {value} so that we can modify by reference,\n           * since we want to modify the cmc, not only for this char, but also\n           * for any previous chars that this cmc was pushed to, since those\n           * chars are part of this same consecutive match.\n           */\n          cmc.value += q.query[i - shift];\n\n          // include this cmc for this char\n          cmcsForTitleChars[i].push(cmc);\n        } else if (cmc) {\n          // set to null so that the next match starts a new cmc\n          cmc = null;\n        }\n      }\n    }\n\n    const avgQueryWordLength = q.query.length / q.words.size;\n\n    // If avgQueryWordLength is 1-3, we want to the min match to be about that same size.\n    // If avgQueryWordLength is longer, we want min match to be longer...but not too long.\n    // e.g. For avgQueryWordLength of 9, min should be 5\n    // The misspelling \"regresion\" should still match \"regression\", but not \"encryption\",\n    // \"authentication\" or other words ending in \"ion\"\n    const minMatchLength = Math.ceil(avgQueryWordLength ** 0.65);\n\n    const charScores: number[] = [];\n    for (let i = 0; i < cmcsForTitleChars.length; i++) {\n      const cmcs = cmcsForTitleChars[i];\n      let score = 0;\n      for (let j = 0; j < cmcs.length; j++) {\n        const cmc = cmcs[j];\n        // if the string of consecutive matching chars meets the minMatchLength\n        // or if it's a standalone word in the query (e.g \"C\")\n        if (cmc.value.length >= minMatchLength || q.words.has(cmc.value)) {\n          score += cmc.value.length;\n        }\n      }\n      charScores.push(score);\n    }\n    return charScores;\n  }\n}\n"],"mappings":";AA2BA,SAASA,kBAAAA;CACP,MAAM,EAAEC,WAAWC,OAAOC;AAI1B,KAHa;EAAC;EAAS;EAAS;EAAW;EAAM,CAGxCE,MAAMC,MAAM,WAAWA,EAAE,qBAAqBL,OAAAA,CAAS,QAAOA;AAGvE,KAAIA,OAAOM,SAAS,0BAAA,CAA4B,QAAON;AAGvD,KAAIA,OAAOM,SAAS,YAAA,CAAc,QAAON,OAAOO,QAAQ,UAAU,QAAA;AAGlE,QAAO;;AAGT,SAAgBC,2BAAAA;CACd,MAAMC,WAAW,GAAGV,iBAAAA,CAAkB;CACtC,MAAMW,UAAUC,OAAOC,UAAQ,CAAGC,MAAI;AAItC,QAAOH,QACJI,MAAMJ,QAAQK,QAAQ,IAAA,GAAO,GAAG,GAAC,CACjCC,WAAW,MAAM,GAAA,CACjBA,WAAW,cAAcP,SAAAA,CACzBO,WAAW,YAAYf,OAAOC,SAASe,OAAM;;AAQlD,SAASN,SAAAA;CAsBP,MAAMO,uBAAuBC,MAAM,0CAAA,CAChCC,MAAMC,MAAMA,EAAEC,MAAI,CAAA,CAClBF,MAAMG,cAAcA,UAAUC,IAAIC,cAAAA,CAAAA;CAErC,SAASA,cAAc,EAAEC,OAAOC,cAAsB;EACpD,MAAMC,QAAQF,MAAMG,aAAW;AAE/B,SAAO;GAAEG,OAAON;GAAOE;GAAOE,OADhBC,WAAWH,MAAAA;GACYD;GAAW;;CAGlD,SAASM,cAAcC,OAAa;AAElC,SAAO;GAAEA;GAAOJ,OADFC,WAAWG,MAAAA;GACH;;CAGxB,MAAMC,gBAAgB;CAEtB,SAASJ,WAAWK,KAAW;EAC7B,MAAMN,QAAQM,IACXC,MAAMF,cAAAA,CACNX,KAAKc,MAAMA,EAAEzB,MAAI,CAAA,CACjB0B,OAAOC,QAAAA;AACV,SAAO,IAAIC,IAAIX,MAAAA;;CAGjB,MAAMY,WAA8D;EAClEC,cAAcC;EACd,sBAAsBC;EACxB;AAEAC,cAAa,EAAEC,WAAuD;EACpE,MAAM,EAAEb,OAAOc,WAAWD;EAC1B,MAAME,UAAUP,SAASM;AACzB,MAAIC,QACFA,SAAQhB,cAAcC,MAAAA,CAAAA;;CAI1B,SAASgB,eAAeC,GAAmBC,GAAiB;EAC1D,MAAMC,aAAaC,cAAcH,GAAGC,EAAAA;EACpC,MAAMG,QAAQC,cAAcL,GAAGC,GAAGC,WAAAA;AAClC,SAAO;GAAErB,OAAOoB,EAAEpB;GAAOqB;GAAYE;GAAM;;CAG7C,MAAME,aAAa;CAEnB,SAASb,oBAAoBO,GAAiB;AAC5CjC,uBAAqBE,MAAMsC,WAAAA;GAKzB,MAAME,wBAJeF,OAAOlC,KAAK4B,MAC/BF,eAAeC,GAAGC,EAAAA,CAAAA,CAIjBb,QAAQsB,MAAmBA,EAAEN,QAAQ,EAAA,CACrCO,MAAMC,GAAgBC,MAAoBD,EAAER,QAAQS,EAAET,QAAQ,KAAK,EAAA,CACnEzC,MAAM,GAAG2C,WAAAA,CACTjC,KAAK4B,OAAoB;IACxBpB,OAAOoB,EAAEpB;IACTiC,UAAUC,qBAAqBd,EAAEpB,OAAOoB,EAAEC,WAAU;IACtD,EAAA;AAEFc,eAAY;IACVjC,OAAOiB,EAAEjB;IACTkC,QAAQR;IACRZ,QAAQ;IACV,CAAA;IACF;;CAGF,SAASH,uBAAuBM,GAAiB;AAC/ChC,QAAM,yCAAyC;GAC7CkD,MAAMC,KAAKC,UAAU;IAAErC,OAAOiB,EAAEjB;IAAOsC,KAAKf;IAAW,CAAA;GACvDgB,QAAQ;GACV,CAAA,CACGrD,MAAMC,MAAMA,EAAEC,MAAI,CAAA,CAClBF,MAAMsD,2BAAAA;AACL,QAAK,IAAIC,IAAI,GAAGA,IAAID,uBAAuBE,IAAIC,QAAQF,KAAK;IAC1D,MAAMG,QAAQJ,uBAAuBE,IAAID;IAEzC,MAAMtB,aAAaC,cAAcH,GADvB1B,cAAc;KAAEC,OAAOoD,MAAM9C;KAAOL,YAAY;KAAE,CAAA,CACxByB;AACpC0B,UAAMb,WAAWC,qBAAqBY,MAAM9C,OAAOqB,WAAAA;AACnDyB,UAAMC,MAAM5B,EAAEjB,QAAQ,MAAM4C,MAAM9C;;AAEpCmC,eAAY;IACVjC,OAAOiB,EAAEjB;IACTkC,QAAQM;IACR1B,QAAQ;IACV,CAAA;IACF;;CAQJ,MAAMgC,qBAAqB;CAI3B,SAASxB,cACPL,GACAC,GACAC,YAAoB;EAEpB,IAAI4B,YAAY;AAChB,OAAK,IAAIN,IAAI,GAAGA,IAAItB,WAAWwB,QAAQF,IACrCM,cAAa5B,WAAWsB;EAG1B,MAAMO,kBAAkB9B,EAAEzB,cAAc,KAAKqD;EAE7C,IAAIG,QAAQ;AAEZhC,IAAErB,MAAMsD,SAASC,OAAAA;AACf,OAAIjC,EAAEtB,MAAMwD,IAAID,GAAAA,CACdF,UAAS;IAEb;AAGA,MAAI/B,EAAExB,MAAM2D,WAAWpC,EAAEjB,MAAK,CAC5BiD,UAAS;WACA/B,EAAExB,MAAM2D,WAAWpC,EAAEjB,MAAMpB,MAAM,GAAG,EAAA,CAAA,CAE7CqE,UAAS;AAIX,MAAI/B,EAAExB,UAAUuB,EAAEjB,MAChBiD,UAAS;AAIX,MAAIF,YAAY,KAAKO,KAAKC,IAAIrC,EAAExB,MAAMiD,SAAS1B,EAAEjB,MAAM2C,OAAM,IAAK,EAChEM,UAAS;AAGX,SAAOF,aAAaA,YAAY,IAAIC,iBAAiB,KAAKC;;CAI5D,SAASjB,qBAAqBlC,OAAeqB,YAAoB;EAC/D,IAAIqC,iBAA0C;EAC9C,MAAMzB,WAA+B,EAAE;EAEvC,MAAM0B,mBAAmBhB,MAActB,WAAWsB,KAAK;EAEvD,MAAMiB,uBAAuBjB,MAC3BgB,gBAAgBhB,IAAI,EAAA,KAAOgB,gBAAgBhB,EAAAA;AAE7C,OAAK,IAAIA,IAAI,GAAGA,IAAI3C,MAAM6C,QAAQF,KAAK;AACrC,OAAIA,MAAM,KAAKiB,oBAAoBjB,EAAAA,EAAI;AAGrCe,qBAAiB;KAAEhE,OAAO;KAAImE,WAAWF,gBAAgBhB,EAAAA;KAAG;AAC5DV,aAAS6B,KAAKJ,eAAAA;;AAGhBA,kBAAgBhE,SAASM,MAAM2C;;AAEjC,SAAOV;;CAMT,SAASX,cAAcH,GAAmBC,GAAiB;EAKzD,MAAM2C,oBAAoBC,MAAM5C,EAAExB,MAAMiD,OAAM,CAC3CoB,KAAK,EAAA,CACLzE,UAAU,EAAE,CAAA;AA0Bf,OAAK,IAAI0E,QAAQ,IAAI/C,EAAEjB,MAAM2C,QAAQqB,QAAQ9C,EAAExB,MAAMiD,QAAQqB,SAAS;GAGpE,IAAIC,MAAuC;GAC3C,MAAMC,eAAeZ,KAAKhB,IAAI0B,OAAO,EAAA;GACrC,MAAMG,aAAab,KAAKc,IAAInD,EAAEjB,MAAM2C,SAASqB,OAAO9C,EAAExB,MAAMiD,OAAM;AAGlE,QAAK,IAAIF,IAAIyB,cAAczB,IAAI0B,YAAY1B,IAIzC,KAAIxB,EAAEjB,MAAMyC,IAAIuB,WAAW9C,EAAExB,MAAM+C,MAAMvB,EAAExB,MAAM+C,OAAO,KAAK;AAC3D,QAAI,CAACwB,IAEHA,OAAM,EAAEzE,OAAO,IAAG;AAUpByE,QAAIzE,SAASyB,EAAEjB,MAAMyC,IAAIuB;AAGzBH,sBAAkBpB,GAAGmB,KAAKK,IAAAA;cACjBA,IAETA,OAAM;;EAKZ,MAAMI,qBAAqBpD,EAAEjB,MAAM2C,SAAS1B,EAAErB,MAAM0E;EAOpD,MAAMC,iBAAiBjB,KAAKkB,KAAKH,sBAAsB,IAAA;EAEvD,MAAMlD,aAAuB,EAAE;AAC/B,OAAK,IAAIsB,IAAI,GAAGA,IAAIoB,kBAAkBlB,QAAQF,KAAK;GACjD,MAAMgC,OAAOZ,kBAAkBpB;GAC/B,IAAIpB,QAAQ;AACZ,QAAK,IAAIqD,IAAI,GAAGA,IAAID,KAAK9B,QAAQ+B,KAAK;IACpC,MAAMT,MAAMQ,KAAKC;AAGjB,QAAIT,IAAIzE,MAAMmD,UAAU4B,kBAAkBtD,EAAErB,MAAMwD,IAAIa,IAAIzE,MAAK,CAC7D6B,UAAS4C,IAAIzE,MAAMmD;;AAGvBxB,cAAWyC,KAAKvC,MAAAA;;AAElB,SAAOF"}

package/dist/AppHeader/Search/SearchWorker/types.cjs

@@ -0,0 +1,16 @@
+
+//#region src/AppHeader/Search/SearchWorker/types.ts
+var SearchAction;
+(function(SearchAction) {
+	SearchAction["Autocomplete"] = "autocomplete";
+	SearchAction["SearchAsYouType"] = "search-as-you-type";
+})(SearchAction || (SearchAction = {}));
+
+//#endregion
+Object.defineProperty(exports, 'SearchAction', {
+  enumerable: true,
+  get: function () {
+    return SearchAction;
+  }
+});
+//# sourceMappingURL=types.cjs.map

package/dist/AppHeader/Search/SearchWorker/types.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.cjs","names":["SearchAction"],"sources":["../../../../src/AppHeader/Search/SearchWorker/types.ts"],"sourcesContent":["export type HighlightSegment = {\n  value: string;\n  highlight: boolean;\n};\n\nexport type AutocompleteSuggestion = {\n  title: string;\n  segments: HighlightSegment[];\n};\n\ninterface SearchResults {\n  query: string;\n  queryLoadTime: number;\n  searchId: string;\n  resultsCount: number;\n}\n\ninterface BaseTopData {\n  type: string;\n  title: string;\n  slug: string;\n}\n\nexport interface SearchAsYouTypeResults extends SearchResults {\n  top: (BaseTopData & {\n    contentId?: string;\n    segments: HighlightSegment[];\n    urlPath: string;\n    key: string;\n  })[];\n}\n\nexport enum SearchAction {\n  Autocomplete = 'autocomplete',\n  SearchAsYouType = 'search-as-you-type',\n}\n\nexport type SearchResultTypes = {\n  [SearchAction.Autocomplete]: AutocompleteSuggestion[];\n  [SearchAction.SearchAsYouType]: SearchAsYouTypeResults;\n};\n\nexport type SearchWorker = <A extends SearchAction>(\n  action: A,\n  query: string\n) => Promise<SearchResultTypes[A]>;\n"],"mappings":";;;UAgCYA,cAAAA;;;GAAAA,iBAAAA,eAAAA,EAAAA,EAAAA"}

package/dist/AppHeader/Search/SearchWorker/types.d.cts

@@ -0,0 +1,31 @@
+//#region src/AppHeader/Search/SearchWorker/types.d.ts
+type HighlightSegment = {
+  value: string;
+  highlight: boolean;
+};
+type AutocompleteSuggestion = {
+  title: string;
+  segments: HighlightSegment[];
+};
+interface SearchResults {
+  query: string;
+  queryLoadTime: number;
+  searchId: string;
+  resultsCount: number;
+}
+interface BaseTopData {
+  type: string;
+  title: string;
+  slug: string;
+}
+interface SearchAsYouTypeResults extends SearchResults {
+  top: (BaseTopData & {
+    contentId?: string;
+    segments: HighlightSegment[];
+    urlPath: string;
+    key: string;
+  })[];
+}
+//#endregion
+export { AutocompleteSuggestion, SearchAsYouTypeResults };
+//# sourceMappingURL=types.d.cts.map

package/dist/AppHeader/Search/SearchWorker/types.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.cts","names":[],"sources":["../../../../src/AppHeader/Search/SearchWorker/types.ts"],"mappings":";KAAY,gBAAA;EACV,KAAA;EACA,SAAA;AAAA;AAAA,KAGU,sBAAA;EACV,KAAA;EACA,QAAA,EAAU,gBAAA;AAAA;AAAA,UAGF,aAAA;EACR,KAAA;EACA,aAAA;EACA,QAAA;EACA,YAAA;AAAA;AAAA,UAGQ,WAAA;EACR,IAAA;EACA,KAAA;EACA,IAAA;AAAA;AAAA,UAGe,sBAAA,SAA+B,aAAA;EAC9C,GAAA,GAAM,WAAA;IACJ,SAAA;IACA,QAAA,EAAU,gBAAA;IACV,OAAA;IACA,GAAA;EAAA;AAAA"}