move normalize to the more general known_instances.js
This commit is contained in:
parent
bd795157c7
commit
ab4cc996ab
|
@ -1,6 +1,4 @@
|
||||||
const SLOTS = 5;
|
import {SLOTS, normalize_known, known_load, known_save} from './known_instances.js';
|
||||||
|
|
||||||
import {known_load, known_save} from './known_instances.js';
|
|
||||||
|
|
||||||
(function instance_buttons(){
|
(function instance_buttons(){
|
||||||
|
|
||||||
|
@ -33,41 +31,11 @@ import {known_load, known_save} from './known_instances.js';
|
||||||
return known;
|
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(){
|
async function replace_buttons(){
|
||||||
let known = await get_known();
|
let known = await get_known();
|
||||||
|
|
||||||
known = normalize(known);
|
known = normalize_known(known);
|
||||||
known_save(known);
|
known_save(known);
|
||||||
|
|
||||||
let filtered_top_instances = []
|
let filtered_top_instances = []
|
||||||
|
|
|
@ -1,4 +1,5 @@
|
||||||
const STORAGE_KEY = 'forget_known_instances';
|
const STORAGE_KEY = 'forget_known_instances';
|
||||||
|
export const SLOTS = 5;
|
||||||
|
|
||||||
export function known_save(known){
|
export function known_save(known){
|
||||||
localStorage.setItem(STORAGE_KEY, JSON.stringify(known));
|
localStorage.setItem(STORAGE_KEY, JSON.stringify(known));
|
||||||
|
@ -11,3 +12,33 @@ export function known_load(){
|
||||||
}
|
}
|
||||||
return known;
|
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)
|
||||||
|
}
|
||||||
|
|
Loading…
Reference in New Issue