Timeline for What data structure would be the most efficient for a task scheduler?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 18, 2024 at 20:15 | comment | added | CPlus |
Ah, I know, I can make the number of possible schedule lengths discrete and use a separate ring buffer for each. This would limit the capabilities, but if I only have a handful of possible task delay lengths, this could be worth it to make O(1) insertions and O(1) extractions.
|
|
| Dec 24, 2023 at 23:18 | vote | accept | CPlus | ||
| Dec 24, 2023 at 23:07 | history | answered | DMGregory♦ | CC BY-SA 4.0 |