solve-engine 1.2.0 → 2.1.0

package/dist/language.js

@@ -1,349 +1,2 @@
-import { getMeasure } from './chunk-MVTOCRV2.js';
-import { getTokenCategory } from './chunk-LSALB3IN.js';
-export { UNCATEGORIZED_TOKEN_TYPES, getTokenCategory, registerTokenCategory, unregisterTokenCategory } from './chunk-LSALB3IN.js';
-import { knownUnits } from './chunk-SBUFNJVE.js';
-import './chunk-V4XG5QF6.js';
-import './chunk-YLJ4XMA6.js';
-
-// src/language/LanguageService.ts
-var MAX_COMPLETIONS = 50;
-var CATEGORY_TIER = {
-  variable: 0,
-  function: 1,
-  keyword: 1,
-  operator: 1,
-  comparison: 1,
-  bitwise: 1,
-  datetime: 1,
-  vector: 1,
-  unit: 2
-};
-var MAX_CACHED_LINES = 2e3;
-var LanguageService = class {
-  constructor(engine, options) {
-    // Bounded cache keyed by line number ALONE, not `${lineNumber}:${lineText}`
-    // as an earlier version of this class did. A line's previous text state is
-    // never useful once it changes, so keying on text too was pure waste:
-    // every keystroke on a line minted a brand-new, never-reclaimed cache
-    // entry (an effective per-keystroke memory leak over a long editing
-    // session). Keying on line number alone makes "same line, new text" a
-    // cheap overwrite instead.
-    //
-    // Eviction is oldest-inserted (Map iteration order) when at capacity
-    // mirroring the same bounded-cache pattern ExpressionEngine's own
-    // bytecodeCache already uses elsewhere in this codebase. Deliberately
-    // NOT an LFU (least-frequently-used) policy: LFU would keep resisting
-    // eviction of old, once-popular lines while punishing a line that just
-    // scrolled into view (frequency 1), the opposite of what a "currently
-    // visible" cache should prioritize.
-    this.cache = /* @__PURE__ */ new Map();
-    // Keyword/unit/package-contributed completion candidates don't depend
-    // on any particular line, built lazily on first getCompletions() call
-    // and reused after that, since a package registration is the only thing
-    // that could ever change this list mid-session (see invalidateCache()).
-    // Variable-name candidates are NOT part of this, they're read fresh on
-    // every call from variableNameSource(), since those genuinely change on
-    // every edit.
-    this.staticCompletionCandidates = null;
-    // The same candidates, bucketed by their lowercased first character with the
-    // lowercased label precomputed. getCompletions() runs on every keystroke and
-    // only ever wants candidates sharing the prefix's first character, so
-    // scanning the whole list and lowercasing each label per call was doing two
-    // avoidable things: touching entries that could not possibly match, and
-    // allocating a string per candidate per keystroke. That was affordable when
-    // the vocabulary was a few hundred entries. Deriving the unit list from the
-    // conversion tables took it past a thousand, and the warm completion
-    // benchmarks regressed roughly 2.9x until this was added.
-    this.staticCompletionIndex = null;
-    this.engine = engine ?? null;
-    this.variableNameSource = options?.variableNameSource ?? (() => this.defaultVariableNames());
-    this.normalizeForHighlighting = options?.normalizeForHighlighting ?? false;
-  }
-  defaultVariableNames() {
-    if (!this.engine) return [];
-    const snapshot = this.engine.getDag().getSnapshot();
-    const names = new Set(Object.keys(snapshot.consumers));
-    for (const written of Object.values(snapshot.writes)) {
-      for (const name of written) names.add(name);
-    }
-    return names;
-  }
-  /**
-   * Lex a line, normalize it, and place every resulting token back in the
-   * source text.
-   *
-   * ## Why placing them back is the hard part
-   *
-   * Normalization produces three kinds of token and only one of them can be
-   * highlighted the obvious way.
-   *
-   * A token the normalizer left alone still describes its own text, so its
-   * span is `offset` to `offset + text.length`, exactly as before.
-   *
-   * A FUSED token does not. `10 frames` becomes a FRAME_COUNT whose value is
-   * `10`, and a timecode becomes a token whose value is a comma-separated
-   * tuple appearing nowhere on the line. Those carry `sourceEnd`, set by
-   * `createFusedToken`, which is the only place that knows where the fusion
-   * ended.
-   *
-   * An INSERTED token has no text at all. Implicit multiplication puts a STAR
-   * at the following token's offset, so `5(3)` gains a `*` sitting exactly
-   * where the `(` is. Painting it would colour a character the reader never
-   * typed as an operator, and would overlap the token that really is there.
-   * These are dropped, detected by the one test that needs no cooperation
-   * from any rule: a token with no recorded fusion span must match the text
-   * at its own offset, and an inserted one does not.
-   *
-   * @param lineText - The raw line.
-   * @returns Spans in the same shape `Lexer.getHighlightTokens` returns.
-   */
-  classifyNormalized(lineText) {
-    const lexer = this.engine.getLexer();
-    const raw = lexer.getHighlightTokenObjects(lineText);
-    if (raw.length === 0) return [];
-    const source = lineText.startsWith("> ") && lexer.classifyLine(lineText).skip ? lineText.slice(2) : lineText;
-    let normalized;
-    try {
-      normalized = this.engine.getNormalizer().normalize(raw);
-    } catch {
-      normalized = raw;
-    }
-    const out = [];
-    for (const token of normalized) {
-      let end;
-      if (token.sourceEnd !== void 0) {
-        end = token.sourceEnd;
-      } else if (source.startsWith(token.text, token.offset)) {
-        end = token.offset + token.text.length;
-      } else {
-        continue;
-      }
-      out.push({
-        type: token.type,
-        value: token.value,
-        offset: token.offset,
-        col: token.col,
-        length: end - token.offset,
-        category: getTokenCategory(token.type)
-      });
-    }
-    return out;
-  }
-  /**
-   * Classify every recognized token on one line.
-   *
-   * @param lineText - The raw line text (may be a markdown-structural line
-   *   the engine's classifier skips, that's handled by the underlying
-   *   lexer, which returns no tokens for those).
-   * @param lineNumber - 1-based line number, used purely as a cache key.
-   */
-  getSemanticTokens(lineText, lineNumber) {
-    const cached = this.cache.get(lineNumber);
-    if (cached && cached.text === lineText) {
-      if (cached.bareWordCandidate !== void 0) {
-        return this.isKnownVariable(cached.bareWordCandidate) ? cached.tokens : [];
-      }
-      return cached.tokens;
-    }
-    if (!this.engine) {
-      return [];
-    }
-    const lexer = this.engine.getLexer();
-    const lexed = this.normalizeForHighlighting ? this.classifyNormalized(lineText) : lexer.getHighlightTokens(lineText);
-    if (lexed.length === 0) {
-      this.putCache(lineNumber, lineText, []);
-      return [];
-    }
-    const classification = lexer.classifyLine(lineText);
-    const tokens = [];
-    if (classification.hasInlineSolve) {
-      const validSpans = lexer.findInlineSolves(lineText).filter((span) => this.parsesAsExpression(span.expression)).map((span) => ({ from: span.start, to: span.end }));
-      for (const token of lexed) {
-        if (!token.category) continue;
-        const from = token.offset;
-        const to = token.offset + token.length;
-        if (!validSpans.some((s) => from >= s.from && to <= s.to)) continue;
-        tokens.push({ from, to, category: token.category });
-      }
-    } else {
-      const text = lineText.startsWith("> ") && classification.skip ? lineText.slice(2) : lineText;
-      if (this.parsesAsExpression(text)) {
-        for (const token of lexed) {
-          if (!token.category) continue;
-          tokens.push({ from: token.offset, to: token.offset + token.length, category: token.category });
-        }
-      }
-    }
-    if (tokens.length === 1 && tokens[0].category === "variable") {
-      const name = lineText.slice(tokens[0].from, tokens[0].to);
-      this.putCache(lineNumber, lineText, tokens, name);
-      return this.isKnownVariable(name) ? tokens : [];
-    }
-    this.putCache(lineNumber, lineText, tokens);
-    return tokens;
-  }
-  /**
-   * Completion candidates for the identifier prefix immediately before
-   * `cursorOffset` on `lineText`. Deliberately simple prefix matching, not
-   * parser-driven "what's grammatically valid here" prediction, a
-   * half-typed expression almost never parses, so gating on parse
-   * validity (the way `getSemanticTokens` does) would suppress
-   * completions almost always. This is the safest, fastest option that
-   * still delivers real value.
-   *
-   * Candidates come from three sources: keywords (which already include
-   * function names. See `ExpressionLexer.getKeywords()`'s doc comment)
-   * and units, both static per engine configuration and cached lazily;
-   * package-contributed items (`IEnginePackage.completionItems`), same
-   * cache; and variable names, read fresh from `variableNameSource()` on
-   * every call since those change on every edit.
-   */
-  getCompletions(lineText, cursorOffset) {
-    const prefixMatch = /[A-Za-z0-9_]+$/.exec(lineText.slice(0, cursorOffset));
-    if (!prefixMatch) return [];
-    const prefix = prefixMatch[0].toLowerCase();
-    if (!this.engine) return [];
-    const matches = [];
-    for (const name of this.variableNameSource()) {
-      if (name.toLowerCase().startsWith(prefix)) {
-        matches.push({ label: name, category: "variable" });
-      }
-    }
-    const bucket = this.getStaticCompletionIndex().get(prefix[0]);
-    if (bucket) {
-      for (const candidate of bucket) {
-        if (candidate.lowerLabel.startsWith(prefix)) matches.push(candidate.item);
-      }
-    }
-    matches.sort((a, b) => {
-      const tierDiff = (CATEGORY_TIER[a.category] ?? 3) - (CATEGORY_TIER[b.category] ?? 3);
-      if (tierDiff !== 0) return tierDiff;
-      return a.label.localeCompare(b.label);
-    });
-    return matches.slice(0, MAX_COMPLETIONS);
-  }
-  /** Lazily builds and caches the keyword/unit/package-item candidate list. See `staticCompletionCandidates`. */
-  getStaticCompletionCandidates() {
-    if (this.staticCompletionCandidates) return this.staticCompletionCandidates;
-    const items = [];
-    for (const [word, tokenType] of Object.entries(this.engine.getLexer().getKeywords())) {
-      const category = getTokenCategory(tokenType);
-      if (!category) continue;
-      items.push({ label: word, category });
-    }
-    for (const unit of knownUnits) {
-      items.push({ label: unit, category: "unit", detail: getMeasure(unit) });
-    }
-    items.push(...this.engine.getPackageCompletionItems());
-    this.staticCompletionCandidates = items;
-    return items;
-  }
-  /**
-   * The static candidates bucketed by lowercased first character, built once
-   * from {@link getStaticCompletionCandidates} and invalidated alongside it.
-   */
-  getStaticCompletionIndex() {
-    if (this.staticCompletionIndex) return this.staticCompletionIndex;
-    const index = /* @__PURE__ */ new Map();
-    for (const item of this.getStaticCompletionCandidates()) {
-      const lowerLabel = item.label.toLowerCase();
-      const firstCharacter = lowerLabel[0];
-      if (firstCharacter === void 0) continue;
-      let bucket = index.get(firstCharacter);
-      if (bucket === void 0) {
-        bucket = [];
-        index.set(firstCharacter, bucket);
-      }
-      bucket.push({ item, lowerLabel });
-    }
-    this.staticCompletionIndex = index;
-    return index;
-  }
-  isKnownVariable(name) {
-    for (const known of this.variableNameSource()) {
-      if (known === name) return true;
-    }
-    return false;
-  }
-  /**
-   * Whether the engine's parser actually accepts a piece of text as a
-   * well-formed expression, not merely whether it lexes into individually
-   * recognized token types. See the class doc comment's prose example.
-   * `tryCompileExpression` is compile-only (lex → normalize → parse →
-   * cache bytecode, no VM execution, no network/async side effects) and
-   * reuses the engine's existing bytecode cache, so text that's already
-   * been evaluated (or previously highlight-checked) is a cache hit here
-   * too.
-   *
-   * Deliberately calls the non-throwing `tryCompileExpression` rather than
-   * try/catching `compileExpression`. This runs on every visible line on
-   * every keystroke, and the common case for a real markdown document is
-   * lines that DON'T parse (prose), not lines that do. Throwing there would
-   * mean constructing a EngineError (with V8 stack-trace capture) for the
-   * common case instead of the rare one.
-   */
-  parsesAsExpression(text) {
-    return this.engine.tryCompileExpression(text);
-  }
-  putCache(lineNumber, text, tokens, bareWordCandidate) {
-    if (!this.cache.has(lineNumber) && this.cache.size >= MAX_CACHED_LINES) {
-      const oldestKey = this.cache.keys().next().value;
-      if (oldestKey !== void 0) this.cache.delete(oldestKey);
-    }
-    this.cache.set(lineNumber, { text, tokens, bareWordCandidate });
-  }
-  /**
-   * Evict specific lines (e.g. the lines actually touched by a CodeMirror
-   * change set) instead of the whole cache, the surgical counterpart to
-   * {@link invalidateCache}, letting a single-line edit stay cheap even in
-   * a large document: every other cached line is untouched and still hits
-   * on the next call.
-   */
-  invalidateLines(lineNumbers) {
-    for (const lineNumber of lineNumbers) {
-      this.cache.delete(lineNumber);
-    }
-  }
-  /**
-   * Full cache clear. Reserved for cases with no meaningful "which lines
-   * changed" (e.g. the document was swapped wholesale, or a package was
-   * registered/unregistered mid-session, changing what categories exist).
-   * Prefer {@link invalidateLines} for ordinary edits. Also rebuilds the
-   * lazily-cached keyword/unit/package-item completion candidates on next
-   * use, the only thing that can change that list mid-session.
-   */
-  invalidateCache() {
-    this.cache.clear();
-    this.staticCompletionCandidates = null;
-    this.staticCompletionIndex = null;
-  }
-};
-
-// src/language/tokenClassName.ts
-var DEFAULT_TOKEN_CLASS_PREFIX = "solve-";
-function tokenClassName(category, prefix = DEFAULT_TOKEN_CLASS_PREFIX) {
-  return `${prefix}${category}`;
-}
-function createTokenClassName(prefix) {
-  return (category) => `${prefix}${category}`;
-}
-
-// src/language/adapters/codemirror.ts
-var CATEGORY_TO_COMPLETION_TYPE = {
-  keyword: "keyword",
-  operator: "keyword",
-  comparison: "keyword",
-  bitwise: "keyword",
-  function: "function",
-  variable: "variable",
-  unit: "type",
-  datetime: "keyword",
-  vector: "type"
-};
-function completionItemToOption(item) {
-  return { label: item.label, type: CATEGORY_TO_COMPLETION_TYPE[item.category] ?? "text", detail: item.detail };
-}
-
-export { DEFAULT_TOKEN_CLASS_PREFIX, LanguageService, completionItemToOption, createTokenClassName, tokenClassName };
-//# sourceMappingURL=language.js.map
+import {c}from'./chunk-WGZ3FNHI.js';import {d}from'./chunk-JPFCXLJV.js';export{a as UNCATEGORIZED_TOKEN_TYPES,d as getTokenCategory,b as registerTokenCategory,c as unregisterTokenCategory}from'./chunk-JPFCXLJV.js';import {a}from'./chunk-TRBXW6HW.js';import'./chunk-2JMFUQZH.js';var I=50,C={variable:0,function:1,keyword:1,operator:1,comparison:1,bitwise:1,datetime:1,vector:1,unit:2},T=2e3,p=class{constructor(e,o){this.cache=new Map;this.staticCompletionCandidates=null;this.staticCompletionIndex=null;this.engine=e??null,this.variableNameSource=o?.variableNameSource??(()=>this.defaultVariableNames()),this.normalizeForHighlighting=o?.normalizeForHighlighting??false;}defaultVariableNames(){if(!this.engine)return [];let e=this.engine.getDag().getSnapshot(),o=new Set(Object.keys(e.consumers));for(let n of Object.values(e.writes))for(let i of n)o.add(i);return o}classifyNormalized(e){let o=this.engine.getLexer(),n=o.getHighlightTokenObjects(e);if(n.length===0)return [];let i=e.startsWith("> ")&&o.classifyLine(e).skip?e.slice(2):e,r;try{r=this.engine.getNormalizer().normalize(n);}catch{r=n;}let l=[];for(let t of r){let s;if(t.sourceEnd!==void 0)s=t.sourceEnd;else if(i.startsWith(t.text,t.offset))s=t.offset+t.text.length;else continue;l.push({type:t.type,value:t.value,offset:t.offset,col:t.col,length:s-t.offset,category:d(t.type)});}return l}getSemanticTokens(e,o){let n=this.cache.get(o);if(n&&n.text===e)return n.bareWordCandidate!==void 0?this.isKnownVariable(n.bareWordCandidate)?n.tokens:[]:n.tokens;if(!this.engine)return [];let i=this.engine.getLexer(),r=this.normalizeForHighlighting?this.classifyNormalized(e):i.getHighlightTokens(e);if(r.length===0)return this.putCache(o,e,[]),[];let l=i.classifyLine(e),t=[];if(l.hasInlineSolve){let s=i.findInlineSolves(e).filter(a=>this.parsesAsExpression(a.expression)).map(a=>({from:a.start,to:a.end}));for(let a of r){if(!a.category)continue;let m=a.offset,f=a.offset+a.length;s.some(u=>m>=u.from&&f<=u.to)&&t.push({from:m,to:f,category:a.category});}}else {let s=e.startsWith("> ")&&l.skip?e.slice(2):e;if(this.parsesAsExpression(s))for(let a of r)a.category&&t.push({from:a.offset,to:a.offset+a.length,category:a.category});}if(t.length===1&&t[0].category==="variable"){let s=e.slice(t[0].from,t[0].to);return this.putCache(o,e,t,s),this.isKnownVariable(s)?t:[]}return this.putCache(o,e,t),t}getCompletions(e,o){let n=/[A-Za-z0-9_]+$/.exec(e.slice(0,o));if(!n)return [];let i=n[0].toLowerCase();if(!this.engine)return [];let r=[];for(let t of this.variableNameSource())t.toLowerCase().startsWith(i)&&r.push({label:t,category:"variable"});let l=this.getStaticCompletionIndex().get(i[0]);if(l)for(let t of l)t.lowerLabel.startsWith(i)&&r.push(t.item);return r.sort((t,s)=>{let a=(C[t.category]??3)-(C[s.category]??3);return a!==0?a:t.label.localeCompare(s.label)}),r.slice(0,I)}getStaticCompletionCandidates(){if(this.staticCompletionCandidates)return this.staticCompletionCandidates;let e=[];for(let[o,n]of Object.entries(this.engine.getLexer().getKeywords())){let i=d(n);i&&e.push({label:o,category:i});}for(let o of a)e.push({label:o,category:"unit",detail:c(o)});return e.push(...this.engine.getPackageCompletionItems()),this.staticCompletionCandidates=e,e}getStaticCompletionIndex(){if(this.staticCompletionIndex)return this.staticCompletionIndex;let e=new Map;for(let o of this.getStaticCompletionCandidates()){let n=o.label.toLowerCase(),i=n[0];if(i===void 0)continue;let r=e.get(i);r===void 0&&(r=[],e.set(i,r)),r.push({item:o,lowerLabel:n});}return this.staticCompletionIndex=e,e}isKnownVariable(e){for(let o of this.variableNameSource())if(o===e)return  true;return  false}parsesAsExpression(e){return this.engine.tryCompileExpression(e)}putCache(e,o,n,i){if(!this.cache.has(e)&&this.cache.size>=T){let r=this.cache.keys().next().value;r!==void 0&&this.cache.delete(r);}this.cache.set(e,{text:o,tokens:n,bareWordCandidate:i});}invalidateLines(e){for(let o of e)this.cache.delete(o);}invalidateCache(){this.cache.clear(),this.staticCompletionCandidates=null,this.staticCompletionIndex=null;}};var y="solve-";function x(c,e=y){return `${e}${c}`}function E(c){return e=>`${c}${e}`}var S={keyword:"keyword",operator:"keyword",comparison:"keyword",bitwise:"keyword",function:"function",variable:"variable",unit:"type",datetime:"keyword",vector:"type"};function w(c){return {label:c.label,type:S[c.category]??"text",detail:c.detail}}export{y as DEFAULT_TOKEN_CLASS_PREFIX,p as LanguageService,w as completionItemToOption,E as createTokenClassName,x as tokenClassName};//# sourceMappingURL=language.js.map
 //# sourceMappingURL=language.js.map

