Commit edf7c37

pre-commit-ci[bot]cclauss

and

authored

[pre-commit.ci] pre-commit autoupdate (#12623)

* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.9.10 → v0.11.0](astral-sh/ruff-pre-commit@v0.9.10...v0.11.0) - [github.com/abravalheri/validate-pyproject: v0.23 → v0.24](abravalheri/validate-pyproject@v0.23...v0.24) * Fix ruff issues --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.com>

1 parent 7ce998b commit edf7c37Copy full SHA for edf7c37

File tree

15 files changed

+26

-28

lines changed

.pre-commit-config.yaml
conversions
- prefix_conversions_string.py
data_structures/arrays
- sudoku_solver.py
graphics
- digital_differential_analyzer_line.py
graphs
- minimum_spanning_tree_prims2.py
hashes
- enigma_machine.py
linear_algebra/src
- test_linear_algebra.py
maths
- primelib.py
other
- davis_putnam_logemann_loveland.py
- quine.py
project_euler/problem_028
- sol1.py
pyproject.toml
scripts
- validate_filenames.py
sorts
- external_sort.py
strings
- frequency_finder.py

15 files changed

+26

-28

lines changed

`‎.pre-commit-config.yaml`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@ repos:`
`16`	`16`	`- id: auto-walrus`
`17`	`17`
`18`	`18`	`- repo: https://github.com/astral-sh/ruff-pre-commit`
`19`		`- rev: v0.9.10`
	`19`	`+ rev: v0.11.0`
`20`	`20`	`hooks:`
`21`	`21`	`- id: ruff`
`22`	`22`	`- id: ruff-format`
`@@ -42,7 +42,7 @@ repos:`
`42`	`42`	`pass_filenames: false`
`43`	`43`
`44`	`44`	`- repo: https://github.com/abravalheri/validate-pyproject`
`45`		`- rev: v0.23`
	`45`	`+ rev: v0.24`
`46`	`46`	`hooks:`
`47`	`47`	`- id: validate-pyproject`
`48`	`48`

`‎conversions/prefix_conversions_string.py`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -53,7 +53,7 @@ class SIUnit(Enum):`
`53`	`53`	`yocto = -24`
`54`	`54`
`55`	`55`	`@classmethod`
`56`		`- def get_positive(cls: type[T]) -> dict:`
	`56`	`+ def get_positive(cls) -> dict:`
`57`	`57`	`"""`
`58`	`58`	`Returns a dictionary with only the elements of this enum`
`59`	`59`	`that has a positive value`
`@@ -68,7 +68,7 @@ def get_positive(cls: type[T]) -> dict:`
`68`	`68`	`return {unit.name: unit.value for unit in cls if unit.value > 0}`
`69`	`69`
`70`	`70`	`@classmethod`
`71`		`- def get_negative(cls: type[T]) -> dict:`
	`71`	`+ def get_negative(cls) -> dict:`
`72`	`72`	`"""`
`73`	`73`	`Returns a dictionary with only the elements of this enum`
`74`	`74`	`that has a negative value`

`‎data_structures/arrays/sudoku_solver.py`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -54,7 +54,7 @@ def parse_grid(grid):`
`54`	`54`	`return False if a contradiction is detected.`
`55`	`55`	`"""`
`56`	`56`	`## To start, every square can be any digit; then assign values from the grid.`
`57`		`- values = {s: digitsforsinsquares}`
	`57`	`+ values = dict.fromkeys(squares, digits)`
`58`	`58`	`for s, d in grid_values(grid).items():`
`59`	`59`	`if d in digits and not assign(values, s, d):`
`60`	`60`	`return False ## (Fail if we can't assign d to square s.)`
`@@ -203,7 +203,7 @@ def random_puzzle(assignments=17):`
`203`	`203`	`Note the resulting puzzle is not guaranteed to be solvable, but empirically`
`204`	`204`	`about 99.8% of them are solvable. Some have multiple solutions.`
`205`	`205`	`"""`
`206`		`- values = {s: digitsforsinsquares}`
	`206`	`+ values = dict.fromkeys(squares, digits)`
`207`	`207`	`for s in shuffled(squares):`
`208`	`208`	`if not assign(values, s, random.choice(values[s])):`
`209`	`209`	`break`

