Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

2
  • There's a couple small jumps of logic from your question that I don't completely understand. You go from "I have an optimal algorithm that works" (Good!) to "It's ugly" (Why?) to "How would you do it in FP" (Why?). Is there any issue with your algorithm beside the fact that it is supposedly ugly and not FP? Commented Dec 1, 2021 at 21:32
  • Ugly: because of for loops and querying that happens in them... It just doesn't feel right for what it does. Can't put a finger on it, but just a feeling. Why do it in FP? Because. I'm not planning to change it unless FP is somehow much cleaner, but I'm just interested how this could be done in FP. The problem I come to is, that windows are related to each other, and are not immutable (the change of the current window is going to collide with the change of the next window). I don't know much of FP, only the principles and this problem seems to be hard to solve with it (at least for me). Commented Dec 1, 2021 at 21:41