B

�]?#�@sTdZd
dl
Z
Gdd�d�Zdd�Zdd�ZGd	d
�d
�Zdd�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@sXeZ
dZddd�
Zdd�Zdd�Zd	d
�Zdd�Zd
d�Zddd�
Z	dd�Z
dd�ZdS)�KnuthBendix��dcCsrg|_||_
xN|
D]F\}}|r2|�|�
}|�|�
}|�||�rH||}}|j�||f�

qW|�|�

|��
dS)
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__Ds














zKnuthBendix.__init__cCs|�|
�
|�|�
kS)
N)
�reduce)r�
x�
yrrr�__call__Qs
zKnuthBendix.__call__cCsP|j}|rt
|
�
}t
|�
}n|
�|�
}|�|�
}||kr<d
S||krHdS|
|kS)N�
r
)r�len�count)rrrrZlaZlbrrrrTs












zKnuthBendix.gtc
sN�f
d
d�}i}�x6t|
�
D�]}d�_
t�j�
}�
x8|D�
].\}}�
x"|D�
]\}}	||||	f}
|
|krlqLd||
<||kr��|�
}|�|�
}xT|dkr�|d|�|	||t|�
d�}��|�
}
|||
�
|�||d�}q�Wt|�
}xvtd|t�j�
�D]^}|d||�||d�k�
r��||||d��
}��|d|�|	�
}
|||
�
�
qWqLWq:Wd|k�
s|t	�
g}�j�jf}xpt
�j�
D]b\}}|\}}|�j|<��|�
}��|�
}||k�
r�||k�
r�||f}|�|�

|�j|<n�
q�Wt|�
�jk�r"d|k�st	�
|�_d�jk�s2t	�
�j
rPqWtd|
�
�
dS)Ncs@||
kr<��||
�r&�j
�||
f�

n�j
�|
|f�

d
�_dS)Nr
)rrr	�	confluent)�
p�
q)
rrr�
add_reductioncs




z1KnuthBendix.make_confluent.<locals>.add_reductionrr
)rrz�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rrZreds_tested�
i�reds�u1Zv1�u2Zv2ZredrZuuurZlu1ZnewrZnullred�uv�
u�
v�ru�rvZurvr)
rrr
bs\


















$






























zKnuthBendix.make_confluentcCs2x,|
}x|jD]}|
j
|�}
qW||
krPqW|
S)
N)r�replace)rrrr+rrrr!�s





zKnuthBendix.freducecCs0|jr|�
|
�
}
|�|
�
}
|jr,|
�|j�
}
|
S)
N)rrr!�strip)rrrrrr�s






zKnuthBendix.reduceNcs0|
dkr�j}
�f
d
d�}|
j
t�|�
d�

dS)Ncs0|\}}|
\}}��||�r d
S||kr,dSdS)Nrr
���)
r)Zxxx_todo_changemeZxxx_todo_changeme1r�
_r�__)
rrr�cmp�s






zKnuthBendix.sort.<locals>.cmp)
�key)rr�	functools�
cmp_to_key)rr(r5r)
rrr�s

zKnuthBendix.sortc

Cst|j
�

dS)
N)�	printredsr)
rrrr�pp�s
zKnuthBendix.ppcCs0|
�|j
�
s|j
|
}
|
�|j
�
s,|
|j
}
|
S)
N)�
startswithr�endswith)rrrrrr�s







zKnuthBendix.wrap_delim)rr)
N)�__name__�
__module__�__qualname__rrrr
r!rrr:rrrrrrCs


>
rc
CsXx<t|�
D]0\}
}t
d
|f
dd�
|
dddkr
t
�
q
W|
dddkrTt
�
dS)Nz%s	�
 )
�endr�r
)r%�print)r(r'r+rrrr9�s






r9c
Ost|f
|
�|�
S)
N)
r)r
r�
krrr�kb�s
rEc
@seZ
dZd
S)�_GLUECLAMP_N)r=r>r?rrrrrF�s
rFc
s�d
dddg�ddddg}t|d	d
��
d	g
�g
��
fdd��D�
}
|
d	d
dddgd
d
dddgddd
ddgddddd
gdddd
dggks�t
�
�
S)
N�
1z-1r'z-i)z1.ir')zi.iz-1)zi.i.iz-i)zi.i.i.irG�
.)
rc

s&g|]��g
��fdd
��
D�
�qS)c
sg|]}
��d�
|
f�
�qS)
z%s.%s)
r)�.0r)�
Rrrr�
<listcomp>�sz$test2.<locals>.<listcomp>.<listcomp>r)
rI)�
GrJ)
rrrK�sztest2.<locals>.<listcomp>)rEr$)r
�
Tr)rLrJr�test2�s




 




rNcCsZ
d
g
}t|dd�}
|
dd�s t
�
ddg}t|�
}
|
�d�
}|
�d	�
}|d
ksPt
�
|dks\t
�
|
||�rjt
�
d
g
}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�
}|dk�
sHt
�
|dk�
sVt
�
dS)N)z.a.z.b.rH)
rz.a.z.b.)ZfhkZgh)�
mZkkmZ	fffghkkkmZffghkmZffffhmZfffhmZaaz.bb.�bbrr)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.zf.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)rEr$r)r
rrrrrr�test�s>

































rQc Csdd
ddddg}t|�
}
dddd	d
d
ddddd
dddddddddddddddddddd d!g }||
_
|
S)"N)ZHcc�
H)Zaab�ba)Zaac�ca)Zcccb�abc)Zcacar)ZHb�Ha)ZHaarV)ZHabrV)ZHca�Hac)ZHcbrW)ZabbrP)rU�cb)ZacbrX)ZbaarS)ZbabrP)ZbacrX)ZbbarP)ZbcarX)Zbcb�bbc)ZcabrX)ZcbarX)ZcbbrY)ZcbcrP)ZccbrP)ZHacarW)ZHaccrV)ZbbbbrP)ZbbbcrX)Zbbcc�bbb)ZbccarP)ZccaarS)ZcccarX)ZcaccarX)rE�canon)r
rr[rrr�test3%
s 










r\)	�__doc__r7rr9rErFrNrQr\rrrr�<module>>s	(