mirror of
https://github.com/krgamestudios/Toy.git
synced 2026-04-15 23:04:08 +10:00
Kayne Ruse
2157b2f540
TOY_OP_INDEX_ASSIGN_INTERMEDIATE was being used when it shouldn't have. Now the check runs down the whole binary->right branch to ensure the given node doesn't exist in that tree.
10 lines
256 B
Plaintext
10 lines
256 B
Plaintext
|
|
var result; //result must exist to ensure assingment, rather than declaration is invoked by the comparison below
|
|
|
|
var lhs = [0];
|
|
var rhs = [0];
|
|
|
|
result = lhs[0] < rhs[0]; //make sure this doesn't invoke TOY_OP_INDEX_ASSIGN_INTERMEDIATE
|
|
|
|
|
|
print "All good"; |