Steve Checkoway 29e6e796ba Simplify and speed up loading (very very slightly). It would be fastest to add all BPM/stop segments to the array and then sort it once (n log n). It was sorting after every insertion (n^2 log n). This now does simple insertion sort so it's n^2 in the worst case but since upper_bound does a binary search, if the BPM segments are in order this will take n log n in the best case. ...

That said, you'll notice no difference unless you had thousands of BPM changes in a file.

2006-07-20 01:56:17 +00:00

stepmania

Simplify and speed up loading (very very slightly). It would be fastest to add all BPM/stop segments to the array and then sort it once (n log n). It was sorting after every insertion (n^2 log n). This now does simple insertion sort so it's n^2 in the worst case but since upper_bound does a binary search, if the BPM segments are in order this will take n log n in the best case.

2006-07-20 01:56:17 +00:00

S

Description

Mirror of https://github.com/actions/itgmania212121

554 MiB

Languages

C++ 85.7%

Lua 4.3%

C 4.3%

Rich Text Format 2.3%

CMake 1.1%

Other 2%