reslop 0.1.9 → 0.2.0

package/lib/diff/display.js

@@ -46,14 +46,15 @@ const replaceAdds = (lines, overlay, blockId) => {
     return lines.filter((line) => line.type !== 'add');
   }
   const texts = text.split('\n');
-  const tagged = [];
+  const { length } = texts;
+  const tagged = new Array(length);
   let offset = 0;
-  for (let i = 0; i < texts.length; i++) {
+  for (let i = 0; i < length; i++) {
     const row = texts[i];
     const start = offset;
     const end = start + row.length;
-    const isLast = i === texts.length - 1;
-    tagged.push(taggedAdd(row, blockId, start, end));
+    const isLast = i === length - 1;
+    tagged[i] = taggedAdd(row, blockId, start, end);
     offset = isLast ? end : end + 1;
   }
   const out = [];

package/lib/diff/inline.js

@@ -72,13 +72,11 @@ const tokenSimilarity = (a, b) => {
   return (2 * lcs) / (a.length + b.length);
 };
 
-const similarity = (left, right) =>
-  tokenSimilarity(graphemes(left), graphemes(right));
-
 const fillLcsTable = (a, b) => {
   const n = a.length;
   const m = b.length;
-  const dp = Array.from({ length: n + 1 }, () => new Uint32Array(m + 1));
+  const dp = new Array(n + 1);
+  for (let i = 0; i <= n; i++) dp[i] = new Uint32Array(m + 1);
   for (let i = 1; i <= n; i++) {
     const ai = a[i - 1];
     const row = dp[i];
@@ -92,30 +90,31 @@ const fillLcsTable = (a, b) => {
 };
 
 const tracebackLcs = (a, b, dp) => {
-  const rev = [];
+  const rev = new Array(a.length + b.length - dp[a.length][b.length]);
+  let n = 0;
   let i = a.length;
   let j = b.length;
   while (i > 0 && j > 0) {
     if (a[i - 1] === b[j - 1]) {
-      rev.push({ type: 'eq', text: a[i - 1] });
+      rev[n++] = { type: 'eq', text: a[i - 1] };
       i -= 1;
       j -= 1;
       continue;
     }
     if (dp[i - 1][j] >= dp[i][j - 1]) {
-      rev.push({ type: 'del', text: a[i - 1] });
+      rev[n++] = { type: 'del', text: a[i - 1] };
       i -= 1;
       continue;
     }
-    rev.push({ type: 'add', text: b[j - 1] });
+    rev[n++] = { type: 'add', text: b[j - 1] };
     j -= 1;
   }
   while (i > 0) {
-    rev.push({ type: 'del', text: a[i - 1] });
+    rev[n++] = { type: 'del', text: a[i - 1] };
     i -= 1;
   }
   while (j > 0) {
-    rev.push({ type: 'add', text: b[j - 1] });
+    rev[n++] = { type: 'add', text: b[j - 1] };
     j -= 1;
   }
   rev.reverse();
@@ -174,13 +173,17 @@ const diffTokenMiddle = (midA, midB) => {
 };
 
 const joinAffix = (prefix, mid, suffix) => {
-  const parts = [];
-  if (prefix.length) {
-    parts.push({ text: prefix.join(''), changed: false });
+  const hasPrefix = prefix.length > 0;
+  const hasSuffix = suffix.length > 0;
+  const extra = (hasPrefix ? 1 : 0) + (hasSuffix ? 1 : 0);
+  const parts = new Array(mid.length + extra);
+  const at = hasPrefix ? 1 : 0;
+  if (hasPrefix) {
+    parts[0] = { text: prefix.join(''), changed: false };
   }
-  for (const span of mid) parts.push(span);
-  if (suffix.length) {
-    parts.push({ text: suffix.join(''), changed: false });
+  for (let i = 0; i < mid.length; i++) parts[at + i] = mid[i];
+  if (hasSuffix) {
+    parts[at + mid.length] = { text: suffix.join(''), changed: false };
   }
   return collapseSpans(parts);
 };
@@ -253,7 +256,10 @@ const spansFromWordOps = (ops) => {
       i += 1;
     }
     const one = dels.length === 1 && adds.length === 1;
-    const close = one && similarity(dels[0], adds[0]) >= WORD_REFINE_MIN;
+    const close =
+      one &&
+      tokenSimilarity(graphemes(dels[0]), graphemes(adds[0])) >=
+        WORD_REFINE_MIN;
     if (close) {
       const inner = diffTokens(graphemes(dels[0]), graphemes(adds[0]));
       for (const span of inner.oldSpans) oldParts.push(span);
@@ -291,10 +297,9 @@ const diffChars = (oldText, newText) => {
   } else {
     mid = spansFromWordOps(lcsOps(midA, midB));
   }
-  return {
-    oldSpans: joinAffix(prefix, mid.oldSpans, suffix),
-    newSpans: joinAffix(prefix, mid.newSpans, suffix),
-  };
+  const oldSpans = joinAffix(prefix, mid.oldSpans, suffix);
+  const newSpans = joinAffix(prefix, mid.newSpans, suffix);
+  return { oldSpans, newSpans };
 };
 
 module.exports = { tokenSimilarity, diffChars };

package/lib/diff/items.js

@@ -82,14 +82,16 @@ const refreshIndexPatches = (items, item) => {
     if (other.hunk !== item.hunk || other.file !== item.file) continue;
     sides[other.blockId] = INDEX_SIDE[other.origin] ?? 'old';
   }
-  const next = [];
-  for (const other of items) {
+  const { length } = items;
+  const next = new Array(length);
+  for (let i = 0; i < length; i++) {
+    const other = items[i];
     if (other.hunk !== item.hunk || other.file !== item.file) {
-      next.push(other);
+      next[i] = other;
       continue;
     }
     const patchAdd = formatPatch(other.file, other.hunk, other.blockId, sides);
-    next.push({ ...other, patchAdd });
+    next[i] = { ...other, patchAdd };
   }
   return next;
 };

package/lib/diff/patch.js

@@ -70,10 +70,8 @@ const countSides = (lines) => {
 const formatHunkHeader = (oldStart, oldCount, newStart, newCount) =>
   `@@ -${oldStart},${oldCount} +${newStart},${newCount} @@`;
 
-const lineMark = (type) => LINE_MARK[type] ?? ' ';
-
 const formatBodyLine = (line) => {
-  const rows = [`${lineMark(line.type)}${line.text}`];
+  const rows = [`${LINE_MARK[line.type] ?? ' '}${line.text}`];
   if (line.noNl) rows.push('\');
   return rows;
 };

package/lib/diff/unit.js

@@ -0,0 +1,392 @@
+'use strict';
+
+const { attachInline } = require('./align.js');
+const { listPath } = require('../files.js');
+
+const splitEditor = (text) => {
+  const lines = `${text}`.split('\n');
+  if (!lines.length) return [''];
+  return lines;
+};
+
+const splitFile = (text) => {
+  if (!text) return [];
+  const lines = `${text}`.split('\n');
+  if (lines.length && lines[lines.length - 1] === '') lines.pop();
+  return lines;
+};
+
+const hunkKey = (item) => {
+  if (!item) return '';
+  const rel = listPath(item);
+  const hunk = item.hunk;
+  if (!hunk) return `${rel}\0${item.blockId ?? ''}`;
+  return `${rel}\0${hunk.oldStart}\0${hunk.newStart}\0${hunk.header}`;
+};
+
+const sameHunk = (left, right) => {
+  if (!left || !right) return false;
+  if (left.hunk && right.hunk && left.hunk === right.hunk) {
+    return listPath(left) === listPath(right);
+  }
+  const key = hunkKey(left);
+  if (!key) return false;
+  return key === hunkKey(right);
+};
+
+const emptyMarks = (last) => {
+  const size = last + 1;
+  const dels = new Array(size);
+  const adds = new Array(size);
+  for (let i = 0; i < size; i++) {
+    dels[i] = [];
+    adds[i] = null;
+  }
+  return { dels, adds };
+};
+
+const clipAt = (n, last) => Math.min(Math.max(1, n), last);
+
+const applyHunk = (marks, item) => {
+  const hunk = item.hunk;
+  if (!hunk || !hunk.lines) return;
+  const last = marks.dels.length - 1;
+  let newLine = hunk.newStart > 0 ? hunk.newStart : 1;
+  for (const line of hunk.lines) {
+    const extra = {
+      text: line.text ?? '',
+      item,
+      blockId: line.blockId,
+      origin: item.origin,
+    };
+    if (line.type === 'del') {
+      marks.dels[clipAt(newLine, last)].push(extra);
+      continue;
+    }
+    if (line.type === 'add') {
+      marks.adds[clipAt(newLine, last)] = extra;
+      newLine += 1;
+      continue;
+    }
+    newLine += 1;
+  }
+};
+
+const tagged = (type, text, extra = {}) => ({
+  type,
+  text,
+  noNl: false,
+  blockId: extra.blockId ?? null,
+  origin: extra.origin ?? '',
+  item: extra.item ?? null,
+});
+
+const itemsForPath = (items, rel) => {
+  const out = [];
+  for (const item of items) {
+    if (listPath(item) === rel) out.push(item);
+  }
+  return out;
+};
+
+const rowsFromAdds = (items) => {
+  const rows = [];
+  for (const item of items) {
+    const lines = item.hunk && item.hunk.lines ? item.hunk.lines : [];
+    for (const line of lines) {
+      if (line.type === 'add') rows.push(line.text ?? '');
+    }
+  }
+  return rows;
+};
+
+const unitLines = (text, items) => {
+  let rows = splitFile(text);
+  if (!rows.length) rows = rowsFromAdds(items);
+  const marks = emptyMarks(rows.length + 1);
+  for (const item of items) applyHunk(marks, item);
+  const out = [];
+  for (let i = 0; i < rows.length; i++) {
+    const n = i + 1;
+    for (const del of marks.dels[n]) out.push(tagged('del', del.text, del));
+    const add = marks.adds[n];
+    if (add) out.push(tagged('add', rows[i], add));
+    else out.push(tagged('ctx', rows[i], {}));
+  }
+  for (const del of marks.dels[rows.length + 1]) {
+    out.push(tagged('del', del.text, del));
+  }
+  if (!out.length) out.push(tagged('ctx', '', {}));
+  return attachInline(out);
+};
+
+const sameBlock = (line, item) => {
+  if (!line || !item) return false;
+  if (line.item !== item) return false;
+  return line.blockId === item.blockId;
+};
+
+const blockLineRange = (lines, item) => {
+  let start = 0;
+  let end = 0;
+  let found = false;
+  if (!item) return { start, end };
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i];
+    if (!sameBlock(line, item)) continue;
+    if (line.type === 'ctx') continue;
+    if (!found) {
+      start = i;
+      found = true;
+    }
+    end = i;
+  }
+  return { start, end };
+};
+
+const blockLineIndex = (lines, item) => blockLineRange(lines, item).start;
+
+const hunkLineRange = (lines, item) => {
+  let start = 0;
+  let end = 0;
+  let found = false;
+  if (!item) return { start, end };
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i];
+    if (!sameHunk(line.item, item)) continue;
+    if (line.type === 'ctx') continue;
+    if (!found) {
+      start = i;
+      found = true;
+    }
+    end = i;
+  }
+  return { start, end };
+};
+
+const fileOffset = (lines, at) => {
+  let offset = 0;
+  const target = Math.max(0, at);
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i];
+    if (line.type === 'del') continue;
+    if (i >= target) return offset;
+    offset += (line.text ?? '').length + 1;
+  }
+  return offset;
+};
+
+const fileLineIndex = (lines, fileLine) => {
+  let n = 0;
+  let last = 0;
+  for (let i = 0; i < lines.length; i++) {
+    if (lines[i].type === 'del') continue;
+    last = i;
+    if (n === fileLine) return i;
+    n += 1;
+  }
+  return last;
+};
+
+const lastEditableIndex = (lines) => {
+  for (let i = lines.length - 1; i >= 0; i--) {
+    if (lines[i].type !== 'del') return i;
+  }
+  return -1;
+};
+
+const attachEditSpans = (lines) => {
+  let offset = 0;
+  const lastAt = lastEditableIndex(lines);
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i];
+    if (line.type === 'del') continue;
+    const text = line.text ?? '';
+    const last = i === lastAt;
+    line.wrap = true;
+    line.editStart = offset;
+    line.editEnd = offset + text.length;
+    line.editLast = last;
+    offset = last ? offset + text.length : offset + text.length + 1;
+  }
+  return lines;
+};
+
+const LCS_CELLS = 4000000;
+
+const lcsTable = (prev, next) => {
+  const n = prev.length;
+  const m = next.length;
+  const dp = new Array(n + 1);
+  for (let i = 0; i <= n; i++) dp[i] = new Array(m + 1).fill(0);
+  for (let i = n - 1; i >= 0; i--) {
+    for (let j = m - 1; j >= 0; j--) {
+      if (prev[i] === next[j]) dp[i][j] = dp[i + 1][j + 1] + 1;
+      else dp[i][j] = Math.max(dp[i + 1][j], dp[i][j + 1]);
+    }
+  }
+  return dp;
+};
+
+const zipOps = (prev, next) => {
+  const n = Math.min(prev.length, next.length);
+  const ops = new Array(Math.max(prev.length, next.length));
+  let at = 0;
+  for (let i = 0; i < n; i++) ops[at++] = { kind: 'rep', text: next[i] };
+  for (let i = n; i < prev.length; i++) ops[at++] = { kind: 'del' };
+  for (let i = n; i < next.length; i++) {
+    ops[at++] = { kind: 'ins', text: next[i] };
+  }
+  return ops;
+};
+
+const walkLcs = (prev, next, dp) => {
+  const ops = new Array(prev.length + next.length - dp[0][0]);
+  let n = 0;
+  let i = 0;
+  let j = 0;
+  while (i < prev.length && j < next.length) {
+    if (prev[i] === next[j]) {
+      ops[n++] = { kind: 'eq', text: next[j] };
+      i += 1;
+      j += 1;
+      continue;
+    }
+    if (dp[i + 1][j] >= dp[i][j + 1]) {
+      ops[n++] = { kind: 'del' };
+      i += 1;
+      continue;
+    }
+    ops[n++] = { kind: 'ins', text: next[j] };
+    j += 1;
+  }
+  while (i < prev.length) {
+    ops[n++] = { kind: 'del' };
+    i += 1;
+  }
+  while (j < next.length) {
+    ops[n++] = { kind: 'ins', text: next[j] };
+    j += 1;
+  }
+  return ops;
+};
+
+const collapseRep = (ops) => {
+  const out = [];
+  for (let i = 0; i < ops.length; i++) {
+    const op = ops[i];
+    const next = ops[i + 1];
+    if (op.kind === 'del' && next && next.kind === 'ins') {
+      out.push({ kind: 'rep', text: next.text });
+      i += 1;
+      continue;
+    }
+    if (op.kind === 'ins' && next && next.kind === 'del') {
+      out.push({ kind: 'rep', text: op.text });
+      i += 1;
+      continue;
+    }
+    out.push(op);
+  }
+  return out;
+};
+
+const lineOps = (prev, next) => {
+  if (prev.length === next.length) return zipOps(prev, next);
+  if (prev.length * next.length > LCS_CELLS) return zipOps(prev, next);
+  return collapseRep(walkLcs(prev, next, lcsTable(prev, next)));
+};
+
+const copyRow = (row, text) => ({
+  type: row.type,
+  text,
+  noNl: row.noNl === true,
+  blockId: row.blockId ?? null,
+  origin: row.origin ?? '',
+  item: row.item ?? null,
+});
+
+const pushDels = (out, base, at) => {
+  let i = at;
+  while (i < base.length && base[i].type === 'del') {
+    out.push(copyRow(base[i], base[i].text ?? ''));
+    i += 1;
+  }
+  return i;
+};
+
+const mergeEditRows = (baseRows, nextTexts) => {
+  const base = baseRows ?? [];
+  const texts = nextTexts && nextTexts.length ? nextTexts : [''];
+  const prev = [];
+  for (const row of base) {
+    if (row.type === 'del') continue;
+    prev.push(row.text ?? '');
+  }
+  const ops = lineOps(prev, texts);
+  const out = [];
+  let at = 0;
+  for (const op of ops) {
+    at = pushDels(out, base, at);
+    if (op.kind === 'ins') {
+      out.push(tagged('ctx', op.text, {}));
+      continue;
+    }
+    if (at >= base.length) continue;
+    if (op.kind === 'del') {
+      at += 1;
+      continue;
+    }
+    out.push(copyRow(base[at], op.text));
+    at += 1;
+  }
+  pushDels(out, base, at);
+  if (!out.length) out.push(tagged('ctx', '', {}));
+  return attachEditSpans(attachInline(out));
+};
+
+const fileLines = (text) => {
+  const rows = splitFile(text);
+  if (!rows.length) rows.push('');
+  const { length } = rows;
+  const out = new Array(length);
+  let offset = 0;
+  for (let i = 0; i < length; i++) {
+    const row = rows[i];
+    const start = offset;
+    const end = start + row.length;
+    const last = i === length - 1;
+    out[i] = {
+      type: 'ctx',
+      text: row,
+      noNl: false,
+      wrap: true,
+      editStart: start,
+      editEnd: end,
+      editLast: last,
+      blockId: null,
+      origin: '',
+      item: null,
+    };
+    offset = last ? end : end + 1;
+  }
+  return out;
+};
+
+module.exports = {
+  splitFile,
+  splitEditor,
+  itemsForPath,
+  unitLines,
+  sameBlock,
+  sameHunk,
+  hunkKey,
+  blockLineRange,
+  hunkLineRange,
+  blockLineIndex,
+  fileOffset,
+  fileLineIndex,
+  attachEditSpans,
+  mergeEditRows,
+  fileLines,
+};

