Merge branch 'master' of https://github.com/sunyinqi0508/AQuery

sdk/Evaluation.cpp

@@ -5,14 +5,13 @@
 
 struct minEval{
         double value;
-        double values;
+        int* values;
 
 	double eval;
         long left; // how many on its left
         double* record;
         long max;
         long** count;
-        long* sorted; // sorted d
 };
 
 minEval giniSparse(double** data, long* result, long* d, long size, long col, long classes, long* totalT){

sdk/irf.cpp

@@ -4,9 +4,6 @@
 #include "../server/table.h"
 
 DecisionTree* dt = nullptr;
-long pt = 0;
-double** data = nullptr;
-long* result = nullptr;
 
 __AQEXPORT__(bool) newtree(int height, long f, ColRef<int> sparse, double forget, long maxf, long noclasses, Evaluation e, long r, long rb){
 	if(sparse.size!=f)return 0;
@@ -19,14 +16,13 @@ __AQEXPORT__(bool) newtree(int height, long f, ColRef<int> sparse, double forget
 	return 1;
 }
 
-__AQEXPORT__(bool) additem(ColRef<double>X, long y, long size){
+__AQEXPORT__(bool) fit(ColRef<ColRef<double>> X, ColRef<int> y){
-	long j = 0;
+	if(X.size != y.size)return 0;
-	if(size>0){
+	double** data = (double**)malloc(X.size*sizeof(double*));
-		free(data);
+	long* result = (long*)malloc(y.size*sizeof(long));
-		free(result);
+	for(long i=0; i<X.size; i++){
-		pt = 0;
+		data[i] = X.container[i].container;
-		data=(double**)malloc(size*sizeof(double*));
+		result[i] = y.container[i];
-		result=(long*)malloc(size*sizeof(long));
 	}
 	data[pt] = (double*)malloc(X.size*sizeof(double));
 	for(j=0; j<X.size; j++){