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 还没有评估数据。