package/dist/language.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/language/LanguageService.ts","../src/language/tokenClassName.ts","../src/language/adapters/codemirror.ts"],"names":[],"mappings":";;;;;;;;AAkCA,IAAM,eAAA,GAAkB,EAAA;AAGxB,IAAM,aAAA,GAAwD;AAAA,EAC7D,QAAA,EAAU,CAAA;AAAA,EACV,QAAA,EAAU,CAAA;AAAA,EACV,OAAA,EAAS,CAAA;AAAA,EACT,QAAA,EAAU,CAAA;AAAA,EACV,UAAA,EAAY,CAAA;AAAA,EACZ,OAAA,EAAS,CAAA;AAAA,EACT,QAAA,EAAU,CAAA;AAAA,EACV,MAAA,EAAQ,CAAA;AAAA,EACR,IAAA,EAAM;AACP,CAAA;AAGA,IAAM,gBAAA,GAAmB,GAAA;AAwGlB,IAAM,kBAAN,MAAsB;AAAA,EA0C5B,WAAA,CAAY,QAAkC,OAAA,EAAkC;AAtBhF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,KAAA,uBAAY,GAAA,EAAwB;AAS5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,0BAAA,GAAsD,IAAA;AAW9D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,IAAA,CAAQ,qBAAA,GAA0E,IAAA;AAGjF,IAAA,IAAA,CAAK,SAAS,MAAA,IAAU,IAAA;AACxB,IAAA,IAAA,CAAK,kBAAA,GAAqB,OAAA,EAAS,kBAAA,KAAuB,MAAM,KAAK,oBAAA,EAAqB,CAAA;AAC1F,IAAA,IAAA,CAAK,wBAAA,GAA2B,SAAS,wBAAA,IAA4B,KAAA;AAAA,EACtE;AAAA,EAEQ,oBAAA,GAAyC;AAChD,IAAA,IAAI,CAAC,IAAA,CAAK,MAAA,EAAQ,OAAO,EAAC;AAC1B,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,MAAA,CAAO,MAAA,GAAS,WAAA,EAAY;AAClD,IAAA,MAAM,QAAQ,IAAI,GAAA,CAAY,OAAO,IAAA,CAAK,QAAA,CAAS,SAAS,CAAC,CAAA;AAC7D,IAAA,KAAA,MAAW,OAAA,IAAW,MAAA,CAAO,MAAA,CAAO,QAAA,CAAS,MAAM,CAAA,EAAG;AACrD,MAAA,KAAA,MAAW,IAAA,IAAQ,OAAA,EAAS,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AAAA,IAC3C;AACA,IAAA,OAAO,KAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA+BQ,mBACP,QAAA,EACsH;AACtH,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAQ,QAAA,EAAS;AACpC,IAAA,MAAM,GAAA,GAAM,KAAA,CAAM,wBAAA,CAAyB,QAAQ,CAAA;AACnD,IAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAI9B,IAAA,MAAM,MAAA,GACL,QAAA,CAAS,UAAA,CAAW,IAAI,CAAA,IAAK,KAAA,CAAM,YAAA,CAAa,QAAQ,CAAA,CAAE,IAAA,GAAO,QAAA,CAAS,KAAA,CAAM,CAAC,CAAA,GAAI,QAAA;AAEtF,IAAA,IAAI,UAAA;AACJ,IAAA,IAAI;AACH,MAAA,UAAA,GAAa,IAAA,CAAK,MAAA,CAAQ,aAAA,EAAc,CAAE,UAAU,GAAG,CAAA;AAAA,IACxD,CAAA,CAAA,MAAQ;AAIP,MAAA,UAAA,GAAa,GAAA;AAAA,IACd;AAEA,IAAA,MAAM,MAOA,EAAC;AAEP,IAAA,KAAA,MAAW,SAAS,UAAA,EAAY;AAC/B,MAAA,IAAI,GAAA;AACJ,MAAA,IAAI,KAAA,CAAM,cAAc,MAAA,EAAW;AAClC,QAAA,GAAA,GAAM,KAAA,CAAM,SAAA;AAAA,MACb,WAAW,MAAA,CAAO,UAAA,CAAW,MAAM,IAAA,EAAM,KAAA,CAAM,MAAM,CAAA,EAAG;AAMvD,QAAA,GAAA,GAAM,KAAA,CAAM,MAAA,GAAS,KAAA,CAAM,IAAA,CAAK,MAAA;AAAA,MACjC,CAAA,MAAO;AACN,QAAA;AAAA,MACD;AAEA,MAAA,GAAA,CAAI,IAAA,CAAK;AAAA,QACR,MAAM,KAAA,CAAM,IAAA;AAAA,QACZ,OAAO,KAAA,CAAM,KAAA;AAAA,QACb,QAAQ,KAAA,CAAM,MAAA;AAAA,QACd,KAAK,KAAA,CAAM,GAAA;AAAA,QACX,MAAA,EAAQ,MAAM,KAAA,CAAM,MAAA;AAAA,QACpB,QAAA,EAAU,gBAAA,CAAiB,KAAA,CAAM,IAAI;AAAA,OACrC,CAAA;AAAA,IACF;AAEA,IAAA,OAAO,GAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,iBAAA,CAAkB,UAAkB,UAAA,EAAqC;AACxE,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,UAAU,CAAA;AACxC,IAAA,IAAI,MAAA,IAAU,MAAA,CAAO,IAAA,KAAS,QAAA,EAAU;AACvC,MAAA,IAAI,MAAA,CAAO,sBAAsB,MAAA,EAAW;AAC3C,QAAA,OAAO,KAAK,eAAA,CAAgB,MAAA,CAAO,iBAAiB,CAAA,GAAI,MAAA,CAAO,SAAS,EAAC;AAAA,MAC1E;AACA,MAAA,OAAO,MAAA,CAAO,MAAA;AAAA,IACf;AAEA,IAAA,IAAI,CAAC,KAAK,MAAA,EAAQ;AAGjB,MAAA,OAAO,EAAC;AAAA,IACT;AAEA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,MAAA,CAAO,QAAA,EAAS;AACnC,IAAA,MAAM,KAAA,GAAQ,KAAK,wBAAA,GAChB,IAAA,CAAK,mBAAmB,QAAQ,CAAA,GAChC,KAAA,CAAM,kBAAA,CAAmB,QAAQ,CAAA;AACpC,IAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACvB,MAAA,IAAA,CAAK,QAAA,CAAS,UAAA,EAAY,QAAA,EAAU,EAAE,CAAA;AACtC,MAAA,OAAO,EAAC;AAAA,IACT;AAEA,IAAA,MAAM,cAAA,GAAiB,KAAA,CAAM,YAAA,CAAa,QAAQ,CAAA;AAClD,IAAA,MAAM,SAA0B,EAAC;AAEjC,IAAA,IAAI,eAAe,cAAA,EAAgB;AAQlC,MAAA,MAAM,UAAA,GAAa,MACjB,gBAAA,CAAiB,QAAQ,EACzB,MAAA,CAAO,CAAA,IAAA,KAAQ,IAAA,CAAK,kBAAA,CAAmB,IAAA,CAAK,UAAU,CAAC,CAAA,CACvD,GAAA,CAAI,WAAS,EAAE,IAAA,EAAM,KAAK,KAAA,EAAO,EAAA,EAAI,IAAA,CAAK,GAAA,EAAI,CAAE,CAAA;AAClD,MAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AAC1B,QAAA,IAAI,CAAC,MAAM,QAAA,EAAU;AACrB,QAAA,MAAM,OAAO,KAAA,CAAM,MAAA;AACnB,QAAA,MAAM,EAAA,GAAK,KAAA,CAAM,MAAA,GAAS,KAAA,CAAM,MAAA;AAChC,QAAA,IAAI,CAAC,UAAA,CAAW,IAAA,CAAK,CAAA,CAAA,KAAK,IAAA,IAAQ,EAAE,IAAA,IAAQ,EAAA,IAAM,CAAA,CAAE,EAAE,CAAA,EAAG;AACzD,QAAA,MAAA,CAAO,KAAK,EAAE,IAAA,EAAM,IAAI,QAAA,EAAU,KAAA,CAAM,UAAU,CAAA;AAAA,MACnD;AAAA,IACD,CAAA,MAAO;AAKN,MAAA,MAAM,IAAA,GAAO,QAAA,CAAS,UAAA,CAAW,IAAI,CAAA,IAAK,eAAe,IAAA,GACtD,QAAA,CAAS,KAAA,CAAM,CAAC,CAAA,GAChB,QAAA;AACH,MAAA,IAAI,IAAA,CAAK,kBAAA,CAAmB,IAAI,CAAA,EAAG;AAClC,QAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AAC1B,UAAA,IAAI,CAAC,MAAM,QAAA,EAAU;AACrB,UAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,KAAA,CAAM,MAAA,EAAQ,EAAA,EAAI,KAAA,CAAM,MAAA,GAAS,KAAA,CAAM,MAAA,EAAQ,QAAA,EAAU,KAAA,CAAM,UAAU,CAAA;AAAA,QAC9F;AAAA,MACD;AAAA,IACD;AAcA,IAAA,IAAI,OAAO,MAAA,KAAW,CAAA,IAAK,OAAO,CAAC,CAAA,CAAE,aAAa,UAAA,EAAY;AAC7D,MAAA,MAAM,IAAA,GAAO,QAAA,CAAS,KAAA,CAAM,MAAA,CAAO,CAAC,EAAE,IAAA,EAAM,MAAA,CAAO,CAAC,CAAA,CAAE,EAAE,CAAA;AACxD,MAAA,IAAA,CAAK,QAAA,CAAS,UAAA,EAAY,QAAA,EAAU,MAAA,EAAQ,IAAI,CAAA;AAChD,MAAA,OAAO,IAAA,CAAK,eAAA,CAAgB,IAAI,CAAA,GAAI,SAAS,EAAC;AAAA,IAC/C;AAEA,IAAA,IAAA,CAAK,QAAA,CAAS,UAAA,EAAY,QAAA,EAAU,MAAM,CAAA;AAC1C,IAAA,OAAO,MAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAkBA,cAAA,CAAe,UAAkB,YAAA,EAAwC;AACxE,IAAA,MAAM,cAAc,gBAAA,CAAiB,IAAA,CAAK,SAAS,KAAA,CAAM,CAAA,EAAG,YAAY,CAAC,CAAA;AACzE,IAAA,IAAI,CAAC,WAAA,EAAa,OAAO,EAAC;AAC1B,IAAA,MAAM,MAAA,GAAS,WAAA,CAAY,CAAC,CAAA,CAAE,WAAA,EAAY;AAE1C,IAAA,IAAI,CAAC,IAAA,CAAK,MAAA,EAAQ,OAAO,EAAC;AAE1B,IAAA,MAAM,UAA4B,EAAC;AAInC,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,kBAAA,EAAmB,EAAG;AAC7C,MAAA,IAAI,IAAA,CAAK,WAAA,EAAY,CAAE,UAAA,CAAW,MAAM,CAAA,EAAG;AAC1C,QAAA,OAAA,CAAQ,KAAK,EAAE,KAAA,EAAO,IAAA,EAAM,QAAA,EAAU,YAAY,CAAA;AAAA,MACnD;AAAA,IACD;AAIA,IAAA,MAAM,SAAS,IAAA,CAAK,wBAAA,GAA2B,GAAA,CAAI,MAAA,CAAO,CAAC,CAAC,CAAA;AAC5D,IAAA,IAAI,MAAA,EAAQ;AACX,MAAA,KAAA,MAAW,aAAa,MAAA,EAAQ;AAC/B,QAAA,IAAI,SAAA,CAAU,WAAW,UAAA,CAAW,MAAM,GAAG,OAAA,CAAQ,IAAA,CAAK,UAAU,IAAI,CAAA;AAAA,MACzE;AAAA,IACD;AAEA,IAAA,OAAA,CAAQ,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM;AACtB,MAAA,MAAM,QAAA,GAAA,CAAY,cAAc,CAAA,CAAE,QAAQ,KAAK,CAAA,KAAM,aAAA,CAAc,CAAA,CAAE,QAAQ,CAAA,IAAK,CAAA,CAAA;AAClF,MAAA,IAAI,QAAA,KAAa,GAAG,OAAO,QAAA;AAC3B,MAAA,OAAO,CAAA,CAAE,KAAA,CAAM,aAAA,CAAc,CAAA,CAAE,KAAK,CAAA;AAAA,IACrC,CAAC,CAAA;AAED,IAAA,OAAO,OAAA,CAAQ,KAAA,CAAM,CAAA,EAAG,eAAe,CAAA;AAAA,EACxC;AAAA;AAAA,EAGQ,6BAAA,GAAkD;AACzD,IAAA,IAAI,IAAA,CAAK,0BAAA,EAA4B,OAAO,IAAA,CAAK,0BAAA;AAEjD,IAAA,MAAM,QAA0B,EAAC;AACjC,IAAA,KAAA,MAAW,CAAC,IAAA,EAAM,SAAS,CAAA,IAAK,MAAA,CAAO,OAAA,CAAQ,IAAA,CAAK,MAAA,CAAQ,QAAA,EAAS,CAAE,WAAA,EAAa,CAAA,EAAG;AACtF,MAAA,MAAM,QAAA,GAAW,iBAAiB,SAAS,CAAA;AAC3C,MAAA,IAAI,CAAC,QAAA,EAAU;AACf,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,EAAM,UAAU,CAAA;AAAA,IACrC;AACA,IAAA,KAAA,MAAW,QAAQ,UAAA,EAAY;AAC9B,MAAA,KAAA,CAAM,IAAA,CAAK,EAAE,KAAA,EAAO,IAAA,EAAM,QAAA,EAAU,QAAQ,MAAA,EAAQ,UAAA,CAAW,IAAI,CAAA,EAAG,CAAA;AAAA,IACvE;AACA,IAAA,KAAA,CAAM,IAAA,CAAK,GAAG,IAAA,CAAK,MAAA,CAAQ,2BAA2B,CAAA;AAEtD,IAAA,IAAA,CAAK,0BAAA,GAA6B,KAAA;AAClC,IAAA,OAAO,KAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA,EAMQ,wBAAA,GAAsE;AAC7E,IAAA,IAAI,IAAA,CAAK,qBAAA,EAAuB,OAAO,IAAA,CAAK,qBAAA;AAE5C,IAAA,MAAM,KAAA,uBAAY,GAAA,EAA0C;AAC5D,IAAA,KAAA,MAAW,IAAA,IAAQ,IAAA,CAAK,6BAAA,EAA8B,EAAG;AACxD,MAAA,MAAM,UAAA,GAAa,IAAA,CAAK,KAAA,CAAM,WAAA,EAAY;AAC1C,MAAA,MAAM,cAAA,GAAiB,WAAW,CAAC,CAAA;AAGnC,MAAA,IAAI,mBAAmB,MAAA,EAAW;AAClC,MAAA,IAAI,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,cAAc,CAAA;AACrC,MAAA,IAAI,WAAW,MAAA,EAAW;AACzB,QAAA,MAAA,GAAS,EAAC;AACV,QAAA,KAAA,CAAM,GAAA,CAAI,gBAAgB,MAAM,CAAA;AAAA,MACjC;AACA,MAAA,MAAA,CAAO,IAAA,CAAK,EAAE,IAAA,EAAM,UAAA,EAAY,CAAA;AAAA,IACjC;AAEA,IAAA,IAAA,CAAK,qBAAA,GAAwB,KAAA;AAC7B,IAAA,OAAO,KAAA;AAAA,EACR;AAAA,EAEQ,gBAAgB,IAAA,EAAuB;AAC9C,IAAA,KAAA,MAAW,KAAA,IAAS,IAAA,CAAK,kBAAA,EAAmB,EAAG;AAC9C,MAAA,IAAI,KAAA,KAAU,MAAM,OAAO,IAAA;AAAA,IAC5B;AACA,IAAA,OAAO,KAAA;AAAA,EACR;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBQ,mBAAmB,IAAA,EAAuB;AACjD,IAAA,OAAO,IAAA,CAAK,MAAA,CAAQ,oBAAA,CAAqB,IAAI,CAAA;AAAA,EAC9C;AAAA,EAEQ,QAAA,CAAS,UAAA,EAAoB,IAAA,EAAc,MAAA,EAAyB,iBAAA,EAAkC;AAC7G,IAAA,IAAI,CAAC,KAAK,KAAA,CAAM,GAAA,CAAI,UAAU,CAAA,IAAK,IAAA,CAAK,KAAA,CAAM,IAAA,IAAQ,gBAAA,EAAkB;AACvE,MAAA,MAAM,YAAY,IAAA,CAAK,KAAA,CAAM,IAAA,EAAK,CAAE,MAAK,CAAE,KAAA;AAC3C,MAAA,IAAI,SAAA,KAAc,MAAA,EAAW,IAAA,CAAK,KAAA,CAAM,OAAO,SAAS,CAAA;AAAA,IACzD;AACA,IAAA,IAAA,CAAK,MAAM,GAAA,CAAI,UAAA,EAAY,EAAE,IAAA,EAAM,MAAA,EAAQ,mBAAmB,CAAA;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,gBAAgB,WAAA,EAAqC;AACpD,IAAA,KAAA,MAAW,cAAc,WAAA,EAAa;AACrC,MAAA,IAAA,CAAK,KAAA,CAAM,OAAO,UAAU,CAAA;AAAA,IAC7B;AAAA,EACD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,eAAA,GAAwB;AACvB,IAAA,IAAA,CAAK,MAAM,KAAA,EAAM;AACjB,IAAA,IAAA,CAAK,0BAAA,GAA6B,IAAA;AAClC,IAAA,IAAA,CAAK,qBAAA,GAAwB,IAAA;AAAA,EAC9B;AACD;;;AC5hBO,IAAM,0BAAA,GAA6B;AAqBnC,SAAS,cAAA,CAAe,QAAA,EAAyB,MAAA,GAAiB,0BAAA,EAAoC;AAC5G,EAAA,OAAO,CAAA,EAAG,MAAM,CAAA,EAAG,QAAQ,CAAA,CAAA;AAC5B;AAmBO,SAAS,qBAAqB,MAAA,EAAqD;AACzF,EAAA,OAAO,CAAC,QAAA,KAA4B,CAAA,EAAG,MAAM,GAAG,QAAQ,CAAA,CAAA;AACzD;;;ACpCA,IAAM,2BAAA,GAAsE;AAAA,EAC3E,OAAA,EAAS,SAAA;AAAA,EACT,QAAA,EAAU,SAAA;AAAA,EACV,UAAA,EAAY,SAAA;AAAA,EACZ,OAAA,EAAS,SAAA;AAAA,EACT,QAAA,EAAU,UAAA;AAAA,EACV,QAAA,EAAU,UAAA;AAAA,EACV,IAAA,EAAM,MAAA;AAAA,EACN,QAAA,EAAU,SAAA;AAAA,EACV,MAAA,EAAQ;AACT,CAAA;AAUO,SAAS,uBAAuB,IAAA,EAAwE;AAC9G,EAAA,OAAO,EAAE,KAAA,EAAO,IAAA,CAAK,KAAA,EAAO,IAAA,EAAM,2BAAA,CAA4B,IAAA,CAAK,QAAQ,CAAA,IAAK,MAAA,EAAQ,MAAA,EAAQ,IAAA,CAAK,MAAA,EAAO;AAC7G","file":"language.js","sourcesContent":["import type { ExpressionEngine } from \"@solve-js/engine/ExpressionEngine\";\nimport type { TokenCategory } from \"@solve-js/language/TokenCategory\";\nimport { getTokenCategory } from \"@solve-js/language/TokenCategoryMap\";\nimport type { Token } from \"@solve-js/lexer/Token\";\nimport { knownUnits } from \"@solve-js/lexer/units\";\nimport { getMeasure } from \"@solve-js/uom/UomConverter\";\n\n/** A single classified span within a line, the entire output contract of the language service. */\nexport interface SemanticToken {\n\tfrom: number;\n\tto: number;\n\tcategory: TokenCategory;\n}\n\n/** A single completion candidate, the entire output contract of `getCompletions()`. */\nexport interface CompletionItem {\n\tlabel: string;\n\t/** Reuses the highlighting taxonomy, one adapter can serve both features. */\n\tcategory: TokenCategory;\n\t/** e.g. a unit's measure (\"length\"), or the category name for keywords/functions. */\n\tdetail?: string;\n}\n\n/**\n * A completion candidate with its lowercased label precomputed.\n *\n * Internal to the prefix index; callers only ever see the {@link CompletionItem}.\n */\ninterface IndexedCompletionCandidate {\n\titem: CompletionItem;\n\tlowerLabel: string;\n}\n\n/** Completion results are capped, a document-wide candidate pool has no reason to return more than this. */\nconst MAX_COMPLETIONS = 50;\n\n/** Tier ordering for completion results: user-authored variables first, then grammar, then units. */\nconst CATEGORY_TIER: Partial<Record<TokenCategory, number>> = {\n\tvariable: 0,\n\tfunction: 1,\n\tkeyword: 1,\n\toperator: 1,\n\tcomparison: 1,\n\tbitwise: 1,\n\tdatetime: 1,\n\tvector: 1,\n\tunit: 2,\n};\n\n/** Bounded cache size. See the eviction-policy note on `LanguageService.cache`. */\nconst MAX_CACHED_LINES = 2000;\n\ninterface CacheEntry {\n\ttext: string;\n\ttokens: SemanticToken[];\n\t// When set, `tokens` is a single bare-identifier token whose validity\n\t// depends on document-wide DAG state (see the bare-word gate in\n\t// getSemanticTokens), not just this line's own text, so it can't be\n\t// cached as a plain pass/fail result the way every other line can. The\n\t// lex+parse work that produced `tokens` is still cached normally; only\n\t// the DAG membership check is re-run on every lookup (cache hit or\n\t// miss alike), since it's cheap (a Set lookup) and the alternative\n\t// caching the gated result, would go stale the moment some OTHER\n\t// line's edit changes what variables exist, with nothing to trigger a\n\t// re-check of this untouched line.\n\tbareWordCandidate?: string;\n}\n\n/** Options for the editor-facing language service: completions and highlighting. */\nexport interface LanguageServiceOptions {\n\t/**\n\t * Overrides how the service discovers \"variable names known in this\n\t * document\", used to legitimize a lone bare identifier line (see\n\t * `getSemanticTokens`'s single-token gate) and variable-name\n\t * completions (`getCompletions`). Defaults to reading\n\t * `engine.getDag().getSnapshot()`, which works for any consumer\n\t * sharing one `ExpressionEngine` between evaluation and the language\n\t * service (the real Obsidian editor).\n\t *\n\t * Required for consumers whose language service is backed by a\n\t * *different*, non-evaluating engine than the one that actually runs\n\t * the document (the playground's dedicated lexing-only engine, whose\n\t * own DAG is always empty), pass a function reading the real\n\t * evaluation engine's DAG snapshot instead.\n\t */\n\tvariableNameSource?: () => Iterable<string>;\n\n\t/**\n\t * Run the normalizer on the highlighting path, so phrase-fused tokens are\n\t * classified as the thing the parser will actually see.\n\t *\n\t * Off by default, and the default is a judgement rather than an oversight.\n\t * Highlighting runs per keystroke, normalization is real work, and a host\n\t * that is happy with lexer-level categories should not start paying for\n\t * fusion because a new version shipped. Turn it on and `12/09/2026` is one\n\t * `datetime` span instead of five number and operator spans; leave it off\n\t * and nothing about this class changes.\n\t *\n\t * See `benchmarks/languageServiceBenchmarks.spec.ts` for what it costs.\n\t */\n\tnormalizeForHighlighting?: boolean;\n}\n\n/**\n * Editor-agnostic \"language server\" for solve expressions: turns a line of\n * text into semantic token ranges, using the exact same lexer real\n * evaluation uses (so it only ever classifies what the engine's grammar\n * actually recognizes, never a separate/duplicated tokenizer). No\n * knowledge of CSS, CodeMirror, VS Code, or any other rendering concept\n * lives here. See `language/adapters/` for that.\n *\n * Classification happens at the LEXER stage, before the normalizer runs\n * (normalization, phrase fusion, implicit multiply, and package-specific\n * rules, happens later, only on the real evaluation path). A package's\n * lexer-level custom token types (e.g. a custom keyword) are recognized\n * here exactly as evaluation would see them. A package's *normalizer*-fused\n * synthetic tokens (e.g. OSRS's GAME_ITEM, built by fusing several\n * consecutive IDENT tokens against an item-name trie) are NOT. This\n * service still shows the pre-fusion IDENT tokens individually for those.\n * `IEnginePackage.tokenCategories` entries for normalizer-only token types\n * are still valid, correct registrations (queryable via getTokenCategory)\n *, they just won't currently be reachable through this lexer-only\n * classification path. Folding normalization in would require running it\n * per keystroke on the highlighting path too, which needs its own careful\n * design (span recomputation for fused multi-token ranges, in particular)\n * rather than a quick addition here.\n *\n * Lexing alone is NOT sufficient to decide \"recognized\", though: a run of\n * plain-English words (\"My name is ron\") lexes into a sequence of\n * individually-valid IDENT tokens with no grammar tying them together\n * every word \"recognized\" at the token level, but the line as a whole is\n * not something the engine would ever accept as an expression. Surfacing\n * per-token colors for that case looks like the editor mistook prose for\n * code. So a line's tokens are only surfaced once the line as a whole\n * parses successfully (via `ExpressionEngine.compileExpression`, the same\n * parse pipeline, and the same bytecode cache, real evaluation uses; no\n * separate/duplicated grammar check). A single bare word (\"hello\", a valid\n * variable reference) or a keyword-only line (\"pi\") still parses and still\n * highlights, only genuinely ungrammatical text is suppressed, unless it's\n * a known variable elsewhere in the document (see `variableNameSource`).\n *\n * `getCompletions()` is the other half of this \"language server\": unlike\n * `getSemanticTokens()`, it's explicitly for *incomplete*, mid-typing text\n *, it deliberately does NOT gate on parse validity (a half-typed\n * expression almost never parses), using simple prefix matching instead.\n *\n * Must be constructed with an already-configured `ExpressionEngine` (one\n * with all currently-relevant packages registered) rather than a bare\n * lexer, reusing an existing engine is both the fast path (no throwaway\n * lexer construction) and the *correct* one: a highlighting-only lexer\n * built independently of the evaluation engine would silently fail to\n * recognize plugin-contributed tokens (e.g. a package's custom keywords)\n * unless it happened to have the identical packages registered.\n */\nexport class LanguageService {\n\tprivate engine: ExpressionEngine | null;\n\tprivate variableNameSource: () => Iterable<string>;\n\tprivate readonly normalizeForHighlighting: boolean;\n\n\t// Bounded cache keyed by line number ALONE, not `${lineNumber}:${lineText}`\n\t// as an earlier version of this class did. A line's previous text state is\n\t// never useful once it changes, so keying on text too was pure waste:\n\t// every keystroke on a line minted a brand-new, never-reclaimed cache\n\t// entry (an effective per-keystroke memory leak over a long editing\n\t// session). Keying on line number alone makes \"same line, new text\" a\n\t// cheap overwrite instead.\n\t//\n\t// Eviction is oldest-inserted (Map iteration order) when at capacity\n\t// mirroring the same bounded-cache pattern ExpressionEngine's own\n\t// bytecodeCache already uses elsewhere in this codebase. Deliberately\n\t// NOT an LFU (least-frequently-used) policy: LFU would keep resisting\n\t// eviction of old, once-popular lines while punishing a line that just\n\t// scrolled into view (frequency 1), the opposite of what a \"currently\n\t// visible\" cache should prioritize.\n\tprivate cache = new Map<number, CacheEntry>();\n\n\t// Keyword/unit/package-contributed completion candidates don't depend\n\t// on any particular line, built lazily on first getCompletions() call\n\t// and reused after that, since a package registration is the only thing\n\t// that could ever change this list mid-session (see invalidateCache()).\n\t// Variable-name candidates are NOT part of this, they're read fresh on\n\t// every call from variableNameSource(), since those genuinely change on\n\t// every edit.\n\tprivate staticCompletionCandidates: CompletionItem[] | null = null;\n\n\t// The same candidates, bucketed by their lowercased first character with the\n\t// lowercased label precomputed. getCompletions() runs on every keystroke and\n\t// only ever wants candidates sharing the prefix's first character, so\n\t// scanning the whole list and lowercasing each label per call was doing two\n\t// avoidable things: touching entries that could not possibly match, and\n\t// allocating a string per candidate per keystroke. That was affordable when\n\t// the vocabulary was a few hundred entries. Deriving the unit list from the\n\t// conversion tables took it past a thousand, and the warm completion\n\t// benchmarks regressed roughly 2.9x until this was added.\n\tprivate staticCompletionIndex: Map<string, IndexedCompletionCandidate[]> | null = null;\n\n\tconstructor(engine?: ExpressionEngine | null, options?: LanguageServiceOptions) {\n\t\tthis.engine = engine ?? null;\n\t\tthis.variableNameSource = options?.variableNameSource ?? (() => this.defaultVariableNames());\n\t\tthis.normalizeForHighlighting = options?.normalizeForHighlighting ?? false;\n\t}\n\n\tprivate defaultVariableNames(): Iterable<string> {\n\t\tif (!this.engine) return [];\n\t\tconst snapshot = this.engine.getDag().getSnapshot();\n\t\tconst names = new Set<string>(Object.keys(snapshot.consumers));\n\t\tfor (const written of Object.values(snapshot.writes)) {\n\t\t\tfor (const name of written) names.add(name);\n\t\t}\n\t\treturn names;\n\t}\n\n\t/**\n\t * Lex a line, normalize it, and place every resulting token back in the\n\t * source text.\n\t *\n\t * ## Why placing them back is the hard part\n\t *\n\t * Normalization produces three kinds of token and only one of them can be\n\t * highlighted the obvious way.\n\t *\n\t * A token the normalizer left alone still describes its own text, so its\n\t * span is `offset` to `offset + text.length`, exactly as before.\n\t *\n\t * A FUSED token does not. `10 frames` becomes a FRAME_COUNT whose value is\n\t * `10`, and a timecode becomes a token whose value is a comma-separated\n\t * tuple appearing nowhere on the line. Those carry `sourceEnd`, set by\n\t * `createFusedToken`, which is the only place that knows where the fusion\n\t * ended.\n\t *\n\t * An INSERTED token has no text at all. Implicit multiplication puts a STAR\n\t * at the following token's offset, so `5(3)` gains a `*` sitting exactly\n\t * where the `(` is. Painting it would colour a character the reader never\n\t * typed as an operator, and would overlap the token that really is there.\n\t * These are dropped, detected by the one test that needs no cooperation\n\t * from any rule: a token with no recorded fusion span must match the text\n\t * at its own offset, and an inserted one does not.\n\t *\n\t * @param lineText - The raw line.\n\t * @returns Spans in the same shape `Lexer.getHighlightTokens` returns.\n\t */\n\tprivate classifyNormalized(\n\t\tlineText: string,\n\t): { type: string; value: string; offset: number; col: number; length: number; category: TokenCategory | undefined }[] {\n\t\tconst lexer = this.engine!.getLexer();\n\t\tconst raw = lexer.getHighlightTokenObjects(lineText);\n\t\tif (raw.length === 0) return [];\n\n\t\t// Offsets from a blockquote line are relative to the stripped text, so\n\t\t// the text this checks against has to be stripped the same way.\n\t\tconst source =\n\t\t\tlineText.startsWith(\"> \") && lexer.classifyLine(lineText).skip ? lineText.slice(2) : lineText;\n\n\t\tlet normalized: Token[];\n\t\ttry {\n\t\t\tnormalized = this.engine!.getNormalizer().normalize(raw);\n\t\t} catch {\n\t\t\t// Normalization is an enhancement here, not a requirement. A rule\n\t\t\t// that throws on a half-typed line should cost the reader phrase\n\t\t\t// colouring, not all colouring.\n\t\t\tnormalized = raw;\n\t\t}\n\n\t\tconst out: {\n\t\t\ttype: string;\n\t\t\tvalue: string;\n\t\t\toffset: number;\n\t\t\tcol: number;\n\t\t\tlength: number;\n\t\t\tcategory: TokenCategory | undefined;\n\t\t}[] = [];\n\n\t\tfor (const token of normalized) {\n\t\t\tlet end: number;\n\t\t\tif (token.sourceEnd !== undefined) {\n\t\t\t\tend = token.sourceEnd;\n\t\t\t} else if (source.startsWith(token.text, token.offset)) {\n\t\t\t\t// `text`, not `value`. They are the same string for almost every\n\t\t\t\t// token, and differ for a string literal, whose value is the\n\t\t\t\t// payload while its text is the quoted source slice. Matching on\n\t\t\t\t// value dropped every string literal from the painted line,\n\t\t\t\t// since `gbp` does not appear at the offset where `\"gbp\"` does.\n\t\t\t\tend = token.offset + token.text.length;\n\t\t\t} else {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tout.push({\n\t\t\t\ttype: token.type,\n\t\t\t\tvalue: token.value,\n\t\t\t\toffset: token.offset,\n\t\t\t\tcol: token.col,\n\t\t\t\tlength: end - token.offset,\n\t\t\t\tcategory: getTokenCategory(token.type),\n\t\t\t});\n\t\t}\n\n\t\treturn out;\n\t}\n\n\t/**\n\t * Classify every recognized token on one line.\n\t *\n\t * @param lineText - The raw line text (may be a markdown-structural line\n\t *   the engine's classifier skips, that's handled by the underlying\n\t *   lexer, which returns no tokens for those).\n\t * @param lineNumber - 1-based line number, used purely as a cache key.\n\t */\n\tgetSemanticTokens(lineText: string, lineNumber: number): SemanticToken[] {\n\t\tconst cached = this.cache.get(lineNumber);\n\t\tif (cached && cached.text === lineText) {\n\t\t\tif (cached.bareWordCandidate !== undefined) {\n\t\t\t\treturn this.isKnownVariable(cached.bareWordCandidate) ? cached.tokens : [];\n\t\t\t}\n\t\t\treturn cached.tokens;\n\t\t}\n\n\t\tif (!this.engine) {\n\t\t\t// No engine available (e.g. a consumer that hasn't wired one up yet)\n\t\t\t//, no highlighting, not an error.\n\t\t\treturn [];\n\t\t}\n\n\t\tconst lexer = this.engine.getLexer();\n\t\tconst lexed = this.normalizeForHighlighting\n\t\t\t? this.classifyNormalized(lineText)\n\t\t\t: lexer.getHighlightTokens(lineText);\n\t\tif (lexed.length === 0) {\n\t\t\tthis.putCache(lineNumber, lineText, []);\n\t\t\treturn [];\n\t\t}\n\n\t\tconst classification = lexer.classifyLine(lineText);\n\t\tconst tokens: SemanticToken[] = [];\n\n\t\tif (classification.hasInlineSolve) {\n\t\t\t// A line can mix markdown prose with one or more embedded\n\t\t\t// `s`...`` expressions. Only the text actually inside a\n\t\t\t// well-formed marker is a recognized expression, surrounding\n\t\t\t// prose lexes into individually-valid tokens too (see the class\n\t\t\t// doc comment) but is never something the engine would parse,\n\t\t\t// so it's excluded token-by-token via span membership rather\n\t\t\t// than gating the whole line pass/fail.\n\t\t\tconst validSpans = lexer\n\t\t\t\t.findInlineSolves(lineText)\n\t\t\t\t.filter(span => this.parsesAsExpression(span.expression))\n\t\t\t\t.map(span => ({ from: span.start, to: span.end }));\n\t\t\tfor (const token of lexed) {\n\t\t\t\tif (!token.category) continue;\n\t\t\t\tconst from = token.offset;\n\t\t\t\tconst to = token.offset + token.length;\n\t\t\t\tif (!validSpans.some(s => from >= s.from && to <= s.to)) continue;\n\t\t\t\ttokens.push({ from, to, category: token.category });\n\t\t\t}\n\t\t} else {\n\t\t\t// Blockquote content is stripped of its \"> \" prefix before being\n\t\t\t// tokenized (see Lexer.getHighlightTokens), token offsets are\n\t\t\t// already relative to the stripped text, so the parse check must\n\t\t\t// run against that same substring to match.\n\t\t\tconst text = lineText.startsWith(\"> \") && classification.skip\n\t\t\t\t? lineText.slice(2)\n\t\t\t\t: lineText;\n\t\t\tif (this.parsesAsExpression(text)) {\n\t\t\t\tfor (const token of lexed) {\n\t\t\t\t\tif (!token.category) continue;\n\t\t\t\t\ttokens.push({ from: token.offset, to: token.offset + token.length, category: token.category });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// A lone bare word (\"hello\") is exactly as ambiguous as a run of\n\t\t// prose (\"My name is dave\"), it happens to parse as a\n\t\t// single-identifier variable-reference expression, but that's true\n\t\t// of literally any English word, so on its own it isn't \"recognized\"\n\t\t// in any meaningful sense. Sigil-marked variables (\":x\", \"$x\") are\n\t\t// unaffected, those lex to TWO tokens (sigil + ident), never\n\t\t// hitting this single-token check. Keywords (\"pi\") are unaffected\n\t\t// too, their category is \"keyword\", not \"variable\". Only surface\n\t\t// it once it's an actual known variable elsewhere in the document\n\t\t// checked live (see the `bareWordCandidate` cache field), not baked\n\t\t// into the cached result, since another line's edit can make this\n\t\t// check flip without this line's own text ever changing.\n\t\tif (tokens.length === 1 && tokens[0].category === \"variable\") {\n\t\t\tconst name = lineText.slice(tokens[0].from, tokens[0].to);\n\t\t\tthis.putCache(lineNumber, lineText, tokens, name);\n\t\t\treturn this.isKnownVariable(name) ? tokens : [];\n\t\t}\n\n\t\tthis.putCache(lineNumber, lineText, tokens);\n\t\treturn tokens;\n\t}\n\n\t/**\n\t * Completion candidates for the identifier prefix immediately before\n\t * `cursorOffset` on `lineText`. Deliberately simple prefix matching, not\n\t * parser-driven \"what's grammatically valid here\" prediction, a\n\t * half-typed expression almost never parses, so gating on parse\n\t * validity (the way `getSemanticTokens` does) would suppress\n\t * completions almost always. This is the safest, fastest option that\n\t * still delivers real value.\n\t *\n\t * Candidates come from three sources: keywords (which already include\n\t * function names. See `ExpressionLexer.getKeywords()`'s doc comment)\n\t * and units, both static per engine configuration and cached lazily;\n\t * package-contributed items (`IEnginePackage.completionItems`), same\n\t * cache; and variable names, read fresh from `variableNameSource()` on\n\t * every call since those change on every edit.\n\t */\n\tgetCompletions(lineText: string, cursorOffset: number): CompletionItem[] {\n\t\tconst prefixMatch = /[A-Za-z0-9_]+$/.exec(lineText.slice(0, cursorOffset));\n\t\tif (!prefixMatch) return [];\n\t\tconst prefix = prefixMatch[0].toLowerCase();\n\n\t\tif (!this.engine) return [];\n\n\t\tconst matches: CompletionItem[] = [];\n\n\t\t// Variables are read fresh every call and there are few of them, so they\n\t\t// stay a linear scan.\n\t\tfor (const name of this.variableNameSource()) {\n\t\t\tif (name.toLowerCase().startsWith(prefix)) {\n\t\t\t\tmatches.push({ label: name, category: \"variable\" });\n\t\t\t}\n\t\t}\n\n\t\t// Static candidates only ever match if they share the prefix's first\n\t\t// character, so consult that bucket alone.\n\t\tconst bucket = this.getStaticCompletionIndex().get(prefix[0]);\n\t\tif (bucket) {\n\t\t\tfor (const candidate of bucket) {\n\t\t\t\tif (candidate.lowerLabel.startsWith(prefix)) matches.push(candidate.item);\n\t\t\t}\n\t\t}\n\n\t\tmatches.sort((a, b) => {\n\t\t\tconst tierDiff = (CATEGORY_TIER[a.category] ?? 3) - (CATEGORY_TIER[b.category] ?? 3);\n\t\t\tif (tierDiff !== 0) return tierDiff;\n\t\t\treturn a.label.localeCompare(b.label);\n\t\t});\n\n\t\treturn matches.slice(0, MAX_COMPLETIONS);\n\t}\n\n\t/** Lazily builds and caches the keyword/unit/package-item candidate list. See `staticCompletionCandidates`. */\n\tprivate getStaticCompletionCandidates(): CompletionItem[] {\n\t\tif (this.staticCompletionCandidates) return this.staticCompletionCandidates;\n\n\t\tconst items: CompletionItem[] = [];\n\t\tfor (const [word, tokenType] of Object.entries(this.engine!.getLexer().getKeywords())) {\n\t\t\tconst category = getTokenCategory(tokenType);\n\t\t\tif (!category) continue;\n\t\t\titems.push({ label: word, category });\n\t\t}\n\t\tfor (const unit of knownUnits) {\n\t\t\titems.push({ label: unit, category: \"unit\", detail: getMeasure(unit) });\n\t\t}\n\t\titems.push(...this.engine!.getPackageCompletionItems());\n\n\t\tthis.staticCompletionCandidates = items;\n\t\treturn items;\n\t}\n\n\t/**\n\t * The static candidates bucketed by lowercased first character, built once\n\t * from {@link getStaticCompletionCandidates} and invalidated alongside it.\n\t */\n\tprivate getStaticCompletionIndex(): Map<string, IndexedCompletionCandidate[]> {\n\t\tif (this.staticCompletionIndex) return this.staticCompletionIndex;\n\n\t\tconst index = new Map<string, IndexedCompletionCandidate[]>();\n\t\tfor (const item of this.getStaticCompletionCandidates()) {\n\t\t\tconst lowerLabel = item.label.toLowerCase();\n\t\t\tconst firstCharacter = lowerLabel[0];\n\t\t\t// A label cannot match any prefix if it is empty, and the prefix\n\t\t\t// regex guarantees at least one character on the query side.\n\t\t\tif (firstCharacter === undefined) continue;\n\t\t\tlet bucket = index.get(firstCharacter);\n\t\t\tif (bucket === undefined) {\n\t\t\t\tbucket = [];\n\t\t\t\tindex.set(firstCharacter, bucket);\n\t\t\t}\n\t\t\tbucket.push({ item, lowerLabel });\n\t\t}\n\n\t\tthis.staticCompletionIndex = index;\n\t\treturn index;\n\t}\n\n\tprivate isKnownVariable(name: string): boolean {\n\t\tfor (const known of this.variableNameSource()) {\n\t\t\tif (known === name) return true;\n\t\t}\n\t\treturn false;\n\t}\n\n\t/**\n\t * Whether the engine's parser actually accepts a piece of text as a\n\t * well-formed expression, not merely whether it lexes into individually\n\t * recognized token types. See the class doc comment's prose example.\n\t * `tryCompileExpression` is compile-only (lex → normalize → parse →\n\t * cache bytecode, no VM execution, no network/async side effects) and\n\t * reuses the engine's existing bytecode cache, so text that's already\n\t * been evaluated (or previously highlight-checked) is a cache hit here\n\t * too.\n\t *\n\t * Deliberately calls the non-throwing `tryCompileExpression` rather than\n\t * try/catching `compileExpression`. This runs on every visible line on\n\t * every keystroke, and the common case for a real markdown document is\n\t * lines that DON'T parse (prose), not lines that do. Throwing there would\n\t * mean constructing a EngineError (with V8 stack-trace capture) for the\n\t * common case instead of the rare one.\n\t */\n\tprivate parsesAsExpression(text: string): boolean {\n\t\treturn this.engine!.tryCompileExpression(text);\n\t}\n\n\tprivate putCache(lineNumber: number, text: string, tokens: SemanticToken[], bareWordCandidate?: string): void {\n\t\tif (!this.cache.has(lineNumber) && this.cache.size >= MAX_CACHED_LINES) {\n\t\t\tconst oldestKey = this.cache.keys().next().value;\n\t\t\tif (oldestKey !== undefined) this.cache.delete(oldestKey);\n\t\t}\n\t\tthis.cache.set(lineNumber, { text, tokens, bareWordCandidate });\n\t}\n\n\t/**\n\t * Evict specific lines (e.g. the lines actually touched by a CodeMirror\n\t * change set) instead of the whole cache, the surgical counterpart to\n\t * {@link invalidateCache}, letting a single-line edit stay cheap even in\n\t * a large document: every other cached line is untouched and still hits\n\t * on the next call.\n\t */\n\tinvalidateLines(lineNumbers: Iterable<number>): void {\n\t\tfor (const lineNumber of lineNumbers) {\n\t\t\tthis.cache.delete(lineNumber);\n\t\t}\n\t}\n\n\t/**\n\t * Full cache clear. Reserved for cases with no meaningful \"which lines\n\t * changed\" (e.g. the document was swapped wholesale, or a package was\n\t * registered/unregistered mid-session, changing what categories exist).\n\t * Prefer {@link invalidateLines} for ordinary edits. Also rebuilds the\n\t * lazily-cached keyword/unit/package-item completion candidates on next\n\t * use, the only thing that can change that list mid-session.\n\t */\n\tinvalidateCache(): void {\n\t\tthis.cache.clear();\n\t\tthis.staticCompletionCandidates = null;\n\t\tthis.staticCompletionIndex = null;\n\t}\n}\n","import type { TokenCategory } from \"@solve-js/language/TokenCategory\";\n\n/**\n * Namespace applied to a semantic category when no other one is asked for.\n *\n * A prefix is needed because a bare category name like `number` or `error`\n * would collide with almost any host stylesheet. `solve-` is the narrowest\n * namespace that still says where the class came from, and it deliberately\n * names this library rather than any particular editor.\n */\nexport const DEFAULT_TOKEN_CLASS_PREFIX = \"solve-\";\n\n/**\n * Maps a semantic category to a predictable, stable CSS class name.\n *\n * Deliberately trivial: the category name IS the class-name key\n * (`\"number\"` → `solve-number`), so there is no separate table to keep in\n * sync as categories grow. A brand-new category, including one contributed\n * by a solve-js package at runtime, gets a matching class name with no\n * changes here.\n *\n * This is editor-agnostic on purpose. It produces a class-name string and\n * nothing else, so it works the same whether the host is CodeMirror\n * (`Decoration.mark({ class: tokenClassName(token.category) })`), Slate,\n * ProseMirror, Monaco or a plain `<span>`. Actual colors are pure CSS,\n * resolved from `--solve-hl-{category}` custom properties by each consumer.\n *\n * @param category - Semantic category from `getSemanticTokens()`.\n * @param prefix - Namespace to apply. Defaults to `solve-`.\n * @returns The class name for that category.\n */\nexport function tokenClassName(category: TokenCategory, prefix: string = DEFAULT_TOKEN_CLASS_PREFIX): string {\n\treturn `${prefix}${category}`;\n}\n\n/**\n * Builds a `tokenClassName` bound to a fixed prefix.\n *\n * The prefix is configurable because a host may already own a namespace it\n * wants these classes to sit inside: a CodeMirror theme that keys off `cm-`,\n * a design system that scopes everything under one token, or an app that\n * embeds two editors and wants to style them apart. Passing the prefix once\n * here is cheaper than threading it through every call site.\n *\n * ```ts\n * const className = createTokenClassName(\"cm-solve-\");\n * className(\"number\"); // \"cm-solve-number\"\n * ```\n *\n * @param prefix - Namespace to apply to every category.\n * @returns A function mapping a category to a prefixed class name.\n */\nexport function createTokenClassName(prefix: string): (category: TokenCategory) => string {\n\treturn (category: TokenCategory) => `${prefix}${category}`;\n}\n","import type { TokenCategory } from \"@solve-js/language/TokenCategory\";\nimport type { CompletionItem } from \"@solve-js/language/LanguageService\";\n\n/**\n * Maps a semantic category to one of `@codemirror/autocomplete`'s built-in\n * completion \"type\" strings (which drive its default gutter icon), the one\n * genuinely CodeMirror-specific thing this feature needs. Falls back to\n * \"text\" for anything unmapped, including plugin-contributed categories\n * (e.g. OSRS's \"osrs-item\"), a reasonable neutral default rather than a\n * hard failure for a category this adapter doesn't know about yet.\n *\n * No `@codemirror/autocomplete` import here, the returned object shape is\n * structurally compatible with CM6's `Completion` type by duck typing, so\n * `solve-js` gains no new dependency; the actual `CompletionSource`\n * function (reading `CompletionContext`, building a `CompletionResult`)\n * lives in each consumer (src/app, playground), same tier as\n * `buildDecorations()` already is for highlighting.\n */\nconst CATEGORY_TO_COMPLETION_TYPE: Partial<Record<TokenCategory, string>> = {\n\tkeyword: \"keyword\",\n\toperator: \"keyword\",\n\tcomparison: \"keyword\",\n\tbitwise: \"keyword\",\n\tfunction: \"function\",\n\tvariable: \"variable\",\n\tunit: \"type\",\n\tdatetime: \"keyword\",\n\tvector: \"type\",\n};\n\n/**\n * Convert a completion into CodeMirror's option shape.\n *\n * Kept in an adapter so the language service itself stays editor-agnostic.\n *\n * @param item - Completion produced by the language service.\n * @returns The equivalent CodeMirror option.\n */\nexport function completionItemToOption(item: CompletionItem): { label: string; type: string; detail?: string } {\n\treturn { label: item.label, type: CATEGORY_TO_COMPLETION_TYPE[item.category] ?? \"text\", detail: item.detail };\n}\n"]}
+{"version":3,"sources":["../src/language/LanguageService.ts","../src/language/tokenClassName.ts","../src/language/adapters/codemirror.ts"],"names":["MAX_COMPLETIONS","CATEGORY_TIER","MAX_CACHED_LINES","LanguageService","engine","options","snapshot","names","written","name","lineText","lexer","raw","source","normalized","out","token","end","getTokenCategory","lineNumber","cached","lexed","classification","tokens","validSpans","span","from","to","s","text","cursorOffset","prefixMatch","prefix","matches","bucket","candidate","a","b","tierDiff","items","word","tokenType","category","unit","knownUnits","getMeasure","index","item","lowerLabel","firstCharacter","known","bareWordCandidate","oldestKey","lineNumbers","DEFAULT_TOKEN_CLASS_PREFIX","tokenClassName","createTokenClassName","CATEGORY_TO_COMPLETION_TYPE","completionItemToOption"],"mappings":"sRAkCA,IAAMA,CAAAA,CAAkB,GAGlBC,CAAAA,CAAwD,CAC7D,SAAU,CAAA,CACV,QAAA,CAAU,CAAA,CACV,OAAA,CAAS,CAAA,CACT,QAAA,CAAU,EACV,UAAA,CAAY,CAAA,CACZ,OAAA,CAAS,CAAA,CACT,QAAA,CAAU,CAAA,CACV,OAAQ,CAAA,CACR,IAAA,CAAM,CACP,CAAA,CAGMC,CAAAA,CAAmB,GAAA,CAwGZC,EAAN,KAAsB,CA0C5B,WAAA,CAAYC,CAAAA,CAAkCC,CAAAA,CAAkC,CAtBhF,KAAQ,KAAA,CAAQ,IAAI,GAAA,CASpB,IAAA,CAAQ,0BAAA,CAAsD,IAAA,CAW9D,KAAQ,qBAAA,CAA0E,IAAA,CAGjF,IAAA,CAAK,MAAA,CAASD,CAAAA,EAAU,IAAA,CACxB,KAAK,kBAAA,CAAqBC,CAAAA,EAAS,kBAAA,GAAuB,IAAM,IAAA,CAAK,oBAAA,IACrE,IAAA,CAAK,wBAAA,CAA2BA,GAAS,wBAAA,EAA4B,MACtE,CAEQ,oBAAA,EAAyC,CAChD,GAAI,CAAC,IAAA,CAAK,MAAA,CAAQ,OAAO,EAAC,CAC1B,IAAMC,CAAAA,CAAW,IAAA,CAAK,MAAA,CAAO,QAAO,CAAE,WAAA,EAAY,CAC5CC,CAAAA,CAAQ,IAAI,GAAA,CAAY,OAAO,IAAA,CAAKD,CAAAA,CAAS,SAAS,CAAC,CAAA,CAC7D,IAAA,IAAWE,KAAW,MAAA,CAAO,MAAA,CAAOF,CAAAA,CAAS,MAAM,CAAA,CAClD,IAAA,IAAWG,KAAQD,CAAAA,CAASD,CAAAA,CAAM,GAAA,CAAIE,CAAI,CAAA,CAE3C,OAAOF,CACR,CA+BQ,kBAAA,CACPG,CAAAA,CACsH,CACtH,IAAMC,CAAAA,CAAQ,KAAK,MAAA,CAAQ,QAAA,GACrBC,CAAAA,CAAMD,CAAAA,CAAM,yBAAyBD,CAAQ,CAAA,CACnD,GAAIE,CAAAA,CAAI,MAAA,GAAW,CAAA,CAAG,OAAO,EAAC,CAI9B,IAAMC,CAAAA,CACLH,CAAAA,CAAS,UAAA,CAAW,IAAI,CAAA,EAAKC,CAAAA,CAAM,YAAA,CAAaD,CAAQ,CAAA,CAAE,IAAA,CAAOA,EAAS,KAAA,CAAM,CAAC,CAAA,CAAIA,CAAAA,CAElFI,CAAAA,CACJ,GAAI,CACHA,CAAAA,CAAa,IAAA,CAAK,MAAA,CAAQ,aAAA,EAAc,CAAE,SAAA,CAAUF,CAAG,EACxD,CAAA,KAAQ,CAIPE,CAAAA,CAAaF,EACd,CAEA,IAAMG,CAAAA,CAOA,EAAC,CAEP,IAAA,IAAWC,CAAAA,IAASF,CAAAA,CAAY,CAC/B,IAAIG,CAAAA,CACJ,GAAID,CAAAA,CAAM,SAAA,GAAc,OACvBC,CAAAA,CAAMD,CAAAA,CAAM,SAAA,CAAA,KAAA,GACFH,CAAAA,CAAO,UAAA,CAAWG,CAAAA,CAAM,KAAMA,CAAAA,CAAM,MAAM,CAAA,CAMpDC,CAAAA,CAAMD,CAAAA,CAAM,MAAA,CAASA,EAAM,IAAA,CAAK,MAAA,CAAA,KAEhC,SAGDD,CAAAA,CAAI,IAAA,CAAK,CACR,KAAMC,CAAAA,CAAM,IAAA,CACZ,KAAA,CAAOA,CAAAA,CAAM,KAAA,CACb,MAAA,CAAQA,EAAM,MAAA,CACd,GAAA,CAAKA,CAAAA,CAAM,GAAA,CACX,MAAA,CAAQC,CAAAA,CAAMD,EAAM,MAAA,CACpB,QAAA,CAAUE,CAAAA,CAAiBF,CAAAA,CAAM,IAAI,CACtC,CAAC,EACF,CAEA,OAAOD,CACR,CAUA,iBAAA,CAAkBL,EAAkBS,CAAAA,CAAqC,CACxE,IAAMC,CAAAA,CAAS,IAAA,CAAK,MAAM,GAAA,CAAID,CAAU,CAAA,CACxC,GAAIC,CAAAA,EAAUA,CAAAA,CAAO,OAASV,CAAAA,CAC7B,OAAIU,CAAAA,CAAO,iBAAA,GAAsB,MAAA,CACzB,IAAA,CAAK,gBAAgBA,CAAAA,CAAO,iBAAiB,CAAA,CAAIA,CAAAA,CAAO,MAAA,CAAS,GAElEA,CAAAA,CAAO,MAAA,CAGf,GAAI,CAAC,IAAA,CAAK,MAAA,CAGT,OAAO,EAAC,CAGT,IAAMT,CAAAA,CAAQ,IAAA,CAAK,MAAA,CAAO,UAAS,CAC7BU,CAAAA,CAAQ,IAAA,CAAK,wBAAA,CAChB,IAAA,CAAK,kBAAA,CAAmBX,CAAQ,CAAA,CAChCC,CAAAA,CAAM,kBAAA,CAAmBD,CAAQ,CAAA,CACpC,GAAIW,EAAM,MAAA,GAAW,CAAA,CACpB,YAAK,QAAA,CAASF,CAAAA,CAAYT,EAAU,EAAE,CAAA,CAC/B,EAAC,CAGT,IAAMY,EAAiBX,CAAAA,CAAM,YAAA,CAAaD,CAAQ,CAAA,CAC5Ca,CAAAA,CAA0B,GAEhC,GAAID,CAAAA,CAAe,cAAA,CAAgB,CAQlC,IAAME,CAAAA,CAAab,EACjB,gBAAA,CAAiBD,CAAQ,CAAA,CACzB,MAAA,CAAOe,CAAAA,EAAQ,IAAA,CAAK,mBAAmBA,CAAAA,CAAK,UAAU,CAAC,CAAA,CACvD,GAAA,CAAIA,CAAAA,GAAS,CAAE,IAAA,CAAMA,CAAAA,CAAK,KAAA,CAAO,EAAA,CAAIA,CAAAA,CAAK,GAAI,EAAE,CAAA,CAClD,IAAA,IAAWT,CAAAA,IAASK,CAAAA,CAAO,CAC1B,GAAI,CAACL,CAAAA,CAAM,QAAA,CAAU,SACrB,IAAMU,CAAAA,CAAOV,EAAM,MAAA,CACbW,CAAAA,CAAKX,CAAAA,CAAM,MAAA,CAASA,CAAAA,CAAM,MAAA,CAC3BQ,EAAW,IAAA,CAAKI,CAAAA,EAAKF,CAAAA,EAAQE,CAAAA,CAAE,IAAA,EAAQD,CAAAA,EAAMC,EAAE,EAAE,CAAA,EACtDL,CAAAA,CAAO,IAAA,CAAK,CAAE,IAAA,CAAAG,EAAM,EAAA,CAAAC,CAAAA,CAAI,QAAA,CAAUX,CAAAA,CAAM,QAAS,CAAC,EACnD,CACD,CAAA,KAAO,CAKN,IAAMa,CAAAA,CAAOnB,CAAAA,CAAS,WAAW,IAAI,CAAA,EAAKY,CAAAA,CAAe,IAAA,CACtDZ,CAAAA,CAAS,KAAA,CAAM,CAAC,CAAA,CAChBA,CAAAA,CACH,GAAI,IAAA,CAAK,kBAAA,CAAmBmB,CAAI,EAC/B,IAAA,IAAWb,CAAAA,IAASK,EACdL,CAAAA,CAAM,QAAA,EACXO,EAAO,IAAA,CAAK,CAAE,IAAA,CAAMP,CAAAA,CAAM,MAAA,CAAQ,EAAA,CAAIA,EAAM,MAAA,CAASA,CAAAA,CAAM,MAAA,CAAQ,QAAA,CAAUA,CAAAA,CAAM,QAAS,CAAC,EAGhG,CAcA,GAAIO,CAAAA,CAAO,MAAA,GAAW,CAAA,EAAKA,EAAO,CAAC,CAAA,CAAE,QAAA,GAAa,UAAA,CAAY,CAC7D,IAAMd,EAAOC,CAAAA,CAAS,KAAA,CAAMa,CAAAA,CAAO,CAAC,CAAA,CAAE,IAAA,CAAMA,EAAO,CAAC,CAAA,CAAE,EAAE,CAAA,CACxD,OAAA,IAAA,CAAK,QAAA,CAASJ,EAAYT,CAAAA,CAAUa,CAAAA,CAAQd,CAAI,CAAA,CACzC,IAAA,CAAK,eAAA,CAAgBA,CAAI,CAAA,CAAIc,CAAAA,CAAS,EAC9C,CAEA,YAAK,QAAA,CAASJ,CAAAA,CAAYT,CAAAA,CAAUa,CAAM,CAAA,CACnCA,CACR,CAkBA,cAAA,CAAeb,CAAAA,CAAkBoB,CAAAA,CAAwC,CACxE,IAAMC,CAAAA,CAAc,iBAAiB,IAAA,CAAKrB,CAAAA,CAAS,KAAA,CAAM,CAAA,CAAGoB,CAAY,CAAC,EACzE,GAAI,CAACC,CAAAA,CAAa,OAAO,EAAC,CAC1B,IAAMC,CAAAA,CAASD,CAAAA,CAAY,CAAC,CAAA,CAAE,WAAA,EAAY,CAE1C,GAAI,CAAC,IAAA,CAAK,MAAA,CAAQ,OAAO,EAAC,CAE1B,IAAME,CAAAA,CAA4B,EAAC,CAInC,IAAA,IAAWxB,CAAAA,IAAQ,IAAA,CAAK,oBAAmB,CACtCA,CAAAA,CAAK,aAAY,CAAE,UAAA,CAAWuB,CAAM,CAAA,EACvCC,CAAAA,CAAQ,IAAA,CAAK,CAAE,KAAA,CAAOxB,CAAAA,CAAM,SAAU,UAAW,CAAC,CAAA,CAMpD,IAAMyB,CAAAA,CAAS,IAAA,CAAK,0BAAyB,CAAE,GAAA,CAAIF,CAAAA,CAAO,CAAC,CAAC,CAAA,CAC5D,GAAIE,CAAAA,CACH,IAAA,IAAWC,CAAAA,IAAaD,CAAAA,CACnBC,CAAAA,CAAU,UAAA,CAAW,WAAWH,CAAM,CAAA,EAAGC,CAAAA,CAAQ,IAAA,CAAKE,CAAAA,CAAU,IAAI,EAI1E,OAAAF,CAAAA,CAAQ,IAAA,CAAK,CAACG,CAAAA,CAAGC,CAAAA,GAAM,CACtB,IAAMC,CAAAA,CAAAA,CAAYrC,CAAAA,CAAcmC,CAAAA,CAAE,QAAQ,CAAA,EAAK,IAAMnC,CAAAA,CAAcoC,CAAAA,CAAE,QAAQ,CAAA,EAAK,CAAA,CAAA,CAClF,OAAIC,CAAAA,GAAa,CAAA,CAAUA,CAAAA,CACpBF,CAAAA,CAAE,KAAA,CAAM,aAAA,CAAcC,EAAE,KAAK,CACrC,CAAC,CAAA,CAEMJ,CAAAA,CAAQ,KAAA,CAAM,EAAGjC,CAAe,CACxC,CAGQ,6BAAA,EAAkD,CACzD,GAAI,KAAK,0BAAA,CAA4B,OAAO,IAAA,CAAK,0BAAA,CAEjD,IAAMuC,CAAAA,CAA0B,EAAC,CACjC,IAAA,GAAW,CAACC,CAAAA,CAAMC,CAAS,CAAA,GAAK,OAAO,OAAA,CAAQ,IAAA,CAAK,MAAA,CAAQ,QAAA,EAAS,CAAE,WAAA,EAAa,CAAA,CAAG,CACtF,IAAMC,CAAAA,CAAWxB,CAAAA,CAAiBuB,CAAS,EACtCC,CAAAA,EACLH,CAAAA,CAAM,KAAK,CAAE,KAAA,CAAOC,EAAM,QAAA,CAAAE,CAAS,CAAC,EACrC,CACA,IAAA,IAAWC,KAAQC,CAAAA,CAClBL,CAAAA,CAAM,IAAA,CAAK,CAAE,KAAA,CAAOI,CAAAA,CAAM,SAAU,MAAA,CAAQ,MAAA,CAAQE,CAAAA,CAAWF,CAAI,CAAE,CAAC,EAEvE,OAAAJ,CAAAA,CAAM,IAAA,CAAK,GAAG,IAAA,CAAK,MAAA,CAAQ,2BAA2B,CAAA,CAEtD,IAAA,CAAK,0BAAA,CAA6BA,CAAAA,CAC3BA,CACR,CAMQ,wBAAA,EAAsE,CAC7E,GAAI,IAAA,CAAK,qBAAA,CAAuB,OAAO,KAAK,qBAAA,CAE5C,IAAMO,CAAAA,CAAQ,IAAI,GAAA,CAClB,IAAA,IAAWC,KAAQ,IAAA,CAAK,6BAAA,GAAiC,CACxD,IAAMC,EAAaD,CAAAA,CAAK,KAAA,CAAM,WAAA,EAAY,CACpCE,CAAAA,CAAiBD,CAAAA,CAAW,CAAC,CAAA,CAGnC,GAAIC,CAAAA,GAAmB,MAAA,CAAW,SAClC,IAAIf,EAASY,CAAAA,CAAM,GAAA,CAAIG,CAAc,CAAA,CACjCf,CAAAA,GAAW,MAAA,GACdA,EAAS,EAAC,CACVY,CAAAA,CAAM,GAAA,CAAIG,CAAAA,CAAgBf,CAAM,GAEjCA,CAAAA,CAAO,IAAA,CAAK,CAAE,IAAA,CAAAa,CAAAA,CAAM,UAAA,CAAAC,CAAW,CAAC,EACjC,CAEA,OAAA,IAAA,CAAK,qBAAA,CAAwBF,CAAAA,CACtBA,CACR,CAEQ,eAAA,CAAgBrC,CAAAA,CAAuB,CAC9C,IAAA,IAAWyC,CAAAA,IAAS,KAAK,kBAAA,EAAmB,CAC3C,GAAIA,CAAAA,GAAUzC,CAAAA,CAAM,OAAO,KAAA,CAE5B,OAAO,MACR,CAmBQ,kBAAA,CAAmBoB,CAAAA,CAAuB,CACjD,OAAO,IAAA,CAAK,MAAA,CAAQ,oBAAA,CAAqBA,CAAI,CAC9C,CAEQ,QAAA,CAASV,CAAAA,CAAoBU,CAAAA,CAAcN,CAAAA,CAAyB4B,CAAAA,CAAkC,CAC7G,GAAI,CAAC,IAAA,CAAK,KAAA,CAAM,GAAA,CAAIhC,CAAU,CAAA,EAAK,KAAK,KAAA,CAAM,IAAA,EAAQjB,CAAAA,CAAkB,CACvE,IAAMkD,CAAAA,CAAY,KAAK,KAAA,CAAM,IAAA,EAAK,CAAE,IAAA,EAAK,CAAE,KAAA,CACvCA,IAAc,MAAA,EAAW,IAAA,CAAK,KAAA,CAAM,MAAA,CAAOA,CAAS,EACzD,CACA,IAAA,CAAK,KAAA,CAAM,IAAIjC,CAAAA,CAAY,CAAE,KAAAU,CAAAA,CAAM,MAAA,CAAAN,CAAAA,CAAQ,iBAAA,CAAA4B,CAAkB,CAAC,EAC/D,CASA,eAAA,CAAgBE,CAAAA,CAAqC,CACpD,IAAA,IAAWlC,CAAAA,IAAckC,EACxB,IAAA,CAAK,KAAA,CAAM,MAAA,CAAOlC,CAAU,EAE9B,CAUA,iBAAwB,CACvB,IAAA,CAAK,KAAA,CAAM,KAAA,EAAM,CACjB,IAAA,CAAK,2BAA6B,IAAA,CAClC,IAAA,CAAK,qBAAA,CAAwB,KAC9B,CACD,MC5hBamC,CAAAA,CAA6B,SAqBnC,SAASC,CAAAA,CAAeb,CAAAA,CAAyBV,CAAAA,CAAiBsB,EAAoC,CAC5G,OAAO,CAAA,EAAGtB,CAAM,CAAA,EAAGU,CAAQ,EAC5B,CAmBO,SAASc,CAAAA,CAAqBxB,CAAAA,CAAqD,CACzF,OAAQU,GAA4B,CAAA,EAAGV,CAAM,CAAA,EAAGU,CAAQ,CAAA,CACzD,CCpCA,IAAMe,CAAAA,CAAsE,CAC3E,OAAA,CAAS,SAAA,CACT,QAAA,CAAU,SAAA,CACV,WAAY,SAAA,CACZ,OAAA,CAAS,SAAA,CACT,QAAA,CAAU,UAAA,CACV,QAAA,CAAU,WACV,IAAA,CAAM,MAAA,CACN,QAAA,CAAU,SAAA,CACV,MAAA,CAAQ,MACT,EAUO,SAASC,CAAAA,CAAuBX,CAAAA,CAAwE,CAC9G,OAAO,CAAE,MAAOA,CAAAA,CAAK,KAAA,CAAO,IAAA,CAAMU,CAAAA,CAA4BV,CAAAA,CAAK,QAAQ,GAAK,MAAA,CAAQ,MAAA,CAAQA,CAAAA,CAAK,MAAO,CAC7G","file":"language.js","sourcesContent":["import type { ExpressionEngine } from \"@solve-js/engine/ExpressionEngine\";\nimport type { TokenCategory } from \"@solve-js/language/TokenCategory\";\nimport { getTokenCategory } from \"@solve-js/language/TokenCategoryMap\";\nimport type { Token } from \"@solve-js/lexer/Token\";\nimport { knownUnits } from \"@solve-js/lexer/units\";\nimport { getMeasure } from \"@solve-js/uom/UomConverter\";\n\n/** A single classified span within a line, the entire output contract of the language service. */\nexport interface SemanticToken {\n\tfrom: number;\n\tto: number;\n\tcategory: TokenCategory;\n}\n\n/** A single completion candidate, the entire output contract of `getCompletions()`. */\nexport interface CompletionItem {\n\tlabel: string;\n\t/** Reuses the highlighting taxonomy, one adapter can serve both features. */\n\tcategory: TokenCategory;\n\t/** e.g. a unit's measure (\"length\"), or the category name for keywords/functions. */\n\tdetail?: string;\n}\n\n/**\n * A completion candidate with its lowercased label precomputed.\n *\n * Internal to the prefix index; callers only ever see the {@link CompletionItem}.\n */\ninterface IndexedCompletionCandidate {\n\titem: CompletionItem;\n\tlowerLabel: string;\n}\n\n/** Completion results are capped, a document-wide candidate pool has no reason to return more than this. */\nconst MAX_COMPLETIONS = 50;\n\n/** Tier ordering for completion results: user-authored variables first, then grammar, then units. */\nconst CATEGORY_TIER: Partial<Record<TokenCategory, number>> = {\n\tvariable: 0,\n\tfunction: 1,\n\tkeyword: 1,\n\toperator: 1,\n\tcomparison: 1,\n\tbitwise: 1,\n\tdatetime: 1,\n\tvector: 1,\n\tunit: 2,\n};\n\n/** Bounded cache size. See the eviction-policy note on `LanguageService.cache`. */\nconst MAX_CACHED_LINES = 2000;\n\ninterface CacheEntry {\n\ttext: string;\n\ttokens: SemanticToken[];\n\t// When set, `tokens` is a single bare-identifier token whose validity\n\t// depends on document-wide DAG state (see the bare-word gate in\n\t// getSemanticTokens), not just this line's own text, so it can't be\n\t// cached as a plain pass/fail result the way every other line can. The\n\t// lex+parse work that produced `tokens` is still cached normally; only\n\t// the DAG membership check is re-run on every lookup (cache hit or\n\t// miss alike), since it's cheap (a Set lookup) and the alternative\n\t// caching the gated result, would go stale the moment some OTHER\n\t// line's edit changes what variables exist, with nothing to trigger a\n\t// re-check of this untouched line.\n\tbareWordCandidate?: string;\n}\n\n/** Options for the editor-facing language service: completions and highlighting. */\nexport interface LanguageServiceOptions {\n\t/**\n\t * Overrides how the service discovers \"variable names known in this\n\t * document\", used to legitimize a lone bare identifier line (see\n\t * `getSemanticTokens`'s single-token gate) and variable-name\n\t * completions (`getCompletions`). Defaults to reading\n\t * `engine.getDag().getSnapshot()`, which works for any consumer\n\t * sharing one `ExpressionEngine` between evaluation and the language\n\t * service (the real Obsidian editor).\n\t *\n\t * Required for consumers whose language service is backed by a\n\t * *different*, non-evaluating engine than the one that actually runs\n\t * the document (the playground's dedicated lexing-only engine, whose\n\t * own DAG is always empty), pass a function reading the real\n\t * evaluation engine's DAG snapshot instead.\n\t */\n\tvariableNameSource?: () => Iterable<string>;\n\n\t/**\n\t * Run the normalizer on the highlighting path, so phrase-fused tokens are\n\t * classified as the thing the parser will actually see.\n\t *\n\t * Off by default, and the default is a judgement rather than an oversight.\n\t * Highlighting runs per keystroke, normalization is real work, and a host\n\t * that is happy with lexer-level categories should not start paying for\n\t * fusion because a new version shipped. Turn it on and `12/09/2026` is one\n\t * `datetime` span instead of five number and operator spans; leave it off\n\t * and nothing about this class changes.\n\t *\n\t * See `benchmarks/languageServiceBenchmarks.spec.ts` for what it costs.\n\t */\n\tnormalizeForHighlighting?: boolean;\n}\n\n/**\n * Editor-agnostic \"language server\" for solve expressions: turns a line of\n * text into semantic token ranges, using the exact same lexer real\n * evaluation uses (so it only ever classifies what the engine's grammar\n * actually recognizes, never a separate/duplicated tokenizer). No\n * knowledge of CSS, CodeMirror, VS Code, or any other rendering concept\n * lives here. See `language/adapters/` for that.\n *\n * Classification happens at the LEXER stage, before the normalizer runs\n * (normalization, phrase fusion, implicit multiply, and package-specific\n * rules, happens later, only on the real evaluation path). A package's\n * lexer-level custom token types (e.g. a custom keyword) are recognized\n * here exactly as evaluation would see them. A package's *normalizer*-fused\n * synthetic tokens (e.g. OSRS's GAME_ITEM, built by fusing several\n * consecutive IDENT tokens against an item-name trie) are NOT. This\n * service still shows the pre-fusion IDENT tokens individually for those.\n * `IEnginePackage.tokenCategories` entries for normalizer-only token types\n * are still valid, correct registrations (queryable via getTokenCategory)\n *, they just won't currently be reachable through this lexer-only\n * classification path. Folding normalization in would require running it\n * per keystroke on the highlighting path too, which needs its own careful\n * design (span recomputation for fused multi-token ranges, in particular)\n * rather than a quick addition here.\n *\n * Lexing alone is NOT sufficient to decide \"recognized\", though: a run of\n * plain-English words (\"My name is ron\") lexes into a sequence of\n * individually-valid IDENT tokens with no grammar tying them together\n * every word \"recognized\" at the token level, but the line as a whole is\n * not something the engine would ever accept as an expression. Surfacing\n * per-token colors for that case looks like the editor mistook prose for\n * code. So a line's tokens are only surfaced once the line as a whole\n * parses successfully (via `ExpressionEngine.compileExpression`, the same\n * parse pipeline, and the same bytecode cache, real evaluation uses; no\n * separate/duplicated grammar check). A single bare word (\"hello\", a valid\n * variable reference) or a keyword-only line (\"pi\") still parses and still\n * highlights, only genuinely ungrammatical text is suppressed, unless it's\n * a known variable elsewhere in the document (see `variableNameSource`).\n *\n * `getCompletions()` is the other half of this \"language server\": unlike\n * `getSemanticTokens()`, it's explicitly for *incomplete*, mid-typing text\n *, it deliberately does NOT gate on parse validity (a half-typed\n * expression almost never parses), using simple prefix matching instead.\n *\n * Must be constructed with an already-configured `ExpressionEngine` (one\n * with all currently-relevant packages registered) rather than a bare\n * lexer, reusing an existing engine is both the fast path (no throwaway\n * lexer construction) and the *correct* one: a highlighting-only lexer\n * built independently of the evaluation engine would silently fail to\n * recognize plugin-contributed tokens (e.g. a package's custom keywords)\n * unless it happened to have the identical packages registered.\n */\nexport class LanguageService {\n\tprivate engine: ExpressionEngine | null;\n\tprivate variableNameSource: () => Iterable<string>;\n\tprivate readonly normalizeForHighlighting: boolean;\n\n\t// Bounded cache keyed by line number ALONE, not `${lineNumber}:${lineText}`\n\t// as an earlier version of this class did. A line's previous text state is\n\t// never useful once it changes, so keying on text too was pure waste:\n\t// every keystroke on a line minted a brand-new, never-reclaimed cache\n\t// entry (an effective per-keystroke memory leak over a long editing\n\t// session). Keying on line number alone makes \"same line, new text\" a\n\t// cheap overwrite instead.\n\t//\n\t// Eviction is oldest-inserted (Map iteration order) when at capacity\n\t// mirroring the same bounded-cache pattern ExpressionEngine's own\n\t// bytecodeCache already uses elsewhere in this codebase. Deliberately\n\t// NOT an LFU (least-frequently-used) policy: LFU would keep resisting\n\t// eviction of old, once-popular lines while punishing a line that just\n\t// scrolled into view (frequency 1), the opposite of what a \"currently\n\t// visible\" cache should prioritize.\n\tprivate cache = new Map<number, CacheEntry>();\n\n\t// Keyword/unit/package-contributed completion candidates don't depend\n\t// on any particular line, built lazily on first getCompletions() call\n\t// and reused after that, since a package registration is the only thing\n\t// that could ever change this list mid-session (see invalidateCache()).\n\t// Variable-name candidates are NOT part of this, they're read fresh on\n\t// every call from variableNameSource(), since those genuinely change on\n\t// every edit.\n\tprivate staticCompletionCandidates: CompletionItem[] | null = null;\n\n\t// The same candidates, bucketed by their lowercased first character with the\n\t// lowercased label precomputed. getCompletions() runs on every keystroke and\n\t// only ever wants candidates sharing the prefix's first character, so\n\t// scanning the whole list and lowercasing each label per call was doing two\n\t// avoidable things: touching entries that could not possibly match, and\n\t// allocating a string per candidate per keystroke. That was affordable when\n\t// the vocabulary was a few hundred entries. Deriving the unit list from the\n\t// conversion tables took it past a thousand, and the warm completion\n\t// benchmarks regressed roughly 2.9x until this was added.\n\tprivate staticCompletionIndex: Map<string, IndexedCompletionCandidate[]> | null = null;\n\n\tconstructor(engine?: ExpressionEngine | null, options?: LanguageServiceOptions) {\n\t\tthis.engine = engine ?? null;\n\t\tthis.variableNameSource = options?.variableNameSource ?? (() => this.defaultVariableNames());\n\t\tthis.normalizeForHighlighting = options?.normalizeForHighlighting ?? false;\n\t}\n\n\tprivate defaultVariableNames(): Iterable<string> {\n\t\tif (!this.engine) return [];\n\t\tconst snapshot = this.engine.getDag().getSnapshot();\n\t\tconst names = new Set<string>(Object.keys(snapshot.consumers));\n\t\tfor (const written of Object.values(snapshot.writes)) {\n\t\t\tfor (const name of written) names.add(name);\n\t\t}\n\t\treturn names;\n\t}\n\n\t/**\n\t * Lex a line, normalize it, and place every resulting token back in the\n\t * source text.\n\t *\n\t * ## Why placing them back is the hard part\n\t *\n\t * Normalization produces three kinds of token and only one of them can be\n\t * highlighted the obvious way.\n\t *\n\t * A token the normalizer left alone still describes its own text, so its\n\t * span is `offset` to `offset + text.length`, exactly as before.\n\t *\n\t * A FUSED token does not. `10 frames` becomes a FRAME_COUNT whose value is\n\t * `10`, and a timecode becomes a token whose value is a comma-separated\n\t * tuple appearing nowhere on the line. Those carry `sourceEnd`, set by\n\t * `createFusedToken`, which is the only place that knows where the fusion\n\t * ended.\n\t *\n\t * An INSERTED token has no text at all. Implicit multiplication puts a STAR\n\t * at the following token's offset, so `5(3)` gains a `*` sitting exactly\n\t * where the `(` is. Painting it would colour a character the reader never\n\t * typed as an operator, and would overlap the token that really is there.\n\t * These are dropped, detected by the one test that needs no cooperation\n\t * from any rule: a token with no recorded fusion span must match the text\n\t * at its own offset, and an inserted one does not.\n\t *\n\t * @param lineText - The raw line.\n\t * @returns Spans in the same shape `Lexer.getHighlightTokens` returns.\n\t */\n\tprivate classifyNormalized(\n\t\tlineText: string,\n\t): { type: string; value: string; offset: number; col: number; length: number; category: TokenCategory | undefined }[] {\n\t\tconst lexer = this.engine!.getLexer();\n\t\tconst raw = lexer.getHighlightTokenObjects(lineText);\n\t\tif (raw.length === 0) return [];\n\n\t\t// Offsets from a blockquote line are relative to the stripped text, so\n\t\t// the text this checks against has to be stripped the same way.\n\t\tconst source =\n\t\t\tlineText.startsWith(\"> \") && lexer.classifyLine(lineText).skip ? lineText.slice(2) : lineText;\n\n\t\tlet normalized: Token[];\n\t\ttry {\n\t\t\tnormalized = this.engine!.getNormalizer().normalize(raw);\n\t\t} catch {\n\t\t\t// Normalization is an enhancement here, not a requirement. A rule\n\t\t\t// that throws on a half-typed line should cost the reader phrase\n\t\t\t// colouring, not all colouring.\n\t\t\tnormalized = raw;\n\t\t}\n\n\t\tconst out: {\n\t\t\ttype: string;\n\t\t\tvalue: string;\n\t\t\toffset: number;\n\t\t\tcol: number;\n\t\t\tlength: number;\n\t\t\tcategory: TokenCategory | undefined;\n\t\t}[] = [];\n\n\t\tfor (const token of normalized) {\n\t\t\tlet end: number;\n\t\t\tif (token.sourceEnd !== undefined) {\n\t\t\t\tend = token.sourceEnd;\n\t\t\t} else if (source.startsWith(token.text, token.offset)) {\n\t\t\t\t// `text`, not `value`. They are the same string for almost every\n\t\t\t\t// token, and differ for a string literal, whose value is the\n\t\t\t\t// payload while its text is the quoted source slice. Matching on\n\t\t\t\t// value dropped every string literal from the painted line,\n\t\t\t\t// since `gbp` does not appear at the offset where `\"gbp\"` does.\n\t\t\t\tend = token.offset + token.text.length;\n\t\t\t} else {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tout.push({\n\t\t\t\ttype: token.type,\n\t\t\t\tvalue: token.value,\n\t\t\t\toffset: token.offset,\n\t\t\t\tcol: token.col,\n\t\t\t\tlength: end - token.offset,\n\t\t\t\tcategory: getTokenCategory(token.type),\n\t\t\t});\n\t\t}\n\n\t\treturn out;\n\t}\n\n\t/**\n\t * Classify every recognized token on one line.\n\t *\n\t * @param lineText - The raw line text (may be a markdown-structural line\n\t *   the engine's classifier skips, that's handled by the underlying\n\t *   lexer, which returns no tokens for those).\n\t * @param lineNumber - 1-based line number, used purely as a cache key.\n\t */\n\tgetSemanticTokens(lineText: string, lineNumber: number): SemanticToken[] {\n\t\tconst cached = this.cache.get(lineNumber);\n\t\tif (cached && cached.text === lineText) {\n\t\t\tif (cached.bareWordCandidate !== undefined) {\n\t\t\t\treturn this.isKnownVariable(cached.bareWordCandidate) ? cached.tokens : [];\n\t\t\t}\n\t\t\treturn cached.tokens;\n\t\t}\n\n\t\tif (!this.engine) {\n\t\t\t// No engine available (e.g. a consumer that hasn't wired one up yet)\n\t\t\t//, no highlighting, not an error.\n\t\t\treturn [];\n\t\t}\n\n\t\tconst lexer = this.engine.getLexer();\n\t\tconst lexed = this.normalizeForHighlighting\n\t\t\t? this.classifyNormalized(lineText)\n\t\t\t: lexer.getHighlightTokens(lineText);\n\t\tif (lexed.length === 0) {\n\t\t\tthis.putCache(lineNumber, lineText, []);\n\t\t\treturn [];\n\t\t}\n\n\t\tconst classification = lexer.classifyLine(lineText);\n\t\tconst tokens: SemanticToken[] = [];\n\n\t\tif (classification.hasInlineSolve) {\n\t\t\t// A line can mix markdown prose with one or more embedded\n\t\t\t// `s`...`` expressions. Only the text actually inside a\n\t\t\t// well-formed marker is a recognized expression, surrounding\n\t\t\t// prose lexes into individually-valid tokens too (see the class\n\t\t\t// doc comment) but is never something the engine would parse,\n\t\t\t// so it's excluded token-by-token via span membership rather\n\t\t\t// than gating the whole line pass/fail.\n\t\t\tconst validSpans = lexer\n\t\t\t\t.findInlineSolves(lineText)\n\t\t\t\t.filter(span => this.parsesAsExpression(span.expression))\n\t\t\t\t.map(span => ({ from: span.start, to: span.end }));\n\t\t\tfor (const token of lexed) {\n\t\t\t\tif (!token.category) continue;\n\t\t\t\tconst from = token.offset;\n\t\t\t\tconst to = token.offset + token.length;\n\t\t\t\tif (!validSpans.some(s => from >= s.from && to <= s.to)) continue;\n\t\t\t\ttokens.push({ from, to, category: token.category });\n\t\t\t}\n\t\t} else {\n\t\t\t// Blockquote content is stripped of its \"> \" prefix before being\n\t\t\t// tokenized (see Lexer.getHighlightTokens), token offsets are\n\t\t\t// already relative to the stripped text, so the parse check must\n\t\t\t// run against that same substring to match.\n\t\t\tconst text = lineText.startsWith(\"> \") && classification.skip\n\t\t\t\t? lineText.slice(2)\n\t\t\t\t: lineText;\n\t\t\tif (this.parsesAsExpression(text)) {\n\t\t\t\tfor (const token of lexed) {\n\t\t\t\t\tif (!token.category) continue;\n\t\t\t\t\ttokens.push({ from: token.offset, to: token.offset + token.length, category: token.category });\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// A lone bare word (\"hello\") is exactly as ambiguous as a run of\n\t\t// prose (\"My name is dave\"), it happens to parse as a\n\t\t// single-identifier variable-reference expression, but that's true\n\t\t// of literally any English word, so on its own it isn't \"recognized\"\n\t\t// in any meaningful sense. Sigil-marked variables (\":x\", \"$x\") are\n\t\t// unaffected, those lex to TWO tokens (sigil + ident), never\n\t\t// hitting this single-token check. Keywords (\"pi\") are unaffected\n\t\t// too, their category is \"keyword\", not \"variable\". Only surface\n\t\t// it once it's an actual known variable elsewhere in the document\n\t\t// checked live (see the `bareWordCandidate` cache field), not baked\n\t\t// into the cached result, since another line's edit can make this\n\t\t// check flip without this line's own text ever changing.\n\t\tif (tokens.length === 1 && tokens[0].category === \"variable\") {\n\t\t\tconst name = lineText.slice(tokens[0].from, tokens[0].to);\n\t\t\tthis.putCache(lineNumber, lineText, tokens, name);\n\t\t\treturn this.isKnownVariable(name) ? tokens : [];\n\t\t}\n\n\t\tthis.putCache(lineNumber, lineText, tokens);\n\t\treturn tokens;\n\t}\n\n\t/**\n\t * Completion candidates for the identifier prefix immediately before\n\t * `cursorOffset` on `lineText`. Deliberately simple prefix matching, not\n\t * parser-driven \"what's grammatically valid here\" prediction, a\n\t * half-typed expression almost never parses, so gating on parse\n\t * validity (the way `getSemanticTokens` does) would suppress\n\t * completions almost always. This is the safest, fastest option that\n\t * still delivers real value.\n\t *\n\t * Candidates come from three sources: keywords (which already include\n\t * function names. See `ExpressionLexer.getKeywords()`'s doc comment)\n\t * and units, both static per engine configuration and cached lazily;\n\t * package-contributed items (`IEnginePackage.completionItems`), same\n\t * cache; and variable names, read fresh from `variableNameSource()` on\n\t * every call since those change on every edit.\n\t */\n\tgetCompletions(lineText: string, cursorOffset: number): CompletionItem[] {\n\t\tconst prefixMatch = /[A-Za-z0-9_]+$/.exec(lineText.slice(0, cursorOffset));\n\t\tif (!prefixMatch) return [];\n\t\tconst prefix = prefixMatch[0].toLowerCase();\n\n\t\tif (!this.engine) return [];\n\n\t\tconst matches: CompletionItem[] = [];\n\n\t\t// Variables are read fresh every call and there are few of them, so they\n\t\t// stay a linear scan.\n\t\tfor (const name of this.variableNameSource()) {\n\t\t\tif (name.toLowerCase().startsWith(prefix)) {\n\t\t\t\tmatches.push({ label: name, category: \"variable\" });\n\t\t\t}\n\t\t}\n\n\t\t// Static candidates only ever match if they share the prefix's first\n\t\t// character, so consult that bucket alone.\n\t\tconst bucket = this.getStaticCompletionIndex().get(prefix[0]);\n\t\tif (bucket) {\n\t\t\tfor (const candidate of bucket) {\n\t\t\t\tif (candidate.lowerLabel.startsWith(prefix)) matches.push(candidate.item);\n\t\t\t}\n\t\t}\n\n\t\tmatches.sort((a, b) => {\n\t\t\tconst tierDiff = (CATEGORY_TIER[a.category] ?? 3) - (CATEGORY_TIER[b.category] ?? 3);\n\t\t\tif (tierDiff !== 0) return tierDiff;\n\t\t\treturn a.label.localeCompare(b.label);\n\t\t});\n\n\t\treturn matches.slice(0, MAX_COMPLETIONS);\n\t}\n\n\t/** Lazily builds and caches the keyword/unit/package-item candidate list. See `staticCompletionCandidates`. */\n\tprivate getStaticCompletionCandidates(): CompletionItem[] {\n\t\tif (this.staticCompletionCandidates) return this.staticCompletionCandidates;\n\n\t\tconst items: CompletionItem[] = [];\n\t\tfor (const [word, tokenType] of Object.entries(this.engine!.getLexer().getKeywords())) {\n\t\t\tconst category = getTokenCategory(tokenType);\n\t\t\tif (!category) continue;\n\t\t\titems.push({ label: word, category });\n\t\t}\n\t\tfor (const unit of knownUnits) {\n\t\t\titems.push({ label: unit, category: \"unit\", detail: getMeasure(unit) });\n\t\t}\n\t\titems.push(...this.engine!.getPackageCompletionItems());\n\n\t\tthis.staticCompletionCandidates = items;\n\t\treturn items;\n\t}\n\n\t/**\n\t * The static candidates bucketed by lowercased first character, built once\n\t * from {@link getStaticCompletionCandidates} and invalidated alongside it.\n\t */\n\tprivate getStaticCompletionIndex(): Map<string, IndexedCompletionCandidate[]> {\n\t\tif (this.staticCompletionIndex) return this.staticCompletionIndex;\n\n\t\tconst index = new Map<string, IndexedCompletionCandidate[]>();\n\t\tfor (const item of this.getStaticCompletionCandidates()) {\n\t\t\tconst lowerLabel = item.label.toLowerCase();\n\t\t\tconst firstCharacter = lowerLabel[0];\n\t\t\t// A label cannot match any prefix if it is empty, and the prefix\n\t\t\t// regex guarantees at least one character on the query side.\n\t\t\tif (firstCharacter === undefined) continue;\n\t\t\tlet bucket = index.get(firstCharacter);\n\t\t\tif (bucket === undefined) {\n\t\t\t\tbucket = [];\n\t\t\t\tindex.set(firstCharacter, bucket);\n\t\t\t}\n\t\t\tbucket.push({ item, lowerLabel });\n\t\t}\n\n\t\tthis.staticCompletionIndex = index;\n\t\treturn index;\n\t}\n\n\tprivate isKnownVariable(name: string): boolean {\n\t\tfor (const known of this.variableNameSource()) {\n\t\t\tif (known === name) return true;\n\t\t}\n\t\treturn false;\n\t}\n\n\t/**\n\t * Whether the engine's parser actually accepts a piece of text as a\n\t * well-formed expression, not merely whether it lexes into individually\n\t * recognized token types. See the class doc comment's prose example.\n\t * `tryCompileExpression` is compile-only (lex → normalize → parse →\n\t * cache bytecode, no VM execution, no network/async side effects) and\n\t * reuses the engine's existing bytecode cache, so text that's already\n\t * been evaluated (or previously highlight-checked) is a cache hit here\n\t * too.\n\t *\n\t * Deliberately calls the non-throwing `tryCompileExpression` rather than\n\t * try/catching `compileExpression`. This runs on every visible line on\n\t * every keystroke, and the common case for a real markdown document is\n\t * lines that DON'T parse (prose), not lines that do. Throwing there would\n\t * mean constructing a EngineError (with V8 stack-trace capture) for the\n\t * common case instead of the rare one.\n\t */\n\tprivate parsesAsExpression(text: string): boolean {\n\t\treturn this.engine!.tryCompileExpression(text);\n\t}\n\n\tprivate putCache(lineNumber: number, text: string, tokens: SemanticToken[], bareWordCandidate?: string): void {\n\t\tif (!this.cache.has(lineNumber) && this.cache.size >= MAX_CACHED_LINES) {\n\t\t\tconst oldestKey = this.cache.keys().next().value;\n\t\t\tif (oldestKey !== undefined) this.cache.delete(oldestKey);\n\t\t}\n\t\tthis.cache.set(lineNumber, { text, tokens, bareWordCandidate });\n\t}\n\n\t/**\n\t * Evict specific lines (e.g. the lines actually touched by a CodeMirror\n\t * change set) instead of the whole cache, the surgical counterpart to\n\t * {@link invalidateCache}, letting a single-line edit stay cheap even in\n\t * a large document: every other cached line is untouched and still hits\n\t * on the next call.\n\t */\n\tinvalidateLines(lineNumbers: Iterable<number>): void {\n\t\tfor (const lineNumber of lineNumbers) {\n\t\t\tthis.cache.delete(lineNumber);\n\t\t}\n\t}\n\n\t/**\n\t * Full cache clear. Reserved for cases with no meaningful \"which lines\n\t * changed\" (e.g. the document was swapped wholesale, or a package was\n\t * registered/unregistered mid-session, changing what categories exist).\n\t * Prefer {@link invalidateLines} for ordinary edits. Also rebuilds the\n\t * lazily-cached keyword/unit/package-item completion candidates on next\n\t * use, the only thing that can change that list mid-session.\n\t */\n\tinvalidateCache(): void {\n\t\tthis.cache.clear();\n\t\tthis.staticCompletionCandidates = null;\n\t\tthis.staticCompletionIndex = null;\n\t}\n}\n","import type { TokenCategory } from \"@solve-js/language/TokenCategory\";\n\n/**\n * Namespace applied to a semantic category when no other one is asked for.\n *\n * A prefix is needed because a bare category name like `number` or `error`\n * would collide with almost any host stylesheet. `solve-` is the narrowest\n * namespace that still says where the class came from, and it deliberately\n * names this library rather than any particular editor.\n */\nexport const DEFAULT_TOKEN_CLASS_PREFIX = \"solve-\";\n\n/**\n * Maps a semantic category to a predictable, stable CSS class name.\n *\n * Deliberately trivial: the category name IS the class-name key\n * (`\"number\"` → `solve-number`), so there is no separate table to keep in\n * sync as categories grow. A brand-new category, including one contributed\n * by a solve-js package at runtime, gets a matching class name with no\n * changes here.\n *\n * This is editor-agnostic on purpose. It produces a class-name string and\n * nothing else, so it works the same whether the host is CodeMirror\n * (`Decoration.mark({ class: tokenClassName(token.category) })`), Slate,\n * ProseMirror, Monaco or a plain `<span>`. Actual colors are pure CSS,\n * resolved from `--solve-hl-{category}` custom properties by each consumer.\n *\n * @param category - Semantic category from `getSemanticTokens()`.\n * @param prefix - Namespace to apply. Defaults to `solve-`.\n * @returns The class name for that category.\n */\nexport function tokenClassName(category: TokenCategory, prefix: string = DEFAULT_TOKEN_CLASS_PREFIX): string {\n\treturn `${prefix}${category}`;\n}\n\n/**\n * Builds a `tokenClassName` bound to a fixed prefix.\n *\n * The prefix is configurable because a host may already own a namespace it\n * wants these classes to sit inside: a CodeMirror theme that keys off `cm-`,\n * a design system that scopes everything under one token, or an app that\n * embeds two editors and wants to style them apart. Passing the prefix once\n * here is cheaper than threading it through every call site.\n *\n * ```ts\n * const className = createTokenClassName(\"cm-solve-\");\n * className(\"number\"); // \"cm-solve-number\"\n * ```\n *\n * @param prefix - Namespace to apply to every category.\n * @returns A function mapping a category to a prefixed class name.\n */\nexport function createTokenClassName(prefix: string): (category: TokenCategory) => string {\n\treturn (category: TokenCategory) => `${prefix}${category}`;\n}\n","import type { TokenCategory } from \"@solve-js/language/TokenCategory\";\nimport type { CompletionItem } from \"@solve-js/language/LanguageService\";\n\n/**\n * Maps a semantic category to one of `@codemirror/autocomplete`'s built-in\n * completion \"type\" strings (which drive its default gutter icon), the one\n * genuinely CodeMirror-specific thing this feature needs. Falls back to\n * \"text\" for anything unmapped, including plugin-contributed categories\n * (e.g. OSRS's \"osrs-item\"), a reasonable neutral default rather than a\n * hard failure for a category this adapter doesn't know about yet.\n *\n * No `@codemirror/autocomplete` import here, the returned object shape is\n * structurally compatible with CM6's `Completion` type by duck typing, so\n * `solve-js` gains no new dependency; the actual `CompletionSource`\n * function (reading `CompletionContext`, building a `CompletionResult`)\n * lives in each consumer (src/app, playground), same tier as\n * `buildDecorations()` already is for highlighting.\n */\nconst CATEGORY_TO_COMPLETION_TYPE: Partial<Record<TokenCategory, string>> = {\n\tkeyword: \"keyword\",\n\toperator: \"keyword\",\n\tcomparison: \"keyword\",\n\tbitwise: \"keyword\",\n\tfunction: \"function\",\n\tvariable: \"variable\",\n\tunit: \"type\",\n\tdatetime: \"keyword\",\n\tvector: \"type\",\n};\n\n/**\n * Convert a completion into CodeMirror's option shape.\n *\n * Kept in an adapter so the language service itself stays editor-agnostic.\n *\n * @param item - Completion produced by the language service.\n * @returns The equivalent CodeMirror option.\n */\nexport function completionItemToOption(item: CompletionItem): { label: string; type: string; detail?: string } {\n\treturn { label: item.label, type: CATEGORY_TO_COMPLETION_TYPE[item.category] ?? \"text\", detail: item.detail };\n}\n"]}

