placementt-core 1.400.1089 → 1.400.1091

package/lib/callables/apprenticeships.d.ts

@@ -27,18 +27,23 @@ export declare const apprenticeshipsCallables: {
                 unchanged: z.ZodNumber;
                 deleted: z.ZodNumber;
                 requests: z.ZodNumber;
+                /** Adverts stored without a SOC because their standard was not in the
+                 * lmiMeta/apprenticeshipStandards crosswalk. */
+                unlinked: z.ZodOptional<z.ZodNumber>;
             }, "strip", z.ZodTypeAny, {
                 deleted: number;
                 fetched: number;
                 written: number;
                 unchanged: number;
                 requests: number;
+                unlinked?: number | undefined;
             }, {
                 deleted: number;
                 fetched: number;
                 written: number;
                 unchanged: number;
                 requests: number;
+                unlinked?: number | undefined;
             }>;
             /** Requests this step made, so an admin can see the pacing held. */
             stepRequests: z.ZodNumber;
@@ -51,6 +56,7 @@ export declare const apprenticeshipsCallables: {
                 written: number;
                 unchanged: number;
                 requests: number;
+                unlinked?: number | undefined;
             };
             stepRequests: number;
             cursor?: {
@@ -67,6 +73,7 @@ export declare const apprenticeshipsCallables: {
                 written: number;
                 unchanged: number;
                 requests: number;
+                unlinked?: number | undefined;
             };
             stepRequests: number;
             cursor?: {

package/lib/callables/apprenticeships.js

@@ -23,6 +23,9 @@ const syncTotals = zod_1.z.object({
     unchanged: zod_1.z.number(),
     deleted: zod_1.z.number(),
     requests: zod_1.z.number(),
+    /** Adverts stored without a SOC because their standard was not in the
+     * lmiMeta/apprenticeshipStandards crosswalk. */
+    unlinked: zod_1.z.number().optional(),
 });
 exports.apprenticeshipsCallables = {
     /** Run one crawl step now (about eight minutes of paced requests), starting

package/lib/callables/apprenticeships.js.map

@@ -1 +1 @@
-{"version":3,"file":"apprenticeships.js","sourceRoot":"","sources":["../../src/callables/apprenticeships.ts"],"names":[],"mappings":";;;AAAA,6BAAsB;AAGtB;;;;;;;;;GASG;AAEH,MAAM,UAAU,GAAG,OAAC,CAAC,MAAM,CAAC;IACxB,UAAU,EAAE,OAAC,CAAC,MAAM,EAAE;IACtB,UAAU,EAAE,OAAC,CAAC,MAAM,EAAE;IACtB,UAAU,EAAE,OAAC,CAAC,MAAM,EAAE;CACzB,CAAC,CAAC;AAEH,MAAM,UAAU,GAAG,OAAC,CAAC,MAAM,CAAC;IACxB,OAAO,EAAE,OAAC,CAAC,MAAM,EAAE;IACnB,OAAO,EAAE,OAAC,CAAC,MAAM,EAAE;IACnB,SAAS,EAAE,OAAC,CAAC,MAAM,EAAE;IACrB,OAAO,EAAE,OAAC,CAAC,MAAM,EAAE;IACnB,QAAQ,EAAE,OAAC,CAAC,MAAM,EAAE;CACvB,CAAC,CAAC;AAEU,QAAA,wBAAwB,GAAG;IACpC;oCACgC;IAChC,0BAA0B,EAAE;QACxB,OAAO,EAAE,OAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,QAAQ,EAAE,OAAC,CAAC,MAAM,CAAC;YACf,KAAK,EAAE,OAAC,CAAC,MAAM,EAAE;YACjB,oEAAoE;YACpE,QAAQ,EAAE,OAAC,CAAC,OAAO,EAAE;YACrB,MAAM,EAAE,UAAU,CAAC,QAAQ,EAAE;YAC7B,MAAM,EAAE,UAAU;YAClB,oEAAoE;YACpE,YAAY,EAAE,OAAC,CAAC,MAAM,EAAE;SAC3B,CAAC;KACL;IACD;kCAC8B;IAC9B,0BAA0B,EAAE;QACxB,OAAO,EAAE,OAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,QAAQ,EAAE,OAAC,CAAC,MAAM,CAAC;YACf,EAAE,EAAE,OAAC,CAAC,OAAO,CAAC,IAAI,CAAC;SACtB,CAAC;KACL;IACD,8DAA8D;IAC9D,+BAA+B,EAAE;QAC7B,OAAO,EAAE,OAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,QAAQ,EAAE,OAAC,CAAC,MAAM,CAAC;YACf,MAAM,EAAE,OAAC,CAAC,KAAK,CAAC,OAAC,CAAC,MAAM,EAAE,CAAC;SAC9B,CAAC;KACL;CACoB,CAAC"}
+{"version":3,"file":"apprenticeships.js","sourceRoot":"","sources":["../../src/callables/apprenticeships.ts"],"names":[],"mappings":";;;AAAA,6BAAsB;AAGtB;;;;;;;;;GASG;AAEH,MAAM,UAAU,GAAG,OAAC,CAAC,MAAM,CAAC;IACxB,UAAU,EAAE,OAAC,CAAC,MAAM,EAAE;IACtB,UAAU,EAAE,OAAC,CAAC,MAAM,EAAE;IACtB,UAAU,EAAE,OAAC,CAAC,MAAM,EAAE;CACzB,CAAC,CAAC;AAEH,MAAM,UAAU,GAAG,OAAC,CAAC,MAAM,CAAC;IACxB,OAAO,EAAE,OAAC,CAAC,MAAM,EAAE;IACnB,OAAO,EAAE,OAAC,CAAC,MAAM,EAAE;IACnB,SAAS,EAAE,OAAC,CAAC,MAAM,EAAE;IACrB,OAAO,EAAE,OAAC,CAAC,MAAM,EAAE;IACnB,QAAQ,EAAE,OAAC,CAAC,MAAM,EAAE;IACpB;oDACgD;IAChD,QAAQ,EAAE,OAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE;CAClC,CAAC,CAAC;AAEU,QAAA,wBAAwB,GAAG;IACpC;oCACgC;IAChC,0BAA0B,EAAE;QACxB,OAAO,EAAE,OAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,QAAQ,EAAE,OAAC,CAAC,MAAM,CAAC;YACf,KAAK,EAAE,OAAC,CAAC,MAAM,EAAE;YACjB,oEAAoE;YACpE,QAAQ,EAAE,OAAC,CAAC,OAAO,EAAE;YACrB,MAAM,EAAE,UAAU,CAAC,QAAQ,EAAE;YAC7B,MAAM,EAAE,UAAU;YAClB,oEAAoE;YACpE,YAAY,EAAE,OAAC,CAAC,MAAM,EAAE;SAC3B,CAAC;KACL;IACD;kCAC8B;IAC9B,0BAA0B,EAAE;QACxB,OAAO,EAAE,OAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,QAAQ,EAAE,OAAC,CAAC,MAAM,CAAC;YACf,EAAE,EAAE,OAAC,CAAC,OAAO,CAAC,IAAI,CAAC;SACtB,CAAC;KACL;IACD,8DAA8D;IAC9D,+BAA+B,EAAE;QAC7B,OAAO,EAAE,OAAC,CAAC,MAAM,CAAC,EAAE,CAAC;QACrB,QAAQ,EAAE,OAAC,CAAC,MAAM,CAAC;YACf,MAAM,EAAE,OAAC,CAAC,KAAK,CAAC,OAAC,CAAC,MAAM,EAAE,CAAC;SAC9B,CAAC;KACL;CACoB,CAAC"}

package/lib/callables/registry.d.ts

@@ -337,18 +337,21 @@ export declare const allCallables: {
                 unchanged: z.ZodNumber;
                 deleted: z.ZodNumber;
                 requests: z.ZodNumber;
+                unlinked: z.ZodOptional<z.ZodNumber>;
             }, "strip", z.ZodTypeAny, {
                 deleted: number;
                 fetched: number;
                 written: number;
                 unchanged: number;
                 requests: number;
+                unlinked?: number | undefined;
             }, {
                 deleted: number;
                 fetched: number;
                 written: number;
                 unchanged: number;
                 requests: number;
+                unlinked?: number | undefined;
             }>;
             stepRequests: z.ZodNumber;
         }, "strip", z.ZodTypeAny, {
@@ -360,6 +363,7 @@ export declare const allCallables: {
                 written: number;
                 unchanged: number;
                 requests: number;
+                unlinked?: number | undefined;
             };
             stepRequests: number;
             cursor?: {
@@ -376,6 +380,7 @@ export declare const allCallables: {
                 written: number;
                 unchanged: number;
                 requests: number;
+                unlinked?: number | undefined;
             };
             stepRequests: number;
             cursor?: {
@@ -1646,18 +1651,21 @@ export declare const callableGroups: {
                     unchanged: z.ZodNumber;
                     deleted: z.ZodNumber;
                     requests: z.ZodNumber;
+                    unlinked: z.ZodOptional<z.ZodNumber>;
                 }, "strip", z.ZodTypeAny, {
                     deleted: number;
                     fetched: number;
                     written: number;
                     unchanged: number;
                     requests: number;
+                    unlinked?: number | undefined;
                 }, {
                     deleted: number;
                     fetched: number;
                     written: number;
                     unchanged: number;
                     requests: number;
+                    unlinked?: number | undefined;
                 }>;
                 stepRequests: z.ZodNumber;
             }, "strip", z.ZodTypeAny, {
@@ -1669,6 +1677,7 @@ export declare const callableGroups: {
                     written: number;
                     unchanged: number;
                     requests: number;
+                    unlinked?: number | undefined;
                 };
                 stepRequests: number;
                 cursor?: {
@@ -1685,6 +1694,7 @@ export declare const callableGroups: {
                     written: number;
                     unchanged: number;
                     requests: number;
+                    unlinked?: number | undefined;
                 };
                 stepRequests: number;
                 cursor?: {

package/lib/index.d.ts

@@ -18,6 +18,7 @@ export * from "./activities";
 export * from "./activityLogging";
 export * from "./lmi";
 export * from "./lmiCategories";
+export * from "./pathways";
 export * from "./productResolver";
 export * from "./pricing";
 export * from "./invoicing";

package/lib/index.js

@@ -38,6 +38,7 @@ __exportStar(require("./activities"), exports);
 __exportStar(require("./activityLogging"), exports);
 __exportStar(require("./lmi"), exports);
 __exportStar(require("./lmiCategories"), exports);
+__exportStar(require("./pathways"), exports);
 __exportStar(require("./productResolver"), exports);
 __exportStar(require("./pricing"), exports);
 __exportStar(require("./invoicing"), exports);

package/lib/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;AACA,sDAAoC;AACpC,gEAA8C;AAC9C,0DAAwC;AACxC,2DAAyC;AACzC,kDAAgC;AAChC,uDAAqC;AACrC,4DAA0C;AAC1C,2DAAyC;AAEzC,oDAAkC;AAClC,8CAA4B;AAC5B,kDAAgC;AAChC,kDAAgC;AAChC,qDAAmC;AACnC,mDAAiC;AACjC,qDAAmC;AACnC,mDAAiC;AACjC,+CAA6B;AAC7B,oDAAkC;AAClC,wCAAsB;AACtB,kDAAgC;AAChC,oDAAkC;AAClC,4CAA0B;AAC1B,8CAA4B;AAC5B,2CAAyB;AACzB,kDAAgC;AAChC,uDAAqC;AACrC,oDAAkC;AAClC,kDAAgC;AAChC,0DAAwC;AACxC,iDAA+B;AAC/B,2DAAyC;AACzC,uDAAqC;AACrC,uDAAqC;AACrC,iDAA+B;AAC/B,8CAA4B;AAC5B,qDAAmC;AACnC,0CAAwB;AACxB,kDAAgC;AAChC,yCAAuB;AACvB,4DAA0C;AAC1C,kDAAgC;AAChC,iDAA+B;AAC/B,2CAAyB;AACzB,4DAA0C;AAC1C,oEAAiD;AACjD,yEAAuD;AACvD,kEAAgD;AAChD,kEAAgD;AAChD,oEAAkD;AAClD,yGAAuF;AACvF,0GAAwF;AACxF,+FAA6E;AAC7E,4DAA0C;AAC1C,oEAAkD;AAClD,iEAA+C;AAC/C,gEAA8C;AAC9C,2EAAyD;AACzD,6CAA2B;AAC3B,+CAA6B;AAC7B,8CAA4B;AAC5B,6DAAuE;AAA9D,2IAAA,OAAO,OAAuB"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;AACA,sDAAoC;AACpC,gEAA8C;AAC9C,0DAAwC;AACxC,2DAAyC;AACzC,kDAAgC;AAChC,uDAAqC;AACrC,4DAA0C;AAC1C,2DAAyC;AAEzC,oDAAkC;AAClC,8CAA4B;AAC5B,kDAAgC;AAChC,kDAAgC;AAChC,qDAAmC;AACnC,mDAAiC;AACjC,qDAAmC;AACnC,mDAAiC;AACjC,+CAA6B;AAC7B,oDAAkC;AAClC,wCAAsB;AACtB,kDAAgC;AAChC,6CAA2B;AAC3B,oDAAkC;AAClC,4CAA0B;AAC1B,8CAA4B;AAC5B,2CAAyB;AACzB,kDAAgC;AAChC,uDAAqC;AACrC,oDAAkC;AAClC,kDAAgC;AAChC,0DAAwC;AACxC,iDAA+B;AAC/B,2DAAyC;AACzC,uDAAqC;AACrC,uDAAqC;AACrC,iDAA+B;AAC/B,8CAA4B;AAC5B,qDAAmC;AACnC,0CAAwB;AACxB,kDAAgC;AAChC,yCAAuB;AACvB,4DAA0C;AAC1C,kDAAgC;AAChC,iDAA+B;AAC/B,2CAAyB;AACzB,4DAA0C;AAC1C,oEAAiD;AACjD,yEAAuD;AACvD,kEAAgD;AAChD,kEAAgD;AAChD,oEAAkD;AAClD,yGAAuF;AACvF,0GAAwF;AACxF,+FAA6E;AAC7E,4DAA0C;AAC1C,oEAAkD;AAClD,iEAA+C;AAC/C,gEAA8C;AAC9C,2EAAyD;AACzD,6CAA2B;AAC3B,+CAA6B;AAC7B,8CAA4B;AAC5B,6DAAuE;AAA9D,2IAAA,OAAO,OAAuB"}

package/lib/pathways.d.ts

@@ -0,0 +1,170 @@
+/**
+ * Pathways: the joins between the careers library (SOC 2020), the apprenticeship
+ * mirror and the university course mirror, and what a student's own interests
+ * mean as a filter over the two.
+ *
+ * Everything routes through the 4-digit SOC 2020 unit group. Neither mirror
+ * carries one directly, so each is one hop away:
+ *
+ *   vacancy.larsCode ─► IfATE standard.occupationCode ─► skillsEngland[].stdCode ─► soc
+ *   course.commonJobs[i] (a HESA label) ─► SOC 2020 group title ─► prefix ("213")
+ *
+ * The HESA labels are SOC groups at whatever level HESA chose — mostly minor
+ * groups, a few major or unit — so a course links to a *prefix*, and both
+ * indexes carry each code's full prefix chain (`socPrefixChain`) so one exact
+ * Algolia facet term can match at any level.
+ *
+ * The functions here are pure and shared: the backend importers use the chain
+ * and the label matcher, the web uses the student-side helpers to build the
+ * "For you" filter and to say why a row matched.
+ */
+import { HeCommonJobGroup, UserData } from "./typeDefinitions";
+/**
+ * A SOC 2020 code's ancestors and itself, shortest first.
+ *
+ * Accepts a unit group, a sub-unit ("2134/03") or a preference key ("2134-03");
+ * only the leading digits count. A code shorter than four digits (a HESA label
+ * that resolved to a minor group) yields the chain up to its own length.
+ *
+ * @param {string} code the SOC 2020 code, any of the forms above.
+ * @return {string[]} e.g. ["2", "21", "213", "2134"]; empty for non-SOC input.
+ */
+export declare function socPrefixChain(code: string): string[];
+/**
+ * The form HESA labels and ONS group titles are compared in.
+ *
+ * Case, punctuation and spacing differ between the two sources ("Teaching
+ * Professionals" vs "Teaching professionals", "(RandD)" vs "(R&D)"), and one
+ * HESA label is singular where ONS is plural. Nothing semantic is done: if a
+ * future label needs more than this, it belongs in `unmatched`, not here.
+ *
+ * @param {string} title a label or group title.
+ * @return {string} the comparison key.
+ */
+export declare function normaliseSocGroupTitle(title: string): string;
+/**
+ * The SOC 2020 group a HESA common-job label names.
+ *
+ * @param {string} label the label as JOBLIST prints it.
+ * @param {{[code: string]: string}} titles the SOC hierarchy, code → title.
+ * @return {string|undefined} the group code, or undefined for a label no
+ * title matches.
+ */
+export declare function socPrefixForLabel(label: string, titles: {
+    [code: string]: string;
+}): string | undefined;
+/**
+ * The 3-digit minor groups an interest category covers, plus any unit groups
+ * filed under it by override. Sorted, so a filter built from it is stable.
+ *
+ * @param {string} category one of CAREER_LIBRARY_CATEGORIES.
+ * @return {string[]} the codes; empty for an unknown category.
+ */
+export declare function socCodesForCategory(category: string): string[];
+/** One reason a course or vacancy is recommended: a hearted job, or an
+ * interest category. */
+export type ForYouSource = {
+    kind: "job";
+    /** The preference key, so a chip can open the job page. */
+    key: string;
+    title: string;
+    /** The 4-digit SOC. */
+    codes: string[];
+} | {
+    kind: "category";
+    title: string;
+    /** The category's minor groups and overridden unit groups. */
+    codes: string[];
+};
+/**
+ * What a student's careers tab says they are interested in, as filter sources.
+ *
+ * Hearted jobs first (exact unit groups), then interest categories (sets of
+ * minor groups), in the order the student holds them. The categories are the
+ * live set if they have edited it, otherwise their latest survey answer — the
+ * same rule the library sidebar shows them under.
+ *
+ * @param {Pick<UserData, "currentJobPreferences"|"currentCareerInterests"|"aspirationHistory">} user the student.
+ * @return {ForYouSource[]} possibly empty, in which case there is nothing to recommend from.
+ */
+export declare function forYouSources(user?: Pick<UserData, "currentJobPreferences" | "currentCareerInterests" | "aspirationHistory">): ForYouSource[];
+/** The facet terms a "For you" search filters each index on. */
+export type ForYouFilter = {
+    /** Exact codes — a vacancy's chain always reaches unit level, so a
+     * hearted 2134 or an interest's 213 is matched as itself. */
+    vacancyTerms: string[];
+    /** Codes and every ancestor — a course's label can sit at any level, so
+     * a hearted 2134 must also find a course filed under "213" or "21". */
+    courseTerms: string[];
+};
+/**
+ * Turn the sources into the two term lists, deduped and sorted.
+ *
+ * @param {ForYouSource[]} sources from `forYouSources`, possibly narrowed to
+ * the chips the student tapped.
+ * @return {ForYouFilter} empty lists when there are no sources.
+ */
+export declare function forYouFilter(sources: ForYouSource[]): ForYouFilter;
+/**
+ * Which source a row is there because of.
+ *
+ * A row matches a source code when the row sits under the code (a vacancy at
+ * 2134 under an interest's 213) or the code sits under the row's own group (a
+ * course filed under "213" for a hearted 2134). Sharing an ancestor is not
+ * enough — 2211 and 2134 both start with "2" and have nothing to do with each
+ * other — so the row side is compared at the ends of its chains, never at
+ * an ancestor. The longest such overlap wins, which is what makes a hearted
+ * job beat a category covering the same minor group, and the depth comes
+ * back so a list can sort exact matches above group-level ones.
+ *
+ * @param {string[]} rowPrefixes the record's `socPrefixes`.
+ * @param {ForYouSource[]} sources the sources the filter was built from.
+ * @return {{source: ForYouSource, depth: number}|undefined} the best source,
+ * or undefined when nothing overlaps (a row from an unfiltered search).
+ */
+export declare function forYouMatch(rowPrefixes: string[] | undefined, sources: ForYouSource[]): {
+    source: ForYouSource;
+    depth: number;
+} | undefined;
+/** Why a course is recommended: the source it matched and, where the course
+ * carries its common-job groups, the group that did the matching with its
+ * share of graduates. */
+export type ForYouCourseMatch = {
+    source: ForYouSource;
+    depth: number;
+    group?: HeCommonJobGroup;
+};
+/**
+ * Which source a course matched, and through which of its common-job groups.
+ *
+ * The course's `socPrefixes` say whether it matches at all; its
+ * `commonJobGroups` say which group did it, and that group's `perc` is the
+ * figure a row quotes — "41% went into information technology professionals".
+ * Where two groups match, the deeper one wins, then the larger share. A course
+ * indexed before the groups existed still matches on its prefixes, just with
+ * no group to quote.
+ *
+ * @param {object} course the index record, or the part of it that matters.
+ * @param {string[]} [course.socPrefixes] its prefix chains.
+ * @param {HeCommonJobGroup[]} [course.commonJobGroups] its groups.
+ * @param {ForYouSource[]} sources the sources the filter was built from.
+ * @return {ForYouCourseMatch|undefined} the match, or nothing.
+ */
+export declare function forYouCourseMatch(course: {
+    socPrefixes?: string[];
+    commonJobGroups?: HeCommonJobGroup[];
+}, sources: ForYouSource[]): ForYouCourseMatch | undefined;
+/**
+ * Order recommendations so the most direct matches lead, keeping the input
+ * order (nearest first, as Algolia returns a geo search) within a depth.
+ * Items that match nothing are dropped: they can only be there because the
+ * index and the student's sources disagree, and a row with no reason reads
+ * as an advert.
+ *
+ * @param {T[]} items the hits, in the order they came back.
+ * @param {(item: T) => {depth: number}|undefined} matchOf how each matched.
+ * @return {T[]} the matched items, deepest first.
+ */
+export declare function rankForYou<T>(items: T[], matchOf: (item: T) => {
+    depth: number;
+} | undefined): T[];

package/lib/pathways.js

@@ -0,0 +1,241 @@
+"use strict";
+/**
+ * Pathways: the joins between the careers library (SOC 2020), the apprenticeship
+ * mirror and the university course mirror, and what a student's own interests
+ * mean as a filter over the two.
+ *
+ * Everything routes through the 4-digit SOC 2020 unit group. Neither mirror
+ * carries one directly, so each is one hop away:
+ *
+ *   vacancy.larsCode ─► IfATE standard.occupationCode ─► skillsEngland[].stdCode ─► soc
+ *   course.commonJobs[i] (a HESA label) ─► SOC 2020 group title ─► prefix ("213")
+ *
+ * The HESA labels are SOC groups at whatever level HESA chose — mostly minor
+ * groups, a few major or unit — so a course links to a *prefix*, and both
+ * indexes carry each code's full prefix chain (`socPrefixChain`) so one exact
+ * Algolia facet term can match at any level.
+ *
+ * The functions here are pure and shared: the backend importers use the chain
+ * and the label matcher, the web uses the student-side helpers to build the
+ * "For you" filter and to say why a row matched.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.socPrefixChain = socPrefixChain;
+exports.normaliseSocGroupTitle = normaliseSocGroupTitle;
+exports.socPrefixForLabel = socPrefixForLabel;
+exports.socCodesForCategory = socCodesForCategory;
+exports.forYouSources = forYouSources;
+exports.forYouFilter = forYouFilter;
+exports.forYouMatch = forYouMatch;
+exports.forYouCourseMatch = forYouCourseMatch;
+exports.rankForYou = rankForYou;
+const lmiCategories_1 = require("./lmiCategories");
+/**
+ * A SOC 2020 code's ancestors and itself, shortest first.
+ *
+ * Accepts a unit group, a sub-unit ("2134/03") or a preference key ("2134-03");
+ * only the leading digits count. A code shorter than four digits (a HESA label
+ * that resolved to a minor group) yields the chain up to its own length.
+ *
+ * @param {string} code the SOC 2020 code, any of the forms above.
+ * @return {string[]} e.g. ["2", "21", "213", "2134"]; empty for non-SOC input.
+ */
+function socPrefixChain(code) {
+    const digits = String(code ?? "").trim().match(/^\d{1,4}/)?.[0] ?? "";
+    return Array.from({ length: digits.length }, (_, i) => digits.slice(0, i + 1));
+}
+/**
+ * The form HESA labels and ONS group titles are compared in.
+ *
+ * Case, punctuation and spacing differ between the two sources ("Teaching
+ * Professionals" vs "Teaching professionals", "(RandD)" vs "(R&D)"), and one
+ * HESA label is singular where ONS is plural. Nothing semantic is done: if a
+ * future label needs more than this, it belongs in `unmatched`, not here.
+ *
+ * @param {string} title a label or group title.
+ * @return {string} the comparison key.
+ */
+function normaliseSocGroupTitle(title) {
+    return String(title ?? "")
+        .toLowerCase()
+        .replace(/\(randd\)/g, "(r&d)")
+        .replace(/[^a-z0-9 ]/g, "")
+        .replace(/\s+/g, " ")
+        .trim()
+        .replace(/ occupation$/, " occupations");
+}
+/**
+ * The SOC 2020 group a HESA common-job label names.
+ *
+ * @param {string} label the label as JOBLIST prints it.
+ * @param {{[code: string]: string}} titles the SOC hierarchy, code → title.
+ * @return {string|undefined} the group code, or undefined for a label no
+ * title matches.
+ */
+function socPrefixForLabel(label, titles) {
+    const wanted = normaliseSocGroupTitle(label);
+    if (!wanted)
+        return undefined;
+    for (const [code, title] of Object.entries(titles)) {
+        if (normaliseSocGroupTitle(title) === wanted)
+            return code;
+    }
+    return undefined;
+}
+/**
+ * The 3-digit minor groups an interest category covers, plus any unit groups
+ * filed under it by override. Sorted, so a filter built from it is stable.
+ *
+ * @param {string} category one of CAREER_LIBRARY_CATEGORIES.
+ * @return {string[]} the codes; empty for an unknown category.
+ */
+function socCodesForCategory(category) {
+    const codes = new Set();
+    for (const [minor, c] of Object.entries(lmiCategories_1.CAREER_CATEGORY_BY_SOC_MINOR)) {
+        if (c === category)
+            codes.add(minor);
+    }
+    for (const [unit, c] of Object.entries(lmiCategories_1.CAREER_CATEGORY_BY_SOC_UNIT)) {
+        if (c === category && !codes.has(unit.slice(0, 3)))
+            codes.add(unit);
+    }
+    return [...codes].sort();
+}
+/**
+ * What a student's careers tab says they are interested in, as filter sources.
+ *
+ * Hearted jobs first (exact unit groups), then interest categories (sets of
+ * minor groups), in the order the student holds them. The categories are the
+ * live set if they have edited it, otherwise their latest survey answer — the
+ * same rule the library sidebar shows them under.
+ *
+ * @param {Pick<UserData, "currentJobPreferences"|"currentCareerInterests"|"aspirationHistory">} user the student.
+ * @return {ForYouSource[]} possibly empty, in which case there is nothing to recommend from.
+ */
+function forYouSources(user) {
+    const sources = [];
+    const prefs = user?.currentJobPreferences ?? {};
+    Object.entries(prefs)
+        .sort(([, a], [, b]) => (a.added || "").localeCompare(b.added || ""))
+        .forEach(([key, p]) => {
+        const soc = (p.soc || key.split("-")[0] || "").trim();
+        if (!/^\d{4}$/.test(soc))
+            return;
+        sources.push({ kind: "job", key, title: p.title || soc, codes: [soc] });
+    });
+    const interests = user?.currentCareerInterests ??
+        [...(user?.aspirationHistory ?? [])]
+            .sort((a, b) => (b.date || "").localeCompare(a.date || ""))[0]?.careerInterests ??
+        [];
+    interests
+        .filter((c) => lmiCategories_1.CAREER_LIBRARY_CATEGORIES.includes(c))
+        .forEach((category) => {
+        const codes = socCodesForCategory(category);
+        if (codes.length)
+            sources.push({ kind: "category", title: category, codes });
+    });
+    return sources;
+}
+/**
+ * Turn the sources into the two term lists, deduped and sorted.
+ *
+ * @param {ForYouSource[]} sources from `forYouSources`, possibly narrowed to
+ * the chips the student tapped.
+ * @return {ForYouFilter} empty lists when there are no sources.
+ */
+function forYouFilter(sources) {
+    const vacancy = new Set();
+    const course = new Set();
+    for (const s of sources) {
+        for (const code of s.codes) {
+            vacancy.add(code);
+            socPrefixChain(code).forEach((p) => course.add(p));
+        }
+    }
+    return {
+        vacancyTerms: [...vacancy].sort(),
+        courseTerms: [...course].sort(),
+    };
+}
+/**
+ * Which source a row is there because of.
+ *
+ * A row matches a source code when the row sits under the code (a vacancy at
+ * 2134 under an interest's 213) or the code sits under the row's own group (a
+ * course filed under "213" for a hearted 2134). Sharing an ancestor is not
+ * enough — 2211 and 2134 both start with "2" and have nothing to do with each
+ * other — so the row side is compared at the ends of its chains, never at
+ * an ancestor. The longest such overlap wins, which is what makes a hearted
+ * job beat a category covering the same minor group, and the depth comes
+ * back so a list can sort exact matches above group-level ones.
+ *
+ * @param {string[]} rowPrefixes the record's `socPrefixes`.
+ * @param {ForYouSource[]} sources the sources the filter was built from.
+ * @return {{source: ForYouSource, depth: number}|undefined} the best source,
+ * or undefined when nothing overlaps (a row from an unfiltered search).
+ */
+function forYouMatch(rowPrefixes, sources) {
+    const rows = new Set(rowPrefixes ?? []);
+    // The codes the row is actually filed under: chain ends, not ancestors.
+    const leaves = [...rows].filter((p) => ![...rows].some((q) => q.length === p.length + 1 && q.startsWith(p)));
+    let best;
+    for (const source of sources) {
+        for (const code of source.codes) {
+            const depth = rows.has(code) ? code.length :
+                leaves.filter((leaf) => code.startsWith(leaf))
+                    .reduce((n, leaf) => Math.max(n, leaf.length), 0);
+            if (depth && (!best || depth > best.depth))
+                best = { source, depth };
+        }
+    }
+    return best;
+}
+/**
+ * Which source a course matched, and through which of its common-job groups.
+ *
+ * The course's `socPrefixes` say whether it matches at all; its
+ * `commonJobGroups` say which group did it, and that group's `perc` is the
+ * figure a row quotes — "41% went into information technology professionals".
+ * Where two groups match, the deeper one wins, then the larger share. A course
+ * indexed before the groups existed still matches on its prefixes, just with
+ * no group to quote.
+ *
+ * @param {object} course the index record, or the part of it that matters.
+ * @param {string[]} [course.socPrefixes] its prefix chains.
+ * @param {HeCommonJobGroup[]} [course.commonJobGroups] its groups.
+ * @param {ForYouSource[]} sources the sources the filter was built from.
+ * @return {ForYouCourseMatch|undefined} the match, or nothing.
+ */
+function forYouCourseMatch(course, sources) {
+    const overall = forYouMatch(course.socPrefixes, sources);
+    if (!overall)
+        return undefined;
+    const best = (course.commonJobGroups ?? [])
+        .filter((g) => g.prefix)
+        .map((g) => ({ group: g, match: forYouMatch(socPrefixChain(g.prefix), sources) }))
+        .filter((x) => Boolean(x.match))
+        .sort((a, b) => b.match.depth - a.match.depth ||
+        (b.group.perc ?? -1) - (a.group.perc ?? -1))[0];
+    return best ?
+        { source: best.match.source, depth: best.match.depth, group: best.group } :
+        overall;
+}
+/**
+ * Order recommendations so the most direct matches lead, keeping the input
+ * order (nearest first, as Algolia returns a geo search) within a depth.
+ * Items that match nothing are dropped: they can only be there because the
+ * index and the student's sources disagree, and a row with no reason reads
+ * as an advert.
+ *
+ * @param {T[]} items the hits, in the order they came back.
+ * @param {(item: T) => {depth: number}|undefined} matchOf how each matched.
+ * @return {T[]} the matched items, deepest first.
+ */
+function rankForYou(items, matchOf) {
+    return items
+        .map((item, index) => ({ item, index, depth: matchOf(item)?.depth ?? 0 }))
+        .filter((x) => x.depth > 0)
+        .sort((a, b) => b.depth - a.depth || a.index - b.index)
+        .map((x) => x.item);
+}
+//# sourceMappingURL=pathways.js.map

package/lib/pathways.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathways.js","sourceRoot":"","sources":["../src/pathways.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;GAmBG;;AAeH,wCAGC;AAaD,wDAQC;AAUD,8CASC;AASD,kDASC;AA6BD,sCAwBC;AAmBD,oCAaC;AAmBD,kCAiBC;AA2BD,8CAgBC;AAaD,gCAQC;AAnQD,mDAAqH;AAGrH;;;;;;;;;GASG;AACH,SAAgB,cAAc,CAAC,IAAY;IACvC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACtE,OAAO,KAAK,CAAC,IAAI,CAAC,EAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,sBAAsB,CAAC,KAAa;IAChD,OAAO,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;SACrB,WAAW,EAAE;SACb,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC;SAC9B,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC;SAC1B,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE;SACN,OAAO,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;AACjD,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,iBAAiB,CAC7B,KAAa,EAAE,MAAgC;IAE/C,MAAM,MAAM,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IAC7C,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACjD,IAAI,sBAAsB,CAAC,KAAK,CAAC,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC;IAC9D,CAAC;IACD,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,mBAAmB,CAAC,QAAgB;IAChD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,4CAA4B,CAAC,EAAE,CAAC;QACpE,IAAI,CAAC,KAAK,QAAQ;YAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,2CAA2B,CAAC,EAAE,CAAC;QAClE,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;AAC7B,CAAC;AAkBD;;;;;;;;;;GAUG;AACH,SAAgB,aAAa,CACzB,IAA2F;IAE3F,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,MAAM,KAAK,GAA0B,IAAI,EAAE,qBAAqB,IAAI,EAAE,CAAC;IACvE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;SAChB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;SACpE,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE;QAClB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACtD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO;QACjC,OAAO,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEP,MAAM,SAAS,GAAG,IAAI,EAAE,sBAAsB;QAC1C,CAAC,GAAG,CAAC,IAAI,EAAE,iBAAiB,IAAI,EAAE,CAAC,CAAC;aAC/B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,eAAe;QACnF,EAAE,CAAC;IACP,SAAS;SACJ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,yCAAyB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;SACpD,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;QAClB,MAAM,KAAK,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,KAAK,CAAC,MAAM;YAAE,OAAO,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;IACP,OAAO,OAAO,CAAC;AACnB,CAAC;AAYD;;;;;;GAMG;AACH,SAAgB,YAAY,CAAC,OAAuB;IAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,cAAc,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;IACL,CAAC;IACD,OAAO;QACH,YAAY,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE;QACjC,WAAW,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE;KAClC,CAAC;AACN,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAgB,WAAW,CACvB,WAA+B,EAAE,OAAuB;IAExD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC;IACxC,wEAAwE;IACxE,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAClC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,IAAqD,CAAC;IAC1D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACxC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;qBACzC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1D,IAAI,KAAK,IAAI,CAAC,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;gBAAE,IAAI,GAAG,EAAC,MAAM,EAAE,KAAK,EAAC,CAAC;QACvE,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC;AAWD;;;;;;;;;;;;;;;GAeG;AACH,SAAgB,iBAAiB,CAC7B,MAAsE,EACtE,OAAuB;IAEvB,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IACzD,IAAI,CAAC,OAAO;QAAE,OAAO,SAAS,CAAC;IAC/B,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,eAAe,IAAI,EAAE,CAAC;SACtC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;SACvB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,cAAc,CAAC,CAAC,CAAC,MAAgB,CAAC,EAAE,OAAO,CAAC,EAAC,CAAC,CAAC;SACzF,MAAM,CAAC,CAAC,CAAC,EAAgF,EAAE,CACxF,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;SACpB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK;QACzC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,OAAO,IAAI,CAAC,CAAC;QACT,EAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAC,CAAC,CAAC;QACzE,OAAO,CAAC;AAChB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,UAAU,CACtB,KAAU,EAAE,OAA+C;IAE3D,OAAO,KAAK;SACP,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,EAAC,CAAC,CAAC;SACvE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;SAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACtD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC"}

package/lib/pathways.test.d.ts

@@ -0,0 +1 @@
+export {};