use pip-compile to generate requirements.txt (#37)

* use pip-compile to generate requirements.txt

* re-run black on all code

seems like some rules changed while upgrading from 22.12 to 23.x

* dont emit index url

Author: mattnworb

README.md

@@ -18,3 +18,9 @@ To benchmark one of the modules with `timeit`, can run something like:
 python -m timeit -s 'import y2021.problem15; inp = open("y2021/problem15/input").read(-1).strip()' 'y2021.problem15.part1(inp)'
 1 loop, best of 5: 938 msec per loop
 ```
+
+The `requirements.txt` file is generated with pip-compile from [pip-tools](https://pip-tools.readthedocs.io/en/latest/). To re-compile:
+
+```
+pip-compile --no-emit-index-url > requirements.txt
+```

requirements.in

@@ -0,0 +1,4 @@
+black
+mypy
+pytest
+tox

requirements.txt

@@ -1,32 +1,68 @@
-attrs==22.1.0
-black==22.12.0
-cachetools==5.2.0
-cfgv==3.3.1
+#
+# This file is autogenerated by pip-compile with Python 3.10
+# by the following command:
+#
+#    pip-compile --no-emit-index-url
+#
+attrs==22.2.0
+    # via pytest
+black==23.1.0
+    # via -r requirements.in
+cachetools==5.3.0
+    # via tox
 chardet==5.1.0
+    # via tox
 click==8.1.3
+    # via black
 colorama==0.4.6
+    # via tox
 distlib==0.3.6
-exceptiongroup==1.0.4
-filelock==3.8.2
-identify==2.5.9
-iniconfig==1.1.1
-mypy==0.991
-mypy-extensions==0.4.3
-nodeenv==1.7.0
-packaging==22.0
-pathspec==0.10.2
-platformdirs==2.6.0
+    # via virtualenv
+exceptiongroup==1.1.0
+    # via pytest
+filelock==3.9.0
+    # via
+    #   tox
+    #   virtualenv
+iniconfig==2.0.0
+    # via pytest
+mypy==1.0.1
+    # via -r requirements.in
+mypy-extensions==1.0.0
+    # via
+    #   black
+    #   mypy
+packaging==23.0
+    # via
+    #   black
+    #   pyproject-api
+    #   pytest
+    #   tox
+pathspec==0.11.0
+    # via black
+platformdirs==3.0.0
+    # via
+    #   black
+    #   tox
+    #   virtualenv
 pluggy==1.0.0
-pre-commit==2.20.0
-py==1.11.0
-pyparsing==3.0.9
-pyproject_api==1.2.1
-pytest==7.2.0
-PyYAML==6.0
-six==1.16.0
-toml==0.10.2
+    # via
+    #   pytest
+    #   tox
+pyproject-api==1.5.0
+    # via tox
+pytest==7.2.1
+    # via -r requirements.in
 tomli==2.0.1
-tox==4.0.8
-typed-ast==1.5.4
-typing_extensions==4.4.0
-virtualenv==20.17.1
+    # via
+    #   black
+    #   mypy
+    #   pyproject-api
+    #   pytest
+    #   tox
+tox==4.4.6
+    # via -r requirements.in
+typing-extensions==4.5.0
+    # via mypy
+virtualenv==20.19.0
+    # via tox

y2020/problem06/__init__.py

@@ -2,7 +2,6 @@
 
 
 def count_groups(inp: str, intersect=False) -> int:
-
     groups = inp.strip().split("\n\n")
 
     all_answers: List[Set[str]] = []

y2020/problem10/__init__.py

@@ -22,6 +22,7 @@
 # joltage differences between the charging outlet, the adapters, and your
 # device?
 
+
 # Originally my solution tried to find a valid chain of adapters from the input
 # which would use all of them. But duh, if we use all of them, there is only one
 # ordering possible, since the allowed differences of [1, 2, or 3] are all

y2020/problem12/__init__.py

@@ -46,7 +46,6 @@ def part1(instr: List[str]) -> Tuple[int, int]:
 
 
 def move(pos: Tuple[int, int], action: str, value: int) -> Tuple[int, int]:
-
     if action == "N":
         r = pos[0], pos[1] - value
     elif action == "S":

y2020/problem17/__init__.py

@@ -79,7 +79,6 @@ def part1(inp: str, cycles: int = 6) -> int:
 
 
 def print_state3(state: State3):
-
     min_z = min(z for x, y, z in state)
     max_z = max(z for x, y, z in state)
 

y2020/problem18/__init__.py

@@ -51,7 +51,6 @@ def parse_expression(line: str, part1=True) -> List[Either]:
 
         # check if operator
         elif token not in ["(", ")"]:
-
             while (
                 len(operators) > 0
                 # normally this would also check if operator at the top of the

y2020/problem20/__init__.py

@@ -7,6 +7,7 @@
 Position = Tuple[int, int]
 Image = Dict[Position, Tile]
 
+
 # some thoughts on an approach:
 #
 # only the borders of each tile matter
@@ -196,7 +197,6 @@ def assert_image_valid(image: Image):
 def assemble_image(
     tiles: Dict[int, Tile], corner_tile_nums: Set[int]
 ) -> Tuple[Image, Dict[Position, int]]:
-
     # dict of border (string) to count (int)
     border_counts = Counter(b for t in tiles.values() for b in all_borders(t))
 
@@ -372,7 +372,6 @@ def count_sea_monsters(tile: Tile) -> int:
     # of the monster onto it (with the last group being rows [93,94,95]).
     for y in range(0, tile_rows - monster_rows + 1):
         for x in range(0, tile_cols - monster_cols + 1):
-
             # using (x, y) as an anchor point, we see if the monster could exist
             # from this anchor point. Do this by checking if the positions from
             # here contain the required '#' characters.

y2020/problem20/test_problem20.py

@@ -12,7 +12,6 @@ def tiles():
 
 
 def test_parse_input(tiles):
-
     assert len(tiles) == 144
     for tile in tiles.values():
         assert len(tile) == 10

y2020/problem22/__init__.py

@@ -48,7 +48,6 @@ def parse_input(inp: str) -> Tuple[Deck, Deck]:
 def play_game(
     deck1: Deck, deck2: Deck, max_rounds: Optional[int] = None
 ) -> Tuple[Deck, Deck]:
-
     # make copies
     deck1 = list(deck1)
     deck2 = list(deck2)
@@ -104,7 +103,6 @@ def score(winning_deck: Deck) -> int:
 def play_game2(
     deck1: Deck, deck2: Deck, max_rounds: Optional[int] = None, game_num: int = 1
 ) -> Tuple[Deck, Deck, int]:
-
     # make copies
     deck1 = list(deck1)
     deck2 = list(deck2)

y2020/problem24/__init__.py

@@ -76,7 +76,6 @@ def process_moves(inp: str) -> Set[Position]:
     black_tiles: Set[Position] = set()
 
     for line in inp.strip().split("\n"):
-
         pos = (0, 0)
 
         for m in parse_line(line):

y2020/problem25/__init__.py

@@ -83,7 +83,6 @@ def transform_n_times(subject: int, loop_size: int) -> int:
 
 
 def part1(inp: str) -> int:
-
     card_pub_key, door_pub_key = map(int, inp.strip().split("\n"))
 
     # what loop size would have generated the two pub keys?

y2021/problem01/__init__.py

@@ -1,5 +1,6 @@
 from typing import *
 
+
 # The first order of business is to figure out how quickly the depth increases,
 # just so you know what you're dealing with - you never know if the keys will
 # get carried into deeper water by an ocean current or a fish or something.

y2021/problem04/test_problem04.py

@@ -63,7 +63,6 @@ def test_board_col():
 
 
 def test_part1_example():
-
     assert part1(example) == 4512
 
 

y2021/problem07/__init__.py

@@ -37,6 +37,7 @@
 # Determine the horizontal position that the crabs can align to using the least
 # fuel possible. How much fuel must they spend to align to that position?
 
+
 # -----------------------------------------------------------------------------
 # My notes:
 #

y2021/problem09/__init__.py

@@ -93,7 +93,6 @@ def part1(inp: str):
 # The size of a basin is the number of locations within the basin, including the
 # low point. The example above has four basins.
 def part2(inp: str):
-
     g = Grid(inp)
 
     basins: List[Set[Pos]] = []

y2021/problem14/__init__.py

@@ -14,7 +14,6 @@ def parse(inp: str) -> Tuple[str, Dict[str, str]]:
 
 
 def run_steps(template: str, instructions: Dict[str, str], rounds=10) -> Dict[str, int]:
-
     # the naive approach, which works fine for part1 / 10 rounds, is to treat
     # the polymer as a string (or list of chars), build a copy of the string in
     # each round, iterating over each position in the string. around round 20

y2022/problem01/__init__.py

@@ -1,5 +1,6 @@
 from typing import *
 
+
 # In case the Elves get hungry and need extra snacks, they need to know which
 # Elf to ask: they'd like to know how many Calories are being carried by the Elf
 # carrying the most Calories. In the example above, this is 24000 (carried by

y2022/problem10/__init__.py

@@ -2,7 +2,6 @@
 
 
 def part1(inp: str):
-
     # Start by figuring out the signal being sent by the CPU. The CPU has a
     # single register, X, which starts with the value 1. It supports only two
     # instructions:

y2022/problem12/__init__.py

@@ -78,7 +78,6 @@ def build_graph(height: Dict[Node, int]) -> Dict[Node, List[Node]]:
 def solve(
     height: Dict[Node, int], graph: Dict[Node, List[Node]], start: Node, end: Node
 ) -> Optional[int]:
-
     # now we search
     def h(n: Node) -> int:
         return abs(n[0] - end[0]) + abs(n[1] - end[1])

y2022/problem15/__init__.py

@@ -26,7 +26,6 @@ def parse(inp: str) -> List[Tuple[Point, Point]]:
 
 
 def part1(inp: str, y=2000000) -> int:
-
     # First approach I took here was to attempt to populate a sparse grid to
     # note every (x, y) position where a sensor is, where the beacons are, and
     # the positions that cannot contain a beacon. This works well for the
@@ -78,7 +77,6 @@ def part1(inp: str, y=2000000) -> int:
 
 
 def part2(inp: str, search_space: Tuple[int, int]) -> int:
-
     # Your handheld device indicates that the distress signal is coming from a
     # beacon nearby. The distress beacon is not detected by any sensor, but the
     # distress beacon must have x and y coordinates each no lower than 0 and no

y2022/problem16/__init__.py

@@ -26,7 +26,6 @@ def parse(inp: str) -> Tuple[Dict[str, int], Dict[str, List[str]]]:
 
 
 def part1(inp: str, minutes: int = 30, start_location="AA"):
-
     flow_rate, connections = parse(inp)
 
     @functools.cache

y2022/problem17/__init__.py

@@ -79,7 +79,6 @@ def next_rock(
     shape_gen: Iterator[Shape],
     jet_gen: Iterator[str],
 ) -> int:
-
     # new rock
     shape = next(shape_gen)
     # Each rock appears so that its left edge is two units away from the