You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
At some point, we might want a reckless commutativity flag for AST matching. Currently, CAIT only supports adjacent commutativity on the same ast level because in theory, even things like addition are not technically commutative in python in cases where a function foo might mutate a reference where order would in such case matter
foo(reference_a) + foo(reference_a).
a more reckless commutativity would allow for vertical stretching of the tree instead of simply horizontal stretching of the tree. However, this really only makes sense in terms of arithmetic operators. But having a flag to enable such vertical stretching on BinOps could be useful, but a bit large of an undertaking.
The text was updated successfully, but these errors were encountered:
At some point, we might want a reckless commutativity flag for AST matching. Currently, CAIT only supports adjacent commutativity on the same ast level because in theory, even things like addition are not technically commutative in python in cases where a function foo might mutate a reference where order would in such case matter
foo(reference_a) + foo(reference_a).
a more reckless commutativity would allow for vertical stretching of the tree instead of simply horizontal stretching of the tree. However, this really only makes sense in terms of arithmetic operators. But having a flag to enable such vertical stretching on BinOps could be useful, but a bit large of an undertaking.
The text was updated successfully, but these errors were encountered: