archive/bigly-caret
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fix some things

Browse source
This commit is contained in:
biglyderv 2025-01-31 17:54:32 -05:00
parent 242e119222
commit 1c4ea64463
2 changed files with 11 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

15
rank.js
View file

@ -5,7 +5,6 @@ function rankCalc(result, iterations = 10, main = []) {
let fng = {};
let fnc = {};
let frs = {};
let frsEasy = {};
let msum_old = 0.001;
let pr = {};
@ -51,9 +50,6 @@ function rankCalc(result, iterations = 10, main = []) {
for (let una in result) {
th++;
pr[una] = 0.1 / rl;
if (main.indexOf(una) != -1) {
pr[una] = 0.5;
}
matrixe[una] = [];
if (frs[una].length == 0) {
pr[una] = prold[una];
@ -98,10 +94,17 @@ function rankCalc(result, iterations = 10, main = []) {
}
}
let new_sum = Object.values(pr).filter(x => !isNaN(x)).reduce((a, b) => a + b, 0)
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, 1);
let new_sum2 = ov.filter(i => !isNaN(pr[i]) && main.indexOf(i) == -1).map(n => pr[n]).reduce((a, b) => a + b, 1);
for (let unn in result) {
pr[unn] /= new_sum;
if (main.indexOf(unn) == -1) {
pr[unn] /= new_sum2 * 2;
} else {
pr[unn] /= new_sum * 2;
}
}
}