/snap/core18/2999/usr/lib/python3.6/__pycache__
Edit: /snap/core18/2999/usr/lib/python3.6/__pycache__/difflib.cpython-36.pyc (59642B)
3
Nq iI @ s8 d Z ddddddddd d
d d g Zd
dlmZ d
dlmZ ed dZdd Z G dd dZ
d8ddZ dd Z G dd dZ
d
dlZejdjfd dZd9d dZd d Zd:d#d Zd$d% Zd;d&dZd'd( Zd
" lines in HTML files). That may be
because this is the only method of the 3 that has a *concept* of
"junk" .
Example, comparing two strings, and considering blanks to be "junk":
>>> s = SequenceMatcher(lambda x: x == " ",
... "private Thread currentThread;",
... "private volatile Thread currentThread;")
>>>
.ratio() returns a float in [0, 1], measuring the "similarity" of the
sequences. As a rule of thumb, a .ratio() value over 0.6 means the
sequences are close matches:
>>> print(round(s.ratio(), 3))
0.866
>>>
If you're only interested in where the sequences match,
.get_matching_blocks() is handy:
>>> for block in s.get_matching_blocks():
... print("a[%d] and b[%d] match for %d elements" % block)
a[0] and b[0] match for 8 elements
a[8] and b[17] match for 21 elements
a[29] and b[38] match for 0 elements
Note that the last tuple returned by .get_matching_blocks() is always a
dummy, (len(a), len(b), 0), and this is the only case in which the last
tuple element (number of elements matched) is 0.
If you want to know how to change the first sequence into the second,
use .get_opcodes():
>>> for opcode in s.get_opcodes():
... print("%6s a[%d:%d] b[%d:%d]" % opcode)
equal a[0:8] b[0:8]
insert a[8:8] b[8:17]
equal a[8:29] b[17:38]
See the Differ class for a fancy human-friendly file differencer, which
uses SequenceMatcher both to compare sequences of lines, and to compare
sequences of characters within similar (near-matching) lines.
See also function get_close_matches() in this module, which shows how
simple code building on SequenceMatcher can be used to do useful work.
Timing: Basic R-O is cubic time worst case and quadratic time expected
case. SequenceMatcher is quadratic time for the worst case and has
expected-case behavior dependent in a complicated way on how many
elements the sequences have in common; best case time is linear.
Methods:
__init__(isjunk=None, a='', b='')
Construct a SequenceMatcher.
set_seqs(a, b)
Set the two sequences to be compared.
set_seq1(a)
Set the first sequence to be compared.
set_seq2(b)
Set the second sequence to be compared.
find_longest_match(alo, ahi, blo, bhi)
Find longest matching block in a[alo:ahi] and b[blo:bhi].
get_matching_blocks()
Return list of triples describing matching subsequences.
get_opcodes()
Return list of 5-tuples describing how to turn a into b.
ratio()
Return a measure of the sequences' similarity (float in [0,1]).
quick_ratio()
Return an upper bound on .ratio() relatively quickly.
real_quick_ratio()
Return an upper bound on ratio() very quickly.
N Tc C s( || _ d | _| _|| _| j|| dS )a! Construct a SequenceMatcher.
Optional arg isjunk is None (the default), or a one-argument
function that takes a sequence element and returns true iff the
element is junk. None is equivalent to passing "lambda x: 0", i.e.
no elements are considered to be junk. For example, pass
lambda x: x in " \t"
if you're comparing lines as sequences of characters, and don't
want to synch up on blanks or hard tabs.
Optional arg a is the first of two sequences to be compared. By
default, an empty string. The elements of a must be hashable. See
also .set_seqs() and .set_seq1().
Optional arg b is the second of two sequences to be compared. By
default, an empty string. The elements of b must be hashable. See
also .set_seqs() and .set_seq2().
Optional arg autojunk should be set to False to disable the
"automatic junk heuristic" that treats popular elements as junk
(see module documentation for more information).
N)isjunkabautojunkset_seqs)selfr r r r r r r __init__ s ; zSequenceMatcher.__init__c C s | j | | j| dS )zSet the two sequences to be compared.
>>> s = SequenceMatcher()
>>> s.set_seqs("abcd", "bcde")
>>> s.ratio()
0.75
N)set_seq1set_seq2)r r r r r r r s
zSequenceMatcher.set_seqsc C s$ || j krdS || _ d | _| _dS )aM Set the first sequence to be compared.
The second sequence to be compared is not changed.
>>> s = SequenceMatcher(None, "abcd", "bcde")
>>> s.ratio()
0.75
>>> s.set_seq1("bcde")
>>> s.ratio()
1.0
>>>
SequenceMatcher computes and caches detailed information about the
second sequence, so if you want to compare one sequence S against
many sequences, use .set_seq2(S) once and call .set_seq1(x)
repeatedly for each of the other sequences.
See also set_seqs() and set_seq2().
N)r matching_blocksopcodes)r r r r r r s
zSequenceMatcher.set_seq1c C s2 || j krdS || _ d | _| _d| _| j dS )aM Set the second sequence to be compared.
The first sequence to be compared is not changed.
>>> s = SequenceMatcher(None, "abcd", "bcde")
>>> s.ratio()
0.75
>>> s.set_seq2("abcd")
>>> s.ratio()
1.0
>>>
SequenceMatcher computes and caches detailed information about the
second sequence, so if you want to compare one sequence S against
many sequences, use .set_seq2(S) once and call .set_seq1(x)
repeatedly for each of the other sequences.
See also set_seqs() and set_seq1().
N)r r r
fullbcount_SequenceMatcher__chain_b)r r r r r r s
zSequenceMatcher.set_seq2c C s | j }i | _}x*t|D ] \}}|j|g }|j| qW t | _}| j}|rx"|j D ]}||r\|j | q\W x|D ]
}||= q|W t | _
}t |} | j r| dkr| d d }
x*|j
D ] \}} t | |
kr|j | qW x|D ]
}||= qW d S )N d )r b2j enumerate
setdefaultappendsetbjunkr keysaddZbpopularlenr items) r r r& ieltindicesZjunkr ZpopularnZntestZidxsr r r Z __chain_b) s,
zSequenceMatcher.__chain_bc C sN | j | j| j| jjf\}}}}||d } }
} i } g }
xt||D ]}| j}i }xn|j|| |
D ]Z}||k rpqb||krzP ||d dd }||< || krb|| d || d | } }
} qbW |} qBW xb| |kr*|
|kr*|||
d r*|| d ||
d kr*| d |
d | d } }
} qW xX| | |k r|
| |k r|||
| r|| | ||
| kr| d7 } q.W xb| |kr|
|kr|||
d r|| d ||
d kr| d |
d | d } }
} qW xV| | |k r@|
| |k r@|||
| r@|| | ||
| kr@| d } qW t| |
| S )a Find longest matching block in a[alo:ahi] and b[blo:bhi].
If isjunk is not defined:
Return (i,j,k) such that a[i:i+k] is equal to b[j:j+k], where
alo <= i <= i+k <= ahi
blo <= j <= j+k <= bhi
and for all (i',j',k') meeting those conditions,
k >= k'
i <= i'
and if i == i', j <= j'
In other words, of all maximal matching blocks, return one that
starts earliest in a, and of all those maximal matching blocks that
start earliest in a, return the one that starts earliest in b.
>>> s = SequenceMatcher(None, " abcd", "abcd abcd")
>>> s.find_longest_match(0, 5, 0, 9)
Match(a=0, b=4, size=5)
If isjunk is defined, first the longest matching block is
determined as above, but with the additional restriction that no
junk element appears in the block. Then that block is extended as
far as possible by matching (only) junk elements on both sides. So
the resulting block never matches on junk except as identical junk
happens to be adjacent to an "interesting" match.
Here's the same example as before, but considering blanks to be
junk. That prevents " abcd" from matching the " abcd" at the tail
end of the second sequence directly. Instead only the "abcd" can
match, and matches the leftmost "abcd" in the second sequence:
>>> s = SequenceMatcher(lambda x: x==" ", " abcd", "abcd abcd")
>>> s.find_longest_match(0, 5, 0, 9)
Match(a=1, b=0, size=4)
If no blocks match, return (alo, blo, 0).
>>> s = SequenceMatcher(None, "ab", "c")
>>> s.find_longest_match(0, 2, 0, 1)
Match(a=0, b=0, size=0)
r
r% )r r r& r+ __contains__rangegetr )r aloahiblobhir r r& ZisbjunkZbestiZbestjZbestsizeZj2lenZnothingr0 Zj2lengetZnewj2lenjkr r r find_longest_matchP sB 8 $ " z"SequenceMatcher.find_longest_matchc C s | j dk r| j S t| jt| j }}d|d|fg}g }x|r|j \}}}}| j|||| \} }
} } | r:|j| || k r||
k r|j|| ||
f | | |k r:|
| |k r:|j| | ||
| |f q:W |j d }
}}g }x^|D ]V\}}}|
| |kr || |kr ||7 }q|r2|j|
||f ||| }
}}qW |r\|j|
||f |j||df tt t
j || _ | j S )a Return list of triples describing matching subsequences.
Each triple is of the form (i, j, n), and means that
a[i:i+n] == b[j:j+n]. The triples are monotonically increasing in
i and in j. New in Python 2.5, it's also guaranteed that if
(i, j, n) and (i', j', n') are adjacent triples in the list, and
the second is not the last triple in the list, then i+n != i' or
j+n != j'. IOW, adjacent triples never describe adjacent equal
blocks.
The last triple is a dummy, (len(a), len(b), 0), and is the only
triple with n==0.
>>> s = SequenceMatcher(None, "abxcd", "abcd")
>>> list(s.get_matching_blocks())
[Match(a=0, b=0, size=2), Match(a=3, b=2, size=2), Match(a=5, b=4, size=0)]
Nr
) r r. r r popr= r) sortlistmapr _make)r lalbZqueuer r7 r8 r9 r: r0 r; r< xi1j1Zk1Z non_adjacenti2j2Zk2r r r get_matching_blocks s8
z#SequenceMatcher.get_matching_blocksc C s | j dk r| j S d }}g | _ }x| j D ]\}}}d}||k rP||k rPd}n||k r^d}n ||k rjd}|r|j|||||f || || }}|r,|jd||||f q,W |S )a[ Return list of 5-tuples describing how to turn a into b.
Each tuple is of the form (tag, i1, i2, j1, j2). The first tuple
has i1 == j1 == 0, and remaining tuples have i1 == the i2 from the
tuple preceding it, and likewise for j1 == the previous j2.
The tags are strings, with these meanings:
'replace': a[i1:i2] should be replaced by b[j1:j2]
'delete': a[i1:i2] should be deleted.
Note that j1==j2 in this case.
'insert': b[j1:j2] should be inserted at a[i1:i1].
Note that i1==i2 in this case.
'equal': a[i1:i2] == b[j1:j2]
>>> a = "qabxcd"
>>> b = "abycdf"
>>> s = SequenceMatcher(None, a, b)
>>> for tag, i1, i2, j1, j2 in s.get_opcodes():
... print(("%7s a[%d:%d] (%s) b[%d:%d] (%s)" %
... (tag, i1, i2, a[i1:i2], j1, j2, b[j1:j2])))
delete a[0:1] (q) b[0:0] ()
equal a[1:3] (ab) b[0:2] (ab)
replace a[3:4] (x) b[2:3] (y)
equal a[4:6] (cd) b[3:5] (cd)
insert a[6:6] () b[5:6] (f)
Nr
r replacedeleteinsertequal)r rJ r) )r r0 r; Zansweraibjsizetagr r r get_opcodes s$
zSequenceMatcher.get_opcodes c
c sr | j }|sdg}|d d dkrZ|d \}}}}}|t||| |t||| |f|d< |d d dkr|d \}}}}}||t||| |t||| f|d< || }g } x|D ]\}}}}}|dko|| |kr(| j||t||| |t||| f | V g } t||| t||| }}| j|||||f qW | rnt| dkob| d d dk rn| V dS ) a Isolate change clusters by eliminating ranges with no changes.
Return a generator of groups with up to n lines of context.
Each group is in the same format as returned by get_opcodes().
>>> from pprint import pprint
>>> a = list(map(str, range(1,40)))
>>> b = a[:]
>>> b[8:8] = ['i'] # Make an insertion
>>> b[20] += 'x' # Make a replacement
>>> b[23:28] = [] # Make a deletion
>>> b[30] += 'y' # Make another replacement
>>> pprint(list(SequenceMatcher(None,a,b).get_grouped_opcodes()))
[[('equal', 5, 8, 5, 8), ('insert', 8, 8, 8, 9), ('equal', 8, 11, 9, 12)],
[('equal', 16, 19, 17, 20),
('replace', 19, 20, 20, 21),
('equal', 20, 22, 21, 23),
('delete', 22, 27, 23, 23),
('equal', 27, 30, 23, 26)],
[('equal', 31, 34, 27, 30),
('replace', 34, 35, 30, 31),
('equal', 35, 38, 31, 34)]]
rN r
r% N)rN r
r% r
r% rU rU )rS maxminr) r. )
r r3 ZcodesrR rF rH rG rI Znngroupr r r get_grouped_opcodes< s( &&( (z#SequenceMatcher.get_grouped_opcodesc C s0 t dd | j D }t|t| jt| j S )a Return a measure of the sequences' similarity (float in [0,1]).
Where T is the total number of elements in both sequences, and
M is the number of matches, this is 2.0*M / T.
Note that this is 1 if the sequences are identical, and 0 if
they have nothing in common.
.ratio() is expensive to compute if you haven't already computed
.get_matching_blocks() or .get_opcodes(), in which case you may
want to try .quick_ratio() or .real_quick_ratio() first to get an
upper bound.
>>> s = SequenceMatcher(None, "abcd", "bcde")
>>> s.ratio()
0.75
>>> s.quick_ratio()
0.75
>>> s.real_quick_ratio()
1.0
c s s | ]}|d V qdS )r% NrU r ).0Ztripler r r s z(SequenceMatcher.ratio..)sumrJ r r. r r )r r r r r ration s zSequenceMatcher.ratioc C s | j dkr8i | _ }x"| jD ]}|j|dd ||< q W | j }i }|jd }}xH| jD ]>}||rl|| }n |j|d}|d ||< |dkrV|d }qVW t|t| jt| j S )zReturn an upper bound on ratio() relatively quickly.
This isn't defined beyond that it is an upper bound on .ratio(), and
is faster to compute.
Nr
r% )r! r r6 r4 r r r. )r r! r1 ZavailZavailhasr Znumbr r r quick_ratio s
zSequenceMatcher.quick_ratioc C s* t | jt | j }}tt|||| S )zReturn an upper bound on ratio() very quickly.
This isn't defined beyond that it is an upper bound on .ratio(), and
is faster to compute than either .ratio() or .quick_ratio().
)r. r r r rW )r rC rD r r r real_quick_ratio s z SequenceMatcher.real_quick_ratio)Nr r T)rT )__name__
__module__ __qualname____doc__r r r r r" r= rJ rS rY r] r^ r_ r r r r r + s j
@ ,'nG7
2 rT 333333?c C s |dkst d|f d| ko(dkn s 0.
Optional arg cutoff (default 0.6) is a float in [0, 1]. Possibilities
that don't score at least that similar to word are ignored.
The best (no more than n) matches among the possibilities are returned
in a list, sorted by similarity score, most similar first.
>>> get_close_matches("appel", ["ape", "apple", "peach", "puppy"])
['apple', 'ape']
>>> import keyword as _keyword
>>> get_close_matches("wheel", _keyword.kwlist)
['while']
>>> get_close_matches("Apple", _keyword.kwlist)
[]
>>> get_close_matches("accept", _keyword.kwlist)
['except']
r
zn must be > 0: %rg g ?z cutoff must be in [0.0, 1.0]: %rc S s g | ] \}}|qS r r )rZ ZscorerE r r r
s z%get_close_matches..)
ValueErrorr r r r_ r^ r] r) _nlargest)ZwordZ
possibilitiesr3 cutoffresultsrE r r r r s
c C s4 dt | }}x ||k r.| | |kr.|d7 }qW |S )z}
Return number of `ch` characters at the start of `line`.
Example:
>>> _count_leading(' abc', ' ')
3
r
r% )r. )linechr0 r3 r r r _count_leading s
rm c @ sJ e Zd ZdZdddZdd Zdd Zd d
Zd d Zd
d Z dd Z
dS )r a
Differ is a class for comparing sequences of lines of text, and
producing human-readable differences or deltas. Differ uses
SequenceMatcher both to compare sequences of lines, and to compare
sequences of characters within similar (near-matching) lines.
Each line of a Differ delta begins with a two-letter code:
'- ' line unique to sequence 1
'+ ' line unique to sequence 2
' ' line common to both sequences
'? ' line not present in either input sequence
Lines beginning with '? ' attempt to guide the eye to intraline
differences, and were not present in either input sequence. These lines
can be confusing if the sequences contain tab characters.
Note that Differ makes no claim to produce a *minimal* diff. To the
contrary, minimal diffs are often counter-intuitive, because they synch
up anywhere possible, sometimes accidental matches 100 pages apart.
Restricting synch points to contiguous matches preserves some notion of
locality, at the occasional cost of producing a longer diff.
Example: Comparing two texts.
First we set up the texts, sequences of individual single-line strings
ending with newlines (such sequences can also be obtained from the
`readlines()` method of file-like objects):
>>> text1 = ''' 1. Beautiful is better than ugly.
... 2. Explicit is better than implicit.
... 3. Simple is better than complex.
... 4. Complex is better than complicated.
... '''.splitlines(keepends=True)
>>> len(text1)
4
>>> text1[0][-1]
'\n'
>>> text2 = ''' 1. Beautiful is better than ugly.
... 3. Simple is better than complex.
... 4. Complicated is better than complex.
... 5. Flat is better than nested.
... '''.splitlines(keepends=True)
Next we instantiate a Differ object:
>>> d = Differ()
Note that when instantiating a Differ object we may pass functions to
filter out line and character 'junk'. See Differ.__init__ for details.
Finally, we compare the two:
>>> result = list(d.compare(text1, text2))
'result' is a list of strings, so let's pretty-print it:
>>> from pprint import pprint as _pprint
>>> _pprint(result)
[' 1. Beautiful is better than ugly.\n',
'- 2. Explicit is better than implicit.\n',
'- 3. Simple is better than complex.\n',
'+ 3. Simple is better than complex.\n',
'? ++\n',
'- 4. Complex is better than complicated.\n',
'? ^ ---- ^\n',
'+ 4. Complicated is better than complex.\n',
'? ++++ ^ ^\n',
'+ 5. Flat is better than nested.\n']
As a single multi-line string it looks like this:
>>> print(''.join(result), end="")
1. Beautiful is better than ugly.
- 2. Explicit is better than implicit.
- 3. Simple is better than complex.
+ 3. Simple is better than complex.
? ++
- 4. Complex is better than complicated.
? ^ ---- ^
+ 4. Complicated is better than complex.
? ++++ ^ ^
+ 5. Flat is better than nested.
Methods:
__init__(linejunk=None, charjunk=None)
Construct a text differencer, with optional filters.
compare(a, b)
Compare two sequences of lines; generate the resulting delta.
Nc C s || _ || _dS )a
Construct a text differencer, with optional filters.
The two optional keyword parameters are for filter functions:
- `linejunk`: A function that should accept a single string argument,
and return true iff the string is junk. The module-level function
`IS_LINE_JUNK` may be used to filter out lines without visible
characters, except for at most one splat ('#'). It is recommended
to leave linejunk None; the underlying SequenceMatcher class has
an adaptive notion of "noise" lines that's better than any static
definition the author has ever been able to craft.
- `charjunk`: A function that should accept a string of length 1. The
module-level function `IS_CHARACTER_JUNK` may be used to filter out
whitespace characters (a blank or tab; **note**: bad idea to include
newline in this!). Use of IS_CHARACTER_JUNK is recommended.
N)linejunkcharjunk)r rn ro r r r r M s zDiffer.__init__c
c s t | j||}x|j D ]\}}}}}|dkrD| j||||||} n\|dkr^| jd|||} nB|dkrx| jd|||} n(|dkr| jd|||} ntd|f | E d H qW d S )
a
Compare two sequences of lines; generate the resulting delta.
Each sequence must contain individual single-line strings ending with
newlines. Such sequences can be obtained from the `readlines()` method
of file-like objects. The delta generated also consists of newline-
terminated strings, ready to be printed as-is via the writeline()
method of a file-like object.
Example:
>>> print(''.join(Differ().compare('one\ntwo\nthree\n'.splitlines(True),
... 'ore\ntree\nemu\n'.splitlines(True))),
... end="")
- one
? ^
+ ore
? ^
- two
- three
? -
+ tree
+ emu
rK rL -rM +rN zunknown tag %rN)r rn rS _fancy_replace_dumprf )
r r r cruncherrR r7 r8 r9 r: gr r r compared s zDiffer.comparec c s* x$t ||D ]}d||| f V q W dS )z4Generate comparison results for a same-tagged range.z%s %sN)r5 )r rR rE lohir0 r r r rt s z Differ._dumpc
c s ||k r||k st || || k rF| jd|||}| jd|||}n | jd|||}| jd|||}x||fD ]} | E d H qpW d S )Nrq rp )AssertionErrorrt )
r r r7 r8 r r9 r: firstsecondrv r r r _plain_replace s zDiffer._plain_replacec c sH d\}}t | j} d\}
} xt||D ]} || }
| j|
xxt||D ]j}|| }||
krp|
dkrH|| }
} qH| j| | j |krH| j |krH| j |krH| j || }}}qHW q&W ||k r|
dkr| j||||||E dH dS |
| d }}}nd}
| j ||||||E dH || || }}|
dkrd }}| j
|| x| j D ]\}}}}}|| || }} |dkr|d| 7 }|d| 7 }nb|dkr|d | 7 }nJ|d
kr|d | 7 }n2|d kr|d
| 7 }|d
| 7 }nt d|f qTW | j
||||E dH n
d| V | j ||d |||d |E dH dS )aL
When replacing one block of lines with another, search the blocks
for *similar* lines; the best-matching pair (if any) is used as a
synch point, and intraline difference marking is done on the
similar pair. Lots of work, but often worth it.
Example:
>>> d = Differ()
>>> results = d._fancy_replace(['abcDefghiJkl\n'], 0, 1,
... ['abcdefGhijkl\n'], 0, 1)
>>> print(''.join(results), end="")
- abcDefghiJkl
? ^ ^ ^
+ abcdefGhijkl
? ^ ^ ^
Gz? ?Ng ?r rK ^rL rp rM rq rN rr zunknown tag %rz r% )r~ r )NN)r ro r5 r r r_ r^ r] r}
_fancy_helperr rS rf _qformat) r r r7 r8 r r9 r: Z
best_ratiorh ru ZeqiZeqjr; rP r0 rO Zbest_iZbest_jZaeltZbeltatagsbtagsrR Zai1Zai2Zbj1Zbj2rC rD r r r rs sX
zDiffer._fancy_replacec c sb g }||k r<||k r*| j ||||||}qT| jd|||}n||k rT| jd|||}|E d H d S )Nrp rq )rs rt )r r r7 r8 r r9 r: rv r r r r s zDiffer._fancy_helperc c s t t|dt|d}t |t|d| d}t |t|d| d}||d j }||d j }d| V |rdd| |f V d| V |rdd| |f V dS )a
Format "?" output and deal with leading tabs.
Example:
>>> d = Differ()
>>> results = d._qformat('\tabcDefghiJkl\n', '\tabcdefGhijkl\n',
... ' ^ ^ ^ ', ' ^ ^ ^ ')
>>> for line in results: print(repr(line))
...
'- \tabcDefghiJkl\n'
'? \t ^ ^ ^\n'
'+ \tabcdefGhijkl\n'
'? \t ^ ^ ^\n'
Nrr z- z? %s%s
z+ )rW rm rstrip)r ZalineZbliner r commonr r r r
s
zDiffer._qformat)NN) r` ra rb rc r rw rt r} rs r r r r r r r s \
)^ Nz
\s*(?:#\s*)?$c C s || dk S )z
Return 1 for ignorable line: iff `line` is blank or contains a single '#'.
Examples:
>>> IS_LINE_JUNK('\n')
True
>>> IS_LINE_JUNK(' # \n')
True
>>> IS_LINE_JUNK('hello\n')
False
Nr )rk Zpatr r r r > s c C s | |kS )z
Return 1 for ignorable character: iff `ch` is a space or tab.
Examples:
>>> IS_CHARACTER_JUNK(' ')
True
>>> IS_CHARACTER_JUNK('\t')
True
>>> IS_CHARACTER_JUNK('\n')
False
>>> IS_CHARACTER_JUNK('x')
False
r )rl Zwsr r r r N s c C s: | d }|| }|dkr"dj |S |s.|d8 }dj ||S )z Convert range to the "ed" formatr% z{}z{},{})format)startstop beginningr r r r _format_range_unifiede s
r r
c c sh t | |||||| d}xHtd| |j|D ]0} |sd}|rJdj|nd}
|r\dj|nd} dj||
|V dj|| |V | d | d } }
t| d |
d
}t| d |
d }d
j|||V x| D ]\}}}}}|dkrx | || D ]}d| V qW q|dkr2x | || D ]}d| V q W |dkrx ||| D ]}d| V qHW qW q.W dS )a
Compare two sequences of lines; generate the delta as a unified diff.
Unified diffs are a compact way of showing line changes and a few
lines of context. The number of context lines is set by 'n' which
defaults to three.
By default, the diff control lines (those with ---, +++, or @@) are
created with a trailing newline. This is helpful so that inputs
created from file.readlines() result in diffs that are suitable for
file.writelines() since both the inputs and outputs have trailing
newlines.
For inputs that do not have trailing newlines, set the lineterm
argument to "" so that the output will be uniformly newline free.
The unidiff format normally has a header for filenames and modification
times. Any or all of these may be specified using strings for
'fromfile', 'tofile', 'fromfiledate', and 'tofiledate'.
The modification times are normally expressed in the ISO 8601 format.
Example:
>>> for line in unified_diff('one two three four'.split(),
... 'zero one tree four'.split(), 'Original', 'Current',
... '2005-01-26 23:30:50', '2010-04-02 10:20:52',
... lineterm=''):
... print(line) # doctest: +NORMALIZE_WHITESPACE
--- Original 2005-01-26 23:30:50
+++ Current 2010-04-02 10:20:52
@@ -1,4 +1,4 @@
+zero
one
-two
-three
+tree
four
FNTz {}r z
--- {}{}{}z
+++ {}{}{}r
r% rT z@@ -{} +{} @@{}rN rr rK rL rp rM rq rU > rL rK > rK rM ) _check_typesr rY r r )r r fromfiletofile fromfiledate
tofiledater3 linetermstartedrX fromdatetodater{ last file1_range file2_rangerR rF rH rG rI rk r r r r p s0 )
c C sB | d }|| }|s |d8 }|dkr.dj |S dj ||| d S )z Convert range to the "ed" formatr% z{}z{},{})r )r r r r r r r _format_range_context s
r c c s t | |||||| tddddd}d} xztd| |j|D ]b}
| sd} |rZd j|nd
} |rld j|nd
} d j|| |V d j|| |V |
d
|
d }
}d| V t|
d |d }dj||V tdd |
D r&xD|
D ]<\}}}}}|dkrx$| || D ]}|| | V q
W qW t|
d |d }dj||V tdd |
D r>xH|
D ]@\}}}}}|dkr^x$||| D ]}|| | V qW q^W q>W dS )ah
Compare two sequences of lines; generate the delta as a context diff.
Context diffs are a compact way of showing line changes and a few
lines of context. The number of context lines is set by 'n' which
defaults to three.
By default, the diff control lines (those with *** or ---) are
created with a trailing newline. This is helpful so that inputs
created from file.readlines() result in diffs that are suitable for
file.writelines() since both the inputs and outputs have trailing
newlines.
For inputs that do not have trailing newlines, set the lineterm
argument to "" so that the output will be uniformly newline free.
The context diff format normally has a header for filenames and
modification times. Any or all of these may be specified using
strings for 'fromfile', 'tofile', 'fromfiledate', and 'tofiledate'.
The modification times are normally expressed in the ISO 8601 format.
If not specified, the strings default to blanks.
Example:
>>> print(''.join(context_diff('one\ntwo\nthree\nfour\n'.splitlines(True),
... 'zero\none\ntree\nfour\n'.splitlines(True), 'Original', 'Current')),
... end="")
*** Original
--- Current
***************
*** 1,4 ****
one
! two
! three
four
--- 1,4 ----
+ zero
one
! tree
four
z+ z- z! z )rM rL rK rN FNTz {}r z
*** {}{}{}z
--- {}{}{}r
r% z***************r z
*** {} ****{}c s s | ]\}}}}}|dkV qdS )rK rL N> rL rK r )rZ rR _r r r r[ s z context_diff..rM rT r z
--- {} ----{}c s s | ]\}}}}}|dkV qdS )rK rM N> rK rM r )rZ rR r r r r r[ s rL rU )r dictr rY r r any)r r r r r r r3 r prefixr rX r r r{ r r rR rF rH r rk r rG rI r r r r s4 ,
c G s | r2t | d t r2tdt| d j| d f |rdt |d t rdtdt|d j|d f x$|D ] }t |tsjtd|f qjW d S )Nr
z)lines to compare must be str, not %s (%r)z"all arguments must be str, not: %r)
isinstancestr TypeErrortyper` )r r argsargr r r r s
r
c c s dd } t t| |}t t| |}| |}| |}| |}| |}| |}| ||||||||}
x|
D ]} | jddV qhW dS )a
Compare `a` and `b`, two sequences of lines represented as bytes rather
than str. This is a wrapper for `dfunc`, which is typically either
unified_diff() or context_diff(). Inputs are losslessly converted to
strings so that `dfunc` only has to worry about strings, and encoded
back to bytes on return. This is necessary to compare files with
unknown or inconsistent encoding. All other inputs (except `n`) must be
bytes rather than str.
c S sP y | j ddS tk
rJ } z"dt| j| f }t||W Y d d }~X nX d S )Nasciisurrogateescapez(all arguments must be bytes, not %s (%r))decodeAttributeErrorr r` r )rj errmsgr r r r - s zdiff_bytes..decoder r N)r@ rA encode) Zdfuncr r r r r r r3 r r linesrk r r r r
" s
c C s t ||j| |S )aJ
Compare `a` and `b` (lists of strings); return a `Differ`-style delta.
Optional keyword parameters `linejunk` and `charjunk` are for filter
functions, or can be None:
- linejunk: A function that should accept a single string argument and
return true iff the string is junk. The default is None, and is
recommended; the underlying SequenceMatcher class has an adaptive
notion of "noise" lines.
- charjunk: A function that accepts a character (string of length
1), and returns true iff the character is junk. The default is
the module-level function IS_CHARACTER_JUNK, which filters out
whitespace characters (a blank or tab; note: it's a bad idea to
include newline in this!).
Tools/scripts/ndiff.py is a command-line front-end to this function.
Example:
>>> diff = ndiff('one\ntwo\nthree\n'.splitlines(keepends=True),
... 'ore\ntree\nemu\n'.splitlines(keepends=True))
>>> print(''.join(diff), end="")
- one
? ^
+ ore
? ^
- two
- three
? -
+ tree
+ emu
)r rw )r r rn ro r r r r @ s #c # s ddl }|jdt| |||ddgffdd fdd fdd }| }|dkrj|E dH n.|d
7 }d}x ddg| } }
d } xR| d kryt|\} }
} W n tk
r dS X | | }| |
| f|
|< | d
7 } qW | |k rd V |}n| }d} x.|r.| | }| d
7 } |
| V |d
8 }qW |d
}yDx>|rxt|\} }
} | r`|d
}n|d
8 }| |
| fV q._make_line..record_sub_info rr )r> subreversed) r Z
format_keysideZ num_linestextZmarkersr r keyZbeginend) change_rer r
_make_line s 4z_mdiff.._make_linec 3 s g } d\}}xlx t | dk r0| jtd qW djdd | D }|jdrX|}n|jdr | dd | dd d
fV qn|jd r|d 8 } | d dd
d
fV qnl|jdrވ | d dd
}}|d d }}n>|jdr | d
d | dd d
fV qn|jdr8 | dd | d
d d
fV qn|jd rd|d 8 } | d dd
d
fV qn|jdr|d 7 }d
| dd d
fV qn|jd rd
| dd }}|d d }}n^|jdr|d 7 }d
| dd d
fV qn2|jdr | d
d
d
d | d
d dfV qx |dk r:|d 7 }d V q W x |dkrZ|d 8 }d V q>W |jdrld
S ||d
fV qW d
S )!a Yields from/to lines of text with a change indication.
This function is an iterator. It itself pulls lines from a
differencing iterator, processes them and yields them. When it can
it yields both a "from" and a "to" line, otherwise it will yield one
or the other. In addition to yielding the lines of from/to text, a
boolean flag is yielded to indicate if the text line(s) have
differences in them.
Note, this function is purposefully not defined at the module scope so
that data it needs from its parent function (within whose context it
is defined) does not need to be of module scope.
r
r Xr c S s g | ] }|d qS )r
r )rZ rk r r r re s z2_mdiff.._line_iterator..z-?+?r r% Tz--++rp N--?+--+- z-+?z-?+z+--rq + +-rr Fr )r
r
)r r r )r r r r )Nr Tr r )r NT)r. r) nextjoin
startswith)r Znum_blanks_pendingZnum_blanks_to_yieldrj from_lineto_line)r diff_lines_iteratorr r _line_iterator sf
$ z _mdiff.._line_iteratorc 3 s } g g }}xxpt |dks,t |dkryt| \}}}W n tk
rR dS X |dk rj|j||f |dk r|j||f qW |jd\}}|jd\}}|||p|fV qW dS )at Yields from/to lines of text with a change indication.
This function is an iterator. It itself pulls lines from the line
iterator. Its difference from that iterator is that this function
always yields a pair of from/to text lines (with the change
indication). If necessary it will collect single from/to lines
until it has a matching pair from/to pair to yield.
Note, this function is purposefully not defined at the module scope so
that data it needs from its parent function (within whose context it
is defined) does not need to be of module scope.
r
N)r. r
StopIterationr) r> )Z
line_iterator fromlinestolinesr r
found_diffZfromDiffZto_diff)r r r _line_pair_iterator s
z#_mdiff.._line_pair_iteratorr% F)NNN)recompiler r r )r r contextrn ro r r Zline_pair_iteratorZlines_to_writeindexZ contextLinesr r r r0 r )r r r r r _mdiffe sT "
8X !
r an
%(table)s%(legend)s
aH
table.diff {font-family:Courier; border:medium;}
.diff_header {background-color:#e0e0e0}
td.diff_header {text-align:right}
.diff_next {background-color:#c0c0c0}
.diff_add {background-color:#aaffaa}
.diff_chg {background-color:#ffff77}
.diff_sub {background-color:#ffaaaa}aZ
%(header_row)s
%(data_rows)s
a
| Legends |
| Colors |
|---|
| Added |
| Changed |
| Deleted |
|
| Links |
|---|
| (f)irst change |
| (n)ext change |
| (t)op |
|
c @ s e Zd ZdZeZeZeZeZdZddde fddZ
d d
d d d
Z dd Z dd Z
dd Zdd Zdd Zdd Zdd Zd d d ZdS ) r a{ For producing HTML side by side comparison with change highlights.
This class can be used to create an HTML table (or a complete HTML file
containing the table) showing a side by side, line by line comparison
of text with inter-line and intra-line change highlights. The table can
be generated in either full or contextual difference mode.
The following methods are provided for HTML generation:
make_table -- generates HTML for a single side by side table
make_file -- generates complete HTML file with a single side by side table
See tools/scripts/diff.py for an example usage of this class.
r
Nc C s || _ || _|| _|| _dS )a HtmlDiff instance initializer
Arguments:
tabsize -- tab stop spacing, defaults to 8.
wrapcolumn -- column number where lines are broken and wrapped,
defaults to None where lines are not wrapped.
linejunk,charjunk -- keyword arguments passed into ndiff() (used by
HtmlDiff() to generate the side by side HTML differences). See
ndiff() documentation for argument default values and descriptions.
N)_tabsize _wrapcolumn _linejunk _charjunk)r tabsizeZ
wrapcolumnrn ro r r r r s zHtmlDiff.__init__r F zutf-8)charsetc C s: | j t| j| j| j||||||d|d j|dj|S )a Returns HTML file of side by side comparison with change highlights
Arguments:
fromlines -- list of "from" lines
tolines -- list of "to" lines
fromdesc -- "from" file column header string
todesc -- "to" file column header string
context -- set to True for contextual differences (defaults to False
which shows full differences).
numlines -- number of context lines. When context is set True,
controls number of lines displayed before and after the change.
When context is False, controls the number of lines to place
the "next" link anchors before the next change (so click of
"next" link jumps to just before the change).
charset -- charset of the HTML document
)r numlines)ZstylesZlegendtabler xmlcharrefreplace)_file_templater _styles_legend
make_tabler r )r r r fromdesctodescr r r r r r make_file s
zHtmlDiff.make_filec s8 fdd fdd|D } fdd|D }||fS )a Returns from/to line lists with tabs expanded and newlines removed.
Instead of tab characters being replaced by the number of spaces
needed to fill in to the next tab stop, this function will fill
the space with tab characters. This is done so that the difference
algorithms can identify changes in a file when tabs are replaced by
spaces and vice versa. At the end of the HTML generation, the tab
characters will be replaced with a nonbreakable space.
c s6 | j dd} | j j} | j dd} | j ddjdS )Nrr r r r )rK
expandtabsr r )rk )r r r expand_tabs s z2HtmlDiff._tab_newline_replace..expand_tabsc s g | ] } |qS r r )rZ rk )r r r re s z1HtmlDiff._tab_newline_replace..c s g | ] } |qS r r )rZ rk )r r r re s r )r r r r )r r r _tab_newline_replace s
z HtmlDiff._tab_newline_replacec C s |s|j ||f dS t|}| j}||ksB||jdd |krT|j ||f dS d}d}d}xd||k r||k r|| dkr|d7 }|| }|d7 }qb|| dkr|d7 }d}qb|d7 }|d7 }qbW |d| } ||d }
|r| d } d| |
}
|j || f | j|d|
dS ) a Builds list of text lines by splitting text lines at wrap point
This function will determine if the input text line needs to be
wrapped (split) into separate lines. If so, the first wrap point
will be determined and the first line appended to the output
text line list. This function is used recursively to handle
the second part of the split line to further split it.
Nr rT r
r r% r >)r) r. r count _split_line) r Z data_listZline_numr rQ rV r0 r3 ZmarkZline1Zline2r r r r s8
zHtmlDiff._split_linec c s x|D ]\}}}|dkr&|||fV q|| \}}\}}g g } }
| j | || | j |
|| x@| sh|
r| rx| jd}nd}|
r|
jd}nd}|||fV q`W qW dS )z5Returns iterator that splits (wraps) mdiff text linesNr
r rr )r rr )r rr )r r> ) r diffsfromdatatodataflagZfromlineZfromtextZtolineZtotextfromlisttolistr r r
_line_wrapper; s
zHtmlDiff._line_wrapperc C s g g g }}}xz|D ]r\}}}y4|j | jd|f| |j | jd|f| W n( tk
r| |j d |j d Y nX |j | qW |||fS )zCollects mdiff output into separate lists
Before storing the mdiff from/to data into a list, it is converted
into a single line of text with HTML markup.
r
r% N)r) _format_liner )r r r r flaglistr r r r r r _collect_linesW s
zHtmlDiff._collect_linesc C sr y d| }d| j | |f }W n tk
r6 d}Y nX |jddjddjdd }|jd
d j }d |||f S )
a Returns HTML markup of "from" / "to" text lines
side -- 0 or 1 indicating "from" or "to" text
flag -- indicates if difference on line
linenum -- line number (used for line number column)
text -- line text to be marked up
z%dz
id="%s%s"r &z&r z>