sagedesk 2.0.0 → 2.1.1

package/dist/react/index.cjs

@@ -126,17 +126,33 @@ function dotProduct(a, b) {
   for (let i = 0; i < a.length; i++) dot += a[i] * b[i];
   return dot;
 }
+function insertSorted(arr, item, maxLen) {
+  arr.push(item);
+  let i = arr.length - 1;
+  while (i > 0 && arr[i - 1].score < arr[i].score) {
+    const tmp = arr[i - 1];
+    arr[i - 1] = arr[i];
+    arr[i] = tmp;
+    i--;
+  }
+  if (arr.length > maxLen) arr.pop();
+}
 function search(queryVector, index, topK = 3, minScore = 0.42) {
   const results = [];
   for (const chunk of index) {
     const score = dotProduct(queryVector, chunk.vector384);
     if (score < minScore) continue;
     if (results.length < topK) {
-      results.push({ chunk, score });
-      results.sort((a, b) => b.score - a.score);
+      insertSorted(results, { chunk, score }, topK);
     } else if (score > results[topK - 1].score) {
       results[topK - 1] = { chunk, score };
-      results.sort((a, b) => b.score - a.score);
+      let i = topK - 1;
+      while (i > 0 && results[i - 1].score < results[i].score) {
+        const tmp = results[i - 1];
+        results[i - 1] = results[i];
+        results[i] = tmp;
+        i--;
+      }
     }
   }
   return results;
@@ -147,15 +163,23 @@ function keywordSearch(query, index, topK = 3) {
   const results = [];
   for (const chunk of index) {
     const chunkLower = chunk.textLower || chunk.text.toLowerCase();
-    const matchCount = terms.filter((t) => chunkLower.includes(t)).length;
+    let matchCount = 0;
+    for (const t of terms) {
+      if (chunkLower.includes(t)) matchCount++;
+    }
     const score = matchCount / terms.length;
     if (score <= 0) continue;
     if (results.length < topK) {
-      results.push({ chunk, score });
-      results.sort((a, b) => b.score - a.score);
+      insertSorted(results, { chunk, score }, topK);
     } else if (score > results[topK - 1].score) {
       results[topK - 1] = { chunk, score };
-      results.sort((a, b) => b.score - a.score);
+      let i = topK - 1;
+      while (i > 0 && results[i - 1].score < results[i].score) {
+        const tmp = results[i - 1];
+        results[i - 1] = results[i];
+        results[i] = tmp;
+        i--;
+      }
     }
   }
   return results;
@@ -511,13 +535,10 @@ var PURIFY_CONFIG = {
   ALLOWED_ATTR: ["href", "title", "target", "rel"],
   ALLOW_DATA_ATTR: false
 };
-var HOOK_ALLOWLIST = ["a"];
 import_dompurify.default.addHook("afterSanitizeAttributes", (node) => {
-  if (HOOK_ALLOWLIST.includes(node.tagName.toLowerCase())) {
-    if (node.tagName.toLowerCase() === "a") {
-      node.setAttribute("target", "_blank");
-      node.setAttribute("rel", "noopener noreferrer");
-    }
+  if (node.tagName.toLowerCase() === "a") {
+    node.setAttribute("target", "_blank");
+    node.setAttribute("rel", "noopener noreferrer");
   }
 });
 function parseMarkdown(markdown) {