@lvce-editor/file-search-worker 1.4.0 → 1.6.0

package/dist/fileSearchWorkerMain.js

@@ -467,10 +467,14 @@ const getDirectoryHandle = async uri => {
   }
   return getDirectoryHandle(dirname$1);
 };
+const toIgnore = ['.git', 'node_modules', 'dist', 'dist2'];
 const searchFilesRecursively = async (all, parent, handle) => {
   const childHandles = await getChildHandles(handle);
   const promises = [];
   for (const childHandle of childHandles) {
+    if (toIgnore.includes(childHandle.name)) {
+      continue;
+    }
     const absolutePath = parent + '/' + childHandle.name;
     switch (childHandle.kind) {
       case Directory:
@@ -495,6 +499,193 @@ const searchFile$1 = async uri => {
   return all;
 };
 
+const Diagonal = 1;
+const Left = 2;
+
+// based on https://github.com/microsoft/vscode/blob/3059063b805ed0ac10a6d9539e213386bfcfb852/src/vs/base/common/filters.ts by Microsoft (License MIT)
+
+const createTable = size => {
+  const table = [];
+  for (let i = 0; i < size; i++) {
+    const row = new Uint8Array(size);
+    table.push(row);
+  }
+  return table;
+};
+const EmptyMatches = [];
+const Dash = '-';
+const Dot = '.';
+const EmptyString = '';
+const Space = ' ';
+const Underline = '_';
+const T = 't';
+const isLowerCase = char => {
+  return char === char.toLowerCase();
+};
+const isUpperCase = char => {
+  return char === char.toUpperCase();
+};
+
+// based on https://github.com/microsoft/vscode/blob/3059063b805ed0ac10a6d9539e213386bfcfb852/src/vs/base/common/filters.ts by Microsoft (License MIT)
+const isGap = (columnCharBefore, columnChar) => {
+  switch (columnCharBefore) {
+    case Dash:
+    case Underline:
+    case EmptyString:
+    case T:
+    case Space:
+    case Dot:
+      return true;
+  }
+  if (isLowerCase(columnCharBefore) && isUpperCase(columnChar)) {
+    return true;
+  }
+  return false;
+};
+
+// based on https://github.com/microsoft/vscode/blob/3059063b805ed0ac10a6d9539e213386bfcfb852/src/vs/base/common/filters.ts by Microsoft (License MIT)
+const getScore = (rowCharLow, rowChar, columnCharBefore, columnCharLow, columnChar, isDiagonalMatch) => {
+  if (rowCharLow !== columnCharLow) {
+    return -1;
+  }
+  const isMatch = rowChar === columnChar;
+  if (isMatch) {
+    if (isDiagonalMatch) {
+      return 8;
+    }
+    if (isGap(columnCharBefore, columnChar)) {
+      return 8;
+    }
+    return 5;
+  }
+  if (isGap(columnCharBefore, columnChar)) {
+    return 8;
+  }
+  return 5;
+};
+
+// based on https://github.com/microsoft/vscode/blob/3059063b805ed0ac10a6d9539e213386bfcfb852/src/vs/base/common/filters.ts by Microsoft (License MIT)
+
+const isPatternInWord = (patternLow, patternPos, patternLen, wordLow, wordPos, wordLen) => {
+  while (patternPos < patternLen && wordPos < wordLen) {
+    if (patternLow[patternPos] === wordLow[wordPos]) {
+      patternPos += 1;
+    }
+    wordPos += 1;
+  }
+  return patternPos === patternLen; // pattern must be exhausted
+};
+
+// based on https://github.com/microsoft/vscode/blob/3059063b805ed0ac10a6d9539e213386bfcfb852/src/vs/base/common/filters.ts by Microsoft (License MIT)
+const traceHighlights = (table, arrows, patternLength, wordLength) => {
+  let row = patternLength;
+  let column = wordLength;
+  const matches = [];
+  while (row >= 1 && column >= 1) {
+    const arrow = arrows[row][column];
+    if (arrow === Left) {
+      column--;
+    } else if (arrow === Diagonal) {
+      row--;
+      column--;
+      const start = column + 1;
+      while (row >= 1 && column >= 1) {
+        const arrow = arrows[row][column];
+        if (arrow === Left) {
+          break;
+        }
+        if (arrow === Diagonal) {
+          row--;
+          column--;
+        }
+      }
+      const end = column;
+      matches.unshift(end, start);
+    }
+  }
+  matches.unshift(table[patternLength][wordLength - 1]);
+  return matches;
+};
+
+// based on https://github.com/microsoft/vscode/blob/3059063b805ed0ac10a6d9539e213386bfcfb852/src/vs/base/common/filters.ts by Microsoft (License MIT)
+const gridSize = 128;
+const table = createTable(gridSize);
+const arrows = createTable(gridSize);
+const fuzzySearch = (pattern, word) => {
+  const patternLength = Math.min(pattern.length, gridSize - 1);
+  const wordLength = Math.min(word.length, gridSize - 1);
+  const patternLower = pattern.toLowerCase();
+  const wordLower = word.toLowerCase();
+  if (!isPatternInWord(patternLower, 0, patternLength, wordLower, 0, wordLength)) {
+    return EmptyMatches;
+  }
+  let strongMatch = false;
+  for (let row = 1; row < patternLength + 1; row++) {
+    const rowChar = pattern[row - 1];
+    const rowCharLow = patternLower[row - 1];
+    for (let column = 1; column < wordLength + 1; column++) {
+      const columnChar = word[column - 1];
+      const columnCharLow = wordLower[column - 1];
+      const columnCharBefore = word[column - 2] || '';
+      const isDiagonalMatch = arrows[row - 1][column - 1] === Diagonal;
+      const score = getScore(rowCharLow, rowChar, columnCharBefore, columnCharLow, columnChar, isDiagonalMatch);
+      if (row === 1 && score > 5) {
+        strongMatch = true;
+      }
+      let diagonalScore = score + table[row - 1][column - 1];
+      if (isDiagonalMatch && score !== -1) {
+        diagonalScore += 2;
+      }
+      const leftScore = table[row][column - 1];
+      if (leftScore > diagonalScore) {
+        table[row][column] = leftScore;
+        arrows[row][column] = Left;
+      } else {
+        table[row][column] = diagonalScore;
+        arrows[row][column] = Diagonal;
+      }
+    }
+  }
+  if (!strongMatch) {
+    return EmptyMatches;
+  }
+  const highlights = traceHighlights(table, arrows, patternLength, wordLength);
+  return highlights;
+};
+
+const filterQuickPickItem = (pattern, word) => {
+  const matches = fuzzySearch(pattern, word);
+  return matches;
+};
+
+const getBaseName = path => {
+  return path.slice(path.lastIndexOf('/') + 1);
+};
+const emptyMatches = [];
+const convertToPick = item => {
+  return {
+    pick: item,
+    matches: emptyMatches
+  };
+};
+const filterQuickPickItems = (items, value) => {
+  if (!value) {
+    return items.map(convertToPick);
+  }
+  const results = [];
+  for (const item of items) {
+    const baseName = getBaseName(item);
+    const matches = filterQuickPickItem(value, baseName);
+    if (matches.length > 0) {
+      results.push({
+        pick: item,
+        matches
+      });
+    }
+  }
+  return results;
+};
+
 const getFileSearchRipGrepArgs = () => {
   const ripGrepArgs = ['--files', '--sort-files'];
   return ripGrepArgs;
@@ -899,7 +1090,7 @@ const splitLines$1 = lines => {
 
 // TODO create direct connection from electron to file search worker using message ports
 
-const searchFile = async (path, value) => {
+const searchFile = async (path, value, prepare) => {
   const ripGrepArgs = getFileSearchRipGrepArgs();
   const options = {
     ripGrepArgs,
@@ -908,7 +1099,11 @@ const searchFile = async (path, value) => {
   };
   const stdout = await invoke('SearchFile.searchFile', options);
   const lines = splitLines$1(stdout);
-  return lines;
+  if (!prepare) {
+    return lines;
+  }
+  const filtered = filterQuickPickItems(lines, value);
+  return filtered;
 };
 
 const commandMap = {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@lvce-editor/file-search-worker",
-  "version": "1.4.0",
+  "version": "1.6.0",
   "description": "",
   "main": "dist/fileSearchWorkerMain.js",
   "type": "module",
@@ -8,6 +8,7 @@
   "author": "",
   "license": "MIT",
   "dependencies": {
+    "@lvce-editor/fuzzy-search": "^1.0.0",
     "idb": "^8.0.0"
   }
 }