Normalizing logic

[Mike Austin]

I often come across logic that could be normalized but question if it makes it clearer.

if (targetSprintId === sourceSprintId ? targetItemId !== sourceItemId : true) { ... }

It a little awkward with the ternary, but you see that *ItemId is related to the the sprint ids being equal.

if (targetSprintId !== sourceSprintId || targetItemId !== sourceItemId) { ... }

This is more "normalized" you could say, since *ItemIds are only relevant if the sprint ids are equal. But does that require extra brain load? I have to think in negative terms first.

[jido]

Well, this example should be written:

if not (targetSprintId === sourceSprintId && targetItemId === sourceItemId) { ... }

As you say, it is easier for the brain to apply the negative at the end.

[Mike Austin]

Perfect! I literally didn't see the !=== || !== pattern because I wasn't looking at the big picture.

I wonder if there's an online logic tool where it can reduce complex boolean logic, and explain the logic (tree?). There are similar tools for Regular Expressions for example  regex101: build, test, and debug regex.