def test_factor():
instrs: List[Instruction] = []
candidate_instrs: List[Instruction] = []
mconst = MultConst(debug=True)
# mconst = MultConst(debug=debug)
mconst.search_methods = (search_short_factors, )
n = 27
s_cost, s_instrs = search_short_factors(
mconst,
n,
upper=20,
lower=0,
instrs=instrs,
candidate_instrs=candidate_instrs,
)
check(n, s_cost, s_instrs)
cost, instrs = mconst.try_shift_op_factor(n, 5, "add", 2, s_cost, 0, [],
s_instrs)
assert s_cost == cost, "5 is not a factor of 27, so we keep old s_cost"
for n, factor, shift_amount in ((51, 3, 1), (85, 5, 2)):
s_cost, s_instrs = binary_method.binary_sequence(mconst, n)
print_instructions(s_instrs, n, s_cost)
result = []
cost, result = mconst.try_shift_op_factor(n, factor, "add",
shift_amount, s_cost, 0, [],
s_instrs)
assert cost < s_cost, f"should use the fact that {factor} is a factor of {n}"
print_instructions(result, n, cost)
def test_binary_method():
debug = "DEBUG" in os.environ
mconst = MultConstClass(debug=debug)
for (n, expect_cost) in (
(0, 1),
(1, 0),
(-1, 1),
(2, 1),
(3, 2),
(4, 1),
(5, 2),
(6, 3),
(7, 2),
(-7, 2),
(-3, 2),
(8, 1),
(53, 6),
(340, 7),
):
cost, result = binary_method.binary_sequence(mconst, n)
if debug:
print_instructions(result, n, cost)
assert expect_cost == cost, f"cost({n}) = {cost}; expected it to be {expect_cost}."
def check(n: int, cost: float, instrs: List[Instruction]) -> None:
print_instructions(instrs, n, cost)
check_instruction_sequence_cost(cost, instrs)
check_instruction_sequence_value(n, instrs)