3 Commits

Author	SHA1	Message	Date
Veikko Sariola	95c8c9c2b7	refactor(go4k): Remove all special treatment from samples and map Song 1-1 to what's in the .asm file. ... Whoever uses it, probably wants their own Patch format, as now it is pretty cumbersome to work with sampleoffsets and delays, as the user needs to construct the delaytimes tables and sampleoffset tables.	2020-11-20 22:21:21 +02:00
Veikko Sariola	377132321f	feat(go4k): Implement .asm exporting.	2020-11-10 20:05:03 +02:00
Veikko Sariola	e36aea59a5	feat(go4k): Algorithm to construct small delay times tables by abusing overlapping of different delay times. ... The problem of finding a string that contains all particular substrings is the "shortest superstring problem"; it is NP-hard and analogous to traveling salesman problem. We use simple greedy search instead of trying to find true optimum. But even with these algorithm, units that use exactly the same delay times will always appear only once in the delay times table.	2020-11-09 22:29:10 +02:00