Keep sets sorted

[satune.git] / src / AST / set.cc

diff --git a/src/AST/set.cc b/src/AST/set.cc
index 76d6713ad17ebc9f178ee8a506b5f098c44f6bc4..54c66798f9889d3dda6fb433f5c9b56d3547947e 100644 (file)
--- a/src/AST/set.cc
+++ b/src/AST/set.cc
@@ -2,15 +2,29 @@
 #include <stddef.h>
 #include "csolver.h"
 #include "serializer.h"
+#include "qsort.h"
 
 Set::Set(VarType t) : type(t), isRange(false), low(0), high(0) {
        members = new Vector<uint64_t>();
 }
 
+int intcompare(const void *p1, const void *p2) {
+       uint64_t a=*(uint64_t const *) p1;
+       uint64_t b=*(uint64_t const *) p2;
+       if (a < b)
+               return -1;
+       else if (a==b)
+               return 0;
+       else
+               return 1;
+}
+
 Set::Set(VarType t, uint64_t *elements, uint num) : type(t), isRange(false), low(0), high(0) {
        members = new Vector<uint64_t>(num, elements);
+       bsdqsort(members->expose(), members->getSize(), sizeof(uint64_t), intcompare);
 }
 
+
 Set::Set(VarType t, uint64_t lowrange, uint64_t highrange) : type(t), isRange(true), low(lowrange), high(highrange), members(NULL) {
 }
 
@@ -87,4 +101,4 @@ void Set::serialize(Serializer* serializer){
                uint64_t mem = members->get(i);
                serializer->mywrite(&mem, sizeof(uint64_t));
        }
-}
\ No newline at end of file
+}