Tirsvad
97215c4137
Parsing of cookie counts and prices, the most-expensive-affordable rule, the click-and-buy loop with a check interval, adapter methods and cli option, and the screenshot of lecture step 3 from a container run. Code review RC-016. Closes #18 Closes #19 Closes #20 Closes #21 Task: MIL-004#1 Task: MIL-004#2 Task: MIL-004#3 Task: MIL-004#4
36 lines
1.2 KiB
Python
36 lines
1.2 KiB
Python
"""@file test_upgrades.py
|
|
@brief Tests of the rule that picks the upgrade to buy.
|
|
"""
|
|
|
|
from cookie_clicker_bot.domain.upgrades import Upgrade, choose_most_expensive_affordable
|
|
|
|
CURSOR = Upgrade("product0", "Cursor", 15)
|
|
GRANDMA = Upgrade("product1", "Grandma", 100)
|
|
FARM = Upgrade("product2", "Farm", 1100)
|
|
|
|
|
|
def test_choose_picks_the_most_expensive_affordable() -> None:
|
|
assert choose_most_expensive_affordable([CURSOR, GRANDMA, FARM], 105) == GRANDMA
|
|
|
|
|
|
def test_choose_returns_none_when_nothing_is_affordable() -> None:
|
|
assert choose_most_expensive_affordable([CURSOR, GRANDMA], 10) is None
|
|
|
|
|
|
def test_choose_returns_none_without_upgrades() -> None:
|
|
assert choose_most_expensive_affordable([], 1000) is None
|
|
|
|
|
|
def test_choose_accepts_a_price_equal_to_the_cookies() -> None:
|
|
assert choose_most_expensive_affordable([CURSOR, GRANDMA], 100) == GRANDMA
|
|
|
|
|
|
def test_choose_takes_the_first_on_a_tie() -> None:
|
|
twin = Upgrade("product9", "Twin", 100)
|
|
|
|
assert choose_most_expensive_affordable([GRANDMA, twin], 500) == GRANDMA
|
|
|
|
|
|
def test_choose_ignores_the_order_of_the_list() -> None:
|
|
assert choose_most_expensive_affordable([GRANDMA, CURSOR], 105) == GRANDMA
|