Mercurial > hg > audiodb
annotate nearestaccumulator.h @ 497:9d8aee621afb api-inversion
More libtests fixups.
Include audiodb_close() calls everywhere (whoops).
Add the facility to run tests under valgrind. Unfortunately the
error-exitcode flag doesn't actually cause an error exit if the only
thing wrong is memory leaks, but it will if there are actual memory
errors, which is a start.
author | mas01cr |
---|---|
date | Sat, 10 Jan 2009 16:07:43 +0000 |
parents | 580f696c817c |
children | e21a3db643af |
rev | line source |
---|---|
mas01cr@420 | 1 template <class T> class NearestAccumulator : public Accumulator { |
mas01cr@420 | 2 public: |
mas01cr@420 | 3 NearestAccumulator(); |
mas01cr@420 | 4 ~NearestAccumulator(); |
mas01cr@420 | 5 void add_point(adb_result_t *r); |
mas01cr@420 | 6 adb_query_results_t *get_points(); |
mas01cr@420 | 7 private: |
mas01cr@420 | 8 std::set< adb_result_t, adb_result_triple_lt > *set; |
mas01cr@420 | 9 std::set< adb_result_t, adb_result_qpos_lt > *points; |
mas01cr@420 | 10 }; |
mas01cr@420 | 11 |
mas01cr@420 | 12 template <class T> NearestAccumulator<T>::NearestAccumulator() |
mas01cr@420 | 13 : set(0), points(0) { |
mas01cr@420 | 14 set = new std::set< adb_result_t, adb_result_triple_lt >; |
mas01cr@420 | 15 points = new std::set< adb_result_t, adb_result_qpos_lt >; |
mas01cr@420 | 16 } |
mas01cr@420 | 17 |
mas01cr@420 | 18 template <class T> NearestAccumulator<T>::~NearestAccumulator() { |
mas01cr@420 | 19 if(set) { |
mas01cr@420 | 20 delete set; |
mas01cr@420 | 21 } |
mas01cr@420 | 22 if(points) { |
mas01cr@420 | 23 delete points; |
mas01cr@420 | 24 } |
mas01cr@420 | 25 } |
mas01cr@420 | 26 |
mas01cr@420 | 27 template <class T> void NearestAccumulator<T>::add_point(adb_result_t *r) { |
mas01cr@420 | 28 if(!isnan(r->dist)) { |
mas01cr@420 | 29 if(set->find(*r) == set->end()) { |
mas01cr@420 | 30 set->insert(*r); |
mas01cr@420 | 31 |
mas01cr@420 | 32 std::set< adb_result_t, adb_result_qpos_lt >::iterator it; |
mas01cr@420 | 33 it = points->find(*r); |
mas01cr@420 | 34 if(it == points->end()) { |
mas01cr@420 | 35 points->insert(*r); |
mas01cr@420 | 36 } else if(T()(*(const adb_result_t *)r,(*it))) { |
mas01cr@420 | 37 points->erase(it); |
mas01cr@420 | 38 points->insert(*r); |
mas01cr@420 | 39 } |
mas01cr@420 | 40 } |
mas01cr@420 | 41 } |
mas01cr@420 | 42 } |
mas01cr@420 | 43 |
mas01cr@420 | 44 template <class T> adb_query_results_t *NearestAccumulator<T>::get_points() { |
mas01cr@420 | 45 unsigned int nresults = points->size(); |
mas01cr@420 | 46 adb_query_results_t *r = (adb_query_results_t *) malloc(sizeof(adb_query_results_t)); |
mas01cr@420 | 47 adb_result_t *rs = (adb_result_t *) calloc(nresults, sizeof(adb_result_t)); |
mas01cr@420 | 48 r->nresults = nresults; |
mas01cr@420 | 49 r->results = rs; |
mas01cr@420 | 50 std::set< adb_result_t, adb_result_qpos_lt >::iterator it; |
mas01cr@420 | 51 unsigned int k = 0; |
mas01cr@420 | 52 for(it = points->begin(); it != points->end(); it++) { |
mas01cr@420 | 53 rs[k++] = *it; |
mas01cr@420 | 54 } |
mas01cr@420 | 55 return r; |
mas01cr@420 | 56 } |
mas01cr@420 | 57 |