Mastodon
/
forget-cancellare-vecchi-toot
mirror of https://github.com/codl/forget
2
0
Fork 0
Code Issues Releases Wiki Activity

move normalize to the more general known_instances.js

This commit is contained in:
codl 2019-03-15 21:27:10 +01:00
parent bd795157c7
commit ab4cc996ab
No known key found for this signature in database
GPG Key ID: 6CD7C8891ED1233A
2 changed files with 33 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
assets/instance_buttons.js
View File

@ -1,6 +1,4 @@
const SLOTS = 5;
import {known_load, known_save} from './known_instances.js';
import {SLOTS, normalize_known, known_load, known_save} from './known_instances.js';
(function instance_buttons(){
@ -33,41 +31,11 @@ import {known_load, known_save} from './known_instances.js';
return known;
}
function normalize(known){
/*
move instances with the most hits to the top SLOTS slots,
making sure not to reorder anything that is already there
*/
let head = known.slice(0, SLOTS);
let tail = known.slice(SLOTS);
if(tail.length == 0){
return known;
}
for(let i = 0; i < SLOTS; i++){
let head_min = head.reduce((acc, cur) => acc.hits < cur.hits ? acc : cur);
let tail_max = tail.reduce((acc, cur) => acc.hits > cur.hits ? acc : cur);
if(head_min.hits < tail_max.hits){
// swappy
let i = head.indexOf(head_min);
let j = tail.indexOf(tail_max);
let buf = head[i];
head[i] = tail[j];
tail[j] = buf;
}
}
return head.concat(tail)
}
async function replace_buttons(){
let known = await get_known();
known = normalize(known);
known = normalize_known(known);
known_save(known);
let filtered_top_instances = []

31
assets/known_instances.js
View File

@ -1,4 +1,5 @@
const STORAGE_KEY = 'forget_known_instances';
export const SLOTS = 5;
export function known_save(known){
localStorage.setItem(STORAGE_KEY, JSON.stringify(known));
@ -11,3 +12,33 @@ export function known_load(){
}
return known;
}
export function normalize_known(known){
/*
move instances with the most hits to the top SLOTS slots,
making sure not to reorder anything that is already there
*/
let head = known.slice(0, SLOTS);
let tail = known.slice(SLOTS);
if(tail.length == 0){
return known;
}
for(let i = 0; i < SLOTS; i++){
let head_min = head.reduce((acc, cur) => acc.hits < cur.hits ? acc : cur);
let tail_max = tail.reduce((acc, cur) => acc.hits > cur.hits ? acc : cur);
if(head_min.hits < tail_max.hits){
// swappy
let i = head.indexOf(head_min);
let j = tail.indexOf(tail_max);
let buf = head[i];
head[i] = tail[j];
tail[j] = buf;
}
}
return head.concat(tail)
}