File size: 13,189 Bytes
ee888e1
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
// Structural readers for JS/TS source text.
//
// Source-level audits in this repo used to ask "does this token appear
// somewhere in the file?" β€” which a commented-out entry, a dead duplicate, or
// a token that drifted into a neighbouring container all satisfy. These helpers
// answer the stronger question: "is this token a member of *that* container?"
//
// They are deliberately lexical, not a full parser: comments are blanked with a
// string/template/regex-aware scanner, then containers are located by balanced
// delimiters and split into their top-level entries. Everything fails closed β€”
// a renamed or deleted container returns null rather than silently widening to
// the rest of the file.

const QUOTE_MODES = { "'": 'squote', '"': 'dquote' };
const CLOSING_QUOTE = { squote: "'", dquote: '"' };

const IDENTIFIER_CHAR = /[\w$]/;

// A `/` starts a regex literal (rather than division) when the previous
// significant character cannot end an expression. Newlines are whitespace here,
// not a reset: `const x = a\n  / b` is division continued across a line, while
// `const re =\n  /abc/` is a regex β€” the operand before the break is what tells
// them apart.
const REGEX_PRECEDING = new Set([
  '', '(', ',', '=', ':', '[', '!', '&', '|', '?', '{', '}', ';', '+', '-', '*', '%', '~', '^', '<', '>',
]);

// The character set above cannot see a KEYWORD-preceded regex: `return /x/`
// ends in `n`, so the `/` reads as division, the regex body is then scanned as
// code, and any quote or backtick inside it opens a literal that was never
// there. A stray quote is bounded by the newline guard, but a backtick opens
// template mode β€” which has no newline guard β€” and swallows the rest of the
// file, so a later container reads as missing.
const REGEX_PRECEDING_KEYWORDS = new Set([
  'return', 'typeof', 'instanceof', 'in', 'new', 'delete', 'void',
  'throw', 'case', 'do', 'else', 'yield', 'await',
]);

/**
 * Return the identifier immediately before `index`, skipping whitespace (and
 * therefore blanked comments). Empty when the preceding token is punctuation.
 */
function precedingWord(text, index) {
  let end = index;
  while (end > 0 && /\s/.test(text[end - 1])) end -= 1;
  let start = end;
  while (start > 0 && IDENTIFIER_CHAR.test(text[start - 1])) start -= 1;
  return text.slice(start, end);
}

/**
 * Report whether the `/` at `index` opens a regex literal rather than division.
 */
function opensRegex(text, index, prevSignificant) {
  if (REGEX_PRECEDING.has(prevSignificant)) return true;
  if (!IDENTIFIER_CHAR.test(prevSignificant)) return false;
  const word = precedingWord(text, index);
  let wordStart = index;
  while (wordStart > 0 && /\s/.test(text[wordStart - 1])) wordStart -= 1;
  wordStart -= word.length;
  if (text[wordStart - 1] === '.') return false;
  return REGEX_PRECEDING_KEYWORDS.has(word);
}

/**
 * Return the index just past the regex literal opening at `index`.
 *
 * An unterminated body (a newline before the closing `/`) means the `/` was
 * division after all, so only the `/` itself is consumed β€” never the rest of
 * the line.
 */
function skipRegexLiteral(text, index) {
  let i = index + 1;
  let inClass = false;
  while (i < text.length) {
    const ch = text[i];
    if (ch === '\\') { i += 2; continue; }
    if (ch === '\n') return index + 1;
    if (ch === '[') inClass = true;
    else if (ch === ']') inClass = false;
    else if (ch === '/' && !inClass) return i + 1;
    i += 1;
  }
  return index + 1;
}

/**
 * Replace every comment in `source` with spaces, preserving newlines so the
 * result has the same length and line numbering as the input.
 *
 * Comment-looking text inside string, template, and regex literals is kept.
 *
 * @param {string} source
 * @returns {string}
 */
