|
From: | indieterminacy |
Subject: | Re: Manual Ordering and Dynamic Priority |
Date: | Wed, 31 Aug 2022 18:27:47 +0200 |
Hello Eduardo, On 31-08-2022 18:13, Eduardo Suarez wrote:
I have lots of tasks (todos) and I would like to create a long backlog based onmy perceived priority. I was thinking to deal with them in the following way: - divide them in groups (categories or similar), - manually sort priority for every group,- mergesort groups, that is, start merging groups in pairs, and manually sortfor every step the union group until I have a large sorted backlog.For this to be practical, I would need an easy way to sort manually a group of tasks and get them assigned automatically a priority (or any other hack) sothat priority ordering matches manual ordering. Any idea about how to get this done?
While these are non orgmode solutions inside Emacs I hope they can give you some ideas of what you want:
https://github.com/sp1ff/elfeed-score https://www.unwoundstack.com/blog/scoring-elfeed-entries.html https://www.gnu.org/software/emacs/manual/html_node/gnus/Scoring.html
If I had to implement it (I don't know lisp), I would assign a property (say BACKLOG_PRIORITY) for every new task, with value the higher value of any other tasks in agenda plus ten (for instance). Then I would query a subset of tasks and sort them manually, swapping their values every time I swap their order. I would also allow to assign a value directly based on free slots, not to bubblethe whole list for a low priority task. Does it sound over-engineered? Any idea?
HTH -- Jonathan McHugh indieterminacy@libre.brussels
[Prev in Thread] | Current Thread | [Next in Thread] |