chore(deps): update actions/setup-python action to v6.2.0

[renovate]

This PR contains the following updates:

Package	Type	Update	Change
actions/setup-python	action	minor	v6.0.0 → v6.2.0

---

Release Notes

actions/setup-python (actions/setup-python)

v6.2.0

Compare Source

v6.1.0

Compare Source

What's Changed

Enhancements:

• Add support for pip-install input by @​gowridurgad in #​1201
• Add graalpy early-access and windows builds by @​timfel in #​880

Dependency and Documentation updates:

• Enhanced wording and updated example usage for allow-prereleases by @​yarikoptic in #​979
• Upgrade urllib3 from 1.26.19 to 2.5.0 and document breaking changes in v6 by @​dependabot in #​1139
• Upgrade typescript from 5.4.2 to 5.9.3 and Documentation update by @​dependabot in #​1094
• Upgrade actions/publish-action from 0.3.0 to 0.4.0 & Documentation update for pip-install input by @​dependabot in #​1199
• Upgrade requests from 2.32.2 to 2.32.4 by @​dependabot in #​1130
• Upgrade prettier from 3.5.3 to 3.6.2 by @​dependabot in #​1234
• Upgrade @​types/node from 24.1.0 to 24.9.1 and update macos-13 to macos-15-intel by @​dependabot in #​1235

New Contributors

• @​yarikoptic made their first contribution in #​979

Full Changelog: actions/setup-python@v6...v6.1.0

---

Configuration

📅 Schedule: Branch creation - At any time (no schedule defined), Automerge - At any time (no schedule defined).

🚦 Automerge: Enabled.

♻ Rebasing: Whenever PR is behind base branch, or you tick the rebase/retry checkbox.

🔕 Ignore: Close this PR and you won't be reminded about this update again.

---

• If you want to rebase/retry this PR, check this box

---

This PR was generated by Mend Renovate. View the repository job log.

[codecov]

❌ 1 Tests Failed:

Tests completed	Failed	Passed	Skipped
121	1	120	0

View the top 1 failed test(s) by shortest run time

tests/test_ruleset.py::test_solve_total_value[HIGHS]

Stack Traces | 0.092s run time

ruleset = RuleSet(numbers=13, repeats=2, colours=4, jokers=2, min_len=3, min_initial_value=30, solver_backend=<MILPSolver.HIGHS: 'HIGHS'>)
in_progress_game = <GameState([... 53 tiles ...], table=(<Black 1 (1)>, <Black 2 (2)>, <Black 3 (3)>, <Black 4 (4)>, <Black 5 (5)>, <Blac... 9 (35)>, <Orange 12 (38)>, <Orange 12 (38)>, <Red 2 (41)>, <Red 4 (43)>, <Red 7 (46)>, <Red 12 (51)>), initial=False)>

    #x1B[0m#x1B[94mdef#x1B[39;49;00m#x1B[90m #x1B[39;49;00m#x1B[92mtest_solve_total_value#x1B[39;49;00m(ruleset: RuleSet, in_progress_game: GameState) -> #x1B[94mNone#x1B[39;49;00m:#x1B[90m#x1B[39;49;00m
        in_progress_game.initial = #x1B[94mFalse#x1B[39;49;00m#x1B[90m#x1B[39;49;00m
    #x1B[90m#x1B[39;49;00m
        solution = ruleset.solve(in_progress_game, mode=SolverMode.TOTAL_VALUE)#x1B[90m#x1B[39;49;00m
        #x1B[94massert#x1B[39;49;00m solution #x1B[95mis#x1B[39;49;00m #x1B[95mnot#x1B[39;49;00m #x1B[94mNone#x1B[39;49;00m#x1B[90m#x1B[39;49;00m
    #x1B[90m#x1B[39;49;00m
        #x1B[90m# backends may select different tiles, and differ in their ability to#x1B[39;49;00m#x1B[90m#x1B[39;49;00m
        #x1B[90m# maximize the total tile value, so we can, at best, include known values#x1B[39;49;00m#x1B[90m#x1B[39;49;00m
        #x1B[90m# for different solvers and use this as a range for any others. The exact#x1B[39;49;00m#x1B[90m#x1B[39;49;00m
        #x1B[90m# sets differ based on the tiles selected.#x1B[39;49;00m#x1B[90m#x1B[39;49;00m
        expected_tile_sum = {#x1B[90m#x1B[39;49;00m
            MILPSolver.CBC: #x1B[94m515#x1B[39;49;00m,#x1B[90m#x1B[39;49;00m
            #x1B[90m# MILPSolver.GLPK_MI  is either 515 _or_ 589, depending on the exact version installed.#x1B[39;49;00m#x1B[90m#x1B[39;49;00m
            MILPSolver.SCIPY: #x1B[94m515#x1B[39;49;00m,#x1B[90m#x1B[39;49;00m
            MILPSolver.HIGHS: #x1B[94m589#x1B[39;49;00m,#x1B[90m#x1B[39;49;00m
            MILPSolver.SCIP: #x1B[94m589#x1B[39;49;00m,#x1B[90m#x1B[39;49;00m
        }#x1B[90m#x1B[39;49;00m
        #x1B[94mif#x1B[39;49;00m expected := expected_tile_sum.get(ruleset.backend):#x1B[90m#x1B[39;49;00m
