From 33fa2b39437296cc4dcbcf1ee23aebdacf79a98f Mon Sep 17 00:00:00 2001
From: biglyderv <eggseggsarecool+git@gmail.com>
Date: Sat, 1 Feb 2025 13:52:31 -0500
Subject: [PATCH] failvar

---
 rank.js | 22 +++++++++++++++++-----
 1 file changed, 17 insertions(+), 5 deletions(-)

diff --git a/rank.js b/rank.js
index bfb8e59..16a46a2 100644
--- a/rank.js
+++ b/rank.js
@@ -48,6 +48,7 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
             }
             domains = [...new Set(domains)];
 
+
             fnc[unn] = lf / (1 + domains.length);
         } else {
             fnc[unn] = lf;
@@ -68,9 +69,20 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
             matrixe[n] = 1.1 + 1 / (dst + 3);
             msum_old += matrixe[n];
         }
-        if (main.indexOf(unn) != -1) {
-            for (let ig = (keys.indexOf(unn) || 0) * (rl); ig < ((keys.indexOf(unn) || 0)+1) * (rl); ig++) {
-                matrixe[ig] *= 10;
+
+        let fail = 1;
+        try {
+            let h = new URL(unn);
+            if (!(h.pathname == '/' || h.pathname == '')) fail *= 0.5;
+            if (!(h.search == '')) fail *= 0.4;
+            if (main.indexOf(unn) != -1) fail = 10; 
+        } catch (err) {
+
+        }
+
+        if (fail != 1) {
+            for (let ig = (keys.indexOf(unn) || 0) * (rl); ig < ((keys.indexOf(unn) || 0) + 1) * (rl); ig++) {
+                matrixe[ig] *= fail;
             }
         }
     }
@@ -84,7 +96,7 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
             sum += a[(this.thread.x % c) * c + i] * b[i * c + this.thread.x / c];
         }
         return sum;
-    }).setOutput([keys.length ** 2,1]);
+    }).setOutput([keys.length ** 2, 1]);
 
     for (let i = 0; i < mm; i++) {
         let prold = pr;
@@ -116,7 +128,7 @@ function rankCalc(result, iterations = 10, main = [], domain_mode = false) {
         let ov = Object.keys(pr);
         let new_sum = ov.filter(i => !isNaN(pr[i]) && main.indexOf(i) != -1).map(n => pr[n]).reduce((a, b) => a + b, 1e-9);
         let new_sum2 = ov.filter(i => !isNaN(pr[i]) && main.indexOf(i) == -1).map(n => pr[n]).reduce((a, b) => a + b, 1e-9);
-  
+
         for (let unn of ov) {
             if (!result[unn]) {
                 pr[unn] = 0;