hSrSSKJr SSKJrJrJrJrJrJ r SSK J r /SQr "SS\ \ RS 45r\\\\\/S 4rSS \ S \\S \S\\\/\4S\\\ /\\ R4S\\4 SjjrSS \ S \\S \S\\\/\4S\\\ /\\ R4S\\4 SjjrSS \ S \\S \S\\\/\4S\S\\\ /\\ R4S\\4Sjjrg )z>Methods for traversing trees of otData-driven OpenType tables.)deque)CallableDequeIterableListOptionalTuple) BaseTable)bfs_base_tabledfs_base_table SubTablePathc"\rSrSrS\4SjrSrg)rreturnc/nUH@nURnURbUSURS3- nURU5 MB SRU5$)N[].)nameindexappendjoin)self path_partsentry path_parts S/var/www/html/env/lib/python3.13/site-packages/fontTools/ttLib/tables/otTraverse.py__str__SubTablePath.__str__sZ E I{{&q Q//   i (  xx ##N)__name__ __module__ __qualname____firstlineno__strr__static_attributes__r"r!rrrs$$r!r.Nroot root_accessor skip_root predicateiter_subtables_fnrc#B# [UUUUSU5ShvN gN7f)aDepth-first search tree of BaseTables. Args: root (BaseTable): the root of the tree. root_accessor (Optional[str]): attribute name for the root table, if any (mostly useful for debugging). skip_root (Optional[bool]): if True, the root itself is not visited, only its children. predicate (Optional[Callable[[SubTablePath], bool]]): function to filter out paths. If True, the path is yielded and its subtables are added to the queue. If False, the path is skipped and its subtables are not traversed. iter_subtables_fn (Optional[Callable[[BaseTable], Iterable[BaseTable.SubTableEntry]]]): function to iterate over subtables of a table. If None, the default BaseTable.iterSubTables() is used. Yields: SubTablePath: tuples of BaseTable.SubTableEntry(name, table, index) namedtuples for each of the nodes in the tree. The last entry in a path is the current subtable, whereas preceding ones refer to its parent tables all the way up to the root. c6UR[U55$N) extendleftreversedfrontiernews r dfs_base_table..Ash11(3-@r!N_traverse_ot_datar)r*r+r,r-s rr r s+<! @  c#B# [UUUUSU5ShvN gN7f)aBreadth-first search tree of BaseTables. Args: root the root of the tree. root_accessor (Optional[str]): attribute name for the root table, if any (mostly useful for debugging). skip_root (Optional[bool]): if True, the root itself is not visited, only its children. predicate (Optional[Callable[[SubTablePath], bool]]): function to filter out paths. If True, the path is yielded and its subtables are added to the queue. If False, the path is skipped and its subtables are not traversed. iter_subtables_fn (Optional[Callable[[BaseTable], Iterable[BaseTable.SubTableEntry]]]): function to iterate over subtables of a table. If None, the default BaseTable.iterSubTables() is used. Yields: SubTablePath: tuples of BaseTable.SubTableEntry(name, table, index) namedtuples for each of the nodes in the tree. The last entry in a path is the current subtable, whereas preceding ones refer to its parent tables all the way up to the root. c$URU5$r0)extendr3s rr6 bfs_base_table..js hooc2r!Nr8r:s rr r Fs+>! 2 r;add_to_frontier_fnc## Uc[U5RnUcSnUcSn[5n[R"X5nU(dUR U45 O!U"UU"U5Vs/sHnXx4PM sn5 U(ahUR 5n U SRn U"U 5(dM5[U 5v U"U 5Vs/sHoU4-PM n nU"Xk5 U(aMgggs snfs snf7f)Ncg)NTr")paths rr,$_traverse_ot_data..predicatesr!c"UR5$r0) iterSubTables)tables rr-,_traverse_ot_data..iter_subtables_fns&&( (r!) typer#rr SubTableEntryrpopleftvaluer) r)r*r+r,r@r-r4 root_entrysubtable_entryrCcurrent new_entriess rr9r9os T ++    )%*GH((=J  & '8&= &=N,&=   !r(.. 4  rYsDCC $500#56$E,/l1CDdJK $(:> % %C=%%,!567 %  )hy'>'>??@ %l%T$(:> & &C=&&,!567 &  )hy'>'>??@ &l&b 42 42C=4242,!567 42 ( 42  )hy'>'>??@ 42l42r!