def test_sort_for_storage(self):
test_list = JobList(TestCollector(0, 0),
JobList.order_by.for_storage_collector)
test_list.append(
Job(TestObject(1, 3, 3), [Job.ResListEntry(2, 4, False)]))
test_list.append(
Job(TestObject(2, 1, 1), [Job.ResListEntry(1, 2, False)]))
test_list.append(
Job(TestObject(3, 2, 2), [Job.ResListEntry(2, 3, False)]))
test_list.append(
Job(TestObject(4, 9, 0),
[Job.ResListEntry(4, 9, target_inventory_full=True)]))
test_list.append(
Job(TestObject(BUILDINGS.CLAY_DEPOSIT, 10, 5),
[Job.ResListEntry(4, 9, False)]))
test_list.sort_jobs()
# Make sure everything was sorted in order of distance with secondary
# sorting by fewest available and as last the clay deposit as it has a producer in range
self.assertEqual(test_list[0].object.id, 4)
self.assertEqual(test_list[1].object.id, 2)
self.assertEqual(test_list[2].object.id, 3)
self.assertEqual(test_list[3].object.id, 1)
self.assertEqual(test_list[4].object.id, BUILDINGS.CLAY_DEPOSIT)
# Both give res 2, but TestObject with id 3 is closer
self.assertTrue(
self.distance(test_list, 1) <= self.distance(test_list, 2))
def test_sort_for_storage(self):
test_list = JobList(TestCollector(0, 0), JobList.order_by.for_storage_collector)
test_list.append(Job(TestObject(1, 3, 3), [Job.ResListEntry(2, 4, False)]))
test_list.append(Job(TestObject(2, 1, 1), [Job.ResListEntry(1, 2, False)]))
test_list.append(Job(TestObject(3, 2, 2), [Job.ResListEntry(2, 3, False)]))
test_list.append(Job(TestObject(4, 9, 0), [Job.ResListEntry(4, 9, target_inventory_full=True)]))
test_list.sort_jobs()
# Make sure everything was sorted in order of fewest available with secondary
# sorting by distance
self.assertEqual(test_list[0].object.id, 4)
self.assertEqual(test_list[1].object.id, 3)
self.assertEqual(test_list[2].object.id, 1)
self.assertEqual(test_list[3].object.id, 2)
# Both give res 2, but TestObject with id 3 is closer
self.assertTrue(self.distance(test_list, 1) <= self.distance(test_list, 2))
def test_sort_for_storage(self): test_list = JobList(TestCollector(0, 0), JobList.order_by.for_storage_collector) test_list.append(Job(TestObject(1, 3, 3), [Job.ResListEntry(2, 4, False)])) test_list.append(Job(TestObject(2, 1, 1), [Job.ResListEntry(1, 2, False)])) test_list.append(Job(TestObject(3, 2, 2), [Job.ResListEntry(2, 3, False)])) test_list.append(Job(TestObject(4, 9, 0), [Job.ResListEntry(4, 9, target_inventory_full=True)])) test_list.append(Job(TestObject(BUILDINGS.CLAY_DEPOSIT, 10, 5), [Job.ResListEntry(4, 9, False)])) test_list.sort_jobs() # Make sure everything was sorted in order of distance with secondary # sorting by fewest available and as last the clay deposit as it has a producer in range self.assertEqual(test_list[0].object.id, 4) self.assertEqual(test_list[1].object.id, 2) self.assertEqual(test_list[2].object.id, 3) self.assertEqual(test_list[3].object.id, 1) self.assertEqual(test_list[4].object.id, BUILDINGS.CLAY_DEPOSIT) # Both give res 2, but TestObject with id 3 is closer self.assertTrue(self.distance(test_list, 1) <= self.distance(test_list, 2))
