Current File : //opt/alt/python37/lib64/python3.7/site-packages/guppy/etc/__pycache__/KnuthBendix.cpython-37.pyc
B
�]?# � @ sT d Z ddlZG dd� d�Zdd� Zdd� ZG d d
� d
�Zd d � Zd
d� Zdd� ZdS )a�
An implementation of the Knuth-Bendix algorithm,
as described in (1), p. 143.
For determining if two paths in a category are equal.
The algorithm as given here,
takes a set of equations in the form of a sequence:
E = [(a, b), (c, d) ...]
where a, b, c, d are 'paths'.
Paths are given as strings, for example:
E = [ ('fhk', 'gh'), ('m', 'kkm') ]
means that the path 'fhk' equals 'gh' and 'm' equals 'kkm'.
Each arrow in the path is here a single character. If longer arrow
names are required, a delimiter string can be specified as in:
kb(E, delim='.')
The paths must then be given by the delimiter between each arrow;
E = [ ('h_arrow.g_arrow', 'g_arrow.k_arrow') ... ]
The function kb(E) returns an object, say A, which is
o callable: A(a, b)->boolean determines if two paths given by a, b are equal.
o has a method A.reduce(a)->pathstring, which reduces a path to normal form.
An optional parameter to kb, max_iterations, determines the maximum
number of iterations the algorithm should try making the reduction
system 'confluent'. The algorithm is not guaranteed to terminate
with a confluent system in a finite number of iterations, so if the
number of iterations needed exceeds max_iterations an exception
(ValueError) will be raised. The default is 100.
References
(1)
@book{walters91categories,
title={Categories and Computer Science},
author={R. F. C. Walters},
publisher={Cambridge University Press},
location={Cambridge},
year=1991}
(2)
@book{grimaldi94discrete,
author="Ralph P. Grimaldi".
title="Discrete and Combinatorial Mathematics: An Applied Introduction",
publisher="Addison-Wesley",
location="Readin, Massachusetts",
year=1994
}
� Nc @ sX e Zd Zddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Zddd�Z dd� Z
dd� Z dS )� KnuthBendix� �d c C sr g | _ || _xN|D ]F\}}|r2| �|�}| �|�}| �||�rH|| }}| j �||f� qW | �|� | �� d S )N)�
reductions�delim�
wrap_delim�gt�append�make_confluent�sort)�self�Er �max_iterations�a�b� r �H/opt/alt/python37/lib64/python3.7/site-packages/guppy/etc/KnuthBendix.py�__init__D s
zKnuthBendix.__init__c C s | � |�| � |�kS )N)�reduce)r �x�yr r r �__call__Q s zKnuthBendix.__call__c C sP | j }|r t|�}t|�}n|�|�}|�|�}||kr<dS ||k rHdS ||kS )N� r )r �len�count)r r r r ZlaZlbr r r r T s
zKnuthBendix.gtc
sN � fdd�}i }�x6t |�D �] }d� _t� j�}�x8|D �].\}}�x"|D �]\}} |||| f}
|
|krlqLd||
< ||kr� �|�} |�|�}xT|dkr�|d |� | ||t|� d � } � �| �}
|| |
� |�||d �}q�W t|�}xvt d|t� j� �D ]^}|d || � ||d � k�r� �|||| d � �} � �|d |� | �}
|| |
� �qW qLW q:W d|k�s|t �g }� j� jf}xpt
� j�D ]b\}}|\}}|� j|< � �|�}� �|�}||k�r�||k�r�||f}|� |� |� j|< n �q�W t|�� jk�r"d|k�s t �|� _d� jk�s2t �� jr P q W t d| ��d S )Nc s@ | |kr<� � | |�r&� j�| |f� n� j�|| f� d� _d S )Nr )r r r � confluent)�p�q)r r r �
add_reductionc s
z1KnuthBendix.make_confluent.<locals>.add_reductionr r )r r z�KnuthBendix.make_confluent did not terminate in %d iterations.
Check your equations or specify an higher max_iterations value.'
)
�ranger �listr �freduce�indexr �findr �AssertionError� enumerater �
ValueError)r r r Z reds_tested�i�redsZu1Zv1Zu2Zv2Zredr Zuuur Zlu1ZnewrZnullred�uv�u�vZru�rvZurvr )r r r
b s\
$
zKnuthBendix.make_confluentc C s2 x,|}x| j D ]}|j|� }qW ||krP qW |S )N)r �replace)r r r r) r r r r! � s zKnuthBendix.freducec C s0 | j r| �|�}| �|�}| j r,|�| j �}|S )N)r r r! �strip)r r r r r r � s
zKnuthBendix.reduceNc s0 |d kr� j }� fdd�}|jt�|�d� d S )Nc s0 | \}}|\}}� � ||�r dS ||kr,dS dS )Nr r ���)r )Zxxx_todo_changemeZxxx_todo_changeme1r �_r �__)r r r �cmp� s z KnuthBendix.sort.<locals>.cmp)�key)r r � functools�
cmp_to_key)r r( r2 r )r r r � s zKnuthBendix.sortc C s t | j� d S )N)� printredsr )r r r r �pp� s zKnuthBendix.ppc C s0 |� | j�s| j| }|�| j�s,|| j }|S )N)�
startswithr �endswith)r r r r r r � s
zKnuthBendix.wrap_delim)r r )N) �__name__�
__module__� __qualname__r r r r
r! r r r7 r r r r r r C s
>
r c C sX x<t | �D ]0\}}td|f dd� |d d dkr
t� q
W |d d dkrTt� d S )Nz%s � )�endr � r )r% �print)r( r' r) r r r r6 � s
r6 c O s t | f|�|�S )N)r )r
r �kr r r �kb� s rB c @ s e Zd ZdS )� _GLUECLAMP_N)r: r; r< r r r r rC � s rC c
s� ddddg� ddddg} t | d d
��d g� g� �fd d �� D � }|d ddddgdddddgdddddgdddddgdddddggks�t��S )
N�1z-1r' z-i)z1.ir' )zi.iz-1)zi.i.iz-i)zi.i.i.irD �.)r c s& g | ] � � g�� fd d��D � �qS )c s g | ]}� � d �|f ��qS )z%s.%s)r )�.0r )�Rr r r �
<listcomp>� s z$test2.<locals>.<listcomp>.<listcomp>r )rF )�GrG )r r rH � s ztest2.<locals>.<listcomp>)rB r$ )r
�Tr )rI rG r �test2� s rK c C sZ dg} t | dd�}|dd�s t�ddg} t | �}|�d�}|�d �}|d
ksPt�|d ks\t�|||�rjt�dg} t | dd�}|�d �}|d ks�t�|�d
�}|dks�t�|�d�}|dks�t�ddg} t | dd�}|�d�}|�d�}|s�t|dk��|dk�st�|dk�st�ddg} t | dd�}|�d�}|�d�}|d k�sHt�|d k�sVt�d S ) N)z.a.z.b.rE )r z.a.z.b.)ZfhkZgh)�mZkkmZ fffghkkkmZffghkmZffffhmZfffhmZaaz.bb.�bbr r )z.f.h.k.z.g.h.)z.m.z.k.k.m.z.f.f.f.g.h.k.k.k.m.z
.f.f.g.h.k.m.)z
.f.f.f.f.h.m.z .f.f.f.h.m.z f.f.f.f.h.mz f.f.f.h.m)z
.f.ff.fff.z .ffff.ff.)z.fffff.z.fff.fff.fffff.z!.f.f.f.ffff.ff.fff.fff.fff.fffff.z.f.f.ffff.ff.fff.fffff.zf.f.f.f.ff.fffffzf.f.f.ff.fffff)rB r$ r )r
r r r r r r �test� s>
rN c C sd dddddg} t | �}dddd d
dddd d d
ddddddddddddddd d d dd d d!g }||_|S )"N)ZHcc�H)Zaab�ba)ZaacZca)Zcccb�abc)Zcacar )ZHb�Ha)ZHaarR )ZHabrR )ZHca�Hac)ZHcbrS )ZabbrM )rQ �cb)ZacbrT )ZbaarP )ZbabrM )ZbacrT )ZbbarM )ZbcarT )Zbcb�bbc)ZcabrT )ZcbarT )ZcbbrU )ZcbcrM )ZccbrM )ZHacarS )ZHaccrR )ZbbbbrM )ZbbbcrT )ZbbccZbbb)ZbccarM )ZccaarP )ZcccarT )ZcaccarT )rB �canon)r
r rV r r r �test3% s rW ) �__doc__r4 r r6 rB rC rK rN rW r r r r �<module>> s (
Mini Shell