GitHub/Anki
1
0
Fork 0
mirror of https://github.com/ankitects/anki.git synced 2025-09-18 14:02:21 -04:00
Code Issues Projects Releases Packages 1 Wiki Activity Actions

Better approximate average retention/ease/difficulty

Browse source 
Our average calculation is based on pre-binned values, so it's not
entirely accurate, but using the midpoint of the bin brings us closer.
In the future we can solve this by calculating it on the Rust end instead.
This commit is contained in:
Damien Elmes 2023-12-12 15:07:08 +10:00
parent 00da2ac27b
commit 129157eb21
3 changed files with 3 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
ts/graphs/difficulty.ts
View file

@ -101,7 +101,7 @@ export function prepareData(
const tableData = [
{
label: tr.statisticsAverageDifficulty(),
value: xTickFormat(sum(Array.from(allEases.entries()).map(([k, v]) => k * v)) / total),
value: xTickFormat(sum(Array.from(allEases.entries()).map(([k, v]) => (k + 2.5) * v)) / total),
},
];

2
ts/graphs/ease.ts
View file

@ -106,7 +106,7 @@ export function prepareData(
const tableData = [
{
label: tr.statisticsAverageEase(),
value: xTickFormat(sum(Array.from(allEases.entries()).map(([k, v]) => k * v)) / total),
value: xTickFormat(sum(Array.from(allEases.entries()).map(([k, v]) => (k + 2.5) * v)) / total),
},
];

2
ts/graphs/retrievability.ts
View file

@ -101,7 +101,7 @@ export function prepareData(
const tableData = [
{
label: tr.statisticsAverageRetrievability(),
value: xTickFormat(sum(Array.from(allEases.entries()).map(([k, v]) => k * v)) / total),
value: xTickFormat(sum(Array.from(allEases.entries()).map(([k, v]) => (k + 2.5) * v)) / total),
},
];