Skip to content

fix bugs. #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
QDXG-CXK wants to merge 1 commit into
base: main
Choose a base branch
from
Open

fix bugs. #4

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions deltapq_approx_tree_main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -246,6 +246,11 @@ int main(int argc, char* argv[]){
int M_arg;
M_arg = PQ_M + sizeof(int);
diff_argument = PQ_M + sizeof(int);
m_sub_distances = new float*[PQ_M]; // m_sub_distances defined in .h file
for (int i = 0; i < PQ_M; i++) {
m_sub_distances[i] = new float[PQ_K];
memset(m_sub_distances[i], 0, sizeof(float)*PQ_K);
}
bool file_read = create_approx_tree(dataset, vecs, dummycodes,
dummymarks, M_arg, PQ_K, num_codes, diff_argument,
nodes, m_sub_distances,
Expand Down
3 changes: 0 additions & 3 deletions pq_tree.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -391,9 +391,6 @@ vector<pair<int, float> > PQTree::SampledQuery(vector<float> &query, int id) {
return results;
}
#ifdef PLAIN_PQ
auto comp_max_heap = [](const pair<int, float> &a, const pair<int, float> &b) {
return a.second < b.second;
};
void print_heap(vector<pair<int, float>>& test) {
for (int i = 0; i < test.size(); i ++) {
cout << test[i].first << ", " << test[i].second << " ";
Expand Down