Added gitignore and sample input

Author: adish29

.gitignore

@@ -0,0 +1,2 @@
+*.exe
+*.in

main1.cpp

@@ -0,0 +1,71 @@
+#include "hnsw.h"
+
+#include <algorithm>
+#include <ctime>
+#include <iostream>
+#include <random>
+#include <vector>
+using namespace std;
+
+void randomTest(int numItems, int dim, int numQueries, int K) {
+	std::default_random_engine generator;
+    std::uniform_real_distribution<double> distribution(0.0, 1.0);
+    std::vector<Item> randomItems;
+    randomItems.reserve(numItems);
+
+    for (int i = 0; i < numItems; i++) {
+        std::vector<double> temp(dim);
+        for (int d = 0; d < dim; d++) {
+            temp[d] = distribution(generator);
+        }
+        randomItems.emplace_back(temp);
+    }
+
+    std::shuffle(randomItems.begin(), randomItems.end(), generator);
+	HNSWGraph myHNSWGraph(10, 30, 30, 10, 2);
+	for (int i = 0; i < numItems; i++) {
+		if (i % 10000 == 0) cout << i << endl;
+		myHNSWGraph.Insert(randomItems[i]);
+	}
+	
+	double total_brute_force_time = 0.0;
+	double total_hnsw_time = 0.0;
+
+	cout << "START QUERY" << endl;
+	int numHits = 0;
+	for (int i = 0; i < numQueries; i++) {
+		vector<double> temp(dim);
+		for (int d = 0; d < dim; d++) {
+			temp[d] = distribution(generator);
+		}
+		Item query(temp);
+
+		// Brute force
+		clock_t begin_time = clock();
+		vector<pair<double, int>> distPairs;
+		for (int j = 0; j < numItems; j++) {
+			if (j == i) continue;
+			distPairs.emplace_back(query.dist(randomItems[j]), j);
+		}
+		sort(distPairs.begin(), distPairs.end());
+		total_brute_force_time += double( clock () - begin_time ) /  CLOCKS_PER_SEC;
+
+		begin_time = clock();
+		vector<int> knns = myHNSWGraph.KNNSearch(query, K);
+		// cout << "Printing vectors";
+		// std::cout << "Contents of knns vector:" << std::endl;
+		// for (size_t i = 0; i < knns.size(); ++i) {
+		// 	std::cout << "knns[" << i << "] = " << knns[i] << std::endl;
+		// }
+		// cout << "\nPrinted Vectors";
+		total_hnsw_time += double( clock () - begin_time ) /  CLOCKS_PER_SEC;
+
+		if (knns[0] == distPairs[0].second) numHits++;
+	}
+	cout << numHits << " " << total_brute_force_time / numQueries  << " " << total_hnsw_time / numQueries << endl;
+}
+
+int main() {
+	randomTest(10000, 4, 100, 5);
+	return 0;
+}

sample_inputs/compile_generator.sh

@@ -0,0 +1 @@
+g++ input_generator.cc -o input_generator -O3 -std=c++11

sample_inputs/input_generator.cc

@@ -0,0 +1,85 @@
+#include<stdio.h>
+#include<string.h>
+#include<random>
+#include<string>
+#include<algorithm>
+#include<set>
+#include<random>
+#include<cmath>
+
+std::mt19937 generator(123456789);
+std::normal_distribution<double> dist(0.0,1.0);
+const int max_iter = 100;
+
+double cosine_similarity(const std::vector<double>& u,const std::vector<double>& v){
+  double ip = 0;
+  double sumu2 = 0;
+  double sumv2 = 0;
+  for(int i = 0;i < u.size();++i){
+    ip += u[i] * v[i];
+    sumu2 += u[i] * u[i];
+    sumv2 += v[i] * v[i];
+  }
+  return ip / sqrt(sumu2) / sqrt(sumv2);
+}
+
+void dump_func(int cas,int D,int N,int M,double T){
+	printf("dumping case %d\n",cas);
+	std::string file_name = "sample" + std::to_string(cas) + ".in";
+	FILE* fp = fopen(file_name.c_str(),"w");
+	fprintf(fp,"%d %d %d %f\n",D,N,M,T);
+  std::vector<std::vector<double>> data;
+  for(int i = 0;i < N;++i){
+    std::vector<double> tmp;
+    for(int j = 0;j < D;++j)
+      tmp.push_back(dist(generator));
+    data.push_back(tmp);
+    fprintf(fp,"%f",tmp[0]);
+    for(int j = 1;j < D;++j)
+      fprintf(fp," %f",tmp[j]);
+    fprintf(fp,"\n");
+  }
+
+  std::uniform_int_distribution<int> distint(0,N - 1);
+  for(int i = 0;i < M;++i){
+    double eps = 1e-1;
+    bool found = false;
+    while(!found){
+      std::normal_distribution<double> disteps(0.0,eps);
+      for(int iter = 0;iter < max_iter;++iter){
+        int idx = distint(generator);
+        std::vector<double> q = data[idx];
+        for(int j = 0;j < D;++j)
+          q[j] += disteps(generator);
+        if(cosine_similarity(q,data[idx]) > T){
+          found = true;
+          fprintf(fp,"%f",q[0]);
+          for(int j = 1;j < D;++j)
+            fprintf(fp," %f",q[j]);
+          fprintf(fp,"\n");
+          break;
+        }
+      }
+      eps /= 2;
+    }
+  }
+	fclose(fp);
+}
+
+int main(){
+  // dump_func(12,128,10000, 10000,0.9);
+  // Dimensions, Base Vectors, Queries, Targets
+  dump_func(1,2,10,5,0.9);
+  dump_func(2,4,50,10,0.9);
+  dump_func(3,4,1000,100,0.9);
+  // dump_func(3,128,1000000,10000,0.9);
+  // dump_func(4,128,1000000,10000,0.95);
+  // dump_func(5,256,1000000,10000,0.9);
+  // dump_func(6,256,1000000,10000,0.95);
+  // dump_func(7,512,500000,10000,0.9);
+  // dump_func(8,512,500000,10000,0.95);
+  // dump_func(9,512,1000000,10000,0.9);
+  // dump_func(10,512,1000000,10000,0.95);
+  return 0;
+}
+