kristoferssolo/telescope-frecency.nvim
1
0
Fork 0
mirror of https://github.com/kristoferssolo/telescope-frecency.nvim.git synced 2025-10-21 20:10:38 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

update readme

Browse Source
This commit is contained in:
Senghan Bright 2021-01-14 02:39:13 +01:00
parent b9ba773d5f
commit 57f6dd2a15
1 changed files with 12 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
README.md
View File

@ -7,20 +7,23 @@ An implementation of Mozillas [Frecency algorithm](https://developer.mozilla.org
Frecency is a score given to each unique file loaded into a Neovim buffer. Frecency is a score given to each unique file loaded into a Neovim buffer.
On each load a timestamp is recorded to a database. The score is calculated using the age of each of the timestamps and the amount of times the file has been loaded: On each load a timestamp is recorded to a database. The score is calculated using the age of each of the timestamps and the amount of times the file has been loaded:
Recency_score =
| Timestamp age | Value |
| -------- | ---------- |
| 4 hours | 100 |
| 1 day | 80 |
| 3 days | 60 |
| 1 week | 40 |
| 1 month | 20 |
| 90 days | 10 |
``` ```
recency_score =
timestamp_age 4 hours => value = 100
timestamp_age 1 day => value = 80
timestamp_age 3 days => value = 60
timestamp_age 1 week => value = 40
timestamp_age 1 month => value = 20
timestamp_age 90 days => value = 10
final_score = frequency * recency_score / max_number_of_timestamps final_score = frequency * recency_score / max_number_of_timestamps
``` ```
## WIP ## WIP
TODO TODO
- [ ] Implement sorter based on frecency score - [ ] Implement sorter based on frecency score