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
Is your feature request related to a problem? Please describe.
Currently, we have a BinaryExpressionMutator that swaps operators, for example a + b -> a - b or a && b -> a || b.
For NullCoalescingExpressions, we do not only swap, but also remove either side of the expression.
I think this is something we could also do for other binary expressions.
Describe the solution you'd like
I'd like a mutator that removes either operand in a binary expression. For example, a + b -> a, a + b -> b, a && b -> a, etc.
The text was updated successfully, but these errors were encountered:
I am not sure these mutations would behave differently than the regular binary expression one:
if a+b => a-b is killed, a+b => a is probably killed as well. Expect for string operations, of course.
Is your feature request related to a problem? Please describe.
Currently, we have a
BinaryExpressionMutator
that swaps operators, for examplea + b -> a - b
ora && b -> a || b
.For
NullCoalescingExpression
s, we do not only swap, but also remove either side of the expression.I think this is something we could also do for other binary expressions.
Describe the solution you'd like
I'd like a mutator that removes either operand in a binary expression. For example,
a + b -> a
,a + b -> b
,a && b -> a
, etc.The text was updated successfully, but these errors were encountered: