mirror of
https://github.com/Chia-Network/chia-blockchain.git
synced 2024-09-21 00:24:37 +03:00
102 lines
3.5 KiB
Python
102 lines
3.5 KiB
Python
from __future__ import annotations
|
|
|
|
from unittest import TestCase
|
|
|
|
from clvm.EvalError import EvalError
|
|
from clvm.operators import KEYWORD_TO_ATOM
|
|
from clvm_tools.binutils import assemble, disassemble
|
|
|
|
from chia.types.blockchain_format.program import Program
|
|
|
|
|
|
class TestProgram(TestCase):
|
|
def test_at(self):
|
|
p = Program.to([10, 20, 30, [15, 17], 40, 50])
|
|
|
|
self.assertEqual(p.first(), p.at("f"))
|
|
self.assertEqual(Program.to(10), p.at("f"))
|
|
|
|
self.assertEqual(p.rest(), p.at("r"))
|
|
self.assertEqual(Program.to([20, 30, [15, 17], 40, 50]), p.at("r"))
|
|
|
|
self.assertEqual(p.rest().rest().rest().first().rest().first(), p.at("rrrfrf"))
|
|
self.assertEqual(Program.to(17), p.at("rrrfrf"))
|
|
|
|
self.assertRaises(ValueError, lambda: p.at("q"))
|
|
self.assertRaises(EvalError, lambda: p.at("ff"))
|
|
|
|
def test_replace(self):
|
|
p1 = Program.to([100, 200, 300])
|
|
self.assertEqual(p1.replace(f=105), Program.to([105, 200, 300]))
|
|
self.assertEqual(p1.replace(rrf=[301, 302]), Program.to([100, 200, [301, 302]]))
|
|
self.assertEqual(p1.replace(f=105, rrf=[301, 302]), Program.to([105, 200, [301, 302]]))
|
|
self.assertEqual(p1.replace(f=100, r=200), Program.to((100, 200)))
|
|
|
|
def test_replace_conflicts(self):
|
|
p1 = Program.to([100, 200, 300])
|
|
self.assertRaises(ValueError, lambda: p1.replace(rr=105, rrf=200))
|
|
|
|
def test_replace_conflicting_paths(self):
|
|
p1 = Program.to([100, 200, 300])
|
|
self.assertRaises(ValueError, lambda: p1.replace(ff=105))
|
|
|
|
def test_replace_bad_path(self):
|
|
p1 = Program.to([100, 200, 300])
|
|
self.assertRaises(ValueError, lambda: p1.replace(q=105))
|
|
self.assertRaises(ValueError, lambda: p1.replace(rq=105))
|
|
|
|
|
|
def check_idempotency(f, *args):
|
|
prg = Program.to(f)
|
|
curried = prg.curry(*args)
|
|
|
|
r = disassemble(curried)
|
|
f_0, args_0 = curried.uncurry()
|
|
|
|
assert disassemble(f_0) == disassemble(f)
|
|
assert disassemble(args_0) == disassemble(Program.to(list(args)))
|
|
return r
|
|
|
|
|
|
def test_curry_uncurry():
|
|
PLUS = KEYWORD_TO_ATOM["+"][0]
|
|
f = assemble("(+ 2 5)")
|
|
actual_disassembly = check_idempotency(f, 200, 30)
|
|
assert actual_disassembly == f"(a (q {PLUS} 2 5) (c (q . 200) (c (q . 30) 1)))"
|
|
|
|
f = assemble("(+ 2 5)")
|
|
args = assemble("(+ (q . 50) (q . 60))")
|
|
# passing "args" here wraps the arguments in a list
|
|
actual_disassembly = check_idempotency(f, args)
|
|
assert actual_disassembly == f"(a (q {PLUS} 2 5) (c (q {PLUS} (q . 50) (q . 60)) 1))"
|
|
|
|
|
|
def test_uncurry_not_curried():
|
|
# this function has not been curried
|
|
plus = Program.to(assemble("(+ 2 5)"))
|
|
assert plus.uncurry() == (plus, Program.to(0))
|
|
|
|
|
|
def test_uncurry():
|
|
# this is a positive test
|
|
plus = Program.to(assemble("(2 (q . (+ 2 5)) (c (q . 1) 1))"))
|
|
assert plus.uncurry() == (Program.to(assemble("(+ 2 5)")), Program.to([1]))
|
|
|
|
|
|
def test_uncurry_top_level_garbage():
|
|
# there's garbage at the end of the top-level list
|
|
plus = Program.to(assemble("(2 (q . 1) (c (q . 1) (q . 1)) (q . 0x1337))"))
|
|
assert plus.uncurry() == (plus, Program.to(0))
|
|
|
|
|
|
def test_uncurry_not_pair():
|
|
# the second item in the list is expected to be a pair, with a qoute
|
|
plus = Program.to(assemble("(2 1 (c (q . 1) (q . 1)))"))
|
|
assert plus.uncurry() == (plus, Program.to(0))
|
|
|
|
|
|
def test_uncurry_args_garbage():
|
|
# there's garbage at the end of the args list
|
|
plus = Program.to(assemble("(2 (q . 1) (c (q . 1) (q . 1) (q . 0x1337)))"))
|
|
assert plus.uncurry() == (plus, Program.to(0))
|