RustPython / RustPython/Parser
Investigate alternate PHF algorithms for detecting keywords
@DimitrisJim 已經在處理了。
開始於 2023年5月17日。
- 主要語言
- Rust
- 星號
- 117
- 分支
- 38
- 平均合併
- 4 天 7 小時
- 30 天內合併 PR
- 1
描述
This relates to a discussion on discord a while back.
The basic idea is that we can create a custom hash function for our keywords that's based on their structure (see related video in discussion) and possibly gain a good perf boost by replacing rust_phf. It still needs some investigating and bench-marking to actually evaluate if this would result in any significant improvement.
Afaik, this usually results in a bigger table being generated (for a keyword set of 30 odd functions, we might need a table of 1024 or 2048 elements mostly filled with None's) but that's a small price to pay considering this table should only be generated for the keywords and nothing else.
貢獻指南
這個儲存庫沒有索引到貢獻指南
從這裡開始
- 先讀完整個 Issue,再讀專案的貢獻指南。
- 在 Issue 下留言說明你要接手 —— 這能避免兩個人做同樣的事。
- Fork 儲存庫,在一個分支上完成修改。
- 送出 Pull Request,並在描述裡引用這個 Issue 編號。
評估
這個 Issue 還沒有評估資料。