Lines Matching defs:entries
209 def entries(self) -> "list[tuple[Codepoint, EffectiveWidth]]":
227 def make_buckets(entries, low_bit: BitPos, cap_bit: BitPos) -> "list[Bucket]":
228 """Partitions the `(Codepoint, EffectiveWidth)` tuples in `entries` into `Bucket`s. All
235 for (codepoint, width) in entries:
243 of `2**(number of bits in bit range)` entries. (The bit range is the same for all subtables.)
246 be indexed by sub-table `i` in the next-level lookup table. The entries of this table are
252 discard the buckets and convert the entries into `EffectiveWidth` values."""
264 self.entries = []
268 for entries in entry_groups:
269 buckets.extend(make_buckets(entries, self.low_bit, self.cap_bit))
274 self.entries.append(i)
277 self.entries.append(len(self.indexed))
281 for index in self.entries:
287 self.entries = list(map(lambda i: int(self.indexed[i].width()), self.entries))
295 """Returns this table's entries as a list of bytes. The bytes are formatted according to
296 the `OffsetType` which the table was created with, converting any `EffectiveWidth` entries
298 contain four packed 2-bit entries."""
301 for i in range(0, len(self.entries), entries_per_byte):
304 byte |= self.entries[i + j] << (j * int(self.offset_type))
310 table_cfgs: "list[tuple[BitPos, BitPos, OffsetType]]", entries
314 table, and so forth. `entries` is an iterator over the `(Codepoint, EffectiveWidth)` pairs
317 entry_groups = [entries]
320 entry_groups = map(lambda bucket: bucket.entries(), table.buckets())
382 // This is accomplished by packing four stored entries into one byte.