-1
# l=JJj"T^Tţ
h 50
%
H403
358a=JJj"TƃqTţ f
403 Forbidden
Forbidden
You don't have permission to access this resource.
Additionally, a 403 Forbidden
error was encountered while trying to use an ErrorDocument to handle the request.
355þ c
404 Not Found
Not Found
The requested URL was not found on this server.
Additionally, a 404 Not Found
error was encountered while trying to use an ErrorDocument to handle the request.
! l=JJj"TƃqTţ
0ǿ $ lY> je8Cqn1h
m{ ? a
ikE @ s0 d Z g dZddlmZ ddlmZ ddlm Z eddZ
dd Z G d
d d Z d:ddZ
dd ZG dd dZddlZedjfddZd;ddZdd Zdd)d*Zdefd+d,Zddefd-d.Z d/Z d0Z d1Z d2Z G d3d4 d4e!Z"[d5d6 Z#d7d8 Z$e%d9kr,e$ dS )?ae
Module difflib -- helpers for computing deltas between objects.
Function get_close_matches(word, possibilities, n=3, cutoff=0.6):
Use SequenceMatcher to return list of the best "good enough" matches.
Function context_diff(a, b):
For two lists of strings, return a delta in context diff format.
Function ndiff(a, b):
Return a delta: the difference between `a` and `b` (lists of strings).
Function restore(delta, which):
Return one of the two sequences that generated an ndiff delta.
Function unified_diff(a, b):
For two lists of strings, return a delta in unified diff format.
Class SequenceMatcher:
A flexible class for comparing pairs of sequences of any type.
Class Differ:
For producing human-readable deltas from sequences of lines of text.
Class HtmlDiff:
For producing HTML side by side comparison with change highlights.
) get_close_matchesndiffrestoreSequenceMatcherDifferIS_CHARACTER_JUNK IS_LINE_JUNK context_diff unified_diff
diff_bytesHtmlDiffMatch )nlargest)
namedtuple) GenericAliasr za b sizec C s |rd| | S dS )Ng @ ? )matcheslengthr r /usr/lib64/python3.9/difflib.py_calculate_ratio' s r c @ s~ e Zd ZdZd ddZdd Zd d
Zd d Zd
d Zd ddZ dd Z
dd Z d!ddZ dd Z
dd Zd d ZeeZdS )"r ao
SequenceMatcher is a flexible class for comparing pairs of sequences of
any type, so long as the sequence elements are hashable. The basic
algorithm predates, and is a little fancier than, an algorithm
published in the late 1980's by Ratcliff and Obershelp under the
hyperbolic name "gestalt pattern matching". The basic idea is to find
the longest contiguous matching subsequence that contains no "junk"
elements (R-O doesn't address junk). The same idea is then applied
recursively to the pieces of the sequences to the left and to the right
of the matching subsequence. This does not yield minimal edit
sequences, but does tend to yield matches that "look right" to people.
SequenceMatcher tries to compute a "human-friendly diff" between two
sequences. Unlike e.g. UNIX(tm) diff, the fundamental notion is the
longest *contiguous* & junk-free matching subsequence. That's what
catches peoples' eyes. The Windows(tm) windiff has another interesting
notion, pairing up elements that appear uniquely in each sequence.
That, and the method here, appear to yield more intuitive difference
reports than does diff. This method appears to be the least vulnerable
to syncing up on blocks of "junk lines", though (like blank lines in
ordinary text files, or maybe "" lines in HTML