djsundog
/
circuitpython
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

[build] simplify makeqstrdata heuristic 

The simpler one saves, on average, 51 more bytes per translation;
the biggest translation per board is reduced, on average, by 85 bytes.
This commit is contained in:
Artyom Skrobov 2021-04-05 15:19:44 -04:00
parent 8a86f9dff6
commit 68920682b6
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
py/makeqstrdata.py
View File

@ -12,7 +12,6 @@ from __future__ import print_function
import re import re
import sys import sys
from math import log
import collections import collections
import gettext import gettext
import os.path import os.path
@ -185,7 +184,7 @@ def compute_huffman_coding(translations, compression_filename):
# Score the candidates we found. This is an empirical formula only, # Score the candidates we found. This is an empirical formula only,
# chosen for its effectiveness. # chosen for its effectiveness.
scores = sorted( scores = sorted(
((s, (len(s) - 1) ** log(max(occ - 2, 1)), occ) for (s, occ) in counter.items()), ((s, (len(s) - 1) ** (occ + 4), occ) for (s, occ) in counter.items()),
key=lambda x: x[1], key=lambda x: x[1],
reverse=True, reverse=True,
) )