bool_vector, some spacer tidy

Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>

src/test/bit_vector.cpp

@@ -23,7 +23,7 @@ Revision History:
 
 static void tst1() {
     bit_vector     v1;
-    svector<bool> v2;
+    bool_vector v2;
     unsigned n = rand()%10000;
     for (unsigned i = 0; i < n; i++) {
         int op = rand()%6;

src/test/diff_logic.cpp

@@ -86,7 +86,7 @@ static void tst2() {
     ENSURE(!g.is_feasible());
     TRACE("diff_logic", g.display(tout););
     struct proc {
-        svector<bool> found;
+        bool_vector found;
         proc():
             found(7, false) {
         }

src/test/doc.cpp

@@ -300,7 +300,7 @@ class test_doc_cls {
             d->neg().push_back(t);
         }
         fml1 = mk_and(m, fmls.size(), fmls.c_ptr());
-        svector<bool> to_merge(N, false);
+        bool_vector to_merge(N, false);
         bit_vector discard_cols;
         discard_cols.resize(N, false);
         unsigned num_bits = 1;

src/test/uint_set.cpp

@@ -22,7 +22,7 @@ Revision History:
 
 static void tst1(unsigned n) {
     uint_set       s1;
-    svector<bool>  s2(n, false);
+    bool_vector  s2(n, false);
     unsigned       size = 0;
 
     unsigned num_op = rand()%1000;

src/test/upolynomial.cpp

@@ -156,7 +156,7 @@ static void tst_isolate_roots(polynomial_ref const & p, unsigned prec = 5) {
 
 static void check_roots(mpbq_vector const & roots, mpbq_vector const & lowers, mpbq_vector const & uppers, unsigned expected_sz, rational const * expected_roots) {
     ENSURE(expected_sz == roots.size() + lowers.size());
-    svector<bool> visited;
+    bool_vector visited;
     visited.resize(expected_sz, false);
     for (unsigned i = 0; i < expected_sz; i++) {
         rational const & r = expected_roots[i];