Method: difflib.SequenceMatcher.real_quick_ratio
Calls: 758, Exceptions: 0, Paths: 1Back
Path 1: 758 calls (1.0)
1.0 (212) 0.935064935064935 (56) 0.8918918918918919 (38) 0.96 (37) 0.972972972972973 (37) 0.9565217391304348 (37) 0.9090909090909091 (30) 0.8888888888...
1def real_quick_ratio(self):
2 """Return an upper bound on ratio() very quickly.
3
4 This isn't defined beyond that it is an upper bound on .ratio(), and
5 is faster to compute than either .ratio() or .quick_ratio().
6 """
7
8 la, lb = len(self.a), len(self.b)
9 # can't have more matches than the number of elements in the
10 # shorter sequence
11 return _calculate_ratio(min(la, lb), la + lb)