Earlier quoted context omitted.
> How did you count 30? Counting paths from the first node to the "NO" node rather than just counting total edges leading to the "NO" node. Many of the conditions you mentioned are themselves determined based on various other conditions, and/or only triggered if certain paths (but not others) are followed. > You can check these conditions sequentially and if any of them match, return false. Not so. For example, you c…
No matter. I transcribed that list in a matter of 5 minutes with no knowledge about the application (I haven't used slack in a long time). I'm not going to get it right in 5 minutes. It will obviously take time. But, this is not the kind of thing that justifies, for example, having 20 engineers to work on this one problem for three weeks. It's still a simple thing for one person to handle in a couple of days. I don't…
I don't disagree, I just think it's more effort than the 'regular function with about 30 lines of code' you first mentioned.