Add `top_down` parameter to `(i)glob` and `Path.(r)glob` matching `{os,Path}.walk`
還沒有人認領這個 Issue。
- 主要語言
- Python
- 星號
- 77.2k
- 分支
- 36k
- PR 合併指標
- PR 指標待擷取
描述
Feature or enhancement
Proposal:
Recursively searching for globs is a common use case when working with the filesystem. In cases where one modifies files while working in them it is useful to specify whether one first wants to recurse into directories or first get all the files in a directory before recursing into subdirs.
One simply example is when one wants to delete all empty directories:
for d in context.root.glob("**/", top_down=False):
if d == context.root:
continue
if not any(d.iterdir()):
d.rmdir()
Currently, one has two alternatives (apart from reimplementing glob) which have their respective drawbacks:
for d in reversed(sorted(context.root.glob("**/"))): ...This eagerly consumes and sorts the iterator. This has the drawback of requiring a lot of memory for large trees and taking additional time for the sorting.for d, _, _ in context.root.walk(top_down=False): ...This works for this simple case but does not allow applying search patterns e.g. only looking for empty directories somewhere under.venv(e.g.**/.venv/**/)
Has this already been discussed elsewhere?
This is a minor feature, which does not need previous discussion elsewhere
Links to previous discussion of this feature:
No response
貢獻指南
從這裡開始
- 先讀完整個 Issue,再讀專案的貢獻指南。
- 在 Issue 下留言說明你要接手 —— 這能避免兩個人做同樣的事。
- Fork 儲存庫,在一個分支上完成修改。
- 送出 Pull Request,並在描述裡引用這個 Issue 編號。
研究方向
首先追蹤現有的 (i)glob 和 Path.(r)glob 入口點,並將其行為與 {os,Path}.walk 進行比較。為遞迴 globbing 實作所要求的 top_down 行為,然後驗證諸如 **/ 之類的模式支援由下而上的走訪,同時保留現有的 glob 行為。
由索引模型根據 Issue 內容生成。
評估
- 技術堆疊
- python
- 領域
- operating-systems
- Issue 類型
- 功能
- 難度
- 4/5
- 預估耗時
- 3-5 天
- 活躍度
- 停滯
- 描述清晰度
- 基本清楚
- 新手友好度
- 38/100