Mercurial > hg > audiodb
view tests/0033/run-test.sh @ 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 | fe4dc39b2dd7 |
children |
line wrap: on
line source
#! /bin/bash . ../test-utils.sh if [ -f testdb ]; then rm -f testdb; fi ${AUDIODB} -d testdb -N intstring 2 > testfeature01 floatstring 0 1 >> testfeature01 intstring 2 > testfeature10 floatstring 1 0 >> testfeature10 ${AUDIODB} -d testdb -I -f testfeature01 ${AUDIODB} -d testdb -I -f testfeature10 # sequence queries require L2NORM ${AUDIODB} -d testdb -L echo "query point (0.0,0.5)" intstring 2 > testquery floatstring 0 0.5 >> testquery ${AUDIODB} -d testdb -Q sequence -l 1 -f testquery -R 5 > testoutput echo testfeature01 1 > test-expected-output echo testfeature10 1 >> test-expected-output cmp testoutput test-expected-output ${AUDIODB} -d testdb -Q sequence -l 1 -f testquery -K /dev/null -R 5 > testoutput cat /dev/null > test-expected-output cmp testoutput test-expected-output echo testfeature01 > testkl.txt ${AUDIODB} -d testdb -Q sequence -l 1 -f testquery -K testkl.txt -R 5 > testoutput echo testfeature01 1 > test-expected-output cmp testoutput test-expected-output echo testfeature10 > testkl.txt ${AUDIODB} -d testdb -Q sequence -l 1 -f testquery -K testkl.txt -R 5 > testoutput echo testfeature10 1 > test-expected-output cmp testoutput test-expected-output echo testfeature10 > testkl.txt ${AUDIODB} -d testdb -Q sequence -l 1 -f testquery -K testkl.txt -r 1 -R 5 > testoutput echo testfeature10 1 > test-expected-output cmp testoutput test-expected-output # NB: one might be tempted to insert a test here for having both keys # in the keylist, but in non-database order, and then checking that # the result list is also in that non-database order. I think that # would be misguided, as the efficient way of dealing with such a # keylist is to advance as-sequentially-as-possible through the # database; it just so happens that our current implementation is not # so smart. echo "query point (0.5,0.0)" intstring 2 > testquery floatstring 0.5 0 >> testquery ${AUDIODB} -d testdb -Q sequence -l 1 -f testquery -R 5 > testoutput echo testfeature01 1 > test-expected-output echo testfeature10 1 >> test-expected-output cmp testoutput test-expected-output echo testfeature10 > testkl.txt ${AUDIODB} -d testdb -Q sequence -l 1 -f testquery -K testkl.txt -r 1 -R 5 > testoutput echo testfeature10 1 > test-expected-output cmp testoutput test-expected-output exit 104