m 3Oc@s dZdZdkZdkZdkZdkZdkZdkZdefdYZ ei dfjode fdYZ ne Z de e fd YZ d e fd YZd efd YZdefdYZdfdYZdfdYZdfdYZdfdYZdfdYZdfdYZdefdYZdfdYZd fd!YZd"efd#YZd$efd%YZd&efd'YZd(efd)YZd*efd+YZd,fd-YZd.fd/YZ d0efd1YZ!d2efd3YZ"d4fd5YZ#d6eeefd7YZ$d8eeefd9YZ%d:eeefd;YZ&d<eefd=YZ'd>eefd?YZ(d@eefdAYZ)dBeefdCYZ*dDeefdEYZ+dFeefdGYZ,dHeefdIYZ-dJeefdKYZ.dLeefdMYZ/dNeefdOYZ0dPeefdQYZ1dReefdSYZ2dTeefdUYZ3dVeefdWYZ4dXeefdYYZ5dZeefd[YZ6d\eefd]YZ7d^eefd_YZ8d`eefdaYZ9dbeefdcYZ:ddeefdeYZ;dfeefdgYZ<dheefdiYZ=djeefdkYZ>dleefdmYZ?dneefdoYZ@dpeefdqYZAdreefdsYZBdteefduYZCdveefdwYZDdxeefdyYZEdzeefd{YZFd|eefd}YZGd~eefdYZHdeefdYZIdeefdYZJdeefdYZKdeefdYZLdeefdYZMdeefdYZNdeefdYZOdeefdYZPdeefdYZQdeefdYZRdeefdYZSdeefdYZTdeefdYZUdeefdYZVdeefdYZWdeefdYZXdeefdYZYdeefdYZZdeefdYZ[deefdYZ\deefdYZ]deefdYZ^deefdYZ_deefdYZ`deeefdYZadeeefdYZbdeee ee"fdYZcdeeee#e"fdYZddeeee#e"fdYZedeefdYZfdeefdYZgdeefdYZhdeefdYZideefdYZjdeefdYZkdeefdYZldeefdYZmdeefdYZndeefdYZodeefdYZpdeeeefdYZqdeeefdYZrdee eefdYZsde efdYZtde efdYZude efdYZvdee e!efdYZwde e!efdYZxde e!efdYZyde efdYZzde efdYZ{de efdYZ|de efdYZ}de efdYZ~de efdYZde efdYZdee efdYZde efdYZde efdYZde efdYZdiZdfdYZdefdYZdefdYZdZdZdZdZeedefdYZdefdYZdefdYZd efd YZd efd YZd efdYZdefdYZdefdYZdZeidZeidZhdd<dd<dd<dd<dd<d d!<d"d#<d$d#<d%d&<d'd<d(d)<d*d+<d,d<d-d.<d/d0<d1d!<d2d!<d3d4<d5d6<d7d8<d9d6<d:d<d;d.<d<d!<d=d><d?d&<d@dA<dBd6<dCdD<dEd><dFdG<dHdI<dJd4g}|i|x$|iD]}|i|iqW|S(s:Specialized traverse() that doesn't check for a condition.N(R2R5RR+RR6t _all_traverse(RR2R((RR8s  c Cs|o t}n|oX|oQ| oI|djo|iSqpt |t i t fo|i |Sqpnt |t i t fo|}|d}ng} |o+|djp ||o| i|n|oVt|ioFxC|D]7} | i| idtdtdtdtd|qWn|p|o|}x|iox|ii|}xJ|i|dD]7} | i| idtd|dtdtd|qyW|pPqK|i}qKWn| S( s Return an iterable containing * self (if include_self is true) * all descendants in tree traversal order (if descend is true) * all siblings (if siblings is true) and their descendants (if also descend is true) * the 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 iterable contains 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. For example, given the following tree:: <--- emphasis.traverse() and <--- strong.traverse() are called. Foo Bar Baz Then list(emphasis.traverse()) equals :: [, , <#text: Foo>, <#text: Bar>] and list(strong.traverse(ascend=True)) equals :: [, <#text: Foo>, <#text: Bar>, , <#text: Baz>] cCs t||S(N(R3tnodet node_class(R9R:((Rt conditionst include_selftdescendtsiblingstascendR;iN(R?RR>R<R=R;R RR8R3ttypest ClassTypettypeR7R:trR5tlenR+RR6ttraverseR R9Rtindextsibling( RR;R<R=R>R?R9RFR:RGRCR((RREsF$  !   c CsT|id|d|d|d|d|}y |dSWntj o dSnXdS(s Return the first node in the iterable returned by traverse(), or None if the iterable is empty. Parameter list is the same as of traverse. Note that include_self defaults to 0, though. R;R<R=R>R?iN( RRER;R<R=R>R?titerablet IndexErrorR (RR;R<R=R>R?RH((Rt next_nodes   (i(R&t __module__t__doc__R RRRRRtsyst version_infoR RRRRRR,R0R7R8RR RERJ(((RR#s.       . + Kit reprunicodecBstZdZdZRS(sI A class that removes the initial u from unicode's repr. cCsti|dS(Ni(Rt__repr__R(R((RRP0s(R&RKRLRP(((RRO+s tTextcBstZdZdZfZeidjoedZn edZddZ ddZ d Z d Z d Z d Zd ZdddZedZedZRS(s Instances are terminal nodes (leaves) containing text only; no child nodes or attributes. Initialize by passing a string to the constructor. Access the text itself with the `astext` method. s#texticCs0t|totdnti||S(s7Prevent the rawsource argument from propagating to str.sexpecting str data, not bytesN(R3tdatatbytest TypeErrorROt__new__R4(R4RRt rawsource((RRUDscCsti||S(s7Prevent the rawsource argument from propagating to str.N(RORUR4RR(R4RRRV((RRUJstcCs ||_dS(N(RVR(RRRRV((Rt__init__NsicCsL|}t||jo||d d}nd|itt|fS(Nis ...s<%s: %s>(RRRRDtmaxlenttagnametreprRO(RRYRR((Rt shortreprSscCs|iddS(NRYiD(RR\(R((RRPYscCs|it|S(N(RtcreateTextNodeRR(RR((RR\scCs t|S(N(ROR(R((Rtastext_scCs|it|d|iS(NRV(RR%RORV(R((RRkscCs |iS(N(RR(R((RRnss icCsIg}||}x)|iD]}|i||dqWdi|S(Ns RW(R2RRRt splitlinesRR5tjoin(RRRRR2((RRqs   cCs|iti||S(N(RR%ROtrstriptchars(RRb((RRa}scCs|iti||S(N(RR%ROtlstripRb(RRb((RRcs(i(R&RKRLRZR+RMRNR RURXR\RPRR^RRRRaRc(((RRQ6s"         tElementcBstZdZd5ZeZdZddZd Zd Z d Z d Z e i d6jo e ZnedZdZdZdZdZdZdZdZdZdZdZdZdZdZedZdZdZedZ eZ!eZd Z"d!Z#d"Z$d#d$Z%d%Z&d&Z'd'Z(d(Z)d)Z*d*Z+d+Z,d,e i-d-Z.d,e i-d.Z/d/d,d0Z0d1Z1d2Z2d3Z3eed4Z4RS(7s `Element` is the superclass to all specific elements. Elements contain attributes and child nodes. Elements emulate dictionaries for attributes, indexing by attribute name (a string). To set the attribute 'att' to 'value', do:: element['att'] = 'value' There are two special attributes: 'ids' and 'names'. Both are lists of unique identifiers, and names serve as human interfaces to IDs. Names are case- and whitespace-normalized (see the fully_normalize_name() function), and IDs conform to the regular expression ``[a-z](-?[a-z0-9]+)*`` (see the make_id() function). Elements also emulate lists for child nodes (element nodes and/or text nodes), indexing by integer. To get the first child node, use:: element[0] 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])``. tidstclassestnamestdupnamestbackrefss RWcOs||_g|_|i|h|_x|iD]}g|i|s; s<%s: %s>( RRRR+tcR\RDR%R&R`(RRRR{((RRPs   (cCs?|do%d|iidi|dfSn d|iSdS(NRgs <%s "%s"...>s; s<%s...>(RR%R&R`RZ(R((RR\s %cCsf|ioNd|idig}|iD]}|t|q*~|ifSn |iSdS(Nu%s%s%sRW( RR+tstarttagR`RvR{Rtendtagtemptytag(RRvR{((Rt __unicode__s NicCs|djo t}n|ig}x|iD]\}}|djo|i |q0nt |t oAg}|D]}|td|fqx~}di|}n t|}||}|i d||fq0Wddi|S(Ns%sRpu%s=%su<%s>u (t quoteattrR tpseudo_quoteattrRRZtpartsRstnameRnR5R3RuRvRwRxtvaluesR`R(RRRRnRvRRwR((RR|s      .  cCs d|iS(Ns(RRZ(R((RR} sc CsLddi|igg}|iD]\}}|d||fq#~S(Nu<%s/>u s%s="%s"(R`RRZRvRstnRw(RRvRwR((RR~ scCs t|iS(N(RDRR+(R((Rt__len__scCs.t|to||ijSn||ijS(N(R3tkeyt basestringRRjR+(RR((Rt __contains__scCst|to|i|Snnt|to|i|SnOt|tio2|i djp t d|i|i |i !Sn tddS(Niscannot handle slice with stridesFelement index must be an integer, a slice, or an attribute name string(Ni(R3RRRRjtintR+R@t SliceTypetstepR tAssertionErrortstartR!RT(RR((Rt __getitem__scCst|to||it|xk|dD]_}||ijoI|i||j o5|iid|}|djo||7}qjq q W|dpx|dD]8}|i i t |}|o||ijoPqqWd}xO| p||ijo6|i i |i i t|i}|id7_qW|di|n||i|<|S(NResDuplicate ID: "%s".RgRWi(R9RRReR#tseveretmsgtmsgnodeR RRt id_prefixtmake_idtauto_id_prefixRRR5(RR9RRRR((Rtset_ids( $    # cCs`xY|dD]M}||ijo|i|||||q ||i|<||i||i||ii|dgi||i|dS(NR(RRRRRR5R(RR((Rtnote_footnote_refs  cCs|ii|dS(N(RRR5tcitation(RR$((Rt note_citationscCs>|i||ii|dgi||i|dS(NR(RRRRRR5R(RR((Rtnote_citation_refs  cCst|}||ijoU|iid|d|}|djo||7}n|i|}t ||n||i|<||i t|stauthorscBstZRS(N(R&RK(((RR?st organizationcBstZRS(N(R&RK(((RR@staddresscBstZRS(N(R&RK(((RRAstcontactcBstZRS(N(R&RK(((RRBstversioncBstZRS(N(R&RK(((RRCstrevisioncBstZRS(N(R&RK(((RRDststatuscBstZRS(N(R&RK(((RREstdatecBstZRS(N(R&RK(((RRFst copyrightcBstZRS(N(R&RK(((RRGsRcBstZdZdZRS(NcCsKt|i pt|idt o|idtn|idS(Ni(RDRR+R3theaderR(R((Rt get_headers)cCsHt|i pt|idt o|itn|idS(Ni(RDRR+R3tfooterR5(R((Rt get_footers)(R&RKRIRK(((RRs RHcBstZRS(N(R&RK(((RRHsRJcBstZRS(N(R&RK(((RRJstsectioncBstZRS(N(R&RK(((RRLsttopiccBstZdZRS(s 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. (R&RKRL(((RRMs tsidebarcBstZdZRS(s 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. (R&RKRL(((RRNs t transitioncBstZRS(N(R&RK(((RROst paragraphcBstZRS(N(R&RK(((RRPstcompoundcBstZRS(N(R&RK(((RRQst containercBstZRS(N(R&RK(((RRRst bullet_listcBstZRS(N(R&RK(((RRSstenumerated_listcBstZRS(N(R&RK(((RRTst list_itemcBstZRS(N(R&RK(((RRUstdefinition_listcBstZRS(N(R&RK(((RRV stdefinition_list_itemcBstZRS(N(R&RK(((RRW!sttermcBstZRS(N(R&RK(((RRX"st classifiercBstZRS(N(R&RK(((RRY#st definitioncBstZRS(N(R&RK(((RRZ$st field_listcBstZRS(N(R&RK(((RR[%stfieldcBstZRS(N(R&RK(((RR\&st field_namecBstZRS(N(R&RK(((RR]'st field_bodycBstZRS(N(R&RK(((RR^(stoptioncBstZdZRS(NRW(R&RKR(((RR_+stoption_argumentcBstZdZRS(NcCs|iddti|S(Nt delimiterRp(RRRR^(R((RR^2s(R&RKR^(((RR`0st option_groupcBstZdZRS(Ns, (R&RKR(((RRb6st option_listcBstZRS(N(R&RK(((RRc;stoption_list_itemcBstZdZRS(Ns (R&RKR(((RRd>st option_stringcBstZRS(N(R&RK(((RReCst descriptioncBstZRS(N(R&RK(((RRfDst literal_blockcBstZRS(N(R&RK(((RRgEst doctest_blockcBstZRS(N(R&RK(((RRhFst math_blockcBstZRS(N(R&RK(((RRiGst line_blockcBstZRS(N(R&RK(((RRjHsRcBstZdZRS(N(R&RKR R(((RRKst block_quotecBstZRS(N(R&RK(((RRkPst attributioncBstZRS(N(R&RK(((RRlQst attentioncBstZRS(N(R&RK(((RRmRstcautioncBstZRS(N(R&RK(((RRnSstdangercBstZRS(N(R&RK(((RRoTsR)cBstZRS(N(R&RK(((RR)Ust importantcBstZRS(N(R&RK(((RRpVstnotecBstZRS(N(R&RK(((RRqWsttipcBstZRS(N(R&RK(((RRrXsthintcBstZRS(N(R&RK(((RRsYstwarningcBstZRS(N(R&RK(((RRtZst admonitioncBstZRS(N(R&RK(((RRu[stcommentcBstZRS(N(R&RK(((RRv\stsubstitution_definitioncBstZRS(N(R&RK(((RRw]sRcBstZRS(N(R&RK(((RR^sRcBstZRS(N(R&RK(((RR_sR$cBstZRS(N(R&RK(((RR$`stlabelcBstZRS(N(R&RK(((RRxastfigurecBstZRS(N(R&RK(((RRybstcaptioncBstZRS(N(R&RK(((RRzcstlegendcBstZRS(N(R&RK(((RR{dsttablecBstZRS(N(R&RK(((RR|esttgroupcBstZRS(N(R&RK(((RR}fstcolspeccBstZRS(N(R&RK(((RR~gsttheadcBstZRS(N(R&RK(((RRhsttbodycBstZRS(N(R&RK(((RRistrowcBstZRS(N(R&RK(((RRjstentrycBstZRS(N(R&RK(((RRksRcBs#tZdZedZdZRS(s System message element. Do not instantiate this class directly; use ``document.reporter.info/warning/error/severe()`` instead. cOs^|o td|}|f|}nyti|d||Wnd|fGHnXdS(NRWssystem_message: children=%r(R4RPtpR+RdRXRRj(RR4R+RjR((RRXws cCs>|idd}d|d||d|dti|fS(NRRWu%s:%s: (%s/%s) %sRRBR(RRRRdR^(RR((RR^s(R&RKRLR RXR^(((RRns  R1cBs5tZdZeddZdddZdZRS(sF 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. RWcOs3ti||||||_|ph|_dS(N(RdRXRRVR+Rjt transformtdetails(RRRRVR+Rj((RRXs s ic Csdd|ii|iifdg}|ii}|ix,|D]$\}}t |t oY|i dd|f|i g}|iiD]} |dd| fq~qE|ot |to~t |dt oj|i dd|fxj|D]D}|i g}|iiD]} |dd| fq&~qWqE|i dd||fqEWti|||dig}|D]} |d ||| fq~S( Ns.. internal attributes:s .transform: %s.%ss .details:s%7s%s:RWs%9s%sis %7s%s: %rs %s%s (RRRKR&t internalsRRmRRRnR3RR5R6RvRR_RRuRwRdRRR`( RRRRRnRvRRRwR((RRs%  B+FcCs"|i|i|i|i|iS(N(RR%RRRVRj(R((RRs(R&RKRLR RXRR(((RR1s  trawcBstZdZRS(s@ Raw data that is to be passed untouched to the Writer. (R&RKRL(((RRs temphasiscBstZRS(N(R&RK(((RRststrongcBstZRS(N(R&RK(((RRstliteralcBstZRS(N(R&RK(((RRst referencecBstZRS(N(R&RK(((RRstfootnote_referencecBstZRS(N(R&RK(((RRstcitation_referencecBstZRS(N(R&RK(((RRstsubstitution_referencecBstZRS(N(R&RK(((RRsttitle_referencecBstZRS(N(R&RK(((RRst abbreviationcBstZRS(N(R&RK(((RRstacronymcBstZRS(N(R&RK(((RRst superscriptcBstZRS(N(R&RK(((RRst subscriptcBstZRS(N(R&RK(((RRstmathcBstZRS(N(R&RK(((RRstimagecBstZdZRS(NcCs|iddS(NtaltRW(RR(R((RR^s(R&RKR^(((RRstinlinecBstZRS(N(R&RK(((RRst problematiccBstZRS(N(R&RK(((RRst generatedcBstZRS(N(R&RK(((RRss< 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 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 warningt NodeVisitorcBsAtZdZfZdZdZdZdZdZRS(s "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 should be implemented for *all* node types encountered (such as for `docutils.writers.Writer` subclasses). Unimplemented methods will raise exceptions. For sparse traversals, where only certain node types are of interest, 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. cCs ||_dS(N(RR(RR((RRX=scCsO|ii}t|d||i}|ii i d|i|f||S(s Call self."``visit_`` + node class name" with `node` as parameter. If the ``visit_...`` method does not exist, call self.unknown_visit. tvisit_s;docutils.nodes.NodeVisitor.dispatch_visit calling %s for %sN( R9R%R&t node_nameRRt unknown_visittmethodRR#R$(RR9RR((RR'@s   cCsO|ii}t|d||i}|ii i d|i|f||S(s Call self."``depart_`` + node class name" with `node` as parameter. If the ``depart_...`` method does not exist, call self.unknown_departure. tdepart_s?docutils.nodes.NodeVisitor.dispatch_departure calling %s for %sN( R9R%R&RRRtunknown_departureRRR#R$(RR9RR((RR1Ms   cCsM|iiip|ii|ijo#td|i|iifndS(sk Called when entering unknown `Node` types. Raise an exception unless overridden. s!%s visiting unknown node type: %sN( RRRtstrict_visitorR9R%R&toptionalR(RR9((RRZs&cCsM|iiip|ii|ijo#td|i|iifndS(si Called before exiting unknown `Node` types. Raise exception unless overridden. s"%s departing unknown node type: %sN( RRRRR9R%R&RR(RR9((RRfs&( R&RKRLRRXR'R1RR(((RRs   tSparseNodeVisitorcBstZdZRS(s 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. (R&RKRL(((RRss tGenericNodeVisitorcBs tZdZdZdZRS(s 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. cCs tdS(s)Override for generic, uniform traversals.N(R(RR9((Rt default_visitscCs tdS(s)Override for generic, uniform traversals.N(R(RR9((Rtdefault_departures(R&RKRLRR(((RR}s  cCs|i|dS(N(RRR9(RR9((Rt_call_default_visitscCs|i|dS(N(RRR9(RR9((Rt_call_default_departurescCsdS(N((RR9((Rt_nopscCsex^|D]V}ttd|tttd|tttd|tttd|tqWdS(s%Save typing with dynamic assignments:RRN(Rgt_nametsetattrRRRRR(RgR((Rt_add_node_class_namesstTreeCopyVisitorcBs2tZdZdZdZdZdZRS(sQ Make a complete copy of a tree or branch, including element attributes. cCs&ti||g|_g|_dS(N(RRXRRt parent_stackR(RR((RRXs cCs |idS(Ni(RR(R((Rt get_tree_copyscCs<|i}|ii||ii|i||_dS(s9Copy the current node, and make it the new acting parent.N(R9RtnewnodeRRR5R(RR9R((RRs  cCs|ii|_dS(s#Restore the previous acting parent.N(RRRR(RR9((RRs(R&RKRLRXRRR(((RRs    tTreePruningExceptioncBstZdZRS(s Base class for `NodeVisitor`-related tree pruning exceptions. Raise subclasses from within ``visit_...`` or ``depart_...`` methods called from `Node.walk()` and `Node.walkabout()` tree traversals to prune the tree traversed. (R&RKRL(((RRs R(cBstZdZRS(s Do not visit any children of the current node. The current node's siblings and ``depart_...`` method are not affected. (R&RKRL(((RR(s R-cBstZdZRS(s Do not visit any more siblings (to the right) of the current node. The current node's children and its ``depart_...`` method are not affected. (R&RKRL(((RR-s R)cBstZdZRS(sq Do not visit the current node's children, and do not call the current node's ``depart_...`` method. (R&RKRL(((RR)s R*cBstZdZRS(s Do not call the current node's ``depart_...`` method. The current node's children and siblings are not affected. (R&RKRL(((RR*s t NodeFoundcBstZdZRS(s Raise to indicate that the target of a search has been found. This exception must be caught by the client; it is not caught by the traversal code. (R&RKRL(((RRs R.cBstZdZRS(s= Stop the traversal alltogether. The current node's ``depart_...`` method is not affected. The parent nodes ``depart_...`` methods are also called as usual. No other nodes are visited. This is an alternative to NodeFound that does not cause exception handling to trickle up to the caller. (R&RKRL(((RR.s cCs|i}t|tp|i}n|it}|it}t i d|i ddid}t i ddi|i}ti d|}t|S(s Convert `string` into an identifier and return it. Docutils identifiers will conform to the regular expression ``[a-z](-?[a-z0-9]+)*``. For CSS compatibility, identifiers (the "class" and "id" attributes) should have no underscores, colons, or periods. Hyphens may be used. - The `HTML 4.01 spec`_ defines identifiers based on SGML tokens: ID and NAME tokens must begin with a letter ([A-Za-z]) and may be followed by any number of letters, digits ([0-9]), hyphens ("-"), underscores ("_"), colons (":"), and periods ("."). - However the `CSS1 spec`_ defines identifiers based on the "name" token, a tighter interpretation ("flex" tokenizer notation; "latin1" and "escape" 8-bit characters have been replaced with entities):: unicode \[0-9a-f]{1,4} latin1 [¡-ÿ] escape {unicode}|\[ -~¡-ÿ] nmchar [-a-z0-9]|{latin1}|{escape} name {nmchar}+ The CSS1 "nmchar" rule does not include underscores ("_"), colons (":"), or periods ("."), therefore "class" and "id" attributes should not contain these characters. They should be replaced with hyphens ("-"). Combined with HTML's requirements (the first character must be a letter; no "unicode", "latin1", or "escape" characters), this results in the ``[a-z](-?[a-z0-9]+)*`` pattern. .. _HTML 4.01 spec: http://www.w3.org/TR/html401 .. _CSS1 spec: http://www.w3.org/TR/REC-CSS1 tNFKDtasciitignoret-RpRWN(tstringRoRR3Rtdecodet translatet_non_id_translate_digraphst_non_id_translatet unicodedatat normalizeRt _non_id_charstsubR`tsplitt_non_id_at_endsR(RR((RRs" '!s [^a-z0-9]+s ^[-0-9]+|-+$iuoiudi'uhi1uiiBuligutiubiiuciiufiukiiuniupiiiuyiuziugi%i4i5i6i7uji<i?usi@iGueiIiKuqiMuriOiusziuaeiSuoei8udbi9uqpcCs/|di||di|d|_dS(NRhRgi(R9R5RRR(R9R((RRpscCsdi|iiS(s.Return a case- and whitespace-normalized name.RpN(R`RRoR(R((RR,wscCsdi|iS(s$Return a whitespace-normalized name.RpN(R`RR(R((RR'{scCs|iddiddS(sDEscape string values that are elements of a list, for serialization.s\s\\Rps\ N(RnR(Rn((RRxscCsd|S(sQuote attributes for pseudo-xmls"%s"N(Rn(Rn((RRs(RLt __docformat__RMtostreRR@RtobjectRRNRRORQRdRRRRRRRRRRRRRRRRRRRRRRR:R;R<R=R>R?R@RARBRCRDRERFRGRRHRJRLRMRNRORPRQRRRSRTRURVRWRXRYRZR[R\R]R^R_R`RbRcRdReRfRgRhRiRjRRkRlRmRnRoR)RpRqRrRsRtRuRvRwRRR$RxRyRzR{R|R}R~RRRRRR1RRRRRRRRRRRRRRRRRRRtnode_class_namesRRRRRRRRt ExceptionRR(R-R)R*RR.RtcompileRRRRRR,R'RxR(RWROR~RsRRR<RRNR[RRRGR:RCR1R-R.RlRRRRR)RQRRjRXRbRR^RDRYRTRRuR`RRiRRRRLRUR'RxRRRRRRRRRRSRmR*RARR{RZRReRRORRRRRvRR;RoRRRRHR|RRyRRRRhR_RR?RR]RMRRRQRRRcRPRgR)RkRRRRxRRRR$RRRRtRnRRRR}RR>RrRRqR\RRRRRRRwRRERfRRVRdRMRRpR,RRFRzRR=R@RRRJRR(RBR@RdR((Rt?sF      L   J """E  ]             10#3