95 lines
4.3 KiB
Python
95 lines
4.3 KiB
Python
import unittest
|
|
import pathlib
|
|
|
|
import Utils
|
|
|
|
file_path = pathlib.Path(__file__).parent.parent
|
|
Utils.local_path.cached_path = file_path
|
|
|
|
from BaseClasses import MultiWorld, CollectionState
|
|
from worlds.alttp.Items import ItemFactory
|
|
|
|
|
|
class TestBase(unittest.TestCase):
|
|
world: MultiWorld
|
|
_state_cache = {}
|
|
|
|
def get_state(self, items):
|
|
if (self.world, tuple(items)) in self._state_cache:
|
|
return self._state_cache[self.world, tuple(items)]
|
|
state = CollectionState(self.world)
|
|
for item in items:
|
|
item.advancement = True
|
|
state.collect(item)
|
|
state.sweep_for_events()
|
|
self._state_cache[self.world, tuple(items)] = state
|
|
return state
|
|
|
|
def get_path(self, state, region):
|
|
def flist_to_iter(node):
|
|
while node:
|
|
value, node = node
|
|
yield value
|
|
|
|
from itertools import zip_longest
|
|
reversed_path_as_flist = state.path.get(region, (region, None))
|
|
string_path_flat = reversed(list(map(str, flist_to_iter(reversed_path_as_flist))))
|
|
# Now we combine the flat string list into (region, exit) pairs
|
|
pathsiter = iter(string_path_flat)
|
|
pathpairs = zip_longest(pathsiter, pathsiter)
|
|
return list(pathpairs)
|
|
|
|
def run_location_tests(self, access_pool):
|
|
for i, (location, access, *item_pool) in enumerate(access_pool):
|
|
items = item_pool[0]
|
|
all_except = item_pool[1] if len(item_pool) > 1 else None
|
|
state = self._get_items(item_pool, all_except)
|
|
path = self.get_path(state, self.world.get_location(location, 1).parent_region)
|
|
with self.subTest(msg="Reach Location", location=location, access=access, items=items,
|
|
all_except=all_except, path=path, entry=i):
|
|
|
|
self.assertEqual(self.world.get_location(location, 1).can_reach(state), access)
|
|
|
|
# check for partial solution
|
|
if not all_except and access: # we are not supposed to be able to reach location with partial inventory
|
|
for missing_item in item_pool[0]:
|
|
with self.subTest(msg="Location reachable without required item", location=location,
|
|
items=item_pool[0], missing_item=missing_item, entry=i):
|
|
state = self._get_items_partial(item_pool, missing_item)
|
|
self.assertEqual(self.world.get_location(location, 1).can_reach(state), False)
|
|
|
|
def run_entrance_tests(self, access_pool):
|
|
for i, (entrance, access, *item_pool) in enumerate(access_pool):
|
|
items = item_pool[0]
|
|
all_except = item_pool[1] if len(item_pool) > 1 else None
|
|
state = self._get_items(item_pool, all_except)
|
|
path = self.get_path(state, self.world.get_entrance(entrance, 1).parent_region)
|
|
with self.subTest(msg="Reach Entrance", entrance=entrance, access=access, items=items,
|
|
all_except=all_except, path=path, entry=i):
|
|
|
|
self.assertEqual(self.world.get_entrance(entrance, 1).can_reach(state), access)
|
|
|
|
# check for partial solution
|
|
if not all_except and access: # we are not supposed to be able to reach location with partial inventory
|
|
for missing_item in item_pool[0]:
|
|
with self.subTest(msg="Entrance reachable without required item", entrance=entrance,
|
|
items=item_pool[0], missing_item=missing_item, entry=i):
|
|
state = self._get_items_partial(item_pool, missing_item)
|
|
self.assertEqual(self.world.get_entrance(entrance, 1).can_reach(state), False)
|
|
|
|
def _get_items(self, item_pool, all_except):
|
|
if all_except and len(all_except) > 0:
|
|
items = self.world.itempool[:]
|
|
items = [item for item in items if
|
|
item.name not in all_except and not ("Bottle" in item.name and "AnyBottle" in all_except)]
|
|
items.extend(ItemFactory(item_pool[0], 1))
|
|
else:
|
|
items = ItemFactory(item_pool[0], 1)
|
|
return self.get_state(items)
|
|
|
|
def _get_items_partial(self, item_pool, missing_item):
|
|
new_items = item_pool[0].copy()
|
|
new_items.remove(missing_item)
|
|
items = ItemFactory(new_items, 1)
|
|
return self.get_state(items)
|