Faster optimal solver.

This is a pretty big one, but unfortunately performance only improved by about 5%.
I implemented one of the main ideas of nxopt, that is switching to the
inverse scramble on the fly if it gives a lower branching factor.
On the one hand it makes sense that it does not have such a huge impact, since
it only rarely happens that we do have a lower branching factor on inverse, but
on the other hand I am quite sad that the improvement is barely noticeable :-(
Maybe the problem is that I have introduced a lot of new overhead and I can improve
that in the future. Or maybe I am just overlooking something stupid.

1 files changed, 2 insertions, 0 deletions

diff --git a/src/utils.h b/src/utils.h
index 80c33ae..9ba228d 100644
--- a/src/utils.h
+++ b/src/utils.h
@@ -2,6 +2,7 @@
 #define UTILS_H
 
 #include <stdbool.h>
+#include <stdint.h>
 #include <stdlib.h>
 #include <string.h>
 
@@ -37,5 +38,6 @@ int         powint(int a, int b);
 int         subset_to_index(int *a, int n, int k);
 void        sum_arrays_mod(int *src, int *dst, int n, int m);
 void        swap(int *a, int *b);
+void        swapu64(uint64_t *a, uint64_t *b);
 
 #endif