Current File : //proc/227033/root/opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyc
�
;�Pc @ s] d Z d d d � � YZ d � Z d � Z d d d � � YZ d � Z d � Z d � Z d
S(
s�
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
}
t KnuthBendixc B sb e Z d d d � Z d � Z d � Z d � Z d � Z d � Z d d � Z d � Z
d
� Z RS( t id c C s� g | _ | | _ xs | D]k \ } } | rL | j | � } | j | � } n | j | | � rn | | } } n | j j | | f � q W| j | � | j � d S( N( t
reductionst delimt
wrap_delimt gtt appendt make_confluentt sort( t selft ER t max_iterationst at b( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt __init__C s
c C s | j | � | j | � k S( N( t reduce( R t xt y( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt __call__P s c C sr | j } | r* t | � } t | � } n | j | � } | j | � } | | k rX d S| | k rh d S| | k S( Ni i ( R t lent count( R R R
R t lat lb( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyR S s c s� � f d � } i } x�t | � D]�} d � _ t � j � } xx| D]p\ } } xa| D]Y\ } } | | | | f }
|
| k r� qZ n d | |
<| | k r&� j | � } | j | � } xe | d k r"| | | | | t | � } � j | � }
| | |
� | j | | d � } q� Wn t | � } x~ t d | t � j � � D]` } | | | | | k rO� j | | | | � } � j | | | � }
| | |
� qOqOWqZ WqG Wd | k s�t � g } � j � j f } x� t
� j � D]� \ } } | \ } } | � j | <� j | � } � j | � } | | k r�| | k r�| | f } | j | � | � j | <q�q�Wt | � � j k r�d | k s�t � | � _ n d � j k s�t � � j r" Pq" q" Wt d | � d S( Nc s] | | k rY � j | | � r7 � j j | | f � n � j j | | f � d � _ n d S( Ni ( R R R t confluent( t pt q( R ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt
add_reductionb s
i i R s� KnuthBendix.make_confluent did not terminate in %d iterations.
Check your equations or specify an higher max_iterations value.'
( R R ( R R ( R R (
t rangeR t listR t freducet indexR t findR t AssertionErrort enumerateR t
ValueError( R R R t reds_testedt it redst u1t v1t u2t v2t redR t uuuR t lu1t newrt nullredt uvt ut vt rut rvt urv( ( R sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyR a s^
#
c C sD x= | } x | j D] } | j | � } q W| | k r Pq q W| S( N( R t replace( R R R R/ ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyR � s c C sL | j r | j | � } n | j | � } | j rH | j | j � } n | S( N( R R R t strip( R R ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyR � s c s8 | d k r � j } n � f d � } | j | � d S( Nc sB | \ } } | \ } } � j | | � r. d S| | k r> d Sd S( Ni i i����( R ( t .0t .1R t _R t __( R ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt cmp� s ( t NoneR R ( R R% R; ( ( R sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyR � s c C s t | j � d S( N( t printredsR ( R ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt pp� s c C sH | j | j � s" | j | } n | j | j � sD | | j } n | S( N( t
startswithR t endswith( R R ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyR � s
N( t __name__t
__module__R R R R R R R< R R> R ( ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyR B s
K c C s\ x= t | � D]/ \ } } d | f G| d d d k r
Hq
q
W| d d d k rX Hn d S( Ns %s i i i ( R! ( R% R$ R/ ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyR= � s c O s t | | | � S( N( R ( R
R t k( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt kb� s t _GLUECLAMP_c B s e Z RS( ( RA RB ( ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyRE � s c
C s� d d d d g } d d
d d g } t | d d
�} d
g | g g | D]9 } | g g | D] } | j d | | f � ^ q] ^ qJ } | d
d d d d g d d d d d g d d d d d g d d d d d g d d d d d g g k s� t � | S( Nt 1s -1R$ s -is 1.is i.is i.i.is i.i.i.iR t .s %s.%s( s 1.iR$ ( s i.is -1( s i.i.is -i( s i.i.i.iRF ( RD R R ( t GR
t RR R t T( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt test2� s T!c C s� d$ g } t | d d �} | d d � s0 t � d% d& g } t | � } | j d � } | j d
� } | d k sx t � | d k s� t � | | | � s� t � d' g } t | d d �} | j d
� } | d
k s� t � | j d � } | d k s� t � | j d � } | d k s t � d( d) g } t | d d �} | j d � } | j d � } | srt | d* k � � | d k s�t � | d k s�t � d+ d, g } t | d d �} | j d � } | j d! � } | d" k s�t � | d# k s�t � d S(- Ns .a.s .b.R RG t fhkt ght mt kkmt fffghkkkmt ffghkmt ffffhmt fffhmt aas .bb.t bbR
R s .f.h.k.s .g.h.s .m.s .k.k.m.s .f.f.f.g.h.k.k.k.m.s
.f.f.g.h.k.m.s
.f.f.f.f.h.m.s .f.f.f.h.m.s f.f.f.f.h.ms f.f.f.h.ms
.f.ff.fff.s .ffff.ff.s .fffff.s .fff.fff.fffff.s! .f.f.f.ffff.ff.fff.fff.fff.fffff.s .f.f.ffff.ff.fff.fffff.s f.f.f.f.ff.fffffs f.f.f.ff.fffff( s .a.s .b.( RL RM ( RN RO ( s .a.s .b.( s .f.h.k.s .g.h.( s .m.s .k.k.m.( s
.f.f.f.f.h.m.s .f.f.f.h.m.( s
.f.ff.fff.s .ffff.ff.( s .fffff.s .fff.fff.fffff.( RD R R ( R
R R R ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt test s> c ! C s� d, d- d. d/ d0 g } t | � } d1 d2 d3 d4 d5 d6 d7 d8 d9 d: d; d< d= d> d? d@ dA dB dC dD dE dF dG dH dI dJ dK dL dM dN dO dP g } | | _ | S(Q Nt Hcct Ht aabt bat aact cat cccbt abct cacaR
t Hbt Hat Haat Habt Hcat Hact Hcbt abbRU t cbt acbt baat babt bact bbat bcat bcbt bbct cabt cbat cbbt cbct ccbt Hacat Hacct bbbbt bbbct bbcct bbbt bccat ccaat cccat cacca( RW RX ( RY RZ ( R[ R\ ( R] R^ ( R_ R
( R` Ra ( Rb Ra ( Rc Ra ( Rd Re ( Rf Re ( RW RX ( RY RZ ( R[ R\ ( Rg RU ( R^ Rh ( Ri Rh ( Rj RZ ( Rk RU ( Rl Rh ( Rm RU ( Rn Rh ( Ro Rp ( Rq Rh ( Rr Rh ( Rs Rp ( Rt RU ( Ru RU ( Rv Re ( Rw Ra ( Rx RU ( Ry Rh ( Rz R{ ( R| RU ( R_ R
( R} RZ ( R~ Rh ( R Rh ( RD t canon( R
R R� ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt test31 s N( ( ( t __doc__R R= RD RE RK RV R� ( ( ( sH /opt/alt/python27/lib64/python2.7/site-packages/guppy/etc/KnuthBendix.pyt <module>@ s � )
Mini Shell