Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/__pycache__/mccabe.cpython-39.pyc
Ðазад
a g�h�) � @ s d Z ddlmZ ddlZddlZddlZddlmZ zddlZddlm Z W n" e yn ddl mZm Z Y n0 dZ G dd � d e �ZG d d � d e �ZG d d � d e �ZG dd� de�ZG dd� de �Zd dd�Zd dd�Zdd� Zd dd�Zed k�reejd d� � dS )!z� Meager code path measurement tool. Ned Batchelder http://nedbatchelder.com/blog/200803/python_code_complexity_microtool.html MIT License. � )�with_statementN)� defaultdict)�iter_child_nodes)�astr z0.7.0c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd S ) � ASTVisitorz'Performs a depth-first walk of the AST.c C s d | _ i | _d S �N)�node�_cache��self� r �v/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/mccabe.py�__init__ s zASTVisitor.__init__c G s$ t |�D ]}| j|g|�R � qd S r )r �dispatch)r r �args�childr r r �default s zASTVisitor.defaultc G sT || _ |j}| j�|�}|d u rD|j}t| jd| | j�}|| j|< ||g|�R � S )N�visit)r � __class__r �get�__name__�getattr�visitorr )r r r �klass�methZ classNamer r r r ! s zASTVisitor.dispatchc G s$ || _ | j|_| j|g|�R � dS )z&Do preorder walk of tree using visitorN)r r r )r �treer r r r r �preorder+ s zASTVisitor.preorderN)r � __module__� __qualname__�__doc__r r r r r r r r r s r c @ s& e Zd Zd dd�Zdd� Zdd� ZdS ) �PathNode�circlec C s || _ || _d S r )�name�look)r r" r# r r r r 3 s zPathNode.__init__c C s t d| j| j| �� f � d S )Nz node [shape=%s,label="%s"] %d;)�printr# r" �dot_idr r r r �to_dot7 s �zPathNode.to_dotc C s t | �S r )�idr r r r r% ; s zPathNode.dot_idN)r! )r r r r r& r% r r r r r 2 s r c @ s. e Zd Zd dd�Zdd� Zdd� Zdd � Zd S ) � PathGraphr c C s& || _ || _|| _|| _tt�| _d S r )r" �entity�lineno�columnr �list�nodes)r r" r) r* r+ r r r r @ s zPathGraph.__init__c C s | j | �|� g | j |< d S r )r- �append)r Zn1Zn2r r r �connectG s zPathGraph.connectc C s^ t d� | jD ] }|�� q| j�� D ]*\}}|D ] }t d|�� |�� f � q2q&t d� d S )Nz subgraph {z %s -- %s;�})r$ r- r& �itemsr% )r r Znexts�nextr r r r& L s zPathGraph.to_dotc C s. t dd� | j�� D ��}t| j�}|| d S )zG Return the McCabe complexity for the graph. V-E+2 c S s g | ] }t |��qS r )�len)�.0�nr r r � <listcomp>Y � z(PathGraph.complexity.<locals>.<listcomp>� )�sumr- �valuesr3 )r Z num_edgesZ num_nodesr r r � complexityU s zPathGraph.complexityN)r )r r r r r/ r& r; r r r r r( ? s r( c s� e Zd ZdZ� fdd�Zdd� Zdd� Zdd � ZeZd d � Z d d � Z dd� Z � fdd�Z dd� Z e Z ZZdd� Zd dd�Zdd� Zdd � ZeZd d � ZeZ� ZS ) �PathGraphingAstVisitorz\ A visitor for a parsed Abstract Syntax Tree which finds executable statements. c s& t t| ��� d| _i | _| �� d S )N� )�superr< r � classname�graphs�resetr �r r r r c s z PathGraphingAstVisitor.__init__c C s d | _ d | _d S r )�graph�tailr r r r rA i s z PathGraphingAstVisitor.resetc C s |D ]}| � |� qd S r )r )r Z node_listr r r r � dispatch_listm s z$PathGraphingAstVisitor.dispatch_listc C s� | j rd| j |jf }n|j}d|j|j|f }| jd ur�| �|�}|| _| �|j� t ddd�}| j� | j|� | j� ||� || _nNt |||j|j�| _t |�}|| _| �|j� | j| j d| j |jf < | � � d S )N�%s%sz %d:%d: %rr= �point�r# )r? r" r* � col_offsetrC �appendPathNoderD rE �bodyr r/ r( r@ rA )r r r) r" �pathnode�bottomr r r �visitFunctionDefq s$ z'PathGraphingAstVisitor.visitFunctionDefc C s0 | j }| j |jd 7 _ | �|j� || _ d S )N�.)r? r" rE rK )r r Z old_classnamer r r � visitClassDef� s z$PathGraphingAstVisitor.visitClassDefc C s, | j s d S t|�}| j�| j |� || _ |S r )rD r rC r/ )r r" rL r r r rJ � s z%PathGraphingAstVisitor.appendPathNodec C s, |j d u rd}n|j }d| }| �|� d S )Nr zStmt %d)r* rJ )r r r* r" r r r �visitSimpleStatement� s z+PathGraphingAstVisitor.visitSimpleStatementc s4 t |tj�r| �|� ntt| �j|g|�R � d S r )� isinstancer �stmtrQ r> r< r )r r r rB r r r � s z PathGraphingAstVisitor.defaultc C s d|j }| �||� d S )NzLoop %d�r* � _subgraph�r r r" r r r � visitLoop� s z PathGraphingAstVisitor.visitLoopc C s d|j }| �||� d S )NzIf %drT rV r r r �visitIf� s z PathGraphingAstVisitor.visitIfr c C sp | j du rTt|||j|j�| _ t|�}| �|||� | j | jd| j|f < | �� n| � |�}| �|||� dS )z?create the subgraphs representing any `if` and `for` statementsNrF ) rC r( r* rI r �_subgraph_parser@ r? rA rJ )r r r" � extra_blocksrL r r r rU � s z PathGraphingAstVisitor._subgraphc C s� g }|| _ | �|j� |�| j � |D ]"}|| _ | �|j� |�| j � q&|jrp|| _ | �|j� |�| j � n |�|� |r�tddd�}|D ]}| j�||� q�|| _ dS )z@parse the body and any `else` block of `if` and `for` statementsr= rG rH N)rD rE rK r. �orelser rC r/ )r r rL rZ Z loose_ends�extrarM �ler r r rY � s$ z&PathGraphingAstVisitor._subgraph_parsec C s d|j }| j|||jd� d S )Nz TryExcept %d)rZ )r* rU �handlersrV r r r �visitTryExcept� s z%PathGraphingAstVisitor.visitTryExceptc C s$ d|j }| �|� | �|j� d S )NzWith %d)r* rJ rE rK rV r r r � visitWith� s z PathGraphingAstVisitor.visitWith)r )r r r r r rA rE rN ZvisitAsyncFunctionDefrP rJ rQ r rW Z visitAsyncForZvisitForZ visitWhilerX rU rY r_ ZvisitTryr` ZvisitAsyncWith� __classcell__r r rB r r< ^ s& r< c @ sL e Zd ZdZdZeZdZdZdZ dd� Z e dd � �Z e d d � �Z d d � ZdS )� McCabeCheckerz%McCabe cyclomatic complexity checker.ZmccabeZC901zC901 %r is too complex (%d)���c C s || _ d S r )r )r r �filenamer r r r � s zMcCabeChecker.__init__c C sj d}ddt ddd�}t|dd �}t|t�rT|�d� |j|fi |�� |j�d � n|j|fi |�� d S ) Nz--max-complexityrc �storezMcCabe complexity threshold�True)r �action�type�help�parse_from_config�config_optionsrj zmax-complexity)�intr rR r, �pop� add_optionrk r. )�cls�parser�flag�kwargsZ config_optsr r r � add_options� s � zMcCabeChecker.add_optionsc C s t |j�| _d S r )rl �max_complexity)ro �optionsr r r � parse_options s zMcCabeChecker.parse_optionsc c sn | j dk rd S t� }|�| j|� |j�� D ]<}|�� | j kr,| j|j|�� f }|j |j |t | �fV q,d S )Nr ) rt r< r r r@ r: r; � _error_tmplr) r* r+ rh )r r rC �textr r r �run s zMcCabeChecker.runN)r r r r r" � __version__�version�_coderw rt r � classmethodrs rv ry r r r r rb � s rb � �stdinc C s� zt | |dtj�}W n4 tyH t�� d }tj�d||f � Y dS 0 g }|t_ t||�� � D ] \}}}} |� d|||f � qbt |�dkr�dS t d�|�� t |�S )N�exec� zUnable to parse %s: %s r z %s:%d:1: %s� )�compiler � PyCF_ONLY_AST� SyntaxError�sys�exc_info�stderr�writerb rt ry r. r3 r$ �join) �code� thresholdrd r �eZcomplxr* �offsetrx �checkr r r �get_code_complexity s r� c C s t | �}t||| d�S )z"Returns the complexity of a module)rd )�_readr� )� module_pathr� r� r r r �get_module_complexity$ s r� c C s< dt j k rdk rPn n6t| d��}|�� W d � S 1 sB0 Y � n�dt j krhdk �r8n n�z>t| d�� }t�|j�\}}W d � n1 s�0 Y W nT ttt f� y� t| dd�� }|�� W d � Y S 1 � s�0 Y Y n0 t| d|d��}|�� W d � S 1 �s.0 Y d S ) N)r8 � )� r ZrU)� r �rbzlatin-1)�encoding�r) r� � version_info�open�read�tokenize�detect_encoding�readline� LookupErrorr� � UnicodeError)rd �fr� �_r r r r� * s * 22r� c C s� | d u rt jdd � } t�� }|jdddddd� |jdd d d d dd � |�| �\}}t|d �}t||d dtj �}t � }|� ||� |j r�t d� |j�� D ] }|jr�|�� |jkr�|�� q�t d� n.|j�� D ]"}|�� |jkr�t |j|�� � q�d S )Nr� z-dz--dot�dotzoutput a graphviz dot file� store_true)�destri rg z-mz--minr� z minimum complexity for outputrl )r� ri rh r r r� zgraph {r0 )r� �argv�optparse� OptionParserrn � parse_argsr� r� r r� r< r r� r$ r@ r: r� r; r& r" )r� Zoparru r r� r r rC r r r �main; s4 � � � r� �__main__r� )r~ r )r~ )N)r � __future__r r� r� r� � collectionsr r r � ImportErrorZ flake8.utilrz �objectr r r( r< rb r� r� r� r� r r� r r r r �<module> s. -
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка