minor edits

prtpy/objectives.py

@@ -1,20 +1,22 @@
 """
 Define various optimization objectives for a partition algorithm.
 
->>> objectives = [MaximizeSmallestSum, MaximizeKSmallestSums(2), MinimizeLargestSum, MinimizeKLargestSums(2), MinimizeDifference]
+>>> objectives = [MaximizeSmallestSum, MaximizeKSmallestSums(2), MinimizeLargestSum, MinimizeKLargestSums(2), MinimizeDifference, MinimizeDistAvg]
 >>> for o in objectives: print(o.value_to_minimize(sums=[1,2,3,4,5], are_sums_in_ascending_order=True))
 -1
 -3
 5
 9
 4
+3.0
 >>> objectives.append(MaximizeSmallestWeightedSum([1, 1, 1, 3, 4]))
 >>> for o in objectives: print(o.value_to_minimize(sums=[2,4,1,5,3]))
 -1
 -3
 5
 9
 4
+3.0
 -0.75
 """
 
@@ -201,6 +203,4 @@ def lower_bound(self, sums:list, sum_of_remaining_items:float, are_sums_in_ascen
 
 if __name__ == "__main__":
     import doctest
-
-    (failures, tests) = doctest.testmod(report=True)
-    print("{} failures, {} tests".format(failures, tests))
+    print(doctest.testmod())

prtpy/partitioning/complete_greedy.py

@@ -23,7 +23,7 @@
 
 
 def anytime(
-    binner: Binner, numbins: int, items: List[any], relative_value: List[any] = None,
+    binner: Binner, numbins: int, items: List[int], relative_value: List[int] = None,
     objective: obj.Objective = obj.MinimizeDifference,
     use_lower_bound: bool = True,
     # Prune branches whose lower bound (= optimistic value) is at least as large as the current minimum.
@@ -310,7 +310,6 @@ def anytime(
 
 if __name__ == "__main__":
     import doctest, sys
-
     (failures, tests) = doctest.testmod(report=True, optionflags=doctest.FAIL_FAST)
     print("{} failures, {} tests".format(failures, tests))
     if failures > 0: