1
0
mirror of https://github.com/TomHarte/CLK.git synced 2025-07-25 13:24:23 +00:00

Made an attempt to come up with a data structure that actually makes sense (though perhaps this is textbook list rather than vector stuff? I guess it depends on the frequency I expect inserts to occur versus reads) and to implement inserts. Though the Periods aren't yet honoured.

This commit is contained in:
Thomas Harte
2016-12-19 07:42:43 -05:00
parent 1df478d250
commit 8f937ceac8
3 changed files with 82 additions and 14 deletions

View File

@@ -20,6 +20,7 @@ namespace Storage {
struct Time {
unsigned int length, clock_rate;
Time() : length(0), clock_rate(1) {}
Time(unsigned int int_value) : length(int_value), clock_rate(1) {}
Time(unsigned int length, unsigned int clock_rate) : length(length), clock_rate(clock_rate) {}
/*!