@@ -115,38 +115,6 @@ class SequenceMatcher:
115
115
case. SequenceMatcher is quadratic time for the worst case and has
116
116
expected-case behavior dependent in a complicated way on how many
117
117
elements the sequences have in common; best case time is linear.
118
-
119
- Methods:
120
-
121
- __init__(isjunk=None, a='', b='')
122
- Construct a SequenceMatcher.
123
-
124
- set_seqs(a, b)
125
- Set the two sequences to be compared.
126
-
127
- set_seq1(a)
128
- Set the first sequence to be compared.
129
-
130
- set_seq2(b)
131
- Set the second sequence to be compared.
132
-
133
- find_longest_match(alo=0, ahi=None, blo=0, bhi=None)
134
- Find longest matching block in a[alo:ahi] and b[blo:bhi].
135
-
136
- get_matching_blocks()
137
- Return list of triples describing matching subsequences.
138
-
139
- get_opcodes()
140
- Return list of 5-tuples describing how to turn a into b.
141
-
142
- ratio()
143
- Return a measure of the sequences' similarity (float in [0,1]).
144
-
145
- quick_ratio()
146
- Return an upper bound on .ratio() relatively quickly.
147
-
148
- real_quick_ratio()
149
- Return an upper bound on ratio() very quickly.
150
118
"""
151
119
152
120
def __init__ (self , isjunk = None , a = '' , b = '' , autojunk = True ):
@@ -837,14 +805,6 @@ class Differ:
837
805
+ 4. Complicated is better than complex.
838
806
? ++++ ^ ^
839
807
+ 5. Flat is better than nested.
840
-
841
- Methods:
842
-
843
- __init__(linejunk=None, charjunk=None)
844
- Construct a text differencer, with optional filters.
845
-
846
- compare(a, b)
847
- Compare two sequences of lines; generate the resulting delta.
848
808
"""
849
809
850
810
def __init__ (self , linejunk = None , charjunk = None ):
0 commit comments