careerclaw-js 0.11.0

package/dist/core/text-processing.js

@@ -0,0 +1,187 @@
+/**
+ * core/text-processing.ts — Shared text processing utilities.
+ *
+ * Used by the matching engine (Phase 4), resume intelligence (Phase 5),
+ * and gap analysis (Phase 5). All functions are pure and stateless.
+ *
+ * Design notes:
+ * - No external NLP dependencies — stopword logic is ported directly
+ *   from the Python careerclaw implementation.
+ * - STOPWORDS is the single source of truth. No parallel lists.
+ * - Phrases are sliding-window bigrams and trigrams over the token stream.
+ * - SECTION_WEIGHTS drives keyword importance in resume intelligence (Phase 5).
+ */
+// ---------------------------------------------------------------------------
+// Stopwords
+// ---------------------------------------------------------------------------
+/**
+ * Combined stopword set: common English function words + recruitment
+ * boilerplate terms that carry zero signal value for job matching.
+ *
+ * Recruitment boilerplate sourced from PR-E signal hygiene analysis
+ * (February 2026): terms that appeared consistently in gap keyword lists
+ * despite having no technical meaning.
+ */
+export const STOPWORDS = new Set([
+    // Common English function words
+    "a", "an", "the", "and", "or", "but", "in", "on", "at", "to", "for",
+    "of", "with", "by", "from", "as", "is", "was", "are", "were", "be",
+    "been", "being", "am", "have", "has", "had", "do", "does", "did", "will",
+    "would", "could", "should", "may", "might", "shall", "can", "need",
+    "dare", "ought", "used", "it", "its", "this", "that", "these", "those",
+    "i", "you", "he", "she", "we", "they", "me", "him", "her", "us",
+    // Contractions
+    "i'm", "i've", "i'll", "i'd", "you're", "we're", "they're", "it's",
+    "don't", "doesn't", "can't", "won't", "isn't", "aren't", "wasn't", "weren't",
+    "them", "my", "your", "his", "our", "their", "what", "which", "who",
+    "whom", "when", "where", "why", "how", "all", "each", "every", "both",
+    "few", "more", "most", "other", "some", "such", "no", "not", "only",
+    "same", "so", "than", "too", "very", "just", "about", "above", "after",
+    "also", "between", "during", "into", "through", "up", "out", "if",
+    "while", "then", "than", "there", "here", "any", "now", "new", "well",
+    "back", "even", "still", "way", "take", "get", "make", "know", "time",
+    "year", "day", "part", "over", "many", "much", "own", "go", "see",
+    "come", "think", "look", "want", "give", "use", "find", "tell", "ask",
+    "work", "seem", "feel", "try", "leave", "call", "keep", "let", "begin",
+    "show", "hear", "play", "run", "move", "live", "believe", "hold",
+    "bring", "happen", "write", "provide", "sit", "stand", "lose", "pay",
+    "meet", "include", "continue", "set", "learn", "change", "lead",
+    "understand", "watch", "follow", "stop", "create", "speak", "read",
+    "spend", "grow", "open", "walk", "win", "offer", "remember", "love",
+    "consider", "appear", "buy", "wait", "serve", "die", "send", "expect",
+    "build", "stay", "fall", "cut", "reach", "kill", "remain", "suggest",
+    "raise", "pass", "sell", "require", "report", "decide", "pull", "based",
+    "able", "across", "against", "along", "already", "although", "among",
+    "around", "away", "because", "before", "below", "beside", "beyond",
+    "down", "early", "enough", "ever", "first", "further", "however", "last",
+    "late", "later", "least", "less", "like", "long", "near", "never",
+    "next", "often", "once", "our", "per", "quite", "rather", "since",
+    "soon", "still", "though", "together", "under", "until", "upon",
+    "usually", "whether", "within", "without", "yet", "second", "third",
+    // Recruitment process terms (PR-E signal hygiene)
+    "apply", "applying", "applicant", "applicants", "application",
+    "applications", "submit", "submission", "submissions",
+    "candidate", "candidates", "qualified", "successful", "shortlisted",
+    "interview", "interviewing", "hire", "hiring", "onboard", "onboarding",
+    "recruit", "recruiting", "recruitment",
+    // Generic descriptor terms (PR-E signal hygiene)
+    "competitive", "opportunity", "opportunities", "benefit", "benefits",
+    "package", "responsible", "responsibilities", "responsibility",
+    "seeking", "looking", "plus", "bonus", "nice-to-have", "preferred",
+    "required", "requirement", "requirements", "experience", "years",
+    "role", "roles", "position", "positions", "team", "teams", "company",
+    "companies", "business", "businesses", "product", "products",
+    "mission", "vision", "values", "culture", "environment", "office",
+    "full-time", "part-time", "contract", "permanent", "temporary",
+    "salary", "compensation", "equity", "stock", "options", "remote",
+    "hybrid", "onsite", "location", "worldwide", "anywhere", "global",
+    "join", "help", "love", "great", "good", "best", "strong", "deep",
+    "high", "low", "fast", "smart", "care", "important", "key", "top",
+    "amazing", "excellent", "outstanding", "exceptional", "passionate",
+    "driven", "motivated", "collaborative", "dynamic", "innovative",
+    "exciting", "unique", "diverse", "inclusive", "equal", "opportunity",
+]);
+// ---------------------------------------------------------------------------
+// Section weights
+// ---------------------------------------------------------------------------
+/**
+ * Relative importance weights for resume sections in keyword extraction.
+ * Used by resume intelligence (Phase 5) to weight keyword scores.
+ * Skills = 1.0 is the maximum weight.
+ */
+export const SECTION_WEIGHTS = {
+    skills: 1.0,
+    summary: 0.8,
+    experience: 0.6,
+    education: 0.4,
+    other: 0.3,
+};
+// ---------------------------------------------------------------------------
+// Tokenization
+// ---------------------------------------------------------------------------
+/**
+ * Tokenize a text string into a filtered array of lowercase tokens.
+ *
+ * Steps:
+ *   1. Lowercase
+ *   2. Split on non-alphanumeric boundaries (preserves hyphenated terms)
+ *   3. Strip leading/trailing punctuation from each token
+ *   4. Drop tokens shorter than MIN_TOKEN_LENGTH
+ *   5. Drop stopwords
+ */
+const MIN_TOKEN_LENGTH = 2;
+export function tokenize(text) {
+    return text
+        .toLowerCase()
+        .split(/[\s,;:!?()[\]{}<>"]+/)
+        .map((t) => t.replace(/^[^a-z0-9-]+|[^a-z0-9-]+$/g, ""))
+        .filter((t) => t.length >= MIN_TOKEN_LENGTH && !STOPWORDS.has(t));
+}
+/**
+ * Tokenize and return only unique tokens (set semantics, insertion order).
+ * Useful for keyword overlap scoring where duplicates add no information.
+ */
+export function tokenizeUnique(text) {
+    return [...new Set(tokenize(text))];
+}
+// ---------------------------------------------------------------------------
+// Phrase extraction
+// ---------------------------------------------------------------------------
+/**
+ * Extract bigrams and trigrams from a token stream.
+ *
+ * Tokens are joined with a space: ["senior", "engineer"] → "senior engineer".
+ * Phrases from short token streams (< 2 tokens) are returned as empty array.
+ */
+export function extractPhrases(tokens) {
+    const phrases = [];
+    for (let i = 0; i < tokens.length - 1; i++) {
+        // Bigram
+        phrases.push(`${tokens[i]} ${tokens[i + 1]}`);
+        // Trigram
+        if (i < tokens.length - 2) {
+            phrases.push(`${tokens[i]} ${tokens[i + 1]} ${tokens[i + 2]}`);
+        }
+    }
+    return phrases;
+}
+/**
+ * Tokenize text and extract bigram + trigram phrases in one pass.
+ * Returns unique phrases (insertion order).
+ */
+export function extractPhrasesFromText(text) {
+    return [...new Set(extractPhrases(tokenize(text)))];
+}
+// ---------------------------------------------------------------------------
+// Keyword overlap
+// ---------------------------------------------------------------------------
+/**
+ * Compute the Jaccard-like overlap between two token sets.
+ * Returns a value in [0, 1]: |intersection| / |union|.
+ */
+export function tokenOverlap(a, b) {
+    if (a.length === 0 && b.length === 0)
+        return 0;
+    const setA = new Set(a);
+    const setB = new Set(b);
+    const intersection = a.filter((t) => setB.has(t)).length;
+    const union = new Set([...setA, ...setB]).size;
+    return union === 0 ? 0 : intersection / union;
+}
+/**
+ * Return tokens in `query` that are present in `corpus`.
+ * Used to produce "matched_keywords" in ScoredJob.
+ */
+export function matchedTokens(query, corpus) {
+    const corpusSet = new Set(corpus);
+    return [...new Set(query.filter((t) => corpusSet.has(t)))];
+}
+/**
+ * Return tokens in `query` that are absent from `corpus`.
+ * Used to produce "gap_keywords" in ScoredJob.
+ */
+export function gapTokens(query, corpus) {
+    const corpusSet = new Set(corpus);
+    return [...new Set(query.filter((t) => !corpusSet.has(t)))];
+}
+//# sourceMappingURL=text-processing.js.map

package/dist/core/text-processing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-processing.js","sourceRoot":"","sources":["../../src/core/text-processing.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,SAAS,GAAwB,IAAI,GAAG,CAAC;IACpD,gCAAgC;IAChC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;IACnE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI;IAClE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IACxE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM;IAClE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACtE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;IAC/D,eAAe;IACf,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM;IAClE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS;IAC5E,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;IACnE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM;IACrE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM;IACnE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;IACtE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;IACjE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IACrE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IACrE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK;IACjE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK;IACrE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO;IACtE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM;IAChE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK;IACpE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM;IAC/D,YAAY,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM;IAClE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM;IACnE,UAAU,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ;IACrE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS;IACpE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO;IACvE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO;IACpE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ;IAClE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM;IACxE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IACjE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO;IACjE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM;IAC/D,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO;IAEnE,kDAAkD;IAClD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa;IAC7D,cAAc,EAAE,QAAQ,EAAE,YAAY,EAAE,aAAa;IACrD,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,aAAa;IACnE,WAAW,EAAE,cAAc,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,YAAY;IACtE,SAAS,EAAE,YAAY,EAAE,aAAa;IAEtC,iDAAiD;IACjD,aAAa,EAAE,aAAa,EAAE,eAAe,EAAE,SAAS,EAAE,UAAU;IACpE,SAAS,EAAE,aAAa,EAAE,kBAAkB,EAAE,gBAAgB;IAC9D,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc,EAAE,WAAW;IAClE,UAAU,EAAE,aAAa,EAAE,cAAc,EAAE,YAAY,EAAE,OAAO;IAChE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS;IACpE,WAAW,EAAE,UAAU,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU;IAC5D,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,QAAQ;IACjE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW;IAC9D,QAAQ,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ;IAChE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ;IACjE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;IACjE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK;IACjE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,YAAY;IAClE,QAAQ,EAAE,WAAW,EAAE,eAAe,EAAE,SAAS,EAAE,YAAY;IAC/D,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,aAAa;CACrE,CAAC,CAAC;AAEH,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;;GAIG;AACH,MAAM,CAAC,MAAM,eAAe,GAAqC;IAC/D,MAAM,EAAE,GAAG;IACX,OAAO,EAAE,GAAG;IACZ,UAAU,EAAE,GAAG;IACf,SAAS,EAAE,GAAG;IACd,KAAK,EAAE,GAAG;CACX,CAAC;AAEF,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;;;GASG;AACH,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAE3B,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,KAAK,CAAC,sBAAsB,CAAC;SAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,4BAA4B,EAAE,EAAE,CAAC,CAAC;SACvD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,gBAAgB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACtE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY;IACzC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACtC,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,MAAgB;IAC7C,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,SAAS;QACT,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAE9C,UAAU;QACV,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAAY;IACjD,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,CAAW,EAAE,CAAW;IACnD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACzD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAe,EAAE,MAAgB;IAC7D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAClC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,KAAe,EAAE,MAAgB;IACzD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IAClC,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC"}

package/dist/drafting.d.ts

@@ -0,0 +1,28 @@
+/**
+ * drafting.ts — Deterministic outreach draft generator (Free tier).
+ *
+ * `draftOutreach()` produces a professional outreach email from a fixed
+ * template. It is the Free tier baseline and always runs as the fallback
+ * when LLM enhancement is unavailable or fails.
+ *
+ * Template is ported directly from the Python careerclaw implementation
+ * so output format is consistent across both runtimes.
+ *
+ * Design constraints (from MVP Feature Contract):
+ *   - 150–250 word body
+ *   - Professional and concise tone
+ *   - Inserts job title, company name, matched skill highlights
+ *   - No external dependencies, fully deterministic
+ *   - llm_enhanced is always false
+ */
+import type { NormalizedJob, UserProfile, OutreachDraft } from "./models.js";
+/**
+ * Generate a deterministic outreach draft for a ranked job.
+ *
+ * @param job             - The job to draft for
+ * @param profile         - User profile (experience_years used in body)
+ * @param matchedKeywords - Matched keywords from ScoredJob or GapAnalysis
+ *                          (up to 3 are highlighted in the body)
+ */
+export declare function draftOutreach(job: NormalizedJob, profile: UserProfile, matchedKeywords?: string[]): OutreachDraft;
+//# sourceMappingURL=drafting.d.ts.map

package/dist/drafting.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"drafting.d.ts","sourceRoot":"","sources":["../src/drafting.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAM7E;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,GAAG,EAAE,aAAa,EAClB,OAAO,EAAE,WAAW,EACpB,eAAe,GAAE,MAAM,EAAO,GAC7B,aAAa,CAUf"}

package/dist/drafting.js

@@ -0,0 +1,116 @@
+/**
+ * drafting.ts — Deterministic outreach draft generator (Free tier).
+ *
+ * `draftOutreach()` produces a professional outreach email from a fixed
+ * template. It is the Free tier baseline and always runs as the fallback
+ * when LLM enhancement is unavailable or fails.
+ *
+ * Template is ported directly from the Python careerclaw implementation
+ * so output format is consistent across both runtimes.
+ *
+ * Design constraints (from MVP Feature Contract):
+ *   - 150–250 word body
+ *   - Professional and concise tone
+ *   - Inserts job title, company name, matched skill highlights
+ *   - No external dependencies, fully deterministic
+ *   - llm_enhanced is always false
+ */
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Generate a deterministic outreach draft for a ranked job.
+ *
+ * @param job             - The job to draft for
+ * @param profile         - User profile (experience_years used in body)
+ * @param matchedKeywords - Matched keywords from ScoredJob or GapAnalysis
+ *                          (up to 3 are highlighted in the body)
+ */
+export function draftOutreach(job, profile, matchedKeywords = []) {
+    const subject = buildSubject(job);
+    const body = buildBody(job, profile, matchedKeywords);
+    return {
+        job_id: job.job_id,
+        subject,
+        body,
+        llm_enhanced: false,
+    };
+}
+// ---------------------------------------------------------------------------
+// Template builders
+// ---------------------------------------------------------------------------
+function buildSubject(job) {
+    return `Interest in ${job.title} at ${job.company}`;
+}
+function buildBody(job, profile, matchedKeywords) {
+    const experienceClause = buildExperienceClause(profile);
+    const highlightsClause = buildHighlightsClause(matchedKeywords, job);
+    return [
+        `Hi ${job.company} team,`,
+        "",
+        `I'm reaching out to express interest in the ${job.title} role at ${job.company}. ` +
+            `I have ${experienceClause} building production systems end-to-end, with a consistent ` +
+            `focus on code quality, system reliability, and close collaboration with product and ` +
+            `design stakeholders. I've worked across the full lifecycle from early architecture ` +
+            `through operational ownership.`,
+        "",
+        highlightsClause,
+        "",
+        "That aligns well with my background, including:",
+        "- Delivering production-ready features with strong ownership and " +
+            "attention to reliability",
+        "- Writing clear, maintainable code and collaborating closely with " +
+            "stakeholders",
+        "- Diagnosing issues quickly and improving systems through good " +
+            "instrumentation and feedback loops",
+        "",
+        "If helpful, I can share a brief summary of relevant work and walk " +
+            "you through how I'd approach the first 30 days in this role. " +
+            "I'm happy to answer any questions about my background. " +
+            "Thanks for your time — I'd love to connect.",
+        "",
+        "Best regards,",
+        "[Your Name]",
+    ].join("\n");
+}
+/**
+ * Build the experience clause from profile.experience_years.
+ * Falls back to "extensive experience" when not set.
+ */
+function buildExperienceClause(profile) {
+    if (profile.experience_years === null || profile.experience_years === undefined) {
+        return "extensive experience";
+    }
+    return `${profile.experience_years}+ years of experience`;
+}
+/**
+ * Build the skill highlights sentence from matched keywords.
+ * Uses up to 3 keywords. Falls back to a generic sentence if none.
+ */
+function buildHighlightsClause(matchedKeywords, job) {
+    const highlights = matchedKeywords.slice(0, 3);
+    if (highlights.length === 0) {
+        return (`My background includes skills directly relevant to the ${job.title} ` +
+            `role, and I believe my experience would translate well to the ` +
+            `challenges your team is working on.`);
+    }
+    const formatted = formatList(highlights);
+    return `My background includes direct experience with ${formatted}, ` +
+        `which maps well to what you're building at ${job.company}.`;
+}
+/**
+ * Format a list of strings as natural language.
+ * ["a"] → "a"
+ * ["a", "b"] → "a and b"
+ * ["a", "b", "c"] → "a, b, and c"
+ */
+function formatList(items) {
+    if (items.length === 0)
+        return "";
+    if (items.length === 1)
+        return items[0];
+    if (items.length === 2)
+        return `${items[0]} and ${items[1]}`;
+    return `${items.slice(0, -1).join(", ")}, and ${items[items.length - 1]}`;
+}
+//# sourceMappingURL=drafting.js.map

package/dist/drafting.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"drafting.js","sourceRoot":"","sources":["../src/drafting.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,GAAkB,EAClB,OAAoB,EACpB,kBAA4B,EAAE;IAE9B,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC;IAEtD,OAAO;QACL,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,OAAO;QACP,IAAI;QACJ,YAAY,EAAE,KAAK;KACpB,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E,SAAS,YAAY,CAAC,GAAkB;IACtC,OAAO,eAAe,GAAG,CAAC,KAAK,OAAO,GAAG,CAAC,OAAO,EAAE,CAAC;AACtD,CAAC;AAED,SAAS,SAAS,CAChB,GAAkB,EAClB,OAAoB,EACpB,eAAyB;IAEzB,MAAM,gBAAgB,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;IACxD,MAAM,gBAAgB,GAAG,qBAAqB,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;IAErE,OAAO;QACL,MAAM,GAAG,CAAC,OAAO,QAAQ;QACzB,EAAE;QACF,+CAA+C,GAAG,CAAC,KAAK,YAAY,GAAG,CAAC,OAAO,IAAI;YACjF,UAAU,gBAAgB,6DAA6D;YACvF,sFAAsF;YACtF,qFAAqF;YACrF,gCAAgC;QAClC,EAAE;QACF,gBAAgB;QAChB,EAAE;QACF,iDAAiD;QACjD,mEAAmE;YACjE,0BAA0B;QAC5B,oEAAoE;YAClE,cAAc;QAChB,iEAAiE;YAC/D,oCAAoC;QACtC,EAAE;QACF,oEAAoE;YAClE,+DAA+D;YAC/D,yDAAyD;YACzD,6CAA6C;QAC/C,EAAE;QACF,eAAe;QACf,aAAa;KACd,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAAC,OAAoB;IACjD,IAAI,OAAO,CAAC,gBAAgB,KAAK,IAAI,IAAI,OAAO,CAAC,gBAAgB,KAAK,SAAS,EAAE,CAAC;QAChF,OAAO,sBAAsB,CAAC;IAChC,CAAC;IACD,OAAO,GAAG,OAAO,CAAC,gBAAgB,uBAAuB,CAAC;AAC5D,CAAC;AAED;;;GAGG;AACH,SAAS,qBAAqB,CAC5B,eAAyB,EACzB,GAAkB;IAElB,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE/C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,CACL,0DAA0D,GAAG,CAAC,KAAK,GAAG;YACtE,gEAAgE;YAChE,qCAAqC,CACtC,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;IACzC,OAAO,iDAAiD,SAAS,IAAI;QACnE,8CAA8C,GAAG,CAAC,OAAO,GAAG,CAAC;AACjE,CAAC;AAED;;;;;GAKG;AACH,SAAS,UAAU,CAAC,KAAe;IACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC,CAAC,CAAE,CAAC;IACzC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7D,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;AAC5E,CAAC"}

package/dist/gap.d.ts

@@ -0,0 +1,27 @@
+/**
+ * gap.ts — Gap analysis engine.
+ *
+ * `gapAnalysis()` compares resume intelligence against job requirements
+ * to produce:
+ *   - fit_score         (weighted: rewards high-weight resume keywords)
+ *   - fit_score_unweighted (Jaccard overlap — raw coverage)
+ *   - signals           (resume keywords/phrases present in the job)
+ *   - gaps              (job keywords/phrases absent from the resume)
+ *   - summary           (top-5 of each for display)
+ *
+ * This is a Pro tier feature. It is called after `rankJobs()` and its
+ * output supplements the `ScoredJob` with resume-specific insight.
+ *
+ * Fit score interpretation (from README):
+ *   >= 40% — strong match
+ *   Practical ceiling ~50% due to company/location tokens in denominator
+ */
+import type { NormalizedJob, ResumeIntelligence, GapAnalysisResult } from "./models.js";
+/**
+ * Run gap analysis between resume intelligence and a job posting.
+ *
+ * @param intel - Output of `buildResumeIntelligence()`
+ * @param job   - The job to analyse against
+ */
+export declare function gapAnalysis(intel: ResumeIntelligence, job: NormalizedJob): GapAnalysisResult;
+//# sourceMappingURL=gap.d.ts.map

package/dist/gap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"gap.d.ts","sourceRoot":"","sources":["../src/gap.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAaxF;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,kBAAkB,EACzB,GAAG,EAAE,aAAa,GACjB,iBAAiB,CA0DnB"}

package/dist/gap.js

@@ -0,0 +1,90 @@
+/**
+ * gap.ts — Gap analysis engine.
+ *
+ * `gapAnalysis()` compares resume intelligence against job requirements
+ * to produce:
+ *   - fit_score         (weighted: rewards high-weight resume keywords)
+ *   - fit_score_unweighted (Jaccard overlap — raw coverage)
+ *   - signals           (resume keywords/phrases present in the job)
+ *   - gaps              (job keywords/phrases absent from the resume)
+ *   - summary           (top-5 of each for display)
+ *
+ * This is a Pro tier feature. It is called after `rankJobs()` and its
+ * output supplements the `ScoredJob` with resume-specific insight.
+ *
+ * Fit score interpretation (from README):
+ *   >= 40% — strong match
+ *   Practical ceiling ~50% due to company/location tokens in denominator
+ */
+import { extractJobRequirements } from "./requirements.js";
+// ---------------------------------------------------------------------------
+// Constants
+// ---------------------------------------------------------------------------
+const TOP_N = 5;
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Run gap analysis between resume intelligence and a job posting.
+ *
+ * @param intel - Output of `buildResumeIntelligence()`
+ * @param job   - The job to analyse against
+ */
+export function gapAnalysis(intel, job) {
+    const requirements = extractJobRequirements(job);
+    const jobKeywordSet = new Set(requirements.keywords);
+    const jobPhraseSet = new Set(requirements.phrases);
+    const resumeKeywordSet = new Set(intel.extracted_keywords);
+    const resumePhraseSet = new Set(intel.extracted_phrases);
+    // ---- Signals (resume ∩ job) ----
+    const signalKeywords = intel.extracted_keywords.filter((k) => jobKeywordSet.has(k));
+    const signalPhrases = intel.extracted_phrases.filter((p) => jobPhraseSet.has(p));
+    // ---- Gaps (job − resume) ----
+    const gapKeywords = requirements.keywords.filter((k) => !resumeKeywordSet.has(k));
+    const gapPhrases = requirements.phrases.filter((p) => !resumePhraseSet.has(p));
+    // ---- Fit score (weighted) ----
+    // Sum the keyword_weight of each matched keyword / total job keyword count
+    const jobKeywordCount = requirements.keywords.length;
+    let weightedMatchSum = 0;
+    for (const kw of signalKeywords) {
+        weightedMatchSum += intel.keyword_weights[kw] ?? 0;
+    }
+    const fit_score = jobKeywordCount > 0
+        ? roundScore(weightedMatchSum / jobKeywordCount)
+        : 0;
+    // ---- Fit score (unweighted / Jaccard) ----
+    const unionSize = new Set([
+        ...intel.extracted_keywords,
+        ...requirements.keywords,
+    ]).size;
+    const fit_score_unweighted = unionSize > 0 ? roundScore(signalKeywords.length / unionSize) : 0;
+    return {
+        fit_score,
+        fit_score_unweighted,
+        signals: {
+            keywords: signalKeywords,
+            phrases: signalPhrases,
+        },
+        gaps: {
+            keywords: gapKeywords,
+            phrases: gapPhrases,
+        },
+        summary: {
+            top_signals: {
+                keywords: signalKeywords.slice(0, TOP_N),
+                phrases: signalPhrases.slice(0, TOP_N),
+            },
+            top_gaps: {
+                keywords: gapKeywords.slice(0, TOP_N),
+                phrases: gapPhrases.slice(0, TOP_N),
+            },
+        },
+    };
+}
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+function roundScore(n) {
+    return Math.round(n * 10_000) / 10_000;
+}
+//# sourceMappingURL=gap.js.map

package/dist/gap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gap.js","sourceRoot":"","sources":["../src/gap.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,OAAO,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAE3D,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,MAAM,KAAK,GAAG,CAAC,CAAC;AAEhB,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,KAAyB,EACzB,GAAkB;IAElB,MAAM,YAAY,GAAG,sBAAsB,CAAC,GAAG,CAAC,CAAC;IAEjD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;IACrD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;IACnD,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;IAC3D,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAEzD,mCAAmC;IACnC,MAAM,cAAc,GAAG,KAAK,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpF,MAAM,aAAa,GAAG,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjF,gCAAgC;IAChC,MAAM,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAClF,MAAM,UAAU,GAAG,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/E,iCAAiC;IACjC,2EAA2E;IAC3E,MAAM,eAAe,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC;IACrD,IAAI,gBAAgB,GAAG,CAAC,CAAC;IACzB,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;QAChC,gBAAgB,IAAI,KAAK,CAAC,eAAe,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC;IACD,MAAM,SAAS,GACb,eAAe,GAAG,CAAC;QACjB,CAAC,CAAC,UAAU,CAAC,gBAAgB,GAAG,eAAe,CAAC;QAChD,CAAC,CAAC,CAAC,CAAC;IAER,6CAA6C;IAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;QACxB,GAAG,KAAK,CAAC,kBAAkB;QAC3B,GAAG,YAAY,CAAC,QAAQ;KACzB,CAAC,CAAC,IAAI,CAAC;IACR,MAAM,oBAAoB,GACxB,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpE,OAAO;QACL,SAAS;QACT,oBAAoB;QACpB,OAAO,EAAE;YACP,QAAQ,EAAE,cAAc;YACxB,OAAO,EAAE,aAAa;SACvB;QACD,IAAI,EAAE;YACJ,QAAQ,EAAE,WAAW;YACrB,OAAO,EAAE,UAAU;SACpB;QACD,OAAO,EAAE;YACP,WAAW,EAAE;gBACX,QAAQ,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;gBACxC,OAAO,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACvC;YACD,QAAQ,EAAE;gBACR,QAAQ,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;gBACrC,OAAO,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACpC;SACF;KACF,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,SAAS,UAAU,CAAC,CAAS;IAC3B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,MAAM,CAAC;AACzC,CAAC"}

package/dist/license.d.ts

@@ -0,0 +1,40 @@
+/**
+ * license.ts — Gumroad Pro license validation with offline cache.
+ *
+ * `checkLicense(key, options?)` validates a CareerClaw Pro license key
+ * against the Gumroad API and caches the result for 7 days so the tool
+ * works normally during short network outages.
+ *
+ * Design principles:
+ *   - Raw key NEVER written to disk — only sha256(key) is cached.
+ *   - Graceful degradation: if Gumroad is unreachable and the cache is
+ *     fresh (< LICENSE_CACHE_TTL_MS), the cached result is trusted.
+ *   - Free tier safe: if GUMROAD_PRODUCT_ID is not configured, returns
+ *     { valid: false, source: "none" } immediately without erroring.
+ *   - Testable: fetchFn and cachePath are injectable for offline tests.
+ */
+export interface LicenseResult {
+    valid: boolean;
+    /** Where the result came from. */
+    source: "api" | "cache" | "none";
+}
+export interface CheckLicenseOptions {
+    /** Injectable fetch — defaults to global fetch. */
+    fetchFn?: typeof fetch;
+    /** Override cache file path — for tests using a tmpdir. */
+    cachePath?: string;
+}
+/**
+ * Validate a CareerClaw Pro license key.
+ *
+ * Resolution order:
+ *   1. If GUMROAD_PRODUCT_ID is unset → { valid: false, source: "none" }
+ *   2. POST to Gumroad API (increment_uses_count=false)
+ *      - success + not refunded + not chargebacked → cache hash, return api
+ *      - refunded / chargebacked / not found → { valid: false, source: "api" }
+ *   3. On network failure → read cache
+ *      - hash matches + age < TTL → { valid: true, source: "cache" }
+ *      - stale, missing, or hash mismatch → { valid: false, source: "none" }
+ */
+export declare function checkLicense(key: string, options?: CheckLicenseOptions): Promise<LicenseResult>;
+//# sourceMappingURL=license.d.ts.map

package/dist/license.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"license.d.ts","sourceRoot":"","sources":["../src/license.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAiBH,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,OAAO,CAAC;IACf,kCAAkC;IAClC,MAAM,EAAE,KAAK,GAAG,OAAO,GAAG,MAAM,CAAC;CAClC;AAED,MAAM,WAAW,mBAAmB;IAClC,mDAAmD;IACnD,OAAO,CAAC,EAAE,OAAO,KAAK,CAAC;IACvB,2DAA2D;IAC3D,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAaD;;;;;;;;;;;GAWG;AACH,wBAAsB,YAAY,CAChC,GAAG,EAAE,MAAM,EACX,OAAO,GAAE,mBAAwB,GAChC,OAAO,CAAC,aAAa,CAAC,CAoBxB"}

package/dist/license.js

@@ -0,0 +1,122 @@
+/**
+ * license.ts — Gumroad Pro license validation with offline cache.
+ *
+ * `checkLicense(key, options?)` validates a CareerClaw Pro license key
+ * against the Gumroad API and caches the result for 7 days so the tool
+ * works normally during short network outages.
+ *
+ * Design principles:
+ *   - Raw key NEVER written to disk — only sha256(key) is cached.
+ *   - Graceful degradation: if Gumroad is unreachable and the cache is
+ *     fresh (< LICENSE_CACHE_TTL_MS), the cached result is trusted.
+ *   - Free tier safe: if GUMROAD_PRODUCT_ID is not configured, returns
+ *     { valid: false, source: "none" } immediately without erroring.
+ *   - Testable: fetchFn and cachePath are injectable for offline tests.
+ */
+import { createHash } from "node:crypto";
+import { readFileSync, writeFileSync, mkdirSync } from "node:fs";
+import { dirname } from "node:path";
+import { GUMROAD_API_BASE, GUMROAD_PRODUCT_ID, LICENSE_CACHE_PATH, LICENSE_CACHE_TTL_MS, HTTP_TIMEOUT_MS, } from "./config.js";
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+/**
+ * Validate a CareerClaw Pro license key.
+ *
+ * Resolution order:
+ *   1. If GUMROAD_PRODUCT_ID is unset → { valid: false, source: "none" }
+ *   2. POST to Gumroad API (increment_uses_count=false)
+ *      - success + not refunded + not chargebacked → cache hash, return api
+ *      - refunded / chargebacked / not found → { valid: false, source: "api" }
+ *   3. On network failure → read cache
+ *      - hash matches + age < TTL → { valid: true, source: "cache" }
+ *      - stale, missing, or hash mismatch → { valid: false, source: "none" }
+ */
+export async function checkLicense(key, options = {}) {
+    const fetchFn = options.fetchFn ?? fetch;
+    const cachePath = options.cachePath ?? LICENSE_CACHE_PATH;
+    // Guard: product ID must be configured
+    if (!GUMROAD_PRODUCT_ID) {
+        return { valid: false, source: "none" };
+    }
+    // Attempt live API validation
+    try {
+        const result = await verifyWithApi(key, GUMROAD_PRODUCT_ID, fetchFn);
+        if (result.valid) {
+            writeCache(key, cachePath);
+        }
+        return result;
+    }
+    catch {
+        // Network failure — fall back to cache
+        return readCache(key, cachePath);
+    }
+}
+async function verifyWithApi(key, productId, fetchFn) {
+    const body = new URLSearchParams({
+        product_id: productId,
+        license_key: key,
+        increment_uses_count: "false",
+    });
+    const res = await fetchFn(`${GUMROAD_API_BASE}/v2/licenses/verify`, {
+        method: "POST",
+        headers: { "Content-Type": "application/x-www-form-urlencoded" },
+        body: body.toString(),
+        signal: AbortSignal.timeout(HTTP_TIMEOUT_MS),
+    });
+    // Gumroad returns 404 for invalid/unknown keys
+    if (res.status === 404) {
+        return { valid: false, source: "api" };
+    }
+    if (!res.ok) {
+        // Non-404 HTTP errors (5xx, etc.) are treated as network failures
+        throw new Error(`Gumroad HTTP ${res.status}`);
+    }
+    const data = (await res.json());
+    if (!data.success) {
+        return { valid: false, source: "api" };
+    }
+    if (data.purchase?.refunded || data.purchase?.chargebacked) {
+        return { valid: false, source: "api" };
+    }
+    return { valid: true, source: "api" };
+}
+// ---------------------------------------------------------------------------
+// Cache helpers
+// ---------------------------------------------------------------------------
+function hashKey(key) {
+    return createHash("sha256").update(key).digest("hex");
+}
+function writeCache(key, cachePath) {
+    try {
+        mkdirSync(dirname(cachePath), { recursive: true });
+        const cache = {
+            key_hash: hashKey(key),
+            validated_at: new Date().toISOString(),
+        };
+        writeFileSync(cachePath, JSON.stringify(cache, null, 2), "utf8");
+    }
+    catch {
+        // Cache write failure is non-fatal — validation already succeeded
+    }
+}
+function readCache(key, cachePath) {
+    try {
+        const raw = readFileSync(cachePath, "utf8");
+        const cache = JSON.parse(raw);
+        // Hash must match the key being checked
+        if (cache.key_hash !== hashKey(key)) {
+            return { valid: false, source: "none" };
+        }
+        // Cache must be within the TTL window
+        const age = Date.now() - new Date(cache.validated_at).getTime();
+        if (age > LICENSE_CACHE_TTL_MS) {
+            return { valid: false, source: "none" };
+        }
+        return { valid: true, source: "cache" };
+    }
+    catch {
+        return { valid: false, source: "none" };
+    }
+}
+//# sourceMappingURL=license.js.map