Mercurial > hg > audiodb
view liszt.cpp @ 465:1030664df98c api-inversion
No more audioDB::index_allocate and audioDB::index_init_query
No more SERVER_LSH_INDEX_SINGLETON, either; instead each adb_t contains
a single cache of the last used in-core index. At the moment, this
cache is unused by the server (and the previous cache code has been
replaced by a comment), but I think that this way everyone can be
allowed to benefit without anyone having to explicitly manage indexes
themselves.
I'm not going to say how long I wandered in a maze of valgrind before
giving up and keeping the hacky workaround for loading the lsh tables
[see the FIXME comment in audiodb_index_init_query()]; let's just say
that it was long enough to find the extra bonus crashy close(lshfid) in
audioDB::index_index_db.
Also, delete the abstraction-inverting LSH stuff from query.cpp where we
are making our reporters; the fix for that, which is presumably when
creating small indexes for large datasets, is to implement
space-efficient reporters. (The accumulator code, which is my second
attempt, is more space-efficient than the reporters; inspiration may
wish to be drawn...)
author | mas01cr |
---|---|
date | Tue, 30 Dec 2008 23:56:57 +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; } }