>           #x1B[94massert#x1B[39;49;00m #x1B[96msum#x1B[39;49;00m(solution.tiles) == expected#x1B[90m#x1B[39;49;00m
#x1B[1m#x1B[31mE           assert 515 == 589#x1B[0m
#x1B[1m#x1B[31mE            +  where 515 = sum([<Black 1 (1)>, <Black 3 (3)>, <Black 4 (4)>, <Black 10 (10)>, <Blue 1 (14)>, <Blue 2 (15)>, ...])#x1B[0m
#x1B[1m#x1B[31mE            +    where [<Black 1 (1)>, <Black 3 (3)>, <Black 4 (4)>, <Black 10 (10)>, <Blue 1 (14)>, <Blue 2 (15)>, ...] = ProposedSolution(tiles=[<Black 1 (1)>, <Black 3 (3)>, <Black 4 (4)>, <Black 10 (10)>, <Blue 1 (14)>, <Blue 2 (15)>, <Blue 8 (21)>, <Blue 10 (23)>, <Blue 13 (26)>, <Orange 3 (29)>, <Orange 5 (31)>, <Orange 7 (33)>, <Orange 7 (33)>, <Orange 8 (34)>, <Orange 9 (35)>, <Orange 9 (35)>, <Orange 12 (38)>, <Red 2 (41)>, <Red 4 (43)>, <Red 7 (46)>], sets=[(<Black 1 (1)>, <Black 2 (2)>, <Black 3 (3)>, <Black 4 (4)>), (<Black 1 (1)>, <Blue 1 (14)>, <Joker (53)>), (<Black 3 (3)>, <Blue 3 (16)>, <Orange 3 (29)>), (<Black 4 (4)>, <Blue 4 (17)>, <Red 4 (43)>), (<Black 5 (5)>, <Blue 5 (18)>, <Red 5 (44)>), (<Black 6 (6)>, <Black 7 (7)>, <Black 8 (8)>, <Black 9 (9)>, <Black 10 (10)>), (<Black 13 (13)>, <Blue 13 (26)>, <Red 13 (52)>), (<Blue 2 (15)>, <Orange 2 (28)>, <Red 2 (41)>), (<Blue 5 (18)>, <Blue 6 (19)>, <Blue 7 (20)>, <Blue 8 (21)>), (<Blue 8 (21)>, <Blue 9 (22)>, <Blue 10 (23)>), (<Orange 3 (29)>, <Orange 4 (30)>, <Orange 5 (31)>), (<Orange 7 (33)>, <Orange 8 (34)>, <Orange 9 (35)>), (<Orange 7 (33)>, <Orange 8 (34)>, <Orange 9 (35)>), (<Orange 10 (36)>, <Orange 11 (37)>, <Orange 12 (38)>, <Orange 13 (39)>), (<Red 7 (46)>, <Red 8 (47)>, <Red 9 (48)>, <Red 10 (49)>)], free_jokers=0).tiles#x1B[0m

#x1B[1m#x1B[31mtests/test_ruleset.py#x1B[0m:460: AssertionError

To view more test analytics, go to the Test Analytics Dashboard
_{📋 Got 3 mins? Take this short survey to help us improve Test Analytics.}

[sonarqubecloud]

Quality Gate passed

Issues
0 New issues
0 Accepted issues

Measures
0 Security Hotspots
0.0% Coverage on New Code
0.0% Duplication on New Code

See analysis details on SonarQube Cloud