Lines Matching defs:leaves
39 # we just store the leaves in a dict, we can order the leaves later if needed
42 self.leaves = {} # leaf_number -> leaf data (= 16 uint32)
47 if leaf_num in self.leaves:
48 leaf = self.leaves[leaf_num]
51 self.leaves[leaf_num] = leaf
58 if leaf_num in self.leaves:
59 leaf = self.leaves[leaf_num]
65 keys = sorted(self.leaves.keys())
66 other_keys = sorted(other_cs.leaves.keys())
72 if not leaves_equal(self.leaves[k1], other_cs.leaves[k2]):
195 total_leaves += len(charset.leaves)
197 # Find unique leaves
198 leaves = []
200 for leaf_num in sorted(s.leaves.keys()):
201 leaf = s.leaves[leaf_num]
203 for existing_leaf in leaves:
209 leaves.append(leaf)
231 tn += len(s.leaves)
241 print('/* total size: {} unique leaves: {} */\n'.format(total_leaves, len(leaves)))
244 print('#define OFF0 (LEAF0 + {} * sizeof (FcCharLeaf))'.format(len(leaves)))
259 FcCharLeaf leaves[{}];
264 }} fcLangData = {{'''.format(len(sets), len(leaves), tn, tn,
275 langs[i], len(sets[j].leaves), i, off[j], i, off[j], i))
279 # Dump leaves
281 for l, leaf in enumerate(leaves):
290 # Dump leaves
298 for n, leaf_num in enumerate(sorted(s.leaves.keys())):
299 leaf = s.leaves[leaf_num]
302 found = [k for k, unique_leaf in enumerate(leaves) if leaves_equal(unique_leaf,leaf)]
303 assert found, "Couldn't find leaf in unique leaves list!"
308 if len(s.leaves) % 4 != 0:
320 for n, leaf_num in enumerate(sorted(s.leaves.keys())):
321 leaf = s.leaves[leaf_num]
327 if len(s.leaves) % 8 != 0: