darxtrix/ptop

Optimize the sorting behavior

Open

#31 建立於 2017年7月29日

在 GitHub 查看
 (0 留言) (0 反應) (0 負責人)Python (573 star) (43 fork)batch import
good first issue

描述

See if there is any scope of optimizing the sorting behavior.

  • We don't have to sort each time the processes list, I guess we can use an index for the relevance sort. But for this also we have to get all the process ids that are active and add new process ids and remove all the old process ids from the index. And then display the sorted processes using the index and the process hash map.

貢獻者指南

技術棧
python
領域
performance
議題類型
performance
難度面向新貢獻者的預計實作難度，1 表示很小改動，5 表示專家級工作。
3
預計時間有經驗貢獻者完成調查、實作、測試並準備 pull request 的粗略時間範圍。
half day
活動狀態議題目前的可參與程度：新鮮、活躍、陳舊、阻塞或等待維護者輸入。
stale
清晰度議題是否清楚說明預期改動、驗收標準和下一步。
mostly clear
前置要求
Pythondata structures
新手友善度1-100 的估計分數，表示該議題對首次貢獻者的友善程度。
40
研究方向
Investigate the current sorting implementation in the codebase, likely in the main process listing module. The suggestion is to maintain an index for relevance sorting instead of re sorting the entire process list each time. Look for how process IDs are managed and consider implementing an index that adds/removes IDs as processes appear/disappear. Check the existing data structures and see if a sorted list or heap could be used to avoid full sorts.