File: //home/arjun/projects/env/lib64/python3.10/site-packages/__pycache__/mccabe.cpython-310.pyc
o
we�) � @ s d Z ddlmZ ddlZddlZddlZddlmZ z ddlZddlm Z W n e
y7 ddl mZm Z Y nw 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 kr�eejd d� � dS 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 �?/home/arjun/projects/env/lib/python3.10/site-packages/mccabe.py�__init__ �
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 r"|j}t| jd| | j�}|| j|< ||g|�R � S )N�visit)r � __class__r �get�__name__�getattr�visitorr )r r r �klass�meth� 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 r 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 �n1�n2r r r
�connectG s zPathGraph.connectc C s^ t d� | jD ]}|�� q| j�� D ]\}}|D ]}t d|�� |�� f � qqt d� d S )Nz
subgraph {z %s -- %s;�})r& r/ r( �itemsr' )r r �nexts�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 s z(PathGraph.complexity.<locals>.<listcomp>� )�sumr/ �valuesr8 )r � num_edges� num_nodesr r r
�
complexityU s
zPathGraph.complexityN)r )r r r r r3 r( rA 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� )�superrB 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
rG i r z PathGraphingAstVisitor.resetc C s |D ]}| � |� qd S r )r )r � node_listr r r r
�
dispatch_listm s �z$PathGraphingAstVisitor.dispatch_listc C s� | j r d| j |jf }n|j}d|j|j|f }| jd urE| �|�}|| _| �|j� t ddd�}| j�
| j|� | j�
||� || _d S t |||j|j�| _t |�}|| _| �|j� | j| j d| j |jf < | �
� d S )N�%s%sz %d:%d: %rrC �point�r% )rE r$ r, �
col_offsetrI �appendPathNoderJ rL �bodyr" r3 r* rF rG )r r r+ r$ �pathnode�bottomr r r
�visitFunctionDefq s$
z'PathGraphingAstVisitor.visitFunctionDefc C s0 | j }| j |jd 7 _ | �|j� || _ d S )N�.)rE r$ rL rR )r r �
old_classnamer r r
�
visitClassDef� s
z$PathGraphingAstVisitor.visitClassDefc C s, | j sd S t|�}| j�| j |� || _ |S r )rJ r" rI r3 )r r$ rS r r r
rQ � s z%PathGraphingAstVisitor.appendPathNodec C s, |j d u rd}n|j }d| }| �|� d S )Nr zStmt %d)r, rQ )r r r, r$ r r r
�visitSimpleStatement� s
z+PathGraphingAstVisitor.visitSimpleStatementc s6 t |tj�r
| �|� d S tt| �j|g|�R � d S r )�
isinstancer �stmtrY rD rB r )r r r rH r r
r � s z PathGraphingAstVisitor.defaultc C � d|j }| �||� d S )NzLoop %d�r, � _subgraph�r r r$ r r r
� visitLoop� �
z PathGraphingAstVisitor.visitLoopc C r\ )NzIf %dr] r_ r r r
�visitIf� ra z PathGraphingAstVisitor.visitIfr c C sr | j du r+t|||j|j�| _ t|�}| �|||� | j | jd| j|f < | �� dS | � |�}| �|||� dS )z?create the subgraphs representing any `if` and `for` statementsNrM )
rI r* r, rP r" �_subgraph_parserF rE rG rQ )r r r$ � extra_blocksrS r r r
r^ � s
z PathGraphingAstVisitor._subgraphc C s� g }|| _ | �|j� |�| j � |D ]}|| _ | �|j� |�| j � q|jr8|| _ | �|j� |�| j � n|�|� |rVtddd�}|D ] }| j�||� qG|| _ dS dS )z@parse the body and any `else` block of `if` and `for` statementsrC rN rO N)rJ rL rR r0 �orelser" rI r3 )r r rS rd �
loose_ends�extrarT �ler r r
rc � s&
�z&PathGraphingAstVisitor._subgraph_parsec C s d|j }| j|||jd� d S )Nz TryExcept %d)rd )r, r^ �handlersr_ r r r
�visitTryExcept� s
z%PathGraphingAstVisitor.visitTryExceptc C s$ d|j }| �|� | �|j� d S )NzWith %d)r, rQ rL rR r_ r r r
� visitWith� s
z PathGraphingAstVisitor.visitWith)r )r r r r! r rG rL rU �visitAsyncFunctionDefrX rQ rY r r` �
visitAsyncFor�visitFor�
visitWhilerb r^ rc rj �visitTryrk �visitAsyncWith�
__classcell__r r rH r
rB ^ s(
rB c @ sL e Zd ZdZdZeZdZdZdZ dd� Z
e dd � �Z e d
d � �Z
d d
� ZdS )�
McCabeCheckerz%McCabe cyclomatic complexity checker.�mccabe�C901zC901 %r is too complex (%d)���c C s
|| _ d S r )r )r r �filenamer r r
r � s
zMcCabeChecker.__init__c C sl d}ddt ddd�}t|dd �}t|t�r+|�d� |j|fi |�� |j�d � d S |j|fi |�� d S )
Nz--max-complexityrv �storezMcCabe complexity threshold�True)r �action�type�help�parse_from_config�config_optionsr} zmax-complexity)�intr rZ r. �pop�
add_optionr~ r0 )�cls�parser�flag�kwargs� config_optsr r r
� add_options� s �
zMcCabeChecker.add_optionsc C s t |j�| _d S r )r �max_complexity)r� �optionsr r r
�
parse_options s zMcCabeChecker.parse_optionsc c sp � | j dk rd S t� }|�| j|� |j�� D ] }|�� | j kr5| j|j|�� f }|j |j
|t | �fV qd S )Nr ) r� rB r r rF r> rA � _error_tmplr+ r, r- r{ )r r rI �textr r r
�run s �
��zMcCabeChecker.runN)r r r r! r$ � __version__�version�_coder� r� r � classmethodr� r� r� r r r r
rs � s
rs � �stdinc
C s� z
t | |dtj�}W n ty$ t�� d }tj�d||f � Y dS w g }|t_ t||��
� D ]\}}}} |� d|||f � q1t |�dkrJdS 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�writers r� r� r0 r8 r& �join)
�code� thresholdrw r �e�complxr, �offsetr� �checkr r r
�get_code_complexity s � r� c C s t | �}t||| d�S )z"Returns the complexity of a module)rw )�_readr� )� module_pathr� r� r r r
�get_module_complexity$ s r� c C s< dt j k r dk r(n nt| d�� }|�� W d � S 1 s!w Y d S dt j kr3dk r�n d S z t| d��}t�|j�\}}W d � n1 sPw Y W n( ttt fy~ t| dd��}|�� W d � Y S 1 sww Y Y nw t| d|d�� }|�� W d � S 1 s�w Y d S d S ) N)r< � )� r �rU)� r �rbzlatin-1)�encoding�r)
r� � version_info�open�read�tokenize�detect_encoding�readline� LookupErrorr� � UnicodeError)rw �fr� �_r r r
r� * s( $� ��(��$��r� c C s | d u r t jdd � } t�� }|jdddddd� |jdd d
d d dd
� |�| �\}}t|d �}t||d dtj �}t
� }|� ||� |j rgt
d� |j�� D ]}|jr\|�� |jkr`|�� qPt
d� d S |j�� D ]}|�� |jkr}t
|j|�� � qld S )Nr� z-dz--dot�dotzoutput a graphviz dot file�
store_true)�destr| rz z-mz--minr� z minimum complexity for outputr )r� r| r{ r r r� zgraph {r4 )r� �argv�optparse� OptionParserr� �
parse_argsr� r� r r� rB r r� r& rF r> r� rA r( r$ )r� �oparr� r r� r r rI r r r
�main; s8
�
� � ��r� �__main__r� )r� r� )r� r )r! �
__future__r r� r� r� � collectionsr r r � ImportError� flake8.utilr� �objectr r" r* rB rs r� r� r� r� r r� r r r r
�<module> s4 �
-