export function stripJsComments(source) {
  // split('') β€” NOT [...source]. The spread iterates by code point, so a single
  // surrogate pair (any emoji) makes the buffer shorter than the string and
  // desynchronizes it from the code-unit indices every write here uses
  // (`source[n]`, `indexOf`). The drift blanks the wrong range: it can leave a
  // comment intact while eating real code.
  const out = source.split('');
  const length = source.length;
  const stack = [];
  let prevSignificant = '';
  let i = 0;

  const blank = (from, to) => {
    for (let n = from; n < to; n += 1) {
      if (source[n] !== '\n') out[n] = ' ';
    }
  };

  while (i < length) {
    const mode = stack[stack.length - 1];
    const ch = source[i];

    if (mode === 'squote' || mode === 'dquote') {
      if (ch === '\\') { i += 2; continue; }
      if (ch === CLOSING_QUOTE[mode]) { stack.pop(); prevSignificant = ch; }
      // An unterminated quote would otherwise swallow the rest of the file.
      if (ch === '\n') stack.pop();
      i += 1;
      continue;
    }

    if (mode === 'template') {
      if (ch === '\\') { i += 2; continue; }
      if (ch === '`') { stack.pop(); prevSignificant = ch; i += 1; continue; }
      if (ch === '$' && source[i + 1] === '{') { stack.push('interp'); i += 2; continue; }
      i += 1;
      continue;
    }

    if (ch === '/' && source[i + 1] === '/') {
      const end = source.indexOf('\n', i);
      blank(i, end === -1 ? length : end);
      i = end === -1 ? length : end;
      continue;
    }

    if (ch === '/' && source[i + 1] === '*') {
      const close = source.indexOf('*/', i + 2);
      const end = close === -1 ? length : close + 2;
      blank(i, end);
      i = end;
      continue;
    }

    if (ch === '/' && opensRegex(source, i, prevSignificant)) {
      i = skipRegexLiteral(source, i);
      prevSignificant = '/';
      continue;
    }

    if (QUOTE_MODES[ch]) { stack.push(QUOTE_MODES[ch]); i += 1; continue; }
    if (ch === '`') { stack.push('template'); i += 1; continue; }
    if (ch === '{') { stack.push('brace'); }
    if (ch === '}' && (mode === 'brace' || mode === 'interp')) { stack.pop(); }

    if (!/\s/.test(ch)) prevSignificant = ch;
    i += 1;
  }

  return out.join('');
}

/**
 * Walk `text` (comments already blanked) from `start`, invoking `onCodeChar`
 * only for characters at code level β€” never for characters *inside* a string or
 * template literal, and never for the `}` that closes a `${}` interpolation.
 *
 * The delimiter that OPENS a string or template IS reported, so a caller
 * matching an anchor can find one that begins with a quote. The closing
 * delimiter is not: it is consumed by the string branch below.
 */
function walkCode(text, start, onCodeChar) {
  const stack = [];
  let i = start;
  // Seeded from the text before `start` so a walk that begins mid-expression
  // classifies a leading `/` the same way a walk from 0 would.
  let prevSignificant = text.slice(0, start).trimEnd().slice(-1);

  while (i < text.length) {
    const mode = stack[stack.length - 1];
    const ch = text[i];

    if (mode === 'squote' || mode === 'dquote') {
      if (ch === '\\') { i += 2; continue; }
      if (ch === CLOSING_QUOTE[mode] || ch === '\n') { stack.pop(); prevSignificant = ch; }
      i += 1;
      continue;
    }

    if (mode === 'template') {
      if (ch === '\\') { i += 2; continue; }
      if (ch === '`') { stack.pop(); prevSignificant = ch; }
      else if (ch === '$' && text[i + 1] === '{') { stack.push('interp'); i += 2; continue; }
      i += 1;
      continue;
    }

    // Skip regex literals for the same reason stripJsComments does: their
    // bodies are not code, and a quote or backtick inside one would otherwise
    // open a literal that does not exist. Without this the two scanners
    // disagree about the same text β€” comments are stripped with regex
    // awareness, then re-walked here without it.
    if (ch === '/' && opensRegex(text, i, prevSignificant)) {
      i = skipRegexLiteral(text, i);
      prevSignificant = '/';
      continue;
    }

    if (QUOTE_MODES[ch]) stack.push(QUOTE_MODES[ch]);
    else if (ch === '`') stack.push('template');
    else if (ch === '{') stack.push('brace');
    else if (ch === '}') {
      if (mode === 'interp') { stack.pop(); i += 1; continue; }
      if (mode === 'brace') stack.pop();
    }

    if (onCodeChar(ch, i) === false) return;
    if (!/\s/.test(ch)) prevSignificant = ch;
    i += 1;
  }
}

/**
 * Report whether an anchor match at `index` sits on token boundaries, so an
 * anchor never matches the middle of a longer identifier (`const MAP` must not
 * match `const MAP_V2` β€” a different container entirely).
 */
function isTokenBoundedMatch(text, anchor, index) {
  const before = text[index - 1];
  if (before !== undefined && IDENTIFIER_CHAR.test(anchor[0]) && IDENTIFIER_CHAR.test(before)) {
    return false;
  }
  const after = text[index + anchor.length];
  const lastAnchorChar = anchor[anchor.length - 1];
  if (after !== undefined && IDENTIFIER_CHAR.test(lastAnchorChar) && IDENTIFIER_CHAR.test(after)) {
    return false;
  }
  return true;
}

/**
 * Return the text between the balanced `open`/`close` delimiters that follow
 * the first code-level occurrence of `anchor`.
 *
 * Returns null β€” never a wider slice β€” when the anchor is missing (renamed or
 * commented out), when no opening delimiter follows it, or when the block never
 * closes.
 *
 * @param {string} source
 * @param {string} anchor
 * @param {string} [open]
 * @param {string} [close]
 * @returns {string | null}
 */
export function extractDelimitedBlock(source, anchor, open = '{', close = '}') {
  const text = stripJsComments(source);

  let anchorEnd = -1;
  walkCode(text, 0, (_ch, index) => {
    if (!text.startsWith(anchor, index)) return true;
    if (!isTokenBoundedMatch(text, anchor, index)) return true;
    anchorEnd = index + anchor.length;
    return false;
  });
  if (anchorEnd === -1) return null;

  let bodyStart = -1;
  let bodyEnd = -1;
  let depth = 0;
  walkCode(text, anchorEnd, (ch, index) => {
    if (ch === open) {
      depth += 1;
      if (depth === 1) bodyStart = index + 1;
      return true;
    }
    if (ch === close && depth > 0) {
      depth -= 1;
      if (depth === 0) { bodyEnd = index; return false; }
    }
    return true;
  });

  if (bodyStart === -1 || bodyEnd === -1) return null;
  return text.slice(bodyStart, bodyEnd);
}

/**
 * Split a container body into its top-level, comma-separated entries. Entries
 * nested inside a child object, array, call, or template interpolation stay
 * inside their parent entry rather than becoming entries of their own.
 *
 * @param {string} body
 * @returns {string[]}
 */
export function splitTopLevelEntries(body) {
  const text = stripJsComments(body);
  const entries = [];
  let start = 0;
  let depth = 0;

  walkCode(text, 0, (ch, index) => {
    if (ch === '{' || ch === '[' || ch === '(') depth += 1;
    else if (ch === '}' || ch === ']' || ch === ')') depth -= 1;
    else if (ch === ',' && depth === 0) {
      entries.push(text.slice(start, index));
      start = index + 1;
    }
    return true;
  });
  entries.push(text.slice(start));

  return entries.map((entry) => entry.trim()).filter((entry) => entry.length > 0);
}

const STRING_LITERAL = /^'((?:[^'\\]|\\.)*)'|^"((?:[^"\\]|\\.)*)"/;
const BARE_KEY = /^([A-Za-z_$][\w$]*)\s*:/;

// Standard single-character escapes. `\uXXXX` and `\xXX` are deliberately NOT
// decoded β€” they do not appear in the keys and members this module matches, and
// a half-correct unescaper is worse than an explicitly limited one. Anything
// else after a backslash decodes to the literal character, which is correct for
// \\, \', and \".
const SIMPLE_ESCAPES = { n: '\n', t: '\t', r: '\r', b: '\b', f: '\f', v: '\v', 0: '\0' };

function unescapeStringLiteral(raw) {
  return raw.replace(/\\(.)/g, (_match, ch) => SIMPLE_ESCAPES[ch] ?? ch);
}

function readStringLiteral(entry) {
  const match = STRING_LITERAL.exec(entry);
  if (!match) return null;
  const raw = match[1] ?? match[2];
  return { value: unescapeStringLiteral(raw), length: match[0].length };
}

/**
 * Return the value text of a top-level `key` entry in an object-literal body,
 * or null when the key is not a top-level key of that body.
 *
 * @param {string} body
 * @param {string} key
 * @returns {string | null}
 */
export function objectLiteralEntryValue(body, key) {
  for (const entry of splitTopLevelEntries(body)) {
    const literal = readStringLiteral(entry);
    if (literal) {
      const rest = entry.slice(literal.length);
      if (literal.value === key && /^\s*:/.test(rest)) return rest.replace(/^\s*:\s*/, '').trim();
      continue;
    }
    const bare = BARE_KEY.exec(entry);
    if (bare && bare[1] === key) return entry.slice(bare[0].length).trim();
  }
  return null;
}

/**
 * Report whether `value` is a top-level string member of an array-literal body.
 * An object key, a nested member, and a commented-out member all read false.
 *
 * @param {string} body
 * @param {string} value
 * @returns {boolean}
 */
export function arrayLiteralHasStringMember(body, value) {
  return splitTopLevelEntries(body).some((entry) => {
    const literal = readStringLiteral(entry);
    return literal !== null && literal.length === entry.length && literal.value === value;
  });
}