(self, candidate)
return (
            has_allowed_hash, yank_value, binary_preference, candidate.version,
            build_tag, pri,
        )
Function to pass as the `key` argument to a call to sorted() to sort
        InstallationCandidates by preference.

        Returns a tuple such that tuples sorting as greater using Python's
        default comparison operator are more preferred.

        The preference is as follows:

        First and foremost, candidates with allowed (matching) hashes are
        always preferred over candidates without matching hashes. This is
        because e.g. if the only candidate with an allowed hash is yanked,
        we still want to use that candidate.

        Second, excepting hash considerations, candidates that have been
        yanked (in the sense of PEP 592) are always less preferred than
        candidates that haven't been yanked. Then:

        If not finding wheels, they are sorted by version only.
        If finding wheels, then the sort order is by version, then:
          1. existing installs
          2. wheels ordered via Wheel.support_index_min(self._supported_tags)
          3. source archives
        If prefer_binary was set, then all wheels are sorted above sources.

        Note: it was considered to embed this logic into the Link
              comparison operators, but then different sdist links
              with the same version, would have to be considered equal
Function to pass as the `key` argument to a call to sorted() to sort
        InstallationCandidates by preference.
Function to pass as the key argument to a call to sorted () to sort InstallationCandidates by preference .
def _sort_key(self, candidate):
        # type: (InstallationCandidate) -> CandidateSortingKey
        """
        Function to pass as the `key` argument to a call to sorted() to sort
        InstallationCandidates by preference.

        Returns a tuple such that tuples sorting as greater using Python's
        default comparison operator are more preferred.

        The preference is as follows:

        First and foremost, candidates with allowed (matching) hashes are
        always preferred over candidates without matching hashes. This is
        because e.g. if the only candidate with an allowed hash is yanked,
        we still want to use that candidate.

        Second, excepting hash considerations, candidates that have been
        yanked (in the sense of PEP 592) are always less preferred than
        candidates that haven't been yanked. Then:

        If not finding wheels, they are sorted by version only.
        If finding wheels, then the sort order is by version, then:
          1. existing installs
          2. wheels ordered via Wheel.support_index_min(self._supported_tags)
          3. source archives
        If prefer_binary was set, then all wheels are sorted above sources.

        Note: it was considered to embed this logic into the Link
              comparison operators, but then different sdist links
              with the same version, would have to be considered equal
        """
        valid_tags = self._supported_tags
        support_num = len(valid_tags)
        build_tag = tuple()  # type: BuildTag
        binary_preference = 0
        link = candidate.link
        if link.is_wheel:
            # can raise InvalidWheelFilename
            wheel = Wheel(link.filename)
            if not wheel.supported(valid_tags):
                raise UnsupportedWheel(
                    "%s is not a supported wheel for this platform. It "
                    "can't be sorted." % wheel.filename
                )
            if self._prefer_binary:
                binary_preference = 1
            pri = -(wheel.support_index_min(valid_tags))
            if wheel.build_tag is not None:
                match = re.match(r'^(\d+)(.*)$', wheel.build_tag)
                build_tag_groups = match.groups()
                build_tag = (int(build_tag_groups[0]), build_tag_groups[1])
        else:  # sdist
            pri = -(support_num)
        has_allowed_hash = int(link.is_hash_allowed(self._hashes))
        yank_value = -1 * int(link.is_yanked)  # -1 for yanked.
        return (
            has_allowed_hash, yank_value, binary_preference, candidate.version,
            build_tag, pri,
        )
def _sort_key ( self , candidate ) : # type: (InstallationCandidate) -> CandidateSortingKey valid_tags = self . _supported_tags support_num = len ( valid_tags ) build_tag = tuple ( ) # type: BuildTag binary_preference = 0 link = candidate . link if link . is_wheel : # can raise InvalidWheelFilename wheel = Wheel ( link . filename ) if not wheel . supported ( valid_tags ) : raise UnsupportedWheel ( "%s is not a supported wheel for this platform. It " "can't be sorted." % wheel . filename ) if self . _prefer_binary : binary_preference = 1 pri = - ( wheel . support_index_min ( valid_tags ) ) if wheel . build_tag is not None : match = re . match ( r'^(\d+)(.*)$' , wheel . build_tag ) build_tag_groups = match . groups ( ) build_tag = ( int ( build_tag_groups [ 0 ] ) , build_tag_groups [ 1 ] ) else : # sdist pri = - ( support_num ) has_allowed_hash = int ( link . is_hash_allowed ( self . _hashes ) ) yank_value = - 1 * int ( link . is_yanked ) # -1 for yanked. return ( has_allowed_hash , yank_value , binary_preference , candidate . version , build_tag , pri , )