git-svn-id: https://stp-fast-prover.svn.sourceforge.net/svnroot/stp-fast-prover/trunk/stp@181
e59a4935-1847-0410-ae03-
e826735625c1
static inline void remove(V& ts, const T& t)
{
int j = 0;
- for (; j < ts.size() && ts[j] != t; j++);
+ for (; j < ts.size() && ts[j] != t; j++) ;
assert(j < ts.size());
for (; j < ts.size()-1; j++) ts[j] = ts[j+1];
ts.pop();
static inline bool find(V& ts, const T& t)
{
int j = 0;
- for (; j < ts.size() && ts[j] != t; j++);
+ for (; j < ts.size() && ts[j] != t; j++) ;
return j < ts.size();
}
cap = newsize;
}
-
+
public:
Map () : table(NULL), cap(0), size(0) {}
for (int i = 0; i < ps.size(); i++)
if (equals(ps[i].key, k)){
d = ps[i].data;
- return true; }
+ return true; }
return false;
}
assert(table != NULL);
vec<Pair>& ps = table[index(k)];
int j = 0;
- for (; j < ps.size() && !equals(ps[j].key, k); j++);
+ for (; j < ps.size() && !equals(ps[j].key, k); j++) ;
assert(j < ps.size());
ps[j] = ps.last();
ps.pop();