Thai Pangsakulyanont 61a69fe457 prepwork: also generate a data structure for note statistics that can
determine the number of notes to display from any beat to any beat in
O(log n) [n = number of non-empty rows].

it might be used to determine the first displayed beat or last displayed
beat based on number of notes on screen (instead of fixed beats),
if this can be implemented properly, then notes will no longer disappear
or appear during a long slow scrolls/speeds [as long as the number of
notes to display is in our limit].
2011-09-16 22:27:56 +07:00
2011-09-06 16:46:17 -05:00
2011-09-07 17:42:29 -05:00
2011-08-20 20:53:37 -07:00
2011-08-20 22:14:01 -05:00
2011-03-17 01:47:30 -04:00
2011-09-07 17:42:29 -05:00
2011-08-27 03:47:31 -05:00
2011-07-16 15:14:08 -05:00
2011-09-14 23:31:01 -05:00
2010-07-24 00:26:22 -05:00
2011-08-28 12:49:57 -05:00
2011-09-13 02:06:50 +00:00
2011-09-06 12:44:34 -05:00
2011-05-02 17:48:03 -05:00
2011-08-23 22:16:48 -06:00
2011-06-13 14:32:35 -05:00
2011-03-17 01:47:30 -04:00
2011-09-06 12:44:34 -05:00
S
Description
554 MiB
Languages
C++ 85.7%
Lua 4.3%
C 4.3%
Rich Text Format 2.3%
CMake 1.1%
Other 2%