package/dist/lexer.cjs

@@ -1,64 +1,2 @@
-'use strict';
-
-var chunk7USV76HV_cjs = require('./chunk-7USV76HV.cjs');
-require('./chunk-7AXJNQMF.cjs');
-var chunkYJHY7CMN_cjs = require('./chunk-YJHY7CMN.cjs');
-var chunkG2YPPLGX_cjs = require('./chunk-G2YPPLGX.cjs');
-require('./chunk-OUHT5Z36.cjs');
-var chunkAQNHHJMJ_cjs = require('./chunk-AQNHHJMJ.cjs');
-require('./chunk-AMOJYLG2.cjs');
-require('./chunk-MIGXCBXT.cjs');
-require('./chunk-B7LXJ6LC.cjs');
-
-
-
-Object.defineProperty(exports, "Lexer", {
-  enumerable: true,
-  get: function () { return chunk7USV76HV_cjs.Lexer; }
-});
-Object.defineProperty(exports, "LexerState", {
-  enumerable: true,
-  get: function () { return chunk7USV76HV_cjs.LexerState; }
-});
-Object.defineProperty(exports, "buildTokenLookup", {
-  enumerable: true,
-  get: function () { return chunk7USV76HV_cjs.buildTokenLookup; }
-});
-Object.defineProperty(exports, "sharedLexer", {
-  enumerable: true,
-  get: function () { return chunk7USV76HV_cjs.sharedLexer; }
-});
-Object.defineProperty(exports, "ExpressionLexer", {
-  enumerable: true,
-  get: function () { return chunkYJHY7CMN_cjs.ExpressionLexer; }
-});
-Object.defineProperty(exports, "LexerToken", {
-  enumerable: true,
-  get: function () { return chunkYJHY7CMN_cjs.LexerToken; }
-});
-Object.defineProperty(exports, "TokenTypes", {
-  enumerable: true,
-  get: function () { return chunkG2YPPLGX_cjs.TokenTypes; }
-});
-Object.defineProperty(exports, "registerAllTokenTypes", {
-  enumerable: true,
-  get: function () { return chunkG2YPPLGX_cjs.registerAllTokenTypes; }
-});
-Object.defineProperty(exports, "registerTokenType", {
-  enumerable: true,
-  get: function () { return chunkG2YPPLGX_cjs.registerTokenType; }
-});
-Object.defineProperty(exports, "tokenTypeId", {
-  enumerable: true,
-  get: function () { return chunkG2YPPLGX_cjs.tokenTypeId; }
-});
-Object.defineProperty(exports, "tokenTypeName", {
-  enumerable: true,
-  get: function () { return chunkG2YPPLGX_cjs.tokenTypeName; }
-});
-Object.defineProperty(exports, "knownUnits", {
-  enumerable: true,
-  get: function () { return chunkAQNHHJMJ_cjs.knownUnits; }
-});
-//# sourceMappingURL=lexer.cjs.map
+'use strict';var chunk32GC2FHC_cjs=require('./chunk-32GC2FHC.cjs');require('./chunk-Y7O4D3BJ.cjs');var chunk2LFLR3VZ_cjs=require('./chunk-2LFLR3VZ.cjs'),chunk5IJD5L3O_cjs=require('./chunk-5IJD5L3O.cjs');require('./chunk-MSYX32PF.cjs');var chunkFWW3M36J_cjs=require('./chunk-FWW3M36J.cjs');require('./chunk-CIQOK7Q4.cjs'),require('./chunk-SOMGSIO4.cjs');Object.defineProperty(exports,"Lexer",{enumerable:true,get:function(){return chunk32GC2FHC_cjs.b}});Object.defineProperty(exports,"LexerState",{enumerable:true,get:function(){return chunk32GC2FHC_cjs.a}});Object.defineProperty(exports,"buildTokenLookup",{enumerable:true,get:function(){return chunk32GC2FHC_cjs.d}});Object.defineProperty(exports,"sharedLexer",{enumerable:true,get:function(){return chunk32GC2FHC_cjs.c}});Object.defineProperty(exports,"ExpressionLexer",{enumerable:true,get:function(){return chunk2LFLR3VZ_cjs.b}});Object.defineProperty(exports,"LexerToken",{enumerable:true,get:function(){return chunk2LFLR3VZ_cjs.a}});Object.defineProperty(exports,"TokenTypes",{enumerable:true,get:function(){return chunk5IJD5L3O_cjs.a}});Object.defineProperty(exports,"registerAllTokenTypes",{enumerable:true,get:function(){return chunk5IJD5L3O_cjs.e}});Object.defineProperty(exports,"registerTokenType",{enumerable:true,get:function(){return chunk5IJD5L3O_cjs.b}});Object.defineProperty(exports,"tokenTypeId",{enumerable:true,get:function(){return chunk5IJD5L3O_cjs.c}});Object.defineProperty(exports,"tokenTypeName",{enumerable:true,get:function(){return chunk5IJD5L3O_cjs.d}});Object.defineProperty(exports,"knownUnits",{enumerable:true,get:function(){return chunkFWW3M36J_cjs.a}});//# sourceMappingURL=lexer.cjs.map
 //# sourceMappingURL=lexer.cjs.map

