2012-06-19 12:02:15 +00:00
|
|
|
*** classifier.cc.orig Mon Jun 18 21:55:28 2012
|
|
|
|
|
--- classifier.cc Tue Jun 19 20:56:27 2012
|
|
|
|
|
***************
|
|
|
|
|
*** 50,56 ****
|
|
|
|
|
size_t Classifier::lookup_inverted_index(size_t max, const Vector &vec,
|
|
|
|
|
std::vector<VectorId> &ids) const {
|
|
|
|
|
HashMap<VectorId, bool>::type idmap;
|
|
|
|
|
! init_hash_map(VECID_EMPTY_KEY, idmap);
|
|
|
|
|
std::vector<VecItem> items;
|
|
|
|
|
vec.sorted_items_abs(items);
|
|
|
|
|
for (size_t i = 0; i < items.size() && i < max; i++) {
|
|
|
|
|
--- 50,57 ----
|
|
|
|
|
size_t Classifier::lookup_inverted_index(size_t max, const Vector &vec,
|
|
|
|
|
std::vector<VectorId> &ids) const {
|
|
|
|
|
HashMap<VectorId, bool>::type idmap;
|
|
|
|
|
! VectorId empty = VECID_EMPTY_KEY;
|
|
|
|
|
! init_hash_map(empty, idmap);
|
|
|
|
|
std::vector<VecItem> items;
|
|
|
|
|
vec.sorted_items_abs(items);
|
|
|
|
|
for (size_t i = 0; i < items.size() && i < max; i++) {
|
