/opt/imunify360/venv/lib/python3.11/site-packages/docutils/__pycache__
NameSizeModeActions
core.cpython-311.pyc358290644editdlrm
examples.cpython-311.pyc41750644editdlrm
frontend.cpython-311.pyc460320644editdlrm
io.cpython-311.pyc288040644editdlrm
nodes.cpython-311.pyc1189940644editdlrm
statemachine.cpython-311.pyc723780644editdlrm
__init__.cpython-311.pyc71680644editdlrm
__main__.cpython-311.pyc38680644editdlrm
Edit: /opt/imunify360/venv/lib/python3.11/site-packages/docutils/__pycache__/nodes.cpython-311.pyc (118994B)
§ P#úkCȪQã ó:—dZdZddlmZddlZddlZddlZddlZGd„d¦«ZGd„de ¦«Z d „Z �d\d „Z Gd „d ee ¦«Z Gd„de¦«ZGd„de¦«ZGd„de¦«ZGd„d¦«ZGd„d¦«ZGd„d¦«ZGd„d¦«ZGd„d¦«ZGd„d¦«ZGd „d!e¦«ZGd"„d#¦«ZGd$„d%¦«ZGd&„d'e¦«ZGd(„d)e¦«ZGd*„d+e¦«ZGd,„d-e¦«ZGd.„d/e¦«ZGd0„d1¦«ZGd2„d3¦«Z Gd4„d5e¦«Z!Gd6„d7e¦«Z"Gd8„d9¦«Z#Gd:„d;eee¦«Z$Gd<„d=eee¦«Z%Gd>„d?eee¦«Z&Gd@„dAee¦«Z'GdB„dCee¦«Z(GdD„dEee¦«Z)GdF„dGee¦«Z*GdH„dIee¦«Z+GdJ„dKee¦«Z,GdL„dMee¦«Z-GdN„dOee¦«Z.GdP„dQee¦«Z/GdR„dSee¦«Z0GdT„dUee¦«Z1GdV„dWee¦«Z2GdX„dYee¦«Z3GdZ„d[ee¦«Z4Gd\„d]ee¦«Z5Gd^„d_ee¦«Z6Gd`„daee¦«Z7Gdb„dcee¦«Z8Gdd„deee¦«Z9Gdf„dgee¦«Z:Gdh„diee¦«Z;Gdj„dkee¦«Z<Gdl„dmee¦«Z=Gdn„doee¦«Z>Gdp„dqee¦«Z?Gdr„dsee¦«Z@Gdt„duee¦«ZAGdv„dwee¦«ZBGdx„dyee¦«ZCGdz„d{ee¦«ZDGd|„d}ee¦«ZEGd~„dee¦«ZFGd€„d�ee¦«ZGGd‚„dƒee¦«ZHGd„„d…ee¦«ZIGd†„d‡ee¦«ZJGdˆ„d‰ee¦«ZKGdŠ„d‹ee¦«ZLGdŒ„d�ee¦«ZMGdŽ„d�ee¦«ZNGd�„d‘ee¦«ZOGd’„d“ee¦«ZPGd”„d•ee¦«ZQGd–„d—ee¦«ZRGd˜„d™ee¦«ZSGdš„d›ee¦«ZTGdœ„d�ee¦«ZUGdž„dŸee¦«ZVGd „d¡ee¦«ZWGd¢„d£ee¦«ZXGd¤„d¥ee¦«ZYGd¦„d§ee¦«ZZGd¨„d©ee¦«Z[Gdª„d«ee¦«Z\Gd¬„d­ee¦«Z]Gd®„d¯ee¦«Z^Gd°„d±ee¦«Z_Gd²„d³ee¦«Z`Gd´„dµee¦«ZaGd¶„d·eee¦«ZbGd¸„d¹eee¦«ZcGdº„d»eee ee"¦«ZdGd¼„d½eeee#e"¦«ZeGd¾„d¿eeee#e"¦«ZfGdÀ„dÁee¦«ZgGd„dÃee¦«ZhGdÄ„dÅee¦«ZiGdÆ„dÇee¦«ZjGdÈ„dÉee¦«ZkGdÊ„dËee¦«ZlGdÌ„dÍee¦«ZmGd΄dÏee¦«ZnGdЄdÑee¦«ZoGdÒ„dÓee¦«ZpGdÔ„dÕee¦«ZqGdÖ„d×eeee¦«ZrGdØ„dÙeee¦«ZsGdÚ„dÛee ee¦«ZtGdÜ„dÝe e¦«ZuGdÞ„dße e¦«ZvGdà„dáe e¦«ZwGdâ„dãee e!e¦«ZxGdä„dåe e!e¦«ZyGdæ„dçe e!e¦«ZzGdè„dée e¦«Z{Gdê„dëe e¦«Z|Gdì„díe e¦«Z}Gdî„dïe e¦«Z~Gdð„dñe e¦«ZGdò„dóe e¦«Z€Gdô„dõe e¦«Z�Gdö„d÷ee e¦«Z‚Gdø„dùe e¦«ZƒGdú„dûe e¦«Z„Gdü„dýe e¦«Z…dþ †¦«Z‡ Gdÿ„�d¦«ZˆG�d„�deˆ¦«Z‰G�d„�deˆ¦«ZŠ�d„Z‹�d„ZŒ�d„Z��d„ZŽeŽe‡¦«G�d „�d eЦ«Z�G�d „�d e�¦«Z‘G�d „�de‘¦«Z’G�d„�de‘¦«Z“G�d„�de‘¦«Z”G�d„�de‘¦«Z•G�d„�de‘¦«Z–G�d„�de‘¦«Z—�d„Z˜ej™�d¦«Zšej™�d¦«Z›i�d�d“�d�d“�d �d!“�d"�d#“�d$�d%“�d&�d'“�d(�d)“�d*�d)“�d+�d,“�d-�d“�d.�d/“�d0�d1“�d2�d%“�d3�d4“�d5�d6“�d7�d'“�d8�d'“i�d9�d:“�d;�d<“�d=�d>“�d?�d<“�d@�d%“�dA�d4“�dB�d'“�dC�dD“�dE�d,“�dF�dG“�dH�d<“�dI�dJ“�dK�dD“�dL�dM“�dN�dO“�dP�d:“¥Zœ�dQ�dR�dS�dT�dU�dVœZ��dW„Zž�dX„ZŸ�dY„Z �dZ„Z¡�d[„Z¢dS(]aØ Docutils document tree element class library. Classes in CamelCase are abstract base classes or auxiliary classes. The one exception is `Text`, for a text (PCDATA) node; uppercase is used to differentiate from element classes. Classes in lower_case_with_underscores are element classes, matching the XML element generic identifiers in the DTD_. The position of each node (the level at which it can occur) is significant and is represented by abstract base classes (`Root`, `Structural`, `Body`, `Inline`, etc.). Certain transformations will be easier because we can use ``isinstance(node, base_class)`` to determine the position of the node in the hierarchy. .. _DTD: https://docutils.sourceforge.io/docs/ref/docutils.dtd ÚreStructuredTexté)ÚCounterNcóÈ—eZdZdZdZ dZ dZ dZed„¦«Z e j d„¦«Z d„Z dd„Z dd „Z d „Zd „Zd „Zd „Zd„Zd„Zd„Zd„Z dd„Z dd„Z dd„ZdS)ÚNodez0Abstract base class of nodes in a document tree.NcóL— |jp |jjS#t$rYdSwxYw)zJReturn the `document` root node of the tree containing this Node. N)Ú _documentÚparentÚdocumentÚAttributeError©Úselfs ún/builddir/build/BUILD/imunify360-venv-2.6.3/opt/imunify360/venv/lib/python3.11/site-packages/docutils/nodes.pyr z Node.document6s;€ð Ø”>Ð9 T¤[Ô%9Ð 9øÝð ð ð Ø�4�4ð øøøs ‚• #¢#có—||_dS©N)r)r Úvalues rr z Node.document?s €àˆŒˆˆócó—dS)a Node instances are always true, even if they're empty. A node is more than a simple container. Its boolean "truth" does not depend on having one or more subnodes in the doctree. Use `len()` to check node length. T©r s rÚ__bool__z Node.__bool__Cs €ðˆtrcój—|€ ddlmcm}| ¦«}| |¦«S)z6Return a DOM **fragment** representation of this Node.Nr)Úxml.dom.minidomÚdomÚminidomÚDocumentÚ _dom_node©r rÚdomroots rÚasdomz Node.asdomMsA€à ˆ;Ø )Ð )Ð )Ð )Ð )Ð )Ð )Ð )Ð )Ø—,’,‘.”.ˆØ�~Š~˜gÑ&Ô&Ð&rú rcó—t‚)zs Return an indented pseudo-XML representation, for test purposes. Override in subclasses. ©ÚNotImplementedError)r ÚindentÚlevels rÚpformatz Node.pformatTs €õ "Ð!rcó—t‚)zReturn a copy of self.r!r s rÚcopyz Node.copy\ó€å!Ð!rcó—t‚)z3Return a deep copy of self (also copying children).r!r s rÚdeepcopyz Node.deepcopy`r(rcó—t‚)z,Return a string representation of this Node.r!r s rÚastextz Node.astextdr(rcó¢—||_|jr>|j|_|j€|jj|_|j€|jj|_dSdSdSr)r r ÚsourceÚcurrent_sourceÚlineÚ current_line©r Úchilds rÚ setup_childzNode.setup_childhsZ€ØˆŒ Ø Œ=ð 8Ø!œ]ˆEŒNØŒ|Ð#Ø#œ}Ô;�” ØŒzÐ!Ø!œ]Ô7�” � � ð  8ð 8ð"Ð!rcó~—d}|jj d|jjz¦« | |¦«n$#t tf$r|cYSt$rYnwxYw|j } |dd…D]}|  |¦«rd}nŒn#t$rYnwxYwn#t$rd}YnwxYw|S)aé Traverse a tree of `Node` objects, calling the `dispatch_visit()` method of `visitor` when entering each node. (The `walkabout()` method is similar, except it also calls the `dispatch_departure()` method before exiting each node.) This tree traversal supports limited in-place tree modifications. Replacing one node with one or more nodes is OK, as is removing an element. However, if the node removed or replaced occurs after the current node, the old node will still be traversed, and any new nodes will not. Within ``visit`` methods (and ``depart`` methods for `walkabout()`), `TreePruningException` subclasses may be raised (`SkipChildren`, `SkipSiblings`, `SkipNode`, `SkipDeparture`). Parameter `visitor`: A `NodeVisitor` object, containing a ``visit`` implementation for each `Node` subclass encountered. Return true if we should stop the traversal. Fz6docutils.nodes.Node.walk calling dispatch_visit for %sNT) r ÚreporterÚdebugÚ __class__Ú__name__Údispatch_visitÚ SkipChildrenÚSkipNodeÚ SkipDepartureÚchildrenÚwalkÚ SkipSiblingsÚ StopTraversal)r ÚvisitorÚstopr>r3s rr?z Node.walkqs+€ð.ˆØÔÔ!×'Ò'Ø DØŒnÔ%ñ &ñ 'ô 'ð 'ð ð Ø×&Ò& tÑ,Ô,Ð,Ð,øÝ ¥(Ð+ð ð ð Ø� � � Ý ð ð ð Ø�ð øøøà”}ˆHð Ø% a a aœ[ðð�EØ—z’z 'Ñ*Ô*ðØ#˜Ø˜ðøøõ ð ð ð Ø�ð øøøøøåð ð ð ØˆDˆDˆDð øøøàˆ s_±AÁB+ÁA(ÁB+Á A(Á%B+Á'A(Á( B+Á3&BÂB+ B'Â$B+Â&B'Â'B+Â+ B:Â9B:có—d}d}|jj d|jjz¦« | |¦«n#t $r|cYSt$rd}YnwxYw|j} |dd…D]}|  |¦«rd}nŒn#t$rYnwxYwn#t$rYnt$rd}YnwxYw|rA|jj d|jjz¦«|  |¦«|S)a† Perform a tree traversal similarly to `Node.walk()` (which see), except also call the `dispatch_departure()` method before exiting each node. Parameter `visitor`: A `NodeVisitor` object, containing a ``visit`` and ``depart`` implementation for each `Node` subclass encountered. Return true if we should stop the traversal. TFz;docutils.nodes.Node.walkabout calling dispatch_visit for %sNz?docutils.nodes.Node.walkabout calling dispatch_departure for %s)r r6r7r8r9r:r<r=r>Ú walkaboutr@r;rAÚdispatch_departure)r rBÚ call_departrCr>r3s rrEzNode.walkaboutŸs”€ðˆ ؈ØÔÔ!×'Ò'Ø IØŒnÔ%ñ &ñ 'ô 'ð 'ð ð $Ø×&Ò& tÑ,Ô,Ð,Ð,øÝð ð ð Ø� � � Ý ð $ð $ð $Ø#� � � ð $øøøà”}ˆHð Ø% a a aœ[ðð�EØ—’ wÑ/Ô/ðØ#˜Ø˜ðøøõ ð ð ð Ø�ð øøøøøåð ð ð Ø ˆDÝð ð ð ØˆDˆDˆDð øøøà ð -Ø Ô Ô %× +Ò +ðØœ>Ô2ñ3ñ 4ô 4ð 4ð × &Ò & tÑ ,Ô ,Ð ,؈ se³A ÁB(Á A%ÁB(Á A%Á"B(Á$A%Á% B(Á0&BÂB( B$Â!B(Â#B$Â$B(Â( CÂ4 CÃCc#ó|K—t||¦«r|V—|jD]}| |¦«Ed{V—†ŒdS)z3Return iterator that only supports instance checks.N)Ú isinstancer>Ú _fast_findall)r Úclsr3s rrJzNode._fast_findallÊseèè€å �d˜CÑ Ô ð ØˆJˆJˆJØ”]ð 0ð 0ˆEØ×*Ò*¨3Ñ/Ô/Ð /Ð /Ð /Ð /Ð /Ð /Ð /Ð /ð 0ð 0rc#óZK—|V—|jD]}| ¦«Ed{V—†ŒdS)z3Return iterator that doesn't check for a condition.N)r>Ú_superfast_findallr2s rrMzNode._superfast_findallÑsSèè€ð ˆ ˆ ˆ Ø”]ð 2ð 2ˆEØ×/Ò/Ñ1Ô1Ð 1Ð 1Ð 1Ð 1Ð 1Ð 1Ð 1Ð 1ð 2ð 2rTFc ó†—tjdtd¬¦«t| |||||¦«¦«S)zyReturn list of nodes following `self`. For looping, Node.findall() is faster and more memory efficient. z5nodes.Node.traverse() is obsoleted by Node.findall().é©Ú stacklevel)ÚwarningsÚwarnÚPendingDeprecationWarningÚlistÚfindall©r Ú conditionÚ include_selfÚdescendÚsiblingsÚascends rÚtraversez Node.traverseÚsR€õ Œ ÐMÝ/¸Að ?ñ ?ô ?ð ?å�D—L’L ¨L¸'Ø!)¨6ñ3ô3ñ4ô4ð 4rc#óîK—|rd}|rT|rR|sP|€| ¦«Ed{V—†dSt|t¦«r| |¦«Ed{V—†dSt|t¦«r|}|fd„}|r|� ||¦«r|V—|r9t |j¦«r%|D]"}| |dddd¬¦«Ed{V—†Œ#|s|r¨|}|jr¡|j |¦«} |j| |ur-|j || dz¦«} |j| |u°-|j| dzd…D]"} |  |d|dd¬¦«Ed{V—†Œ#|sdS|j}|j°�dSdSdS)a� Return an iterator yielding nodes following `self`: * self (if `include_self` is true) * all descendants in tree traversal order (if `descend` is true) * the following siblings (if `siblings` is true) and their descendants (if also `descend` is true) * the following siblings of the parent (if `ascend` is true) and their descendants (if also `descend` is true), and so on. If `condition` is not None, the iterator yields only nodes for which ``condition(node)`` is true. If `condition` is a node class ``cls``, it is equivalent to a function consisting of ``return isinstance(node, cls)``. If `ascend` is true, assume `siblings` to be true as well. If the tree structure is modified during iteration, the result is undefined. For example, given the following tree:: <--- emphasis.traverse() and <--- strong.traverse() are called. Foo Bar Baz Then tuple(emphasis.traverse()) equals :: (, , <#text: Foo>, <#text: Bar>) and list(strong.traverse(ascend=True) equals :: [, <#text: Foo>, <#text: Bar>, , <#text: Baz>] TNcó"—t||¦«Sr)rI)ÚnodeÚ node_classs rrXzNode.findall..conditions€Ý! $¨ Ñ3Ô3Ð3rF)rXrYrZr[r\é) rMrIÚtyperJÚlenr>rVr Úindex) r rXrYrZr[r\rar3r`reÚsiblings rrVz Node.findallæsŽèè€ðP ð ØˆHð ð ˜Gð ¨Hð ØÐ Ø×2Ò2Ñ4Ô4Ð4Ð4Ð4Ð4Ð4Ð4Ð4Ø�ݘI¥tÑ,Ô,ð Ø×-Ò-¨iÑ8Ô8Ð8Ð8Ð8Ð8Ð8Ð8Ð8Ø�õ �i¥Ñ &Ô &ð 4Ø"ˆJà+5ð 4ð 4ð 4ð 4ð ð ˜YÐ.°)°)¸D±/´/Ð.؈JˆJˆJØ ð G•s˜4œ=Ñ)Ô)ð GØð Gð G�Ø Ÿ=š=°9Ø6:ÀDØ27Àð)ñGôGðGðGðGðGðGðGðGðGð ð '�vð '؈DØ”+ð 'Øœ ×)Ò)¨$Ñ/Ô/�à”k %Ô(°Ð4Ð4Ø œK×-Ò-¨d°E¸A±IÑ>Ô>�Eð”k %Ô(°Ð4Ð4à#œ{¨5°©7¨8¨8Ô4ð6ð6�GØ&ŸšØ"+Ø%)°7Ø!&¨uð /ñ 6ô 6ð6ð6ð6ð6ð6ð6ð6ð6ðð'Ø�Eàœ;�Dð”+ð 'ð 'ð 'ð 'ð 'ð 'ð 'rc ór— t| |||||¦«¦«S#t$rYdSwxYw)zé Return the first node in the iterator returned by findall(), or None if the iterable is empty. Parameter list is the same as of traverse. Note that `include_self` defaults to False, though. N)ÚnextrVÚ StopIterationrWs rÚ next_nodezNode.next_node9s[€ð ݘŸ š  Y° Ø%,¨h¸ñ@ô@ñAôAð Aøåð ð ð Ø�4�4ð øøøs ‚%(¨ 6µ6r©rr)NTTFF)NFTFF)r9Ú __module__Ú __qualname__Ú__doc__r r.r0rÚpropertyr Úsetterrrr%r'r*r,r4r?rErJrMr]rVrjrrrrr(s}€€€€€Ø:Ð:à €FØFà €FØLà €DØNà€Ià ððñ„Xðð„_ððñ„_ððððð'ð'ð'ð'ð"ð"ð"ð"ð"ð"ð"ð"ð"ð"ð"ð"ð"ð8ð8ð8ð,ð,ð,ð\)ð)ð)ðV0ð0ð0ð2ð2ð2ðCGØ(-ð 4ð 4ð 4ð 4ðBFØ',ðQ'ðQ'ðQ'ðQ'ðfEIØ).ð ð ð ð ð ð rrcó"‡—eZdZdZˆfd„ZˆxZS)Ú reprunicodezR Deprecated backwards compatibility stub. Use the standard `str` instead. c󀕗tjdtd¬¦«t¦« ¦«dS)Nz`nodes.reprunicode() is not required with Python 3 and will be removed in Docutils 0.21 or later.rOrP)rRrSÚDeprecationWarningÚsuperÚ__init__)r Úsr8s €rrvzreprunicode.__init__MsEø€ÝŒ ðHå(°Qð 8ñ 8ô 8ð 8õ ‰Œ×ÒÑÔÐÐÐr)r9rlrmrnrvÚ __classcell__)r8s@rrrrrIsBø€€€€€ðððððððððððrrrcó>—tjdtd¬¦«|S)z@ Deprecated backwards compatibility stub returning `s`. z_nodes.ensure_str() is not required with Python 3 and will be removed in Docutils 0.21 or later.rOrP)rRrSrt)rws rÚ ensure_strrzTs/€õ „MðDå$°ð4ñ4ô4ð4ð €HrFcó�—|r| dd¦«SdD]*}d | |¦«¦«}Œ+|S)zw Return a string with nulls removed or restored to backslashes. Backslash-escaped spaces are also removed. úú\)z z r|Ú)ÚreplaceÚjoinÚsplit)ÚtextÚrestore_backslashesÚrespect_whitespaceÚseps rÚunescaper†_sQ€ð ðØ�|Š|˜F DÑ)Ô)Ð)à.ð ,ð ,ˆCØ—7’7˜4Ÿ:š: c™?œ?Ñ+Ô+ˆDˆD؈ rcób—eZdZdZdZdZ dd„Zdd„Zd„Zd „Z d „Z d „Z d „Z dd„Z dd„Zdd„ZdS)ÚTexta Instances are terminal nodes (leaves) containing text only; no child nodes or attributes. Initialize by passing a string to the constructor. Access the raw (null-escaped) text with ``str()`` and unescaped text with ``.astext()``. z#textrNcó¼—t|t¦«rtd¦«‚|�tjdt d¬¦«t  ||¦«S)zuAssert that `data` is not an array of bytes and warn if the deprecated `rawsource` argument is used. zexpecting str data, not bytesNz_nodes.Text: initialization argument "rawsource" is ignored and will be removed in Docutils 2.0.rOrP)rIÚbytesÚ TypeErrorrRrSrtÚstrÚ__new__)rKÚdataÚ rawsources rr�z Text.__new__|se€õ �d�EÑ "Ô "ð =ÝÐ;Ñ<Ô<Ð <Ø Ð Ý ŒMðLå,¸ð <ñ <ô <ð <õ�{Š{˜3 Ñ%Ô%Ð%récó‚—|}t|¦«|kr|d|dz …dz}d|j›dt|¦«›d�S)Néú ...ú<ú: ú>)rdÚtagnamerŒ)r ÚmaxlenrŽs rÚ shortreprzText.shortreprˆsJ€ØˆÝ ˆt‰9Œ9�vÒ Ð Ø˜ ˜ ™˜ ”? VÑ+ˆDøØ!œ\˜\˜\­3¨t©9¬9¨9¨9Ð5Ð5rcó.—| d¬¦«S)NéD)r˜)r™r s rÚ__repr__z Text.__repr__Žs€Ø�~Š~ Rˆ~Ñ(Ô(Ð(rcóF—| t|¦«¦«Sr)ÚcreateTextNoderŒ)r rs rrzText._dom_node‘s€Ø×%Ò%¥c¨$¡i¤iÑ0Ô0Ð0rcó:—tt|¦«¦«Sr)rŒr†r s rr,z Text.astext”s€Ý•8˜D‘>”>Ñ"Ô"Ð"rcóF—| t|¦«¦«Sr)r8rŒr s rr'z Text.copy—s€Ø�~Š~�c $™iœiÑ(Ô(Ð(rcó*—| ¦«Sr)r'r s rr*z Text.deepcopyšs€Ø�yŠy‰{Œ{Ðrrrc󀇇— |jjjrG‰‰z›d›�}ˆˆfd„| d¦«D¦«}d |g|¢R¦«dzSn#t $rYnwxYw‰‰zŠˆfd„| ¦« ¦«D¦«}|sdSd |¦«dzS)Nz<#text>c3óH•K—|]}‰‰dzzt|¦«zV—ŒdS©rbN)Úrepr©Ú.0r0r#r$s €€rú zText.pformat..¡sKøèè€ð<ð<Ø!ð   q¡Ñ)­D°©J¬JÑ6ð<ð<ð<ð<ð<ðz Text.pformat..§sø€ÐDÐDÐD �˜‘ÐDÐDÐDrr~)r ÚsettingsÚdetailedÚ splitlinesr€r r,)r r#r$ÚtagÚliness `` rr%z Text.pformat�søø€ð ØŒ}Ô%Ô.ð 7Ø & u¡   ¨i¨iÐ8�ð<ð<ð<ð<ð<Ø%)§_¢_°TÑ%:Ô%:ð<ñ<ô<�à—y’y # ¨  Ñ/Ô/°$Ñ6Ð6ð  7øõ ð ð ð Ø ˆDð øøøà˜%‘ˆØDÐDÐDÐD¨¯ª©¬×)AÒ)AÑ)CÔ)CÐDÑDÔDˆØð Ø�2Ø�yŠy˜ÑÔ $Ñ&Ð&s„AAÁ A*Á)A*có^—| t ||¦«¦«Sr)r8rŒÚrstrip©r Úcharss rr²z Text.rstrip°ó"€Ø�~Š~�cŸjšj¨¨uÑ5Ô5Ñ6Ô6Ð6rcó^—| t ||¦«¦«Sr)r8rŒÚlstripr³s rr·z Text.lstrip³rµrr)r�rk)r9rlrmrnr—r>r�r™rœrr,r'r*r%r²r·rrrrˆrˆmsÜ€€€€€ððð€Gà€HØ@ð &ð &ð &ð &ð6ð6ð6ð6ð )ð)ð)ð1ð1ð1ð#ð#ð#ð)ð)ð)ðððð 'ð 'ð 'ð 'ð&7ð7ð7ð7ð7ð7ð7ð7ð7ð7rrˆcó—eZdZdZdZ dZ eezZ edzZ dZ dZ dFd„Z d „Z d „Z d „Z d „ZdGd „Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„Zd„ZdGd„Zd„Zd„ZdGd„Z eZ!dFd„Z"d „Z#d!„Z$d"„Z%dHd$„Z&d%„Z'd&e(j)fd'„Z*d(„Z+d)„Z,d*„Z-d+„Z.d,„Z/dId.„Z0dId/„Z1d0„Z2d1„Z3d2„Z4e4d-d3fd4„Z5 dJd5„Z6 dJd6„Z7 dJd7„Z8dKd8„Z9d9„Z:d:„Z;d;„ZdLd?„Z?d@„Z@dA„ZAdB„ZBdMdC„ZCeDdD„¦«ZEeDdE„¦«ZFdS)NÚElementaV `Element` is the superclass to all specific elements. Elements contain attributes and child nodes. They can be described as a cross between a list and a dictionary. Elements emulate dictionaries for external [#]_ attributes, indexing by attribute name (a string). To set the attribute 'att' to 'value', do:: element['att'] = 'value' .. [#] External attributes correspond to the XML element attributes. From its `Node` superclass, Element also inherits "internal" class attributes that are accessed using the standard syntax, e.g. ``element.parent``. There are two special attributes: 'ids' and 'names'. Both are lists of unique identifiers: 'ids' conform to the regular expression ``[a-z](-?[a-z0-9]+)*`` (see the make_id() function for rationale and details). 'names' serve as user-friendly interfaces to IDs; they are case- and whitespace-normalized (see the fully_normalize_name() function). Elements emulate lists for child nodes (element nodes and/or text nodes), indexing by integer. To get the first child node, use:: element[0] to iterate over the child nodes (without descending), use:: for child in element: ... Elements may be constructed using the ``+=`` operator. To add one new child node to element, do:: element += node This is equivalent to ``element.append(node)``. To add a list of multiple child nodes at once, use the same ``+=`` operator:: element += [node1, node2] This is equivalent to ``element.extend([node1, node2])``. )ÚidsÚclassesÚnamesÚdupnames)Úbackrefs)r.Nz r~cód—||_ g|_ | |¦«i|_ |jD] }g|j|<Œ | ¦«D]?\}}| ¦«}||jvr|dd…|j|<Œ5||j|<Œ@|j€|jj |_dSdSr) r�r>ÚextendÚ attributesÚlist_attributesÚitemsÚlowerr—r8r9)r r�r>rÁÚattrs rrvzElement.__init__sÙ€Ø"ˆŒð 𠈌 Ø;à � Š �HÑÔÐàˆŒØ4ðÔ'ð &ð &ˆCØ#%ˆDŒO˜CÑ Ð à$×*Ò*Ñ,Ô,ð -ð -‰JˆC�Ø—)’)‘+”+ˆCØ�dÔ*Ð*Ð*à',¨Q¨Q¨Q¤x�” Ñ$Ð$à',�” Ñ$Ð$à Œ<Ð Øœ>Ô2ˆDŒLˆLˆLð Ð rcól—| |j¦«}| ¦«D]R\}}t|t¦«rd d„|D¦«¦«}| |d|z¦«ŒS|jD]*}| |  |¦«¦«Œ+|S)Nú c3ó6K—|]}t|›¦«V—ŒdSr©Ú serial_escape©r§Úvs rr¨z$Element._dom_node..#s,èè€Ð KÐ KÀ¥°q°qÑ!;Ô!;Ð KÐ KÐ KÐ KÐ KÐ Krz%s) Ú createElementr—ÚattlistrIrUr€Ú setAttributer>Ú appendChildr)r rÚelementÚ attributerr3s rrzElement._dom_nodes¼€Ø×'Ò'¨¬ Ñ5Ô5ˆØ $§ ¢ ¡¤ð :ð :Ñ ˆI�uݘ%¥Ñ&Ô&ð LØŸšÐ KÐ KÀUÐ KÑ KÔ KÑKÔK�Ø × Ò  ¨D°5©LÑ 9Ô 9Ð 9Ð 9Ø”]ð :ð :ˆEØ × Ò  §¢°Ñ 8Ô 8Ñ 9Ô 9Ð 9Ð 9؈rcó —d}|jD];}|| ¦«z }t|¦«dkr|dd…dz}nŒ<|dr/d|jj›dd |d¦«›d |›d �Sd|jj›d |›d �S) Nr~é<é8r“r¼r”ú "ú; z": r–r•)r>r™rdr8r9r€)r rŽÚcs rrœzElement.__repr__)sŀ؈ؔð ð ˆAØ �A—K’K‘M”MÑ !ˆDÝ�4‰yŒy˜2Š~ˆ~ؘC˜R˜C”y 6Ñ)�Ø�ðð �Œ=ð @ð @Ø&*¤nÔ&=Ð&=Ð&=Ø&*§i¢i°°W´ Ñ&>Ô&>Ð&>Ð&>ÀÀÀðFð Fð @ð"&¤Ô!8Ð!8Ð!8¸$¸$¸$Ð?Ð ?rcó~—|dr,d|jj›dd |d¦«›d�Sd|jzS)Nr¼r”rÖr×z"...>z<%s...>)r8r9r€r—r s rr™zElement.shortrepr6sS€Ø �Œ=ð ,ð ,Ø%)¤^Ô%<Ð%<Ð%<Ø%)§Y¢Y¨t°G¬}Ñ%=Ô%=Ð%=Ð%=ð?ð ?ð˜tœ|Ñ+Ð +rcóÔ—|jrN| ¦«›d d„|jD¦«¦«›| ¦«›�S| ¦«S)Nr~c3ó4K—|]}t|¦«V—ŒdSr)rŒ)r§rØs rr¨z"Element.__str__..@s(èè€Ð&EÐ&E°!¥s¨1¡v¤vÐ&EÐ&EÐ&EÐ&EÐ&EÐ&Er)r>Ústarttagr€ÚendtagÚemptytagr s rÚ__str__zElement.__str__=sc€Ø Œ=ð #Ø#Ÿ}š}™œ˜Ø!ŸwšwÐ&EÐ&E°t´}Ð&EÑ&EÔ&EÑEÔEÐEØ#Ÿ{š{™}œ}˜}ð.ð .ð—=’=‘?”?Ð "rcó”—|€t}|jg}| ¦«D]‹\}}|€| d|z¦«Œ t |t ¦«r"d„|D¦«}d |¦«}nt|¦«}||¦«}| |›d|›�¦«ŒŒdd |¦«zS)Nz %s="True"có.—g|]}t|›¦«‘ŒSrrÉrËs rr«z$Element.starttag..Os"€ÐDÐDÐD¸�-°°Ñ4Ô4ÐDÐDÐDrrÇú=z<%s>)Úpseudo_quoteattrr—rÎÚappendrIrUr€rŒ)r Ú quoteattrÚpartsÚnamerÚvaluess rrÜzElement.starttagEs×€à Ð Ý(ˆIØ”�ˆØŸ<š<™>œ>ð 2ð 2‰KˆD�%؈}Ø— ’ ˜[¨4Ñ/Ñ0Ô0Ð0ØÝ˜%¥Ñ&Ô&ð #ØDÐD¸eÐDÑDÔD�ØŸš Ñ(Ô(��å˜E™ œ �Ø�I˜eÑ$Ô$ˆEØ �LŠL D D D¨%¨%Ð0Ñ 1Ô 1Ð 1Ð 1ؘŸš ™œÑ'Ð'rcó—d|jzS)Nz)r—r s rrÝzElement.endtagWs€Ø˜œÑ%Ð%rcó€—d„| ¦«D¦«}dd |jg|¢R¦«zS)Nc3ó,K—|]\}}|›d|›d�V—ŒdS)z="ú"Nr)r§ÚnrÌs rr¨z#Element.emptytag..[s3èè€ÐDÐD©T¨Q° 1 1 1 a a aÐ(ÐDÐDÐDÐDÐDÐDrz<%s/>rÇ)rÎr€r—)r rÁs rrÞzElement.emptytagZsA€ØDÐD°T·\²\±^´^ÐDÑDÔDˆ ؘŸš 4¤<Ð"=°*Ð"=Ð"=Ñ>Ô>Ñ>Ð>rcó*—t|j¦«Sr)rdr>r s rÚ__len__zElement.__len__^s€Ý�4”=Ñ!Ô!Ð!rcóP—t|t¦«r ||jvS||jvSr)rIrŒrÁr>©r Úkeys rÚ __contains__zElement.__contains__as.€å �c�3Ñ Ô ð *ؘ$œ/Ð)Ð )Ø�d”mÐ#Ð#rcó*—t|t¦«r |j|St|t¦«r |j|St|t ¦«r,|jdvs Jd¦«‚|j|j|j…Std¦«‚©N©Nrbúcannot handle slice with stridezFelement index must be an integer, a slice, or an attribute name string© rIrŒrÁÚintr>ÚsliceÚstepÚstartrCr‹rñs rÚ __getitem__zElement.__getitem__gs›€Ý �c�3Ñ Ô ð 8Ø”? 3Ô'Ð 'Ý ˜�SÑ !Ô !ð 8Ø”= Ô%Ð %Ý ˜�UÑ #Ô #ð 8Ø”8˜yÐ(Ð(Ð(Ð*KÑ(Ô(Ð(Ø”= ¤¨3¬8Ð!3Ô4Ð 4åð7ñ8ô8ð 8rcóœ—t|t¦«r||jt|¦«<dSt|t¦«r!| |¦«||j|<dSt|t ¦«rE|jdvs Jd¦«‚|D]}| |¦«Œ||j|j|j …<dStd¦«‚rõ) rIrŒrÁrùr4r>rúrûrürCr‹)r ròÚitemr`s rÚ __setitem__zElement.__setitem__ssê€Ý �c�3Ñ Ô ð 8Ø(,ˆDŒO�C ™HœHÑ %Ð %Ð %Ý ˜�SÑ !Ô !ð 8Ø × Ò ˜TÑ "Ô "Ð "Ø!%ˆDŒM˜#Ñ Ð Ð Ý ˜�UÑ #Ô #ð 8Ø”8˜yÐ(Ð(Ð(Ð*KÑ(Ô(Ð(Øð 'ð '�Ø× Ò  Ñ&Ô&Ð&Ð&Ø04ˆDŒM˜#œ) C¤HÐ,Ñ -Ð -Ð -åð7ñ8ô8ð 8rcó—t|t¦«r |j|=dSt|t¦«r |j|=dSt|t ¦«r)|jdvs Jd¦«‚|j|j|j…=dStd¦«‚)Nrör÷zMelement index must be an integer, a simple slice, or an attribute name stringrørñs rÚ __delitem__zElement.__delitem__‚s«€Ý �c�3Ñ Ô ð BØ” Ð$Ð$Ð$Ý ˜�SÑ !Ô !ð BØ” ˜cÐ"Ð"Ð"Ý ˜�UÑ #Ô #ð BØ”8˜yÐ(Ð(Ð(Ð*KÑ(Ô(Ð(Ø” ˜cœi¨¬Ð0Ð1Ð1Ð1åðAñBôBð Brcó—|j|zSr©r>©r Úothers rÚ__add__zElement.__add__Žs€ØŒ}˜uÑ$Ð$rcó—||jzSrrrs rÚ__radd__zElement.__radd__‘s€Ø�t”}Ñ$Ð$rcóŠ—t|t¦«r| |¦«n|�| |¦«|S)z4Append a node or a list of nodes to `self.children`.)rIrrärÀrs rÚ__iadd__zElement.__iadd__”sF€å �e�TÑ "Ô "ð Ø �KŠK˜Ñ Ô Ð Ð Ø Ð Ø �KŠK˜Ñ Ô Ð Øˆ rcóT—|j d„|jD¦«¦«S)Ncó6—g|]}| ¦«‘ŒSr)r,©r§r3s rr«z"Element.astext..žs €Ð>Ð>Ð> u�E—L’L‘N”NÐ>Ð>Ð>r)Úchild_text_separatorr€r>r s rr,zElement.astextœs3€ØÔ(×-Ò-Ø>Ð>°´ Ð>Ñ>Ô>ñ@ô@ð @rcó|—i}|j ¦«D]\}}| |¦«r|||<Œ |Sr)rÁrÃÚis_not_default)r Úattsròrs rÚnon_default_attributeszElement.non_default_attributes sM€ØˆØœ/×/Ò/Ñ1Ô1ð "ð "‰JˆC�Ø×"Ò" 3Ñ'Ô'ð "Ø!��S‘ øØˆ rcóh—t| ¦« ¦«¦«Sr)ÚsortedrrÃr s rrÎzElement.attlist§s(€Ý�d×1Ò1Ñ3Ô3×9Ò9Ñ;Ô;Ñ<Ô<Ðrä©r rÿs rräzElement.appendÈs2€Ø ×Ò˜ÑÔÐØ Œ ×Ò˜TÑ"Ô"Ð"Ð"Ð"rcó:—|D]}| |¦«ŒdSr©rä)r rÿr`s rrÀzElement.extendÌs0€Øð ð ˆDØ �KŠK˜Ñ Ô Ð Ð ð ð rcóª—t|t¦«r2| |¦«|j ||¦«dS|� ||||…<dSdSr)rIrr4r>Úinsert)r rerÿs rr.zElement.insertÐsh€Ý �d�DÑ !Ô !ð %Ø × Ò ˜TÑ "Ô "Ð "Ø ŒM× Ò  ¨Ñ -Ô -Ð -Ð -Ð -Ø Ð Ø $ˆD��u�Ñ Ð Ð ðÐ réÿÿÿÿcó6—|j |¦«Sr)r>Úpop©r Úis rr1z Element.pop×s€ØŒ}× Ò  Ñ#Ô#Ð#rcó:—|j |¦«dSr)r>Úremover*s rr5zElement.removeÚs€Ø Œ ×Ò˜TÑ"Ô"Ð"Ð"Ð"rrcó:—|j |||¦«Sr)r>re)r rÿrürCs rrez Element.indexÝs€ØŒ}×"Ò" 4¨°Ñ5Ô5Ð5rcóŒ— |j |¦«}n#t$rYdSwxYw|dkr|j|dz ndS)z*Return preceding sibling node or ``None``.Nrrb)r rer r2s rÚprevious_siblingzElement.previous_siblingàs^€ð Ø” ×!Ò! $Ñ'Ô'ˆAˆAøÝð ð ð Ø�4�4ð øøøà#$ q¢5 5ˆtŒ{˜1˜Q™3ÔШdÐ2s ‚� +ª+có4—||gkr ||jvrdSdS)Nrrb©rÂrñs rrzElement.is_not_defaultès&€Ø �Œ9˜Š?ˆ?˜s dÔ&:Ð:Ð:Ø�1à�1rcó¦—t|t¦«r|j}|jD],}| || |g¦«¦«Œ-dS)zŒ Update basic attributes ('ids', 'names', 'classes', 'dupnames', but not 'source') from node or dictionary `dict_`. N)rIrrÁÚbasic_attributesÚappend_attr_listr)r Údict_rÅs rÚupdate_basic_attszElement.update_basic_attsîsa€õ �e�TÑ "Ô "ð %ØÔ$ˆEØÔ(ð ;ð ;ˆCØ × !Ò ! # u§y¢y°°bÑ'9Ô'9Ñ :Ô :Ð :Ð :ð ;ð ;rcóZ—|D]'}|||vr|| |¦«Œ(dS)zÜ For each element in values, if it does not exist in self[attr], append it. NOTE: Requires self[attr] and values to be sequence type and the former should specifically be a list. Nr,)r rrèrs rr=zElement.append_attr_listøsE€ðð )ð )ˆEؘD œJÐ&Ð&Ø�T” ×!Ò! %Ñ(Ô(Ð(øð )ð )rcóÊ—t| |¦«t¦«s ||g||<t|t¦«s|g}| ||¦«dS)a  First, convert both self[attr] and value to a non-string sequence type; if either is not already a sequence, convert it to a list of one element. Then call append_attr_list. NOTE: self[attr] and value both must not be None. N)rIrrUr=)r rrs rÚcoerce_append_attr_listzElement.coerce_append_attr_listsd€õ˜$Ÿ(š( 4™.œ.­$Ñ/Ô/ð &ؘtœ*˜ˆD�‰Jݘ%¥Ñ&Ô&ð Ø�GˆEØ ×Ò˜d EÑ*Ô*Ð*Ð*Ð*rTcóB—|s| |¦«€|||<dSdS)z‚ If self[attr] does not exist or force is True or omitted, set self[attr] to value, otherwise do nothing. N©r)r rrÚforces rÚ replace_attrzElement.replace_attrs0€ð ð �D—H’H˜T‘N”NÐ*؈D�‰JˆJˆJð+Ð*rcód—| |¦«|ur| ||¦«dSdS)a If attr is an attribute of self, set self[attr] to [self[attr], value], otherwise set self[attr] to value. NOTE: replace is not used by this function and is kept only for compatibility with the other copy functions. N)rrB©r rrrs rÚcopy_attr_convertzElement.copy_attr_converts=€ð �8Š8�D‰>Œ> Ð &Ð &Ø × (Ò (¨¨uÑ 5Ô 5Ð 5Ð 5Ð 5ð 'Ð &rcó—| |¦«|urnt| |¦«t¦«st|t¦«r| ||¦«dS| |||¦«dSdS)a— If attr is an attribute of self and either self[attr] or value is a list, convert all non-sequence values to a sequence of 1 element and then concatenate the two sequence, setting the result to self[attr]. If both self[attr] and value are non-sequences and replace is True or self[attr] is None, replace self[attr] with value. Otherwise, do nothing. N)rrIrUrBrFrHs rÚcopy_attr_coercezElement.copy_attr_coerce(s‰€ð �8Š8�D‰>Œ> Ð &Ð &ݘ$Ÿ(š( 4™.œ.­$Ñ/Ô/ð 8ݘ%¥Ñ&Ô&ð 8à×,Ò,¨T°5Ñ9Ô9Ð9Ð9Ð9à×!Ò! $¨¨wÑ7Ô7Ð7Ð7Ð7ð 'Ð &rcó—| |¦«|urnt| |¦«t¦«r-t|t¦«r| ||¦«dS| |||¦«dSdS)aM If attr is an attribute of self and both self[attr] and value are lists, concatenate the two sequences, setting the result to self[attr]. If either self[attr] or value are non-sequences and replace is True or self[attr] is None, replace self[attr] with value. Otherwise, do nothing. N)rrIrUr=rFrHs rÚcopy_attr_concatenatezElement.copy_attr_concatenate8s‰€ð �8Š8�D‰>Œ> Ð &Ð &ݘ$Ÿ(š( 4™.œ.­$Ñ/Ô/ð 8ݘ%¥Ñ&Ô&ð 8à×%Ò% d¨EÑ2Ô2Ð2Ð2Ð2à×!Ò! $¨¨wÑ7Ô7Ð7Ð7Ð7ð 'Ð &rcóf—| |¦«|ur| |||¦«dSdS)zz If replace is True or self[attr] is None, replace self[attr] with value. Otherwise, do nothing. N)rrFrHs rÚcopy_attr_consistentzElement.copy_attr_consistentGs?€ð �8Š8�D‰>Œ> Ð &Ð &Ø × Ò ˜d E¨7Ñ 3Ô 3Ð 3Ð 3Ð 3ð 'Ð &rFcóØ—t|t¦«r|j}|r|j}n|j}| |¦«t ||¦«D]}||||||¦«ŒdS)a. Updates all attributes from node or dictionary `dict_`. Appends the basic attributes ('ids', 'names', 'classes', 'dupnames', but not 'source') and then, for all other attributes in dict_, updates the same attribute in self. When attributes with the same identifier appear in both self and dict_, the two values are merged based on the value of update_fun. Generally, when replace is True, the values in self are replaced or merged with the values in dict_; otherwise, the values in self may be preserved or merged. When and_source is True, the 'source' attribute is included in the copy. NOTE: When replace is False, and self contains a 'source' attribute, 'source' is not replaced even when dict_ has a 'source' attribute, though it may still be merged into a list depending on the value of update_fun. NOTE: It is easier to call the update-specific methods then to pass the update_fun method to this function. N)rIrrÁÚis_not_list_attributeÚis_not_known_attributer?Úfilter)r r>Ú update_funrÚ and_sourceÚ filter_funrÅs rÚupdate_all_attszElement.update_all_attsOs’€õ* �e�TÑ "Ô "ð %ØÔ$ˆEð ð 5ØÔ3ˆJˆJàÔ4ˆJð ×Ò˜uÑ%Ô%Ð%õ˜* eÑ,Ô,ð 7ð 7ˆCØ ˆJ�t˜S %¨¤*¨gÑ 6Ô 6Ð 6Ð 6ð 7ð 7rcóJ—| |tj||¦«dS)aC Updates all attributes from node or dictionary `dict_`. Appends the basic attributes ('ids', 'names', 'classes', 'dupnames', but not 'source') and then, for all other attributes in dict_, updates the same attribute in self. When attributes with the same identifier appear in both self and dict_ and replace is True, the values in self are replaced with the values in dict_; otherwise, the values in self are preserved. When and_source is True, the 'source' attribute is included in the copy. NOTE: When replace is False, and self contains a 'source' attribute, 'source' is not replaced even when dict_ has a 'source' attribute, though it may still be merged into a list depending on the value of update_fun. N)rWr¹rO©r r>rrUs rÚupdate_all_atts_consistantlyz$Element.update_all_atts_consistantlyus2€ð$ ×Ò˜U¥GÔ$@À'Ø'ñ )ô )ð )ð )ð )rcóJ—| |tj||¦«dS)a Updates all attributes from node or dictionary `dict_`. Appends the basic attributes ('ids', 'names', 'classes', 'dupnames', but not 'source') and then, for all other attributes in dict_, updates the same attribute in self. When attributes with the same identifier appear in both self and dict_ whose values aren't each lists and replace is True, the values in self are replaced with the values in dict_; if the values from self and dict_ for the given identifier are both of list type, then the two lists are concatenated and the result stored in self; otherwise, the values in self are preserved. When and_source is True, the 'source' attribute is included in the copy. NOTE: When replace is False, and self contains a 'source' attribute, 'source' is not replaced even when dict_ has a 'source' attribute, though it may still be merged into a list depending on the value of update_fun. N)rWr¹rMrYs rÚupdate_all_atts_concatenatingz%Element.update_all_atts_concatenatingŠs2€ð* ×Ò˜U¥GÔ$AÀ7Ø'ñ )ô )ð )ð )ð )rcóJ—| |tj||¦«dS)a[ Updates all attributes from node or dictionary `dict_`. Appends the basic attributes ('ids', 'names', 'classes', 'dupnames', but not 'source') and then, for all other attributes in dict_, updates the same attribute in self. When attributes with the same identifier appear in both self and dict_ whose values are both not lists and replace is True, the values in self are replaced with the values in dict_; if either of the values from self and dict_ for the given identifier are of list type, then first any non-lists are converted to 1-element lists and then the two lists are concatenated and the result stored in self; otherwise, the values in self are preserved. When and_source is True, the 'source' attribute is included in the copy. NOTE: When replace is False, and self contains a 'source' attribute, 'source' is not replaced even when dict_ has a 'source' attribute, though it may still be merged into a list depending on the value of update_fun. N)rWr¹rKrYs rÚupdate_all_atts_coercionz Element.update_all_atts_coercion¢s2€ð, ×Ò˜U¥GÔ$<¸gØ'ñ )ô )ð )ð )ð )rcóJ—| |tj|¬¦«dS)a} Updates all attributes from node or dictionary `dict_`. Appends the basic attributes ('ids', 'names', 'classes', 'dupnames', but not 'source') and then, for all other attributes in dict_, updates the same attribute in self. When attributes with the same identifier appear in both self and dict_ then first any non-lists are converted to 1-element lists and then the two lists are concatenated and the result stored in self; otherwise, the values in self are preserved. When and_source is True, the 'source' attribute is included in the copy. NOTE: When replace is False, and self contains a 'source' attribute, 'source' is not replaced even when dict_ has a 'source' attribute, though it may still be merged into a list depending on the value of update_fun. )rUN)rWr¹rI)r r>rUs rÚupdate_all_atts_convertzElement.update_all_atts_convert»s5€ð$ ×Ò˜U¥GÔ$=Ø(2ð ñ 4ô 4ð 4ð 4ð 4rcó—g|_dSrrr s rÚclearz Element.clearÐs €ØˆŒ ˆ ˆ rcó®—| |¦«}t|t¦«r| |¦«|||<dS|� ||||dz…<dSdS)z8Replace one child `Node` with another child or children.Nrb)rerIrr4)r ÚoldÚnewres rrzElement.replaceÓsh€à— ’ ˜3‘”ˆÝ �c�4Ñ Ô ð &Ø × Ò ˜SÑ !Ô !Ð !؈D�‰KˆKˆKØ ˆ_Ø"%ˆD��u˜Q‘w�Ñ Ð Ð ðˆ_rcóH—|}t|t¦«s |d}n#t$rd}YnwxYwt|t¦«r| |¦«n(|jD] }||rJd|›d||›�¦«‚Œ!|j ||¦«dS)zc Replace `self` node with `new`, where `new` is a node or a list of nodes. rNzLosing "z " attribute: )rIrÚ IndexErrorr¹r?r<r r)r reÚupdaterÅs rÚ replace_selfzElement.replace_selfÜsì€ð ˆÝ˜#�tÑ$Ô$ð ð Ø˜Qœ��øÝð ð ð Ø���ð øøøå �f�gÑ &Ô &ð FØ × $Ò $ TÑ *Ô *Ð *Ð *ðÔ,ð Fð F�Ø œ9ðFðFðFØ69°c°c¸4À¼9¸9ÐEñFôF�}ðFà Œ ×Ò˜D #Ñ&Ô&Ð&Ð&Ð&s ™"¢ 1°1cóÔ—t|t¦«s|f}t|tt |¦«|¦«¦«D]#}|D]}t|||¦«r|ccSŒŒ$dS)aM Return the index of the first child whose class exactly matches. Parameters: - `childclass`: A `Node` subclass to search for, or a tuple of `Node` classes. If a tuple, any of the classes may match. - `start`: Initial index to check. - `end`: Initial index to *not* check. N)rIÚtupleÚrangeÚminrd©r Ú childclassrüÚendrerØs rÚfirst_child_matching_classz"Element.first_child_matching_classòs‰€õ˜*¥eÑ,Ô,ð 'Ø$˜ˆJݘ5¥#¥c¨$¡i¤i°Ñ"5Ô"5Ñ6Ô6ð !ð !ˆEØð !ð !�ݘd 5œk¨1Ñ-Ô-ð!Ø �L�L�L�L�Lð!ð !ðˆtrcóÞ—t|t¦«s|f}t|tt |¦«|¦«¦«D](}|D]}t|j||¦«rnŒ |cSŒ)dS)aI Return the index of the first child whose class does *not* match. Parameters: - `childclass`: A `Node` subclass to skip, or a tuple of `Node` classes. If a tuple, none of the classes may match. - `start`: Initial index to check. - `end`: Initial index to *not* check. N)rIrkrlrmrdr>rns rÚfirst_child_not_matching_classz&Element.first_child_not_matching_classs�€õ˜*¥eÑ,Ô,ð 'Ø$˜ˆJݘ5¥#¥c¨$¡i¤i°Ñ"5Ô"5Ñ6Ô6ð ð ˆEØð ð �ݘdœm¨EÔ2°AÑ6Ô6ðØ�Eðð� � � ððˆtrrc󘇇—‰‰z›| ¦«›d�}ˆˆfd„|jD¦«}d |g|¢R¦«S)Nr©c3óJ•K—|]}| ‰‰dz¦«V—ŒdSr¤)r%)r§rØr#r$s €€rr¨z"Element.pformat..s5øèè€ÐGÐG°A�Q—Y’Y˜v u¨Q¡wÑ/Ô/ÐGÐGÐGÐGÐGÐGrr~)rÜr>r€)r r#r$ÚtaglineÚ childrepss `` rr%zElement.pformats[øø€Ø$ U™l˜l¨D¯MªM©O¬O¨O¨OÐ<ˆØGÐGÐGÐGÐG¸¼ÐGÑGÔGˆ Ø�wŠw˜Ð, )Ð,Ð,Ñ-Ô-Ð-rcó€—|jdd|ji|j¤Ž}|j|_|j|_|j|_|S)Nr�r)r8r�rÁrr.r0©r Úobjs rr'z Element.copy sB€ØˆdŒnÐIÐI t¤~ÐI¸¼ÐIÐIˆØœˆŒ Ø”[ˆŒ Ø”9ˆŒØˆ rcóv—| ¦«}| d„|jD¦«¦«|S)Ncó6—g|]}| ¦«‘ŒSr)r*rs rr«z$Element.deepcopy..)s"€ÐAÐAÐA¨%�U—^’^Ñ%Ô%ÐAÐAÐAr)r'rÀr>)r r's rr*zElement.deepcopy's7€Ø�yŠy‰{Œ{ˆØ � Š ÐAÐA°4´=ÐAÑAÔAÑBÔBÐB؈ rcó¤—tjdtd¬¦«d|vsJ‚|d | ¦«¦«dS)z+Add a new class to the "classes" attribute.z•docutils.nodes.Element.set_class() is deprecated; and will be removed in Docutils 0.21 or later.Append to Element['classes'] list attribute directlyrOrPrÇr»N)rRrSrträrÄ©r rçs rÚ set_classzElement.set_class,s]€åŒ ðMõ)°Qð 8ñ 8ô 8ð 8ð˜$ˆˆˆˆØ ˆYŒ×Ò˜tŸzšz™|œ|Ñ,Ô,Ð,Ð,Ð,rcóÜ—d|_t|di¦« |¦«}t|di¦« |¦«}|r |€J‚d|_|r |€J‚d|_dSdS)zQNote that this Element has been referenced by its name `name` or id `id`.rbÚexpect_referenced_by_nameÚexpect_referenced_by_idN)Ú referencedÚgetattrr)r rçÚidÚby_nameÚby_ids rÚnote_referenced_byzElement.note_referenced_by5s’€ðˆŒõ ˜$Ð ;¸RÑ@Ô@×DÒDÀTÑJÔJˆÝ˜Ð7¸Ñ<Ô<×@Ò@ÀÑDÔDˆØ ð #ØÐ#Ð#Ð#Ø!"ˆGÔ Ø ð !Ø�>�>�>Ø ˆEÔ Ð Ð ð !ð !rcó—||jvS)z‹ Returns True if and only if the given attribute is NOT one of the basic list attributes defined for all Elements. r:©rKrs rrQzElement.is_not_list_attributeFs€ð ˜3Ô.Ð.Ð.rcó—||jvS)zj Returns True if and only if the given attribute is NOT recognized by this class. )Úknown_attributesrŠs rrRzElement.is_not_known_attributeNs€ð ˜3Ô/Ð/Ð/r)r~r)r/)T)TF)Frk©NN)Gr9rlrmrnr<Úlocal_attributesrÂrŒr—rrvrrœr™rßrÜrÝrÞrïrórýrrrr r r,rrÎrrr r"Úhas_keyr(rärÀr.r1r5ÚsysÚmaxsizerer8rr?r=rBrFrIrKrMrOrWrZr\r^r`rbrrirqrsr%r'r*rrˆÚ classmethodrQrRrrrr¹r¹·sŽ€€€€€ð-ð-ð^?ÐðCð%ÐðKð 'Ð)9Ñ9€Oðð'¨Ñ4ÐØGà€Gð+ð"ÐØ?ð3ð3ð3ð3ð<ððð @ð @ð @ð,ð,ð,ð#ð#ð#ð(ð(ð(ð(ð$&ð&ð&ð?ð?ð?ð"ð"ð"ð$ð$ð$ð 8ð 8ð 8ð 8ð 8ð 8ð Bð Bð Bð%ð%ð%ð%ð%ð%ðððð@ð@ð@ðððð=ð=ð=ð1ð1ð1ð1ð'ð'ð'ð&ð&ð&ð8ð8ð8ð8ð€Gð ð ð ð ð#ð#ð#ðððð%ð%ð%ð$ð$ð$ð$ð#ð#ð#ð!"¨¬ ð6ð6ð6ð6ð3ð3ð3ðððð ;ð;ð;ð )ð )ð )ð +ð +ð +ððððð 6ð 6ð 6ð 6ð8ð8ð8ð 8ð 8ð 8ð4ð4ð4ð1EØ $°ð$7ð$7ð$7ð$7ðL;?Ø05ð)ð)ð)ð)ð*<@Ø16ð)ð)ð)ð)ð07;Ø,1ð)ð)ð)ð)ð24ð4ð4ð4ð*ððð&ð&ð&ð'ð'ð'ð,<=À#Ä+ððððð&@AØ+.¬;ððððð,.ð.ð.ð.ð ðððððð -ð-ð-ð!ð!ð!ð!ð"ð/ð/ñ„[ð/ðð0ð0ñ„[ð0ð0ð0rr¹có —eZdZdZdZ dd„ZdS)Ú TextElementaé An element which directly contains text. Its children are all `Text` or `Inline` subclass nodes. You can check whether an element's context is inline simply by checking whether its immediate parent is a `TextElement` instance (including subclasses). This is handy for nodes like `image` that can appear both inline and as standalone body elements. If passing children to `__init__()`, make sure to set `text` to ``''`` or some other suitable value. r~cóŽ—|dkr(t|¦«}tj|||g|¢Ri|¤ŽdStj||g|¢Ri|¤ŽdS©Nr~)rˆr¹rv)r r�r‚r>rÁÚtextnodes rrvzTextElement.__init__is€Ø �2Š:ˆ:ݘD‘z”zˆHÝ Ô ˜T 9¨hð +¸ð +ð +ð +Ø)ð +ð +ð +ð +ð +õ Ô ˜T 9Ð F¨xÐ FÐ FÐ F¸:Ð FÐ FÐ FÐ FÐ FrN©r~r~)r9rlrmrnrrvrrrr”r”WsC€€€€€ð ð ðÐØ?ðGðGðGðGðGðGrr”có—eZdZdZdd„ZdS)ÚFixedTextElementz5An element which directly contains preformatted text.r~cóH—tj|||g|¢Ri|¤Žd|jd<dS)NÚpreservez xml:space)r”rvrÁ)r r�r‚r>rÁs rrvzFixedTextElement.__init__vs9€ÝÔ˜T 9¨dÐL°XÐLÐLÐLÀÐLÐLÐLØ'1ˆŒ˜ Ñ$Ð$Ð$rNr˜)r9rlrmrnrvrrrršršrs.€€€€€à?Ð?ð2ð2ð2ð2ð2ð2rršcó—eZdZdZdS)Ú ResolvablerN)r9rlrmÚresolvedrrrržržs€€€€€à€H€H€Hrržcó—eZdZd„ZdS)Ú BackLinkablecó<—|d |¦«dS)Nr¾r,)r Úrefids rÚ add_backrefzBackLinkable.add_backref†s!€Ø ˆZÔ×Ò Ñ&Ô&Ð&Ð&Ð&rN)r9rlrmr¤rrrr¡r¡„s#€€€€€ð'ð'ð'ð'ð'rr¡có—eZdZdS)ÚRootN©r9rlrmrrrr¦r¦Žó€€€€€Ø€Drr¦có—eZdZdS)ÚTitularNr§rrrrªrª’r¨rrªcó—eZdZdZdS)ÚPreBibliographicz×2Ò2°3Ñ7Ô7ð Bð˜c™��à" ^Ñ3�Ø—?’? 3Ñ'Ô'ðBØ(.¨s°¨s¬ ¨ Ø(8ð)AÝ+2°4´<Ñ+@Ô+@ð)Að)AðB�Fð Ø” Ð'Ð'Ô'¨1Ñ,Ð'Ð'Ñ'ؘv t¤°vÔ'>Ð?Ñ?�ؘTœXÐ%Ð%Øð  ð ˆUŒ ×Ò˜2ÑÔÐØˆŒ�‰ ؈ rcó¤—t|d¦«D]9}||jvr| |||||¦«Œ%||j|<||j|<Œ:dS)aî `self.nameids` maps names to IDs, while `self.nametypes` maps names to booleans representing hyperlink type (True==explicit, False==implicit). This method updates the mappings. The following state transition table shows how `self.nameids` items ("id") and `self.nametypes` items ("type") change with new input (a call to this method), and what actions are performed ("implicit"-type system messages are INFO/1, and "explicit"-type system messages are ERROR/3): ==== ===== ======== ======== ======= ==== ===== ===== Old State Input Action New State Notes ----------- -------- ----------------- ----------- ----- id type new type sys.msg. dupname id type ==== ===== ======== ======== ======= ==== ===== ===== - - explicit - - new True - - implicit - - new False - False explicit - - new True old False explicit implicit old new True - True explicit explicit new - True old True explicit explicit new,old - True [#]_ - False implicit implicit new - False old False implicit implicit new,old - False - True implicit implicit new - True old True implicit implicit new old True ==== ===== ======== ======== ======= ==== ===== ===== .. [#] Do not clear the name-to-id map or invalidate the old target if both old and new targets are external and refer to identical URIs. The new target is invalidated regardless. r¼N)rkrÓÚset_duplicate_name_idrÔ)r r`r…rùÚexplicitrçs rÚset_name_id_mapzdocument.set_name_id_map}ss€õB˜$˜wœ-Ñ(Ô(ð 0ð 0ˆDØ�t”|Ð#Ð#Ø×*Ò*¨4°°T¸7ÀHÑMÔMÐMÐMð&(�” ˜TÑ"Ø'/�”˜tÑ$Ð$ð  0ð 0rcó®—|j|}|j|}|p||j|<|r½|r‘d}|�S|j|} d|vr"|d} | drd| vr| d| krd}|dkrt| |¦«d|j|<|j |d|z|g|¬¦«} |�|| z }t||¦«ne||j|<|�|j|} t| |¦«n;|�)|s'd|j|<|j|} t| |¦«t||¦«|r|s.|�.|j d|z|g|¬¦«} |�|| z }dSdSdSdS)NrOÚrefurir¼rbz%Duplicate explicit target name: "%s".)r¾Ú base_nodez%Duplicate implicit target name: "%s".)rÓrÔrºÚdupnamer6Úsystem_messageÚinfo) r r`r…rçrùrÚold_idÚ old_explicitr$Úold_noderrûs rrzdocument.set_duplicate_name_id¦sè€Ø”˜dÔ#ˆØ”~ dÔ+ˆ Ø+Ð7¨xˆŒ�tÑØ ð Øð ,Ø�ØÐ%Ø#œx¨Ô/�HØ 4Ð'Ð'Ø!% h¤˜Ø$ WÔ-ð&Ø (¨HÐ 4Ð 4Ø (¨Ô 2°fÒ <Ð <Ø$%˜Eؘq’y�yÝ ¨$Ñ/Ô/Ð/Ø-1˜œ  TÑ*Ø”m×2Ò2ØÐBÀTÑIØ ˜T¨Tð3ñ3ô3�ðÐ&ؘs‘N�Gݘ˜dÑ#Ô#Ð#Ð#à%'�” ˜TÑ"ØÐ%Ø#œx¨Ô/�HݘH dÑ+Ô+Ð+øàÐ!¨,Ð!Ø%)�” ˜TÑ"Øœ8 FÔ+�ݘ $Ñ'Ô'Ð'Ý �D˜$Ñ Ô Ð Øð   ð °Ð1CØ”-×$Ò$Ø7¸$Ñ>ؘ¨ð%ñ/ô/ˆCðÐ"ؘ3‘���ð#Ð"ð  ð Ð1CÐ1Crcó—||jvSr)rÓr~s rÚhas_namezdocument.has_nameÐs€Ø�t”|Ð#Ð#rcód—| ||¦«}| |||d¬¦«dS)NF©r©rþr©r Útargetrùr…s rÚnote_implicit_targetzdocument.note_implicit_targetÔs8€Ø �[Š[˜ Ñ )Ô )ˆØ ×Ò˜V R¨¸5ÐÑAÔAÐAÐAÐArcód—| ||¦«}| |||d¬¦«dS)NTrrrs rÚnote_explicit_targetzdocument.note_explicit_targetØs8€Ø �[Š[˜ Ñ )Ô )ˆØ ×Ò˜V R¨¸4ÐÑ@Ô@Ð@Ð@Ð@rcón—|j |dg¦« |¦«dS©NÚrefname)rÑr"rä©r r`s rÚ note_refnamezdocument.note_refnameÜs2€Ø Œ × Ò   i¤°"Ñ5Ô5×<Ò<¸TÑBÔBÐBÐBÐBrcón—|j |dg¦« |¦«dS)Nr£)rÒr"rärs rÚ note_refidzdocument.note_refidßs2€Ø Œ ×Ò˜t Gœ}¨bÑ1Ô1×8Ò8¸Ñ>Ô>Ð>Ð>Ð>rcóx—|j |¦«|dr| |¦«dSdS)Nr¼)rÎrär©r rs rÚnote_indirect_targetzdocument.note_indirect_targetâsI€Ø Ô×$Ò$ VÑ,Ô,Ð,Ø �'Œ?ð &Ø × Ò ˜fÑ %Ô %Ð %Ð %Ð %ð &ð &rcó0—| |¦«dSr)rþrs rÚnote_anonymous_targetzdocument.note_anonymous_targetçs€Ø � Š �FÑÔÐÐÐrcód—| |¦«|j |¦«dSr)rþr×rä©r Úfootnotes rÚnote_autofootnotezdocument.note_autofootnoteês1€Ø � Š �HÑÔÐØ Ô×!Ò! (Ñ+Ô+Ð+Ð+Ð+rcód—| |¦«|j |¦«dSr)rþrØrä©r Úrefs rÚnote_autofootnote_refzdocument.note_autofootnote_refîs1€Ø � Š �CÑÔÐØ Ô×%Ò% cÑ*Ô*Ð*Ð*Ð*rcód—| |¦«|j |¦«dSr)rþrÙrär#s rÚnote_symbol_footnotezdocument.note_symbol_footnoteòs1€Ø � Š �HÑÔÐØ Ô×$Ò$ XÑ.Ô.Ð.Ð.Ð.rcód—| |¦«|j |¦«dSr)rþrÚrär's rÚnote_symbol_footnote_refz!document.note_symbol_footnote_refös1€Ø � Š �CÑÔÐØ Ô!×(Ò(¨Ñ-Ô-Ð-Ð-Ð-rcód—| |¦«|j |¦«dSr)rþrÛrär#s rÚ note_footnotezdocument.note_footnoteús0€Ø � Š �HÑÔÐØ Œ×Ò˜hÑ'Ô'Ð'Ð'Ð'rcó—| |¦«|j |dg¦« |¦«| |¦«dSr)rþrÕr"rärr's rÚnote_footnote_refzdocument.note_footnote_refþóY€Ø � Š �CÑÔÐØ Ô×%Ò% c¨)¤n°bÑ9Ô9×@Ò@ÀÑEÔEÐEØ ×Ò˜#ÑÔÐÐÐrcó:—|j |¦«dSr)rÜrä)r Úcitations rÚ note_citationzdocument.note_citations€Ø Œ×Ò˜hÑ'Ô'Ð'Ð'Ð'rcó—| |¦«|j |dg¦« |¦«| |¦«dSr)rþrÖr"rärr's rÚnote_citation_refzdocument.note_citation_refr2rcóþ—t|¦«}||jvrC|j d|z|¬¦«}|�||z }|j|}t ||¦«||j|<||jt |¦«<dS)Nz-Duplicate substitution definition name: "%s".)r)Úwhitespace_normalize_namerÏr6ÚerrorrrÐÚfully_normalize_name)r ÚsubdefÚdef_namerùrçrûÚoldnodes rÚnote_substitution_defzdocument.note_substitution_def s›€Ý(¨Ñ2Ô2ˆØ �4Ô)Ð )Ð )Ø”-×%Ò%ØEÈÑLØ &ð&ñ(ô(ˆCðÐ"ؘ3‘�ØÔ,¨TÔ2ˆGÝ �G˜TÑ "Ô "Ð "à'-ˆÔ˜tÑ$à>BˆÔÕ 4°TÑ :Ô :Ñ;Ð;Ð;rcó*—t|¦«|d<dSr)r9)r Úsubrefrs rÚnote_substitution_refzdocument.note_substitution_refs€Ý5°gÑ>Ô>ˆˆyÑÐÐrcó<—|j ||¦«dSr)råÚ add_pending)r ÚpendingÚprioritys rÚ note_pendingzdocument.note_pendings!€Ø Ô×$Ò$ W¨hÑ7Ô7Ð7Ð7Ð7rcó:—|j |¦«dSr)ràrä©r Úmessages rÚnote_parse_messagezdocument.note_parse_message s€Ø Ô×"Ò" 7Ñ+Ô+Ð+Ð+Ð+rcó:—|j |¦«dSr)rárärIs rÚnote_transform_messagezdocument.note_transform_message#s€Ø Ô×&Ò& wÑ/Ô/Ð/Ð/Ð/rcó>—||_|€ ||_dS|dz|_dSrö)r/r1)r r.Úoffsets rÚ note_sourcezdocument.note_source&s/€Ø$ˆÔØ ˆ>Ø &ˆDÔ Ð Ð à &¨¡ ˆDÔ Ð Ð rcór—|j|j|jfi|j¤Ž}|j|_|j|_|Sr)r8r¬r6rÁr.r0rys rr'z document.copy-sC€ØˆdŒn˜Tœ]¨D¬Mð0ð0Ø#œð0ð0ˆà”[ˆŒ Ø”9ˆŒØˆ rcóö—|jslt¦«|_| ttf¦«}|€| |j¦«n| ||j¦«|jSr)rçrsrªÚmetarär.)r res rÚget_decorationzdocument.get_decoration4sh€ØŒð 4Ý(™lœlˆDŒOØ×7Ò7½Å$¸ÑHÔHˆE؈}Ø— ’ ˜DœOÑ,Ô,Ð,Ð,à— ’ ˜E 4¤?Ñ3Ô3Ð3ØŒÐrrr–r�)!r9rlrmrnrvrîrrþrrr rrrrrr!r%r)r+r-r/r1r5r7r?rBrGrKrMrPr'rTrrrr r Ús €€€€€ðððZðZðZðxððððððð+ð+ð+ð+ðZ'0ð'0ð'0ð'0ðR(ð(ð(ðT$ð$ð$ðBðBðBðBðAðAðAðAðCðCðCð?ð?ð?ð&ð&ð&ð ððð,ð,ð,ð+ð+ð+ð/ð/ð/ð.ð.ð.ð(ð(ð(ðððð (ð(ð(ðððð Cð Cð Cð Cð?ð?ð?ð8ð8ð8ð8ð,ð,ð,ð0ð0ð0ð+ð+ð+ððððððððrr có—eZdZdS)ÚtitleNr§rrrrVrVCr¼rrVcó—eZdZdS)ÚsubtitleNr§rrrrXrXDr¼rrXcó—eZdZdS)ÚrubricNr§rrrrZrZEr¼rrZcó—eZdZdZdS)rSz;Container for "invisible" bibliographic data, or meta-data.Nr­rrrrSrSLs€€€€€ØEÐEÐEÐErrScó—eZdZdS)ÚdocinfoNr§rrrr]r]Tr¼rr]có—eZdZdS)ÚauthorNr§rrrr_r_Ur¼rr_có—eZdZdS)ÚauthorsNr§rrrraraVr¼rracó—eZdZdS)Ú organizationNr§rrrrcrcWr¼rrccó—eZdZdS)ÚaddressNr§rrrrereXr¼rrecó—eZdZdS)ÚcontactNr§rrrrgrgYr¼rrgcó—eZdZdS)ÚversionNr§rrrririZr¼rricó—eZdZdS)ÚrevisionNr§rrrrkrk[r¼rrkcó—eZdZdS)ÚstatusNr§rrrrmrm\r¼rrmcó—eZdZdS)ÚdateNr§rrrroro]r¼rrocó—eZdZdS)Ú copyrightNr§rrrrqrq^r¼rrqcó—eZdZd„Zd„ZdS)rçcóÈ—t|j¦«r t|jdt¦«s"| dt¦«¦«|jdS©Nr)rdr>rIÚheaderr.r s rÚ get_headerzdecoration.get_headergsQ€Ý�4”=Ñ!Ô!ð %­°D´MÀ!Ô4DÅfÑ)MÔ)Mð %Ø �KŠK˜�6™8œ8Ñ $Ô $Ð $ØŒ}˜QÔÐrcóÆ—t|j¦«r t|jdt¦«s!| t¦«¦«|jdS)Nr/)rdr>rIÚfooterrär s rÚ get_footerzdecoration.get_footerlsO€Ý�4”=Ñ!Ô!ð "­°D´MÀ"Ô4EÅvÑ)NÔ)Nð "Ø �KŠK�™œÑ !Ô !Ð !ØŒ}˜RÔ Ð rN)r9rlrmrvryrrrrçrçes2€€€€€ð ð ð ð !ð!ð!ð!ð!rrçcó—eZdZdS)ruNr§rrrrururr¼rrucó—eZdZdS)rxNr§rrrrxrxsr¼rrxcó—eZdZdS)ÚsectionNr§rrrr}r}zr¼rr}có—eZdZdZdS)Útopicaü Topics are terminal, "leaf" mini-sections, like block quotes with titles, or textual figures. A topic is just like a section, except that it has no subsections, and it doesn't have to conform to section placement rules. Topics are allowed wherever body elements (list, table, etc.) are allowed, but only at the top level of a section or document. Topics cannot nest inside topics, sidebars, or body elements; you can't have a topic inside a table, list, block quote, etc. Nr­rrrrr}s€€€€€ð ð ð ð rrcó—eZdZdZdS)ÚsidebaraŸ Sidebars are like miniature, parallel documents that occur inside other documents, providing related or reference material. A sidebar is typically offset by a border and "floats" to the side of the page; the document's main text may flow around it. Sidebars can also be likened to super-footnotes; their content is outside of the flow of the document's main text. Sidebars are allowed wherever body elements (list, table, etc.) are allowed, but only at the top level of a section or document. Sidebars cannot nest inside sidebars, topics, or body elements; you can't have a sidebar inside a table, list, block quote, etc. Nr­rrrr�r�‹s€€€€€ð ð ð ð rr�có—eZdZdS)Ú transitionNr§rrrrƒrƒœr¼rrƒcó—eZdZdS)Ú paragraphNr§rrrr…r…£r¼rr…có—eZdZdS)ÚcompoundNr§rrrr‡r‡¤r¼rr‡có—eZdZdS)Ú containerNr§rrrr‰r‰¥r¼rr‰có—eZdZdS)Ú bullet_listNr§rrrr‹r‹¦r¼rr‹có—eZdZdS)Úenumerated_listNr§rrrr�r�§r¼rr�có—eZdZdS)Ú list_itemNr§rrrr�r�¨r¼rr�có—eZdZdS)Údefinition_listNr§rrrr‘r‘©r¼rr‘có—eZdZdS)Údefinition_list_itemNr§rrrr“r“ªr¼rr“có—eZdZdS)ÚtermNr§rrrr•r•«r¼rr•có—eZdZdS)Ú classifierNr§rrrr—r—¬r¼rr—có—eZdZdS)Ú definitionNr§rrrr™r™­r¼rr™có—eZdZdS)Ú field_listNr§rrrr›r›®r¼rr›có—eZdZdS)ÚfieldNr§rrrr�r�¯r¼rr�có—eZdZdS)Ú field_nameNr§rrrrŸrŸ°r¼rrŸcó—eZdZdS)Ú field_bodyNr§rrrr¡r¡±r¼rr¡có—eZdZdZdS)Úoptionr~N©r9rlrmrrrrr£r£´s€€€€€àÐÐÐrr£có—eZdZd„ZdS)Úoption_argumentcód—| dd¦«t |¦«zS)NÚ delimiterrÇ)rr”r,r s rr,zoption_argument.astext»s)€Ø�xŠx˜  SÑ)Ô)­K×,>Ò,>¸tÑ,DÔ,DÑDÐDrN©r9rlrmr,rrrr¦r¦¹s(€€€€€ðEðEðEðEðErr¦có—eZdZdZdS)Ú option_groupz, Nr¤rrrr«r«¿ó€€€€€àÐÐÐrr«có—eZdZdS)Ú option_listNr§rrrr®r®Är¼rr®có—eZdZdZdS)Úoption_list_itemz Nr¤rrrr°r°Çr¬rr°có—eZdZdS)Ú option_stringNr§rrrr²r²Ìr¼rr²có—eZdZdS)Ú descriptionNr§rrrr´r´Ír¼rr´có—eZdZdS)Ú literal_blockNr§rrrr¶r¶Îr¼rr¶có—eZdZdS)Ú doctest_blockNr§rrrr¸r¸Ïr¼rr¸có—eZdZdS)Ú math_blockNr§rrrrºrºÐr¼rrºcó—eZdZdS)Ú line_blockNr§rrrr¼r¼Ñr¼rr¼có—eZdZdZdS)r0N)r9rlrmr#rrrr0r0Ôs€€€€€à €F€F€Frr0có—eZdZdS)Ú block_quoteNr§rrrr¿r¿Ùr¼rr¿có—eZdZdS)Ú attributionNr§rrrrÁrÁÚr¼rrÁcó—eZdZdS)Ú attentionNr§rrrrÃrÃÛr¼rrÃcó—eZdZdS)ÚcautionNr§rrrrÅrÅÜr¼rrÅcó—eZdZdS)ÚdangerNr§rrrrÇrÇÝr¼rrÇcó—eZdZdS)r:Nr§rrrr:r:Þr¼rr:có—eZdZdS)Ú importantNr§rrrrÊrÊßr¼rrÊcó—eZdZdS)ÚnoteNr§rrrrÌrÌàr¼rrÌcó—eZdZdS)ÚtipNr§rrrrÎrÎár¼rrÎcó—eZdZdS)ÚhintNr§rrrrÐrÐâr¼rrÐcó—eZdZdS)ÚwarningNr§rrrrÒrÒãr¼rrÒcó—eZdZdS)Ú admonitionNr§rrrrÔrÔär¼rrÔcó—eZdZdS)ÚcommentNr§rrrrÖrÖår¼rrÖcó—eZdZdS)Úsubstitution_definitionNr§rrrrØrØær¼rrØcó—eZdZdS)rNr§rrrrrçr¼rrcó—eZdZdS)r$Nr§rrrr$r$èr¼rr$có—eZdZdS)r4Nr§rrrr4r4ér¼rr4có—eZdZdS)ÚlabelNr§rrrrÝrÝêr¼rrÝcó—eZdZdS)ÚfigureNr§rrrrßrßër¼rrßcó—eZdZdS)ÚcaptionNr§rrrráráìr¼rrácó—eZdZdS)ÚlegendNr§rrrrãrãír¼rrãcó—eZdZdS)ÚtableNr§rrrråråîr¼rråcó—eZdZdS)ÚtgroupNr§rrrrçrçïr¼rrçcó—eZdZdS)ÚcolspecNr§rrrréréðr¼rrécó—eZdZdS)ÚtheadNr§rrrrërëñr¼rrëcó—eZdZdS)ÚtbodyNr§rrrríríòr¼rrícó—eZdZdS)ÚrowNr§rrrrïrïór¼rrïcó—eZdZdS)ÚentryNr§rrrrñrñôr¼rrñcó —eZdZdZdd„Zd„ZdS)rz‘ System message element. Do not instantiate this class directly; use ``document.reporter.info/warning/error/severe()`` instead. NcóÀ—| dd¦«}|rtd|¦«}|f|z} tj||g|¢Ri|¤ŽdS#t d|›�¦«‚xYw)Nr�r~zsystem_message: children=)r1r…r¹rvÚprint)r rJr>rÁr�Úps rrvzsystem_message.__init__s†€Ø—N’N ;°Ñ3Ô3ˆ Ø ð 'ݘ"˜gÑ&Ô&ˆAØ�t˜h‘ˆHð Ý Ô ˜T 9Ð F¨xÐ FÐ FÐ F¸:Ð FÐ FÐ FÐ FÐ Føð Ý ˆE°8°8Ð=Ñ >Ô >Ð >Ø øøøs °AÁAc ó¢—| dd¦«}|d›d|›d|d›d|d›d t |¦«›� S) Nr0r~r.ú:z: (rcú/r$z) )rr¹r,)r r0s rr,zsystem_message.astext sX€Ø�xŠx˜ Ñ#Ô#ˆØ&*¨8¤n n n°d°d°d¸DÀ¼L¸L¸LØ&*¨7¤m m mµW·^²^ÀDÑ5IÔ5IÐ5IðKð Krr)r9rlrmrnrvr,rrrrr÷sF€€€€€ððð ð ð ð ðKðKðKðKðKrrcó,—eZdZdZ d d„Zd d„Zd„ZdS) rEaF The "pending" element is used to encapsulate a pending operation: the operation (transform), the point at which to apply it, and any data it requires. Only the pending operation's location within the document is stored in the public document tree (by the "pending" object itself); the operation and its data are stored in the "pending" object's internal instance attributes. For example, say you want a table of contents in your reStructuredText document. The easiest way to specify where to put it is from within the document, with a directive:: .. contents:: But the "contents" directive can't do its work until the entire document has been parsed and possibly transformed to some extent. So the directive code leaves a placeholder behind that will trigger the second phase of its processing, something like this:: + internal attributes Use `document.note_pending()` so that the `docutils.transforms.Transformer` stage of processing can run all pending transforms. Nr~cóT—tj||g|¢Ri|¤Ž||_ |pi|_dSr)r¹rvÚ transformÚdetails)r rûrür�r>rÁs rrvzpending.__init__-sD€åÔ˜˜yÐB¨8ÐBÐBÐB°zÐBÐBÐBà"ˆŒð ð�} "ˆŒ ØIÐIrrrcór‡‡—dd|jj›d|jj›�dg}t|j ¦«¦«}|D�].\}}t |t¦«r_| dd›|›d�¦«|  d„|  ¦«  ¦«D¦«¦«Œz|r•t |t¦«r€t |d t¦«re| dd›|›d�¦«|D]E}|  d „|  ¦«  ¦«D¦«¦«ŒF�Œ| dd›|›d |›�¦«�Œ0t  |‰‰¦«d ˆˆfd „|D¦«¦«zS) Nz.. internal attributes:z .transform: ú.z .details:r~z>7r÷có—g|] }dd›|›�‘Œ S©r~z>9r©r§r0s rr«z#pending.pformat..As9€ð"Lð"Lð"LØ&*ð.0¨R¨R°°Ð"6ð"Lð"Lð"Lrrcó—g|] }dd›|›�‘Œ Srrrs rr«z#pending.pformat..Hs9€ð&Lð&Lð&LØ*.ð24°°°T°TÐ&:ð&Lð&Lð&Lrr•c3ó.•K—|]}d‰‰z›|›d�V—ŒdS)rr©Nrr¦s €€rr¨z"pending.pformat..MsHøèè€ð1ð1Ø"˜dð,2°E©>¨>¸4¸4¸4Ð@ð1ð1ð1ð1ð1ð1r)rûrlr9rrürÃrIrrärÀr%r®rUr¹r€)r r#r$Ú internalsrüròrrÌs `` rr%zpending.pformat8s5øø€Ø.Ð.Ø15´Ô1JÐ1JÐ1JØ15´Ô1HÐ1HðJà%ð'ˆ õ˜œ×+Ò+Ñ-Ô-Ñ.Ô.ˆØ!ð Añ A‰JˆC�ݘ%¥Ñ&Ô&ð AØ× Ò ¨R¨R¨R°°°Ð!5Ñ6Ô6Ð6Ø× Ò ð"Lð"LØ.3¯mªm©o¬o×.HÒ.HÑ.JÔ.Jð"Lñ"Lô"LñMôMðMðMàð AÝ  ­Ñ-Ô-ð Aå   q¤­4Ñ0Ô0ð Að× Ò ¨R¨R¨R°°°Ð!5Ñ6Ô6Ð6ØðMðM�AØ×$Ò$ð&Lð&LØ23·)²)±+´+×2HÒ2HÑ2JÔ2Jð&Lñ&Lô&LñMôMðMðMñMð× Ò °°°°C°C°C¸¸Ð!?Ñ@Ô@Ð@Ñ@Ý—’  f¨eÑ4Ô4Ø—'’'ð1ð1ð1ð1ð1Ø&/ð1ñ1ô1ñ1ô1ñ1ð 2rcó–—|j|j|j|jfi|j¤Ž}|j|_|j|_|j|_|Sr)r8rûrür�rÁrr.r0rys rr'z pending.copyPsP€ØˆdŒn˜Tœ^¨T¬\¸4¼>ð0ð0Ø#œð0ð0ˆàœˆŒ Ø”[ˆŒ Ø”9ˆŒØˆ rr–rk)r9rlrmrnrvr%r'rrrrErEsa€€€€€ððð4+/Øð Jð Jð Jð Jð2ð2ð2ð2ð0ððððrrEcó—eZdZdZdS)Úrawz@ Raw data that is to be passed untouched to the Writer. Nr­rrrrrYs€€€€€ððððrrcó—eZdZdS)ÚemphasisNr§rrrr r dr¼rr có—eZdZdS)ÚstrongNr§rrrr r er¼rr có—eZdZdS)ÚliteralNr§rrrr r fr¼rr có—eZdZdS)Ú referenceNr§rrrrrgr¼rrcó—eZdZdS)Úfootnote_referenceNr§rrrrrhr¼rrcó—eZdZdS)Úcitation_referenceNr§rrrrrir¼rrcó—eZdZdS)Úsubstitution_referenceNr§rrrrrjr¼rrcó—eZdZdS)Útitle_referenceNr§rrrrrkr¼rrcó—eZdZdS)Ú abbreviationNr§rrrrrlr¼rrcó—eZdZdS)ÚacronymNr§rrrrrmr¼rrcó—eZdZdS)Ú superscriptNr§rrrrrnr¼rrcó—eZdZdS)Ú subscriptNr§rrrrror¼rrcó—eZdZdS)ÚmathNr§rrrr!r!pr¼rr!có—eZdZd„ZdS)Úimagecó.—| dd¦«S)NÚaltr~rDr s rr,z image.astextus€Ø�xŠx˜˜rÑ"Ô"Ð"rNr©rrrr#r#ss#€€€€€ð#ð#ð#ð#ð#rr#có—eZdZdS)ÚinlineNr§rrrr'r'yr¼rr'có—eZdZdS)Ú problematicNr§rrrr)r)zr¼rr)có—eZdZdS)Ú generatedNr§rrrr+r+{r¼rr+aA Text abbreviation acronym address admonition attention attribution author authors block_quote bullet_list caption caution citation citation_reference classifier colspec comment compound contact container copyright danger date decoration definition definition_list definition_list_item description docinfo doctest_block document emphasis entry enumerated_list error field field_body field_list field_name figure footer footnote footnote_reference generated header hint image important inline label legend line line_block list_item literal literal_block math math_block meta note option option_argument option_group option_list option_list_item option_string organization paragraph pending problematic raw reference revision row rubric section sidebar status strong subscript substitution_definition substitution_reference subtitle superscript system_message table target tbody term tgroup thead tip title title_reference topic transition version warningcó6—eZdZdZdZ d„Zd„Zd„Zd„Zd„Z dS) Ú NodeVisitora² "Visitor" pattern [GoF95]_ abstract superclass implementation for document tree traversals. Each node class has corresponding methods, doing nothing by default; override individual methods for specific and useful behaviour. The `dispatch_visit()` method is called by `Node.walk()` upon entering a node. `Node.walkabout()` also calls the `dispatch_departure()` method before exiting a node. The dispatch methods call "``visit_`` + node class name" or "``depart_`` + node class name", resp. This is a base class for visitors whose ``visit_...`` & ``depart_...`` methods must be implemented for *all* compulsory node types encountered (such as for `docutils.writers.Writer` subclasses). Unimplemented methods will raise exceptions (except for optional nodes). For sparse traversals, where only certain node types are of interest, use subclass `SparseNodeVisitor` instead. When (mostly or entirely) uniform processing is desired, subclass `GenericNodeVisitor`. .. [GoF95] Gamma, Helm, Johnson, Vlissides. *Design Patterns: Elements of Reusable Object-Oriented Software*. Addison-Wesley, Reading, MA, USA, 1995. )rScó—||_dSr)r ©r r s rrvzNodeVisitor.__init__Ès €Ø ˆŒ ˆ ˆ rcó¶—|jj}t|d|z|j¦«}|jj d|j›d|›�¦«||¦«S)zª Call self."``visit_`` + node class name" with `node` as parameter. If the ``visit_...`` method does not exist, call self.unknown_visit. Úvisit_z2docutils.nodes.NodeVisitor.dispatch_visit calling ú for )r8r9r„Ú unknown_visitr r6r7©r r`Ú node_nameÚmethods rr:zNodeVisitor.dispatch_visitËsi€ð ”NÔ+ˆ ݘ˜x¨)Ñ3°TÔ5GÑHÔHˆØ Œ Ô×$Ò$Ð$àŒˆˆ    ð +ñ ,ô ,ð ,ðˆv�d‰|Œ|Ðrcó¶—|jj}t|d|z|j¦«}|jj d|j›d|›�¦«||¦«S)z° Call self."``depart_`` + node class name" with `node` as parameter. If the ``depart_...`` method does not exist, call self.unknown_departure. Údepart_z6docutils.nodes.NodeVisitor.dispatch_departure calling r2)r8r9r„Úunknown_departurer r6r7r4s rrFzNodeVisitor.dispatch_departureØsi€ð ”NÔ+ˆ ݘ˜y¨9Ñ4°dÔ6LÑMÔMˆØ Œ Ô×$Ò$Ð$àŒˆˆ    ð +ñ ,ô ,ð ,ðˆv�d‰|Œ|Ðrcó”—|jjjs|jj|jvr#t |j›d|jj›�¦«‚dS)zk Called when entering unknown `Node` types. Raise an exception unless overridden. z visiting unknown node type: N©r r¬Ústrict_visitorr8r9Úoptionalr"rs rr3zNodeVisitor.unknown_visitåóX€ð ŒMÔ "Ô 1ð =ØŒ~Ô&¨d¬mÐ;Ð;Ý%à”>�>�> 4¤>Ô#:Ð#:ð<ñ=ô=ð =ð<Ð;rcó”—|jjjs|jj|jvr#t |j›d|jj›�¦«‚dS)zi Called before exiting unknown `Node` types. Raise exception unless overridden. z departing unknown node type: Nr;rs rr9zNodeVisitor.unknown_departureñr>rN) r9rlrmrnr=rvr:rFr3r9rrrr-r-¡su€€€€€ððð6€Hðð!ð!ð!ð ð ð ð ð ð ð =ð =ð =ð =ð =ð =ð =ð =rr-có—eZdZdZdS)ÚSparseNodeVisitora Base class for sparse traversals, where only certain node types are of interest. When ``visit_...`` & ``depart_...`` methods should be implemented for *all* node types (such as for `docutils.writers.Writer` subclasses), subclass `NodeVisitor` instead. Nr­rrrrArAþs€€€€€ððððrrAcó—eZdZdZd„Zd„ZdS)ÚGenericNodeVisitora˜ Generic "Visitor" abstract superclass, for simple traversals. Unless overridden, each ``visit_...`` method calls `default_visit()`, and each ``depart_...`` method (when using `Node.walkabout()`) calls `default_departure()`. `default_visit()` (and `default_departure()`) must be overridden in subclasses. Define fully generic visitors by overriding `default_visit()` (and `default_departure()`) only. Define semi-generic visitors by overriding individual ``visit_...()`` (and ``depart_...()``) methods also. `NodeVisitor.unknown_visit()` (`NodeVisitor.unknown_departure()`) should be overridden for default behavior. có—t‚©z)Override for generic, uniform traversals.r!rs rÚ default_visitz GenericNodeVisitor.default_visitr(rcó—t‚rEr!rs rÚdefault_departurez$GenericNodeVisitor.default_departurer(rN)r9rlrmrnrFrHrrrrCrCs<€€€€€ððð "ð"ð"ð"ð"ð"ð"ð"rrCcó0—| |¦«dSr)rFrs rÚ_call_default_visitrJ#s€Ø×Ò�tÑÔÐÐÐrcó0—| |¦«dSr)rHrs rÚ_call_default_departurerL's€Ø×Ò˜4Ñ Ô Ð Ð Ð rcó—dSrrrs rÚ_noprN+s€Ø€Drcó—|D]z}ttd|zt¦«ttd|zt¦«ttd|zt ¦«ttd|zt ¦«Œ{dS)z%Save typing with dynamic assignments:r1r8N)ÚsetattrrCrJrLrArN)r¼Ú_names rÚ_add_node_class_namesrR/s€€àð<ð<ˆÝÕ" H¨uÑ$4Õ6IÑJÔJÐJÝÕ" I°Ñ$5Õ7NÑOÔOÐOÝÕ! 8¨eÑ#3µTÑ:Ô:Ð:ÝÕ! 9¨uÑ#4µdÑ;Ô;Ð;Ð;ð <ðÐr)FF)£rnÚ __docformat__Ú collectionsrÚrer�rRrnrrŒrrrzr†rˆr¹r”ršržr¡r¦rªr¬r¯r±r³rµr·r¹r»r¾rÀrÂrÄrÆrÈrËr rVrXrZrSr]r_rarcrergrirkrmrorqrçrurxr}rr�rƒr…r‡r‰r‹r�r�r‘r“r•r—r™r›r�rŸr¡r£r¦r«r®r°r²r´r¶r¸rºr¼r0r¿rÁrÃrÅrÇr:rÊrÌrÎrÐrÒrÔrÖrØrr$r4rÝrßrárãrårçrérërírïrñrrErr r r rrrrrrrrrr!r#r'r)r+r�Únode_class_namesr-rArCrJrLrNrRrTÚ Exceptionr]r;r@r<r=rerAr÷Úcompilerrrtrmrlrr;r9rÊrãrrrúršs4ðð ðð"#€ àÐÐÐÐÐØ € € € Ø € € € Ø€€€ØÐÐÐð^ð^ð^ð^ð^ñ^ô^ð^ðB ðððð�#ñôðð ð ð ñ ð ð ð ðG7ðG7ðG7ðG7ðG7ˆ4�ñG7ôG7ðG7ðT] 0ð] 0ð] 0ð] 0ð] 0ˆdñ] 0ô] 0ð] 0ð@GðGðGðGðG�'ñGôGðGð62ð2ð2ð2ð2�{ñ2ô2ð2ðððððñôðð 'ð'ð'ð'ð'ñ'ô'ð'ð ð ð ð ð ñ ô ð ð ð ð ð ð ñ ô ð ðGðGðGðGðGñGôGðGð ð ð ð ð ñ ô ð ð ð ð ð ð Ð!ñ ô ð ð ð ð ð ð ñ ô ð ð ð ð ð ð ñ ô ð ð ð ð ð ð ˆdñ ô ð ððððð�ñôððÐÐÐÐ�ÑÔÐð*ð*ð*ð*ð*ˆdñ*ô*ð*ð9ð9ð9ð9ð9Ð ñ9ô9ð9ð ð ð ð ð ñ ô ð ð ð ð ð ð ñ ô ð ð ð ð ð ð �*ñ ô ð ð1ð1ð1ð1ð1�ñ1ô1ð1ð3ð3ð3ð3ð3ñ3ô3ð3ðbðbðbðbðbˆt�Z ñbôbðbðR :Ð9Ð9Ð9Ð9ˆGÐ% {Ñ9Ô9Ð9Ø<Ð<Ð<Ð<Ð<ˆwÐ(¨+Ñ<Ô<Ð<Ø(Ð(Ð(Ð(Ð(ˆW�kÑ(Ô(Ð(ðFðFðFðFðFÐ ˜WñFôFðFð,Ð+Ð+Ð+Ð+ˆm˜WÑ+Ô+Ð+Ø.Ð.Ð.Ð.Ð.ˆ]˜KÑ.Ô.Ð.Ø+Ð+Ð+Ð+Ð+ˆm˜WÑ+Ô+Ð+Ø4Ð4Ð4Ð4Ð4�= +Ñ4Ô4Ð4Ø4Ð4Ð4Ð4Ð4ˆmÐ-Ñ4Ô4Ð4Ø/Ð/Ð/Ð/Ð/ˆm˜[Ñ/Ô/Ð/Ø/Ð/Ð/Ð/Ð/ˆm˜[Ñ/Ô/Ð/Ø0Ð0Ð0Ð0Ð0ˆ}˜kÑ0Ô0Ð0Ø.Ð.Ð.Ð.Ð.ˆ]˜KÑ.Ô.Ð.Ø,Ð,Ð,Ð,Ð,ˆ=˜+Ñ,Ô,Ð,Ø1Ð1Ð1Ð1Ð1� ˜{Ñ1Ô1Ð1ð !ð !ð !ð !ð !�˜Wñ !ô !ð !ð(Ð'Ð'Ð'Ð'ˆZ˜Ñ'Ô'Ð'Ø'Ð'Ð'Ð'Ð'ˆZ˜Ñ'Ô'Ð'ð)Ð(Ð(Ð(Ð(ˆj˜'Ñ(Ô(Ð(ð ð ð ð ð ˆJ˜ñ ô ð ðððððˆj˜'ñôðð",Ð+Ð+Ð+Ð+�˜WÑ+Ô+Ð+ð,Ð+Ð+Ð+Ð+�˜Ñ+Ô+Ð+Ø&Ð&Ð&Ð&Ð&ˆw˜Ñ&Ô&Ð&Ø'Ð'Ð'Ð'Ð'�˜Ñ'Ô'Ð'Ø,Ð,Ð,Ð,Ð,�*˜gÑ,Ô,Ð,Ø0Ð0Ð0Ð0Ð0�j 'Ñ0Ô0Ð0Ø$Ð$Ð$Ð$Ð$��gÑ$Ô$Ð$Ø0Ð0Ð0Ð0Ð0�j 'Ñ0Ô0Ð0Ø/Ð/Ð/Ð/Ð/˜4 Ñ/Ô/Ð/Ø#Ð#Ð#Ð#Ð#ˆ4�Ñ#Ô#Ð#Ø)Ð)Ð)Ð)Ð)��{Ñ)Ô)Ð)Ø%Ð%Ð%Ð%Ð%��wÑ%Ô%Ð%Ø+Ð+Ð+Ð+Ð+�˜WÑ+Ô+Ð+Ø Ð Ð Ð Ð ˆD�'Ñ Ô Ð Ø)Ð)Ð)Ð)Ð)��{Ñ)Ô)Ð)Ø%Ð%Ð%Ð%Ð%��wÑ%Ô%Ð%ðððððˆT�7ñôðð EðEðEðEðE�d˜KñEôEðEð  ð ð ð ð �4˜ñ ô ð ð -Ð,Ð,Ð,Ð,�*˜gÑ,Ô,Ð,ð ð ð ð ð �t˜Wñ ô ð ð -Ð,Ð,Ð,Ð,�D˜+Ñ,Ô,Ð,Ø&Ð&Ð&Ð&Ð&�$˜Ñ&Ô&Ð&Ø4Ð4Ð4Ð4Ð4�GÐ-Ñ4Ô4Ð4Ø4Ð4Ð4Ð4Ð4�GÐ-Ñ4Ô4Ð4Ø1Ð1Ð1Ð1Ð1�Ð*Ñ1Ô1Ð1Ø(Ð(Ð(Ð(Ð(�˜'Ñ(Ô(Ð(ðððððˆ4�ñôðð *Ð)Ð)Ð)Ð)�'˜7Ñ)Ô)Ð)Ø*Ð*Ð*Ð*Ð*�$˜ Ñ*Ô*Ð*Ø*Ð*Ð*Ð*Ð*� ˜GÑ*Ô*Ð*Ø(Ð(Ð(Ð(Ð(ˆj˜'Ñ(Ô(Ð(Ø'Ð'Ð'Ð'Ð'ˆZ˜Ñ'Ô'Ð'Ø&Ð&Ð&Ð&Ð&ˆJ˜Ñ&Ô&Ð&Ø*Ð*Ð*Ð*Ð*� ˜GÑ*Ô*Ð*Ø%Ð%Ð%Ð%Ð%ˆ:�wÑ%Ô%Ð%Ø$Ð$Ð$Ð$Ð$ˆ*�gÑ$Ô$Ð$Ø%Ð%Ð%Ð%Ð%ˆ:�wÑ%Ô%Ð%Ø(Ð(Ð(Ð(Ð(ˆj˜'Ñ(Ô(Ð(Ø+Ð+Ð+Ð+Ð+�˜WÑ+Ô+Ð+Ø9Ð9Ð9Ð9Ð9ˆg�yÐ"2Ñ9Ô9Ð9ØDÐDÐDÐDÐD˜g y°+ÑDÔDÐDØGÐGÐGÐGÐGˆW�i ¨°jÑGÔGÐGØIÐIÐIÐIÐIˆw˜  g¨w¸ ÑIÔIÐIØIÐIÐIÐIÐIˆw˜  g¨w¸ ÑIÔIÐIØ$Ð$Ð$Ð$Ð$ˆD�+Ñ$Ô$Ð$Ø$Ð$Ð$Ð$Ð$ˆW�gÑ$Ô$Ð$Ø&Ð&Ð&Ð&Ð&ˆd�KÑ&Ô&Ð&Ø!Ð!Ð!Ð!Ð!ˆT�7Ñ!Ô!Ð!Ø#Ð#Ð#Ð#Ð#ˆG�WÑ#Ô#Ð#Ø!Ð!Ð!Ð!Ð!ˆT�7Ñ!Ô!Ð!Ø"Ð"Ð"Ð"Ð"ˆd�GÑ"Ô"Ð"Ø Ð Ð Ð Ð ˆD�'Ñ Ô Ð Ø Ð Ð Ð Ð ˆD�'Ñ Ô Ð ØÐÐÐЈ$�ÑÔÐØ Ð Ð Ð Ð ˆD�'Ñ Ô Ð ðKðKðKðKðK�W˜lÐ,<¸gñKôKðKð4EðEðEðEðEˆg�y 'ñEôEðEðPððððˆ'�6Ð+Ð-=ñôðð*Ð)Ð)Ð)Ð)ˆv�{Ñ)Ô)Ð)Ø'Ð'Ð'Ð'Ð'ˆV�[Ñ'Ô'Ð'Ø(Ð(Ð(Ð(Ð(ˆf�kÑ(Ô(Ð(Ø@Ð@Ð@Ð@Ð@�˜ ¨kÑ@Ô@Ð@Ø@Ð@Ð@Ð@Ð@˜ ¨kÑ@Ô@Ð@Ø@Ð@Ð@Ð@Ð@˜ ¨kÑ@Ô@Ð@Ø7Ð7Ð7Ð7Ð7˜V [Ñ7Ô7Ð7Ø0Ð0Ð0Ð0Ð0�f˜kÑ0Ô0Ð0Ø-Ð-Ð-Ð-Ð-�6˜;Ñ-Ô-Ð-Ø(Ð(Ð(Ð(Ð(ˆf�kÑ(Ô(Ð(Ø,Ð,Ð,Ð,Ð,�&˜+Ñ,Ô,Ð,Ø*Ð*Ð*Ð*Ð*�˜ Ñ*Ô*Ð*Ø%Ð%Ð%Ð%Ð%ˆ6�;Ñ%Ô%Ð%ð#ð#ð#ð#ð#ˆG�V˜Wñ#ô#ð#ð (Ð'Ð'Ð'Ð'ˆV�[Ñ'Ô'Ð'Ø,Ð,Ð,Ð,Ð,�&˜+Ñ,Ô,Ð,Ø*Ð*Ð*Ð*Ð*�˜ Ñ*Ô*Ð*ð÷6Šu‰wŒwð7ð87ðZ=ðZ=ðZ=ðZ=ñZ=ñZ=ôZ=ðZ=ðzðñðñ˜ ñôðð"ð"ñ"ð"ñ"˜ñ"ô"ð"ñ6ððñ!ð!ð!ñ ð ð ñ<ð<ð<ðÐÐ&Ñ'Ô'Ð'ð.ð.ñ.ð.ñ.Ð(ñ.ô.ð.ð4ðñðñ˜9ñôðððñðñÐ'ñôðððñðñÐ'ñôðððñðñÐ#ñôðððñðñÐ(ñôðððñðñÐ$ñôðððñðñÐ(ñôðñ-ð-ð-ð`�” ™<Ñ(Ô(€ Ø�"”*™^Ñ,Ô,€ð"Ù ‰Cð"á ‰Cð"ñ ‰Cð"ñ ‰Cð "ñ  ‰Cð "ñ  ‰Cð "ñ ‰Cð"ñ ‰Cð"ñ ‰Cð"ñ ‰Cð"ñ ‰Cð"ñ ‰Cð"ñ ‰Cð"ñ ‰Cð"ñ ‰Cð"ñ  ‰Cð!"ñ" ‰Cð#"ð"ñ$ ‰Cð%"ñ& ‰Cð'"ñ( ‰Cð)"ñ* ‰Cð+"ñ, ‰Cð-"ñ. ‰Cð/"ñ0 ‰Cð1"ñ2 ‰Cð3"ñ4 ‰Cð5"ñ6 ‰Cð7"ñ8 ‰Cð9"ñ: ‰Cð;"ñ< ‰Cð="ñ> ‰Cð?"ñ@ ‰CðA"ñB ‰CðC"ð"ÐñH Ù Ù Ù Ù ñ ðÐñððñ*ð*ð*ñ "ð"ð"ñ :ð:ð:ñ ððððr