package/dist/lexer.js

@@ -1,11 +1,2 @@
-export { Lexer, LexerState, buildTokenLookup, sharedLexer } from './chunk-RNKDIXDV.js';
-import './chunk-LSALB3IN.js';
-export { ExpressionLexer, LexerToken } from './chunk-ORM7CHYZ.js';
-export { TokenTypes, registerAllTokenTypes, registerTokenType, tokenTypeId, tokenTypeName } from './chunk-NAWZATKT.js';
-import './chunk-XBTEO4OB.js';
-export { knownUnits } from './chunk-SBUFNJVE.js';
-import './chunk-V4XG5QF6.js';
-import './chunk-N7OA4WPJ.js';
-import './chunk-YLJ4XMA6.js';
-//# sourceMappingURL=lexer.js.map
+export{b as Lexer,a as LexerState,d as buildTokenLookup,c as sharedLexer}from'./chunk-YAHGSBMC.js';import'./chunk-JPFCXLJV.js';export{b as ExpressionLexer,a as LexerToken}from'./chunk-G7TBEQRQ.js';export{a as TokenTypes,e as registerAllTokenTypes,b as registerTokenType,c as tokenTypeId,d as tokenTypeName}from'./chunk-IJMNVBIS.js';import'./chunk-62LMTO4F.js';export{a as knownUnits}from'./chunk-TRBXW6HW.js';import'./chunk-2JMFUQZH.js';import'./chunk-MPB7KUN5.js';//# sourceMappingURL=lexer.js.map
 //# sourceMappingURL=lexer.js.map