관리-도구
편집 파일: logic.cpython-38.pyc
U /?�fd' � @ sx d dl Z d dlZ d dlZd�dd� dD ��Ze�d�e��Ze�d�ZG dd � d �Z G d d � d e �Z G d d � d e �Z dS )� N�|c c s | ]}d � |�V qdS )z[{0}]N)�format)�.0�r� r �</opt/hc_python/lib/python3.8/site-packages/dict2xml/logic.py� <genexpr> s �r ) u À-Öu Ø-öu ø-˿u Ͱ-ͽu Ϳ-u -u ⁰-u Ⰰ-u 、-u 豈-﷏u ﷰ-�z(:|[A-Z]|_|[a-z]|{0})z2(\-|\.|[0-9]|\xB7|[\u0300-\u036F]|[\u203F-\u2040])c @ s4 e Zd ZdZdd� ZG dd� d�ZG dd� d�ZdS ) � DataSorterz; Used to sort a map of data depending on it's type c C s |}t |tj�st|�}|S �N)� isinstance� collections� OrderedDict�sorted)�self�dataZ sorted_datar r r � keys_from# s zDataSorter.keys_fromc @ s e Zd Zdd� ZdS )zDataSorter.alwaysc C s t |�S r )r �r r r r r r * s zDataSorter.always.keys_fromN��__name__� __module__� __qualname__r r r r r �always) s r c @ s e Zd Zdd� ZdS )zDataSorter.neverc C s |S r r r r r r r . s zDataSorter.never.keys_fromNr r r r r �never- s r N)r r r �__doc__r r r r r r r r s r c @ sH e Zd ZdZdddgZddd �Zd d � Zd d � Zdd� Ze dd� �Z dS )�Nodea� Represents each tag in the tree Each node has _either_ a single value or one or more children If it has a value: The serialized result is <%(tag)s>%(value)s</%(tag)s> If it has children: The serialized result is <%(wrap)s> %(children)s </%(wrap)s> Which one it is depends on the implementation of self.convert )�&z&)�<z<)�>z>� NTc C s� | � |�| _| � |�| _|| _| �� | _|d k r4|nt� | _|| _|| _ | jdkr~t | jt �r~| j D ]\}}| j� ||�| _qdd S )N�flat)�sanitize_element�tag�wrapr �determine_type�typer � data_sorter�closed_tags_for�iterables_repeat_wrapr �str�entities�replace) r r" r! r r' r& r% �entity� replacementr r r �__init__F s z Node.__init__c s$ | j }d\}}|r&d�|�}d�|�}| jrD| j| jkrDd�| j �S | �� \}}d}|�r| jdkr~� � fdd�|D �|�}n�| jr�g }|D ]F} | �� �}| jd kr�|�|� q�� |gd �}|�d� |||f�� q�� |d �S g }|D ]} |�| �� �� q�d� |� |d �|g�S d� ||||f�S ) z,Returns the Node serialized as an xml string)r r z</{0}>z<{0}>z<{0}/>r �iterablec 3 s | ]}|� � �V qd S r )� serialize�r �c��indenterr r r p s z!Node.serialize.<locals>.<genexpr>r TF) r" r r& r �convertr$ r' r/ �append�join) r r3 r" �end�start�value�children�content�resultr1 r r2 r r/ \ s4 zNode.serializec C s@ | j }t|t�rdS t|tjj�r&dS t|tjj�r8dS dS dS )a Return the type of the data on this node as an identifying string * Iterable : Supports "for item in data" * Mapping : Supports "for key in data: value = data[key]" * flat : A string or something that isn't iterable or a mapping r �mappingr. N)r r r( r �abc�Mapping�Iterabler r r r r# � s zNode.determine_typec C s� d}| j }| j}g }|dkr\| j�|�}|D ],}|| }|�t|d|| j| j| jd�� q,nV|dkr�|D ]&}|�td| j|| j| j| jd�� qhn t |�}| j r�d� | j || j �}||fS )a� Convert data on this node into a (value, children) tuple depending on the type of the data If the type is : * flat : Use self.tag to surround the value. <tag>value</tag> * mapping : Return a list of tags where the key for each child is the wrap for that node * iterable : Return a list of Nodes where self.wrap is the tag for that node r r= )r' r& r% r. z<{0}>{1}</{2}>) r$ r r% r r5 r r' r& r" r( r! r )r �val�typr r: Z sorted_keys�key�itemr r r r4 � sD �� �� z Node.convertc C sT | rLt | t�rL| �� �d�r$d| } d�t�| �s6dndgdd� | D � �S | S dS )a� Convert `wrap` into a valid tag name applying the XML Naming Rules. * Names can contain letters, numbers, and other characters * Names cannot start with a number or punctuation character * Names cannot start with the letters xml (or XML, or Xml, etc) * Names cannot contain spaces * Any name can be used, no words are reserved. :ref: http://www.w3.org/TR/REC-xml/#NT-NameChar �xml�_r c S s( g | ] }t �|�s t�|�s d n|�qS )rF )� NameStartChar�match�NameCharr0 r r r � <listcomp>� s z)Node.sanitize_element.<locals>.<listcomp>N)r r( �lower� startswithr6 rG rH )r" r r r r � s ��zNode.sanitize_element)r r NTNN) r r r r r) r- r/ r# r4 � staticmethodr r r r r r 2 s � 01r c @ s, e Zd ZdZd dd�Zdd� Zd d d �ZdS ) � ConverterzFLogic for creating a Node tree and serialising that tree into a stringN� Tc C s || _ || _|| _dS )aI wrap: The tag that the everything else will be contained within indent: The string that is multiplied at the start of each new line, to represent each level of nesting newlines: A boolean specifying whether we want each tag on a new line. Note that indent only works if newlines is True N)r" �indent�newlines)r r" rP rQ r r r r- � s zConverter.__init__c s< | j �| j}|sdd� }n �s"d�dd� � � �fdd�}|S )zdReturns a function that given a list of strings, will return that list as a single, indented, stringc S s d� | �S )Nr )r6 )�nodes�wrappedr r r �<lambda> � z*Converter._make_indenter.<locals>.<lambda>r c s s$ | D ]}|� d�D ] }|V qqdS )z Yield each line in each node� N)�split)rR �node�liner r r �eachline s z*Converter._make_indenter.<locals>.eachlinec s6 |rd� ��}d� ��}nd}d}|� |�� | ���S )a" Indent nodes depending on value of wrapped and indent If not wrapped, then don't indent Otherwise, Seperate each child by a newline and indent each line in the child by one indent unit z {0}z {0}{{0}} rV z{0})r r6 )rR rS Z seperatorZ surrounding�rZ rP r r �ret s z%Converter._make_indenter.<locals>.ret)rP rQ )r rQ r\ r r[ r �_make_indenter� s zConverter._make_indenterc C s" | � � }t| j||||d��|�S )zICreate a Node tree from the data and return it as a serialized xml string)r" r r' r& r% )r] r r" r/ )r r r' r& r% r3 r r r �build s ��zConverter.build)NrO T)TNN)r r r r r- r] r^ r r r r rN � s $rN ) r �collections.abc�rer6 Z start_ranges�compiler rG rI r �objectr rN r r r r �<module> s � ;