Using set comprehension
Suggestion by anthrotype Co-authored-by: Cosimo Lupo <cosimo@anthrotype.com>
This commit is contained in:
parent
579d0dce31
commit
edc3584d5b
@ -144,7 +144,7 @@ def test(glyphsets, glyphs=None, names=None, ignore_missing=False):
|
|||||||
if glyphs is None:
|
if glyphs is None:
|
||||||
# `glyphs = glyphsets[0].keys()` is faster, certainly, but doesn't allow for sparse TTFs/OTFs given out of order
|
# `glyphs = glyphsets[0].keys()` is faster, certainly, but doesn't allow for sparse TTFs/OTFs given out of order
|
||||||
# ... risks the sparse master being the first one, and only processing a subset of the glyphs
|
# ... risks the sparse master being the first one, and only processing a subset of the glyphs
|
||||||
glyphs = set([g for glyphset in glyphsets for g in glyphset.keys()])
|
glyphs = {g for glyphset in glyphsets for g in glyphset.keys()}
|
||||||
|
|
||||||
hist = []
|
hist = []
|
||||||
problems = OrderedDict()
|
problems = OrderedDict()
|
||||||
|
Loading…
x
Reference in New Issue
Block a user