mirror of
https://github.com/circify/circ.git
synced 2026-01-10 06:08:02 -05:00
8140b1369e
Previously, the traversal stack held (node, children queued) pairs. When visiting a node without it's children queued, we would queue them all. They take a lot of memory! Now, the stack holds children iterators. Also: this patch fixes many bugs introduced by the prior one.
5 lines
192 B
Prolog
5 lines
192 B
Prolog
main(Z: field) :- ((Z + Y) + Y) + ~!-Y + to_field(Y);
|
|
Z;
|
|
exists A: field. A * Z = 1;
|
|
exists B: field, C: bool. B * C * Z = 4.
|