package/lib/files.js

@@ -1,6 +1,6 @@
 'use strict';
 
-const { listFilePath } = require('./deps/manifest.js');
+const { listFilePath } = require('./manifest.js');
 
 const REVIEW_DIR = '.review';
 const ORIGIN_ORDER = ['staged', 'unstaged', 'untracked', 'commit', 'pr'];
@@ -8,13 +8,10 @@ const TODO_FILE = 'TODOs';
 const REPO_TODOS_LABEL = 'Repository TODOs and Issues';
 const TOTAL_LABEL = 'total';
 
-const normalizePathSpec = (spec) =>
-  `${spec ?? ''}`.replaceAll('\\', '/').replace(/\/+$/, '');
-
 const isPathInScope = (rel, paths) => {
   if (!paths.length) return true;
   for (const spec of paths) {
-    const norm = normalizePathSpec(spec);
+    const norm = `${spec ?? ''}`.replaceAll('\\', '/').replace(/\/+$/, '');
     if (!norm || norm === '.') return true;
     if (rel === norm || rel.startsWith(`${norm}/`)) return true;
   }
@@ -30,12 +27,12 @@ const listPath = (item) => listFilePath(itemPath(item));
 
 const isTodoItem = (item) => !!(item && item.origin === 'todo');
 
+const isReadOnlyOrigin = (origin) => origin === 'commit' || origin === 'pr';
+
 const isTodosEntry = (entry) => !!(entry && entry.kind === 'todos');
 
 const isTotalEntry = (entry) => !!(entry && entry.kind === 'total');
 
-const repoTodosLabel = () => REPO_TODOS_LABEL;
-
 const makeTodoItem = () => ({
   origin: 'todo',
   file: {
@@ -226,9 +223,9 @@ module.exports = {
   itemPath,
   listPath,
   isTodoItem,
+  isReadOnlyOrigin,
   isTodosEntry,
   isTotalEntry,
-  repoTodosLabel,
   makeTodoItem,
   fileStatus,
   fileEntries,

package/lib/{git/branches.js → git-branches.js}

@@ -1,6 +1,6 @@
 'use strict';
 
-const { oneLine, requireOk, runGit, runGitAsync } = require('./run.js');
+const { oneLine, requireOk, runGit, runGitAsync } = require('./git.js');
 
 const BRANCH_FORMAT = [
   '%(HEAD)',
@@ -183,10 +183,11 @@ const listBranches = (top) => {
   const names = new Set();
   for (const entry of branches) names.add(entry.name);
   const primary = defaultBranch(top, names);
-  const listed = [];
-  for (const entry of branches) {
-    const isDefault = entry.name === primary;
-    listed.push({ ...entry, isDefault });
+  const { length } = branches;
+  const listed = new Array(length);
+  for (let i = 0; i < length; i++) {
+    const entry = branches[i];
+    listed[i] = { ...entry, isDefault: entry.name === primary };
   }
   return listed;
 };