If you can sort fractions and call a function to get something between two points, then that&#x27;s the entirety of the complexity. The &quot;library&quot; is about a hundred lines in JS and less in Erlang. The logic, which I have written in the past to do conditional reindexing has a worse interface and ends up with about the same LOC burden.<p>Seriously, I&#x27;ve done both of these and the complexity is about the same. One route just ends up with a much better separation of concerns where the other has surprising edge cases which I see hit far more often than I would have imagined.