How did they do it?
-
For a moment forget about your environment and try to think like the original developers. You've got very limited RAM, and slightly-less limited code space. This means your code has to be clever. It also implies you don't necessarily have to handle the arbitrary, general case where all possibilities are handled regardless of what seems to be allowed by the parameters. As an example, suppose you have a signed 16-bit value to handle. Does the usage really need to allow for negative values? What about zero (0)? What's the actual, practical range for the value? Figuring out the actual, implicit (and undocumented) constraints can help figure out a practical algorithm.
Software Zen:
delete this;I totally agree with this, and when I originally planned this I was writing clever code. :) I use signed values for most things because midi is largely a 7-bit protocol. that way if I accidentally set the sign bit the number jumps out at me as negative. In the end I solved it. It took me moving my code to a real PC so I could fire up a debugger. It was just too complicated to work through it without one.
To err is human. Fortune favors the monsters.
-
I totally agree with this, and when I originally planned this I was writing clever code. :) I use signed values for most things because midi is largely a 7-bit protocol. that way if I accidentally set the sign bit the number jumps out at me as negative. In the end I solved it. It took me moving my code to a real PC so I could fire up a debugger. It was just too complicated to work through it without one.
To err is human. Fortune favors the monsters.
honey the codewitch wrote:
It took me moving my code to a real PC so I could fire up a debugger. It was just too complicated to work through it without one.
I like it! I've used this approach on occasion when I "couldn't see the forest for the trees".
Software Zen:
delete this; -
honey the codewitch wrote:
It took me moving my code to a real PC so I could fire up a debugger. It was just too complicated to work through it without one.
I like it! I've used this approach on occasion when I "couldn't see the forest for the trees".
Software Zen:
delete this;It also helps keep it cross platform, so it's win win. I developed most of my GFX library for IoT devices on a PC. I would just draw to in memory bitmaps and then write those to the console as ascii. =)
To err is human. Fortune favors the monsters.
-
It also helps keep it cross platform, so it's win win. I developed most of my GFX library for IoT devices on a PC. I would just draw to in memory bitmaps and then write those to the console as ascii. =)
To err is human. Fortune favors the monsters.
honey the codewitch wrote:
memory bitmaps and then write those to the console as ascii
That triggers a flashback to the early 90's. At the time all of the fonts in our printers were hand-drawn bitmaps. We had a text format where each character's bitmap was drawn using "." for a white pixel, and "@" for a black one. We then had a utility that would convert the text format to the binary form of the font file.
Software Zen:
delete this; -
honey the codewitch wrote:
memory bitmaps and then write those to the console as ascii
That triggers a flashback to the early 90's. At the time all of the fonts in our printers were hand-drawn bitmaps. We had a text format where each character's bitmap was drawn using "." for a white pixel, and "@" for a black one. We then had a utility that would convert the text format to the binary form of the font file.
Software Zen:
delete this;haha I had a python script that created or extracted win 3.1 .FON files in that format for editing or creating. I used it as a reference to create my raster font loading routines.
To err is human. Fortune favors the monsters.
-
That's what I do essentially as far as the deltas. My pre stream is n contexts where n is the number of tracks. I use those to pull events out in the right order
To err is human. Fortune favors the monsters.
Isn't this effectively a merge sort from N sources. Each source is already sorted. I admit my ignorance in how you calculate your context. But I assume that EITHER you have an incoming stream of N contexts pre-sorted (which would make outputting it more trivial as you output it in the order it arrives). Or you have an incoming stream with N tracks, where each track is at a specific offset, but the magic is that while track 1 has a small delta, track 3 could have an excessively large delta, so it is played at the right time. And you might not hear from track 3 for some time. I often find it helpful to imagine how they implemented the player at the hardware level. For my take, I would write something that played only 1 of N contexts correctly... Then I would look hard at how to implement simply adding a second context to that. Based on how the data shows up. Because by the time you get to the third or fourth, I think you usually have a decent approach. The other comparison I would make is a Multiplexer. is this similar to CDM or TDM (Code or Time division Multiplexing). Another comparison is Stereo, where you get L+R and a 2L (I forget the actual), but taking -2L + L+R => -L+R + L+R = 2R But they did it that way to take advantage of simpler hardware. I remember learning from that example that coding stuff versus building components you have to think differently about what is easy/hard. == Finally, your problem reminds me of a Computer Engineering Class, where we built circuits that were run through a simulator. The simulator used a queue design, where "events" would trigger through the queue, and the simulator was able to be fast, because it ignored the timing signals, allowing it to "not wait" any time before processing an item. (I got in trouble in the class, because I wrote obscenely inefficient but SIMPLE code, reducing the homework to a TRIVIAL problem, avoiding the timing issues others were busy coding around). anyways, I could envision a queue that is managing N queues of inputs, and only when you take off an item, do you go to the stream to pull in another item.
-
Isn't this effectively a merge sort from N sources. Each source is already sorted. I admit my ignorance in how you calculate your context. But I assume that EITHER you have an incoming stream of N contexts pre-sorted (which would make outputting it more trivial as you output it in the order it arrives). Or you have an incoming stream with N tracks, where each track is at a specific offset, but the magic is that while track 1 has a small delta, track 3 could have an excessively large delta, so it is played at the right time. And you might not hear from track 3 for some time. I often find it helpful to imagine how they implemented the player at the hardware level. For my take, I would write something that played only 1 of N contexts correctly... Then I would look hard at how to implement simply adding a second context to that. Based on how the data shows up. Because by the time you get to the third or fourth, I think you usually have a decent approach. The other comparison I would make is a Multiplexer. is this similar to CDM or TDM (Code or Time division Multiplexing). Another comparison is Stereo, where you get L+R and a 2L (I forget the actual), but taking -2L + L+R => -L+R + L+R = 2R But they did it that way to take advantage of simpler hardware. I remember learning from that example that coding stuff versus building components you have to think differently about what is easy/hard. == Finally, your problem reminds me of a Computer Engineering Class, where we built circuits that were run through a simulator. The simulator used a queue design, where "events" would trigger through the queue, and the simulator was able to be fast, because it ignored the timing signals, allowing it to "not wait" any time before processing an item. (I got in trouble in the class, because I wrote obscenely inefficient but SIMPLE code, reducing the homework to a TRIVIAL problem, avoiding the timing issues others were busy coding around). anyways, I could envision a queue that is managing N queues of inputs, and only when you take off an item, do you go to the stream to pull in another item.
Kirk 10389821 wrote:
Finally, your problem reminds me of a Computer Engineering Class, where we built circuits that were run through a simulator. The simulator used a queue design, where "events" would trigger through the queue, and the simulator was able to be fast, because it ignored the timing signals, allowing it to "not wait" any time before processing an item. (I got in trouble in the class, because I wrote obscenely inefficient but SIMPLE code, reducing the homework to a TRIVIAL problem, avoiding the timing issues others were busy coding around). anyways, I could envision a queue that is managing N queues of inputs, and only when you take off an item, do you go to the stream to pull in another item.
You're describing the problem pretty well, which I actually solved last night. I won't paste the implementation here, but here is using it with a queue
qForgive the grotty code. It's just test stuff I've been banging on#ifndef ARDUINO
#include
#include
#include
#include
#include
#include
using namespace sfx;void dump_midi(stream* stm, const midi_file& file) {
printf("Type: %d\nTimebase: %d\n",(int)file.type,(int)file.timebase);
printf("Tracks: %d\n",(int)file.tracks_size);
for(int i = 0;i<(int)file.tracks_size;++i) {
printf("\tOffset: %d, Size: %d, Preview: ",(int)file.tracks[i].offset,(int)file.tracks[i].size);
stm->seek(file.tracks[i].offset);
uint8_t buf[16];
size_t tsz = file.tracks[i].size;
size_t sz=stm->read(buf,tsz<16?tsz:16);
for(int j = 0;j