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.