RustPython / RustPython/Parser
Investigate alternate PHF algorithms for detecting keywords
@DimitrisJim ya está trabajando en esto.
Desde el 17/5/2023.
- Lenguaje dominante
- Rust
- Estrellas
- 117
- Forks
- 38
- Merge medio
- 4 d 7 h
- PR fusionados (30 d)
- 1
Descripción
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.
Guía de contribución
No hay ninguna guía de contribución indexada para este repositorio
Primeros pasos
- Lee el issue completo y luego la guía de contribución del proyecto.
- Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
- Haz un fork del repositorio y trabaja en una rama.
- Abre un pull request que haga referencia al número del issue.
Evaluación
Este issue todavía no se ha evaluado.