관리-도구
편집 파일: _base.cpython-34.pyc
� �Re�5 � @ sh d d l m Z m Z m Z d d l m Z d d l m Z m Z m Z d Z i e e � d f d 6e e e e d d f g � B� d f d 6e e e e d d f e d d f g � B� d f d 6e e d d f e d d f g � d f d 6e e d d f e d d f g � d f d 6Z Gd d � d e � Z Gd d � d e � Z Gd d � d e � Z d S)� )�absolute_import�division�unicode_literals)� text_type� )�scopingElements�tableInsertModeElements� namespacesNF�html�button�ol�ul�list�table�optgroup�optionT�selectc @ s� e Z d Z d d � Z d d � Z d d � Z d d � Z d d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d S)�Nodec C s: | | _ d | _ d | _ i | _ g | _ g | _ d S)a6 Node representing an item in the tree. name - The tag name associated with the node parent - The parent of the current node (or None for the document node) value - The value of the current node (applies to text nodes and comments attributes - a dict holding name, value pairs for attributes of the node childNodes - a list of child nodes of the current node. This must include all elements but not necessarily other node types _flags - A list of miscellaneous flags that can be set on the node N)�name�parent�value� attributes� childNodes�_flags)�selfr � r �B/tmp/pip-ztkk0jow-build/pip/_vendor/html5lib/treebuilders/_base.py�__init__ s z Node.__init__c C sK d j d d � | j j � D� � } | r< d | j | f Sd | j Sd S)N� c S s& g | ] \ } } d | | f � q S)z%s="%s"r )�.0r r r r r � <listcomp>+ s z Node.__str__.<locals>.<listcomp>z<%s %s>z<%s>)�joinr �itemsr )r � attributesStrr r r �__str__* s z Node.__str__c C s d | j S)Nz<%s>)r )r r r r �__repr__3 s z Node.__repr__c C s t � d S)z3Insert node as a child of the current node N)�NotImplementedError)r �noder r r � appendChild6 s zNode.appendChildNc C s t � d S)z�Insert data as text in the current node, positioned before the start of node insertBefore or to the end of the node's text. N)r& )r �data� insertBeforer r r � insertText; s zNode.insertTextc C s t � d S)z�Insert node as a child of the current node, before refNode in the list of child nodes. Raises ValueError if refNode is not a child of the current nodeN)r& )r r' �refNoder r r r* A s zNode.insertBeforec C s t � d S)z:Remove node from the children of the current node N)r& )r r' r r r � removeChildG s zNode.removeChildc C s. x | j D] } | j | � q Wg | _ d S)z�Move all the children of the current node to newParent. This is needed so that trees that don't store text as nodes move the text in the correct way N)r r( )r � newParent�childr r r �reparentChildrenL s zNode.reparentChildrenc C s t � d S)z�Return a shallow copy of the current node i.e. a node with the same name and attributes but with no parent or child nodes N)r& )r r r r � cloneNodeV s zNode.cloneNodec C s t � d S)zFReturn true if the node has children or text, false otherwise N)r& )r r r r � hasContent\ s zNode.hasContent) �__name__� __module__� __qualname__r r$ r% r( r+ r* r- r0 r1 r2 r r r r r s r c @ s( e Z d Z d d � Z d d � Z d S)�ActiveFormattingElementsc C s� d } | t k r xj | d d d � D]R } | t k r< Pn | j | | � r[ | d 7} n | d k r& | j | � Pq& q& Wn t j | | � d S)Nr � � ���)�Marker� nodesEqual�remover �append)r r' � equalCount�elementr r r r= c s z ActiveFormattingElements.appendc C s0 | j | j k s d S| j | j k s, d Sd S)NFT)� nameTupler )r �node1�node2r r r r; p s z#ActiveFormattingElements.nodesEqualN)r3 r4 r5 r= r; r r r r r6 b s r6 c @ s? e Z d Z d Z d Z d Z d Z d Z d Z d d � Z d d � Z d d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d d � Z d d � Z d d � Z d d � Z e e e � Z d d � Z d d � Z d d d � Z d! d" � Z d d# d$ � Z d% d& � Z d' d( � Z d) d* � Z d S)+� TreeBuildera Base treebuilder implementation documentClass - the class to use for the bottommost node of a document elementClass - the class to use for HTML Elements commentClass - the class to use for comments doctypeClass - the class to use for doctypes Nc C s) | r d | _ n d | _ | j � d S)Nz http://www.w3.org/1999/xhtml)�defaultNamespace�reset)r �namespaceHTMLElementsr r r r � s zTreeBuilder.__init__c C sC g | _ t � | _ d | _ d | _ d | _ | j � | _ d S)NF)� openElementsr6 �activeFormattingElements� headPointer� formPointer�insertFromTable� documentClass�document)r r r r rE � s zTreeBuilder.resetc C s� t | d � } t | \ } } xZ t | j � D]I } | j | k rK | s] | | k ra | ra d S| | j | k Ar/ d Sq/ Wd s� t � d S)Nr@ TF)�hasattr�listElementsMap�reversedrG r r@ �AssertionError)r �target�variant� exactNode� listElements�invertr' r r r �elementInScope� s zTreeBuilder.elementInScopec C s! | j s d St | j � d } | j | } | t k sH | | j k rL d SxL | t k r� | | j k r� | d k r� d } Pn | d 8} | j | } qO Wx | d 7} | j | } | j � } | j i d d 6| j d 6| j d 6| j d 6� } | | j | <| | j d k r� Pq� q� Wd S) Nr7 r �StartTag�typer � namespacer) r9 r9 ) rH �lenr: rG r1 � insertElementr rZ r )r �i�entry�cloner? r r r �#reconstructActiveFormattingElements� s. z/TreeBuilder.reconstructActiveFormattingElementsc C s> | j j � } x( | j r9 | t k r9 | j j � } q Wd S)N)rH �popr: )r r^ r r r � clearActiveFormattingElements� s z)TreeBuilder.clearActiveFormattingElementsc C sH xA | j d d d � D]) } | t k r- Pq | j | k r | Sq Wd S)z�Check if an element exists between the end of the active formatting elements and the last marker. If it does, return it, else return falseNr7 Fr9 )rH r: r )r r �itemr r r �!elementInActiveFormattingElements� s z-TreeBuilder.elementInActiveFormattingElementsc C s3 | j | � } | j j | � | j j | � d S)N)� createElementrG r= rM r( )r �tokenr? r r r � insertRoot� s zTreeBuilder.insertRootc C sG | d } | d } | d } | j | | | � } | j j | � d S)Nr �publicId�systemId)� doctypeClassrM r( )r rf r rh ri �doctyper r r � insertDoctype� s zTreeBuilder.insertDoctypec C s: | d k r | j d } n | j | j | d � � d S)Nr7 r) r9 )rG r( � commentClass)r rf r r r r � insertComment s zTreeBuilder.insertCommentc C sB | d } | j d | j � } | j | | � } | d | _ | S)z.Create an element but don't insert it anywherer rZ r) )�getrD � elementClassr )r rf r rZ r? r r r re s zTreeBuilder.createElementc C s | j S)N)�_insertFromTable)r r r r �_getInsertFromTable s z TreeBuilder._getInsertFromTablec C s. | | _ | r | j | _ n | j | _ d S)zsSwitch the function used to insert an element from the normal one to the misnested table one and back againN)rq �insertElementTabler\ �insertElementNormal)r r r r r �_setInsertFromTable s z TreeBuilder._setInsertFromTablec C s� | d } t | t � s) t d | � � | j d | j � } | j | | � } | d | _ | j d j | � | j j | � | S)Nr zElement %s not unicoderZ r) r7 r9 ) � isinstancer rQ ro rD rp r rG r( r= )r rf r rZ r? r r r rt s z TreeBuilder.insertElementNormalc C s� | j | � } | j d j t k r2 | j | � S| j � \ } } | d k r` | j | � n | j | | � | j j | � | S)z-Create an element and insert it into the treer7 Nr9 ) re rG r r rt � getTableMisnestedNodePositionr( r* r= )r rf r? r r* r r r rs ( s z TreeBuilder.insertElementTablec C s{ | d k r | j d } n | j sE | j rU | j d j t k rU | j | � n" | j � \ } } | j | | � d S)zInsert text data.Nr7 r9 r9 )rG rK r r r+ rw )r r) r r* r r r r+ 8 s zTreeBuilder.insertTextc C s� d } d } d } x7 | j d d d � D] } | j d k r) | } Pq) q) W| r� | j rm | j } | } q� | j | j j | � d } n | j d } | | f S)zsGet the foster parent element, and sibling to insert before (or None) when inserting a misnested table nodeNr7 r r r9 )rG r r �index)r � lastTable� fosterParentr* �elmr r r rw G s z)TreeBuilder.getTableMisnestedNodePositionc C sO | j d j } | t d � k rK | | k rK | j j � | j | � n d S) Nr7 �dd�dt�lir r �p�rp�rtr9 )zddzdtzlizoptionzoptgroupr zrpzrt)rG r � frozensetra �generateImpliedEndTags)r �excluder r r r r� a s z"TreeBuilder.generateImpliedEndTagsc C s | j S)zReturn the final tree)rM )r r r r � getDocumentk s zTreeBuilder.getDocumentc C s$ | j � } | j d j | � | S)zReturn the final fragmentr )� fragmentClassrG r0 )r �fragmentr r r � getFragmento s zTreeBuilder.getFragmentc C s t � d S)zzSerialize the subtree of node in the format required by unit tests node - the node from which to start serializingN)r& )r r' r r r �testSerializerv s zTreeBuilder.testSerializer) r3 r4 r5 �__doc__rL rp rm rj r� r rE rW r` rb rd rg rl rn re rr ru �propertyrK rt rs r+ rw r� r� r� r� r r r r rC z s6 . rC )� __future__r r r Zpip._vendor.sixr � constantsr r r r: r� �setrO �objectr r r6 rC r r r r �<module> s *! K