Amir Gonnen b7e692c8e4 py/qstr: Sort qstrs by hash.
Instead of sorting by string, sort qstrs by (hash, len).
This allows faster binary serach on qstr_find_strn, since it's faster
to compare hashes than strings.
A few strings needed to be moved to special string pool (QDEF0)
because their qstr is assumed to be small (8 bit) on py/scope.c
2022-07-02 23:40:22 +03:00
..
2022-07-02 23:40:22 +03:00
2022-06-17 12:57:59 +10:00
2022-07-02 23:40:22 +03:00
2022-07-02 23:38:13 +03:00
2019-11-21 12:04:53 +11:00