`‎graphics/digital_differential_analyzer_line.py`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -29,7 +29,7 @@ def digital_differential_analyzer_line(`
`29`	`29`	`for _ in range(steps):`
`30`	`30`	`x += x_increment`
`31`	`31`	`y += y_increment`
`32`		`- coordinates.append((int(round(x)), int(round(y))))`
	`32`	`+ coordinates.append((round(x), round(y)))`
`33`	`33`	`return coordinates`
`34`	`34`
`35`	`35`

`‎graphs/minimum_spanning_tree_prims2.py`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -239,8 +239,8 @@ def prims_algo(`
`239`	`239`	`13`
`240`	`240`	`"""`
`241`	`241`	`# prim's algorithm for minimum spanning tree`
`242`		`- dist: dict[T, int] = {node: maxsizefornodeingraph.connections}`
`243`		`- parent: dict[T, T \| None] = {node: Nonefornodeingraph.connections}`
	`242`	`+ dist: dict[T, int] = dict.fromkeys(graph.connections, maxsize)`
	`243`	`+ parent: dict[T, T \| None] = dict.fromkeys(graph.connections)`
`244`	`244`
`245`	`245`	`priority_queue: MinPriorityQueue[T] = MinPriorityQueue()`
`246`	`246`	`for node, weight in dist.items():`

`‎hashes/enigma_machine.py`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,12 +15,12 @@ def rotator():`
`15`	`15`	`gear_one.append(i)`
`16`	`16`	`del gear_one[0]`
`17`	`17`	`gear_one_pos += 1`
`18`		`- if gear_one_pos % int(len(alphabets)) == 0:`
	`18`	`+ if gear_one_pos % len(alphabets) == 0:`
`19`	`19`	`i = gear_two[0]`
`20`	`20`	`gear_two.append(i)`
`21`	`21`	`del gear_two[0]`
`22`	`22`	`gear_two_pos += 1`
`23`		`- if gear_two_pos % int(len(alphabets)) == 0:`
	`23`	`+ if gear_two_pos % len(alphabets) == 0:`
`24`	`24`	`i = gear_three[0]`
`25`	`25`	`gear_three.append(i)`
`26`	`26`	`del gear_three[0]`

`‎linear_algebra/src/test_linear_algebra.py`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -181,7 +181,7 @@ def test_component_matrix(self) -> None:`
`181`	`181`	`test for Matrix method component()`
`182`	`182`	`"""`
`183`	`183`	`a = Matrix([[1, 2, 3], [2, 4, 5], [6, 7, 8]], 3, 3)`
`184`		`- assert a.component(2, 1) == 7, 0.01`
	`184`	`+ assert a.component(2, 1) == 7, "0.01"`
`185`	`185`
`186`	`186`	`def test__add__matrix(self) -> None:`
`187`	`187`	`"""`

`‎maths/primelib.py`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -76,7 +76,7 @@ def is_prime(number: int) -> bool:`
`76`	`76`	`if number <= 1:`
`77`	`77`	`status = False`
`78`	`78`
`79`		`- for divisor in range(2, int(round(sqrt(number))) + 1):`
	`79`	`+ for divisor in range(2, round(sqrt(number)) + 1):`
`80`	`80`	`# if 'number' divisible by 'divisor' then sets 'status'`
`81`	`81`	`# of false and break up the loop.`
`82`	`82`	`if number % divisor == 0:`

`‎other/davis_putnam_logemann_loveland.py`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -36,7 +36,7 @@ def __init__(self, literals: list[str]) -> None:`
`36`	`36`	`Represent the literals and an assignment in a clause."`
`37`	`37`	`"""`
`38`	`38`	`# Assign all literals to None initially`
`39`		`- self.literals: dict[str, bool \| None] = {literal: Noneforliteralinliterals}`
	`39`	`+ self.literals: dict[str, bool \| None] = dict.fromkeys(literals)`
`40`	`40`
`41`	`41`	`def __str__(self) -> str:`
`42`	`42`	`"""`

`‎other/quine.py`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,5 @@`
`1`	`1`	`#!/bin/python3`
`2`		`-# ruff: noqa`
	`2`	`+# ruff: noqa: PLC3002`
`3`	`3`	`"""`
`4`	`4`	`Quine:`
`5`	`5`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Uh oh!

Commit edf7c37

File tree

15 files changed

15 files changed

`‎.pre-commit-config.yaml`

`‎conversions/prefix_conversions_string.py`

`‎data_structures/arrays/sudoku_solver.py`

`‎graphics/digital_differential_analyzer_line.py`

`‎graphs/minimum_spanning_tree_prims2.py`

`‎hashes/enigma_machine.py`

`‎linear_algebra/src/test_linear_algebra.py`

`‎maths/primelib.py`

`‎other/davis_putnam_logemann_loveland.py`

`‎other/quine.py`

0 commit comments