`difflib.get_close_matches` performance

[dg-pb]

Feature or enhancement

Proposal:

1. s.ratio() is calculated twice

def get_close_matches(...):
    ...
    for x in possibilities:
        s.set_seq1(x)
        if s.real_quick_ratio() >= cutoff and \
           s.quick_ratio() >= cutoff and \
           s.ratio() >= cutoff:
            result.append((s.ratio(), x))
    ...

2. avail.__contains__ is slower than in operator

    def quick_ration(self):
        ...
        availhas, matches = avail.__contains__, 0
        for elt in self.a:
            if availhas(elt):
                numb = avail[elt]
        ...

Has this already been discussed elsewhere?

This is a minor feature, which does not need previous discussion elsewhere

Links to previous discussion of this feature:

No response

Linked PRs

• gh-142939: difflib.get_close_matches performance #142940