@@ -13,7 +13,7 @@ Author: Daniel Poetzl
13
13
#define CPROVER_UTIL_SHARING_MAP_H
14
14
15
15
#ifdef SM_DEBUG
16
- #include < iostream>
16
+ # include < iostream>
17
17
#endif
18
18
19
19
#include < functional>
@@ -34,9 +34,9 @@ Author: Daniel Poetzl
34
34
#include " threeval.h"
35
35
36
36
#ifdef SM_INTERNAL_CHECKS
37
- #define SM_ASSERT (b ) INVARIANT(b, " Sharing map internal invariant" )
37
+ # define SM_ASSERT (b ) INVARIANT(b, " Sharing map internal invariant" )
38
38
#else
39
- #define SM_ASSERT (b )
39
+ # define SM_ASSERT (b )
40
40
#endif
41
41
42
42
// clang-format off
@@ -344,8 +344,8 @@ class sharing_mapt
344
344
map.swap (other.map );
345
345
346
346
std::size_t tmp = num;
347
- num= other.num ;
348
- other.num = tmp;
347
+ num = other.num ;
348
+ other.num = tmp;
349
349
}
350
350
351
351
// / Get number of elements in map
@@ -359,14 +359,14 @@ class sharing_mapt
359
359
// / Check if map is empty
360
360
bool empty () const
361
361
{
362
- return num== 0 ;
362
+ return num == 0 ;
363
363
}
364
364
365
365
// / Clear map
366
366
void clear ()
367
367
{
368
368
map.clear ();
369
- num= 0 ;
369
+ num = 0 ;
370
370
}
371
371
372
372
// / Check if key is in map
@@ -376,7 +376,7 @@ class sharing_mapt
376
376
// / - Best case: O(1)
377
377
bool has_key (const key_type &k) const
378
378
{
379
- return get_leaf_node (k)!= nullptr ;
379
+ return get_leaf_node (k) != nullptr ;
380
380
}
381
381
382
382
// views
@@ -695,8 +695,7 @@ ::iterate(
695
695
f (l.get_key (), l.get_value ());
696
696
}
697
697
}
698
- }
699
- while (!stack.empty ());
698
+ } while (!stack.empty ());
700
699
}
701
700
702
701
SHARING_MAPT (std::size_t )
@@ -1113,8 +1112,7 @@ ::get_delta_view(
1113
1112
}
1114
1113
}
1115
1114
}
1116
- }
1117
- while (!stack.empty ());
1115
+ } while (!stack.empty ());
1118
1116
}
1119
1117
1120
1118
SHARING_MAPT2 (, delta_viewt)::get_delta_view(
@@ -1217,7 +1215,7 @@ SHARING_MAPT(void)::erase(const key_type &k)
1217
1215
if (m.size () > 1 || del == nullptr )
1218
1216
{
1219
1217
del = ip;
1220
- del_bit= bit;
1218
+ del_bit = bit;
1221
1219
}
1222
1220
1223
1221
ip = &ip->add_child (bit);
0 commit comments