1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
# generat3D - evaluate Daz DSON scenes and write .dbz files
# Copyright (C) 2026 Danilo M. <danix@danix.xyz>
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License along
# with this program; if not, write to the Free Software Foundation, Inc.,
# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
import unittest
from generat3d import Error
from generat3d.formula import Graph
def push(key):
return {"op": "push", "key": key}
def val(v):
return {"op": "push", "val": v}
class GraphTest(unittest.TestCase):
def setUp(self):
self.g = Graph()
self.g.add_prop("a", 0.5)
self.g.add_prop("b")
self.g.add_prop("c", 0.0, 0.0, 1.0, clamped=True)
def test_base_values(self):
self.assertEqual(self.g.evaluate(), {"a": 0.5, "b": 0.0, "c": 0.0})
def test_sum_stage(self):
self.g.add_formula("b", [push("a"), val(2), {"op": "mult"}])
self.g.add_formula("b", [push("a"), val(1), {"op": "add"}])
self.assertEqual(self.g.evaluate()["b"], 1.0 + 1.5)
def test_mult_stage(self):
self.g.set_value("b", 3.0)
self.g.add_formula("b", [push("a")], stage="mult")
self.assertEqual(self.g.evaluate()["b"], 1.5)
def test_chain_and_clamp(self):
self.g.add_formula("b", [push("a"), val(4), {"op": "mult"}])
self.g.add_formula("c", [push("b")])
out = self.g.evaluate()
self.assertEqual(out["b"], 2.0)
self.assertEqual(out["c"], 1.0)
def test_sub_div_neg(self):
self.g.add_formula("b", [val(1), push("a"), {"op": "sub"}, val(4), {"op": "div"},
{"op": "neg"}])
self.assertEqual(self.g.evaluate()["b"], -0.125)
def test_unknown_input_drops_formula(self):
self.g.add_formula("b", [push("missing")])
self.g.add_formula("b", [val(7)])
self.assertEqual(self.g.evaluate()["b"], 7)
def test_output_without_prop_is_ignored(self):
self.g.add_formula("nowhere", [val(1)])
self.assertNotIn("nowhere", self.g.evaluate())
def test_cycle_is_fatal(self):
self.g.add_formula("a", [push("b")])
self.g.add_formula("b", [push("a")])
with self.assertRaisesRegex(Error, "formula cycle: a -> b -> a"):
self.g.evaluate()
def test_unknown_op_is_fatal(self):
self.g.add_formula("b", [val(1), {"op": "pow"}], source="/data/x.dsf#m")
with self.assertRaisesRegex(Error, r"/data/x.dsf#m: unknown formula operation 'pow'"):
self.g.evaluate()
def test_unknown_stage_is_fatal(self):
with self.assertRaisesRegex(Error, "unknown formula stage 'avg'"):
self.g.add_formula("b", [val(1)], stage="avg")
def test_stack_errors_are_fatal(self):
self.g.add_formula("b", [{"op": "add"}], source="f")
with self.assertRaisesRegex(Error, "f: malformed formula for b"):
self.g.evaluate()
def test_leftover_stack_is_fatal(self):
self.g.add_formula("b", [val(1), val(2)], source="f")
with self.assertRaisesRegex(Error, "f: malformed formula for b"):
self.g.evaluate()
def test_non_numeric_result_is_fatal(self):
self.g.add_formula("b", [val("x")], source="f")
with self.assertRaisesRegex(Error, "f: malformed formula for b"):
self.g.evaluate()
def test_overflow_is_fatal(self):
self.g.add_formula("b", [val(10**400), val(0.5), {"op": "mult"}], source="f")
with self.assertRaisesRegex(Error, "f: malformed formula for b"):
self.g.evaluate()
def test_nan_result_is_fatal(self):
self.g.add_formula("b", [val(float("nan"))], source="f")
with self.assertRaisesRegex(Error, "f: malformed formula for b"):
self.g.evaluate()
def test_deep_chain_is_fatal(self):
g = Graph()
n = 2000
for i in range(n):
g.add_prop(f"p{i}")
for i in range(n - 1):
g.add_formula(f"p{i}", [push(f"p{i + 1}")])
with self.assertRaisesRegex(Error, "too deep"):
g.evaluate()
def test_diamond_dependency(self):
g = Graph()
g.add_prop("a", 1.0)
g.add_prop("b")
g.add_prop("c")
g.add_prop("d")
g.add_formula("b", [push("a")])
g.add_formula("c", [push("a"), push("a"), {"op": "add"}])
g.add_formula("d", [push("b"), push("c"), {"op": "add"}])
self.assertEqual(g.evaluate()["d"], 3)
|
