improve complexity

[c11tester.git] / funcinst.cc

diff --git a/funcinst.cc b/funcinst.cc
index 61e3d92290c34b354cb16ccf15c6f26ca9e251cd..7e0446ffec149e9c778345c6ca2790ca48916cec 100644 (file)
--- a/funcinst.cc
+++ b/funcinst.cc
@@ -12,7 +12,7 @@ FuncInst::FuncInst(ModelAction *act, FuncNode *func_node) :
 }
 
 /* @param other Preceding FuncInst in the same execution trace
- * Add other to predecessors if it has been added 
+ * Add other to predecessors if it has been added
  *
  * @return false: other is already in predecessors
  *         true : other is added to precedessors
@@ -20,7 +20,7 @@ FuncInst::FuncInst(ModelAction *act, FuncNode *func_node) :
 bool FuncInst::add_pred(FuncInst * other)
 {
        func_inst_list_mt::iterator it;
-       for (it = predecessors.begin(); it != predecessors.end(); it++) {
+       for (it = predecessors.begin();it != predecessors.end();it++) {
                FuncInst * inst = *it;
                if (inst == other)
                        return false;
@@ -33,7 +33,7 @@ bool FuncInst::add_pred(FuncInst * other)
 bool FuncInst::add_succ(FuncInst * other)
 {
        func_inst_list_mt::iterator it;
-       for (it = successors.begin(); it != successors.end(); it++) {
+       for (it = successors.begin();it != successors.end();it++) {
                FuncInst * inst = *it;
                if ( inst == other )
                        return false;
@@ -48,7 +48,7 @@ FuncInst * FuncInst::search_in_collision(ModelAction *act)
        action_type type = act->get_type();
 
        func_inst_list_mt::iterator it;
-       for (it = collisions.begin(); it != collisions.end(); it++) {
+       for (it = collisions.begin();it != collisions.end();it++) {
                FuncInst * inst = *it;
                if ( inst->get_type() == type )
                        return inst;