Mercurial > hg > audiodb
view liszt.cpp @ 423:b09d2eb1a2b2 api-inversion
Cheap hackery abounds.
Include an accumulator into the query_loop chain. Somewhat
surprisingly, very few tests fail, and those that do are due to
over-specific reporting requirements in the case of ties, so rewrite
those tests to be more permissive.
There are probably codepaths which ignore the accumulator completely;
they will still work, because the accumulator will return zero points
when it is asked to ->get_points().
author | mas01cr |
---|---|
date | Wed, 24 Dec 2008 10:55:08 +0000 |
parents | 4ded52b104e6 |
children | e18843dc0aea |
line wrap: on
line source
#include "audioDB.h" void audioDB::liszt(const char* dbName, unsigned offset, unsigned numLines, adb__lisztResponse* adbLisztResponse){ if(!dbH) { initTables(dbName, 0); } assert(trackTable && fileTable); if(offset>dbH->numFiles){ char tmpStr[MAXSTR]; sprintf(tmpStr, "numFiles=%u, lisztOffset=%u", dbH->numFiles, offset); error("listKeys offset out of range", tmpStr); } if(!adbLisztResponse){ for(Uns32T k=0; k<numLines && offset+k<dbH->numFiles; k++){ fprintf(stdout, "[%d] %s (%d)\n", offset+k, fileTable+(offset+k)*O2_FILETABLE_ENTRY_SIZE, trackTable[offset+k]); } } else{ adbLisztResponse->result.Rkey = new char*[numLines]; adbLisztResponse->result.Rlen = new unsigned int[numLines]; Uns32T k = 0; for( ; k<numLines && offset+k<dbH->numFiles; k++){ adbLisztResponse->result.Rkey[k] = new char[MAXSTR]; snprintf(adbLisztResponse->result.Rkey[k], O2_MAXFILESTR, "%s", fileTable+(offset+k)*O2_FILETABLE_ENTRY_SIZE); adbLisztResponse->result.Rlen[k] = trackTable[offset+k]; } adbLisztResponse->result.__sizeRkey = k; adbLisztResponse->result.__sizeRlen = k; } }