Trapezoidal jumps

I haven't checked this yet, but it seems like it also reduces the
complexity (runtime) from ≈O(n^2) to ≈O(k^2 + n)
(n = number of jump curves)
(k = number of unique destinations)

The worst case, that is k = n, is still O(n^2) but generally it's much
more (scalably) performant.

Thanks Arkanic for suggesting this!
https://discord.com/channels/391020510269669376/663854113418641429/1256161815503704104

Co-authored-by: Arkanic <50847107+Arkanic@users.noreply.github.com>
This commit is contained in:
code-explorer786
2024-06-30 12:00:34 +07:00
parent c5b8133ff9
commit a5de131711
3 changed files with 53 additions and 25 deletions

View File

@@ -1227,6 +1227,7 @@ setting.showweather.name = Show Weather Graphics
setting.hidedisplays.name = Hide Logic Displays
setting.dynamicjumpheights.name = Dynamic Jump Heights
setting.coloredjumps.name = Colored Jumps
setting.trapezoidaljumps.name = Trapezoidal Jumps
setting.macnotch.name = Adapt interface to display notch
setting.macnotch.description = Restart required to apply changes
steam.friendsonly = Friends Only