Extract the method for setting ss->best

Author: Jana Pazurikova

src/diffevolution.c

@@ -71,13 +71,8 @@ void run_diff_evolution(struct subset * const ss) {
 		minimized_initial = s.population_size;
 	}
 
-
 	//find the best kappa_data
-	//TODO extract to separate method, also used in kappa.c:find_the_best_parameters
-	ss->best = &ss->data[0];
-	for (i = 0; i < ss->kappa_data_count -1; i++)
-		if (kd_sort_by_is_better(&ss->data[i], ss->best))
-			ss->best = &ss->data[i];
+	set_the_best(ss);
 
 	/* Run the optimization for max iterations */
 	//TODO include iters_max for DE in limits or use one already there (that is used for discard)

src/kappa.c

@@ -232,10 +232,7 @@ void find_the_best_parameters_for_subset(struct subset * const ss) {
 		/* Determine the best parameters for computed data */
 
 		if(s.params_method == PARAMS_LR_FULL) {
-			ss->best = &ss->data[0];
-			for(int i = 0; i < ss->kappa_data_count - 1; i++)
-				if(kd_sort_by_is_better(&ss->data[i], ss->best))
-					ss->best = &ss->data[i];
+			set_the_best(ss);
 		}
 		else if (s.params_method == PARAMS_LR_FULL_BRENT){
 			/* If Brent is used, the maximum is stored in the last item */
@@ -247,3 +244,12 @@ void find_the_best_parameters_for_subset(struct subset * const ss) {
 
 	}
 }
+
+/* Set the best parameters from subset */
+void set_the_best(struct subset * const ss) {
+	ss->best = &ss->data[0];
+	for(int i = 0; i < ss->kappa_data_count - 1; i++)
+		if(kd_sort_by_is_better(&ss->data[i], ss->best))
+			ss->best = &ss->data[i];
+
+}

src/kappa.h

@@ -12,5 +12,6 @@
 #include "subset.h"
 
 void find_the_best_parameters_for_subset(struct subset * const ss);
+void set_the_best(struct subset * const ss);
 
 #endif /* __KAPPA_H__ */