diff options
author | Alan Mishchenko <alanmi@berkeley.edu> | 2020-11-14 14:23:49 -0800 |
---|---|---|
committer | Alan Mishchenko <alanmi@berkeley.edu> | 2020-11-14 14:23:49 -0800 |
commit | bab4c1ddfc3e7bb88d649daed8bd412a98850cf9 (patch) | |
tree | f46fe175c353513ce100c20db8b62642f45a4f5e /src/sat/glucose/Vec.h | |
parent | cc840d8bd83775f911bc373aa3284d518dc050d0 (diff) | |
download | abc-bab4c1ddfc3e7bb88d649daed8bd412a98850cf9.tar.gz abc-bab4c1ddfc3e7bb88d649daed8bd412a98850cf9.tar.bz2 abc-bab4c1ddfc3e7bb88d649daed8bd412a98850cf9.zip |
Upgrading the SAT solvers.
Diffstat (limited to 'src/sat/glucose/Vec.h')
-rw-r--r-- | src/sat/glucose/Vec.h | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/src/sat/glucose/Vec.h b/src/sat/glucose/Vec.h index da87af35..dd1bc20a 100644 --- a/src/sat/glucose/Vec.h +++ b/src/sat/glucose/Vec.h @@ -89,7 +89,8 @@ public: T& operator [] (int index) { return data[index]; } // Duplicatation (preferred instead): - void copyTo(vec<T>& copy) const { copy.clear(); copy.growTo(sz); for (int i = 0; i < sz; i++) copy[i] = data[i]; } + void copyTo (vec<T>& copy) const { copy.clear(); copy.growTo(sz); for (int i = 0; i < sz; i++) copy[i] = data[i]; } + void copyTo_(vec<T>& copy) const { copy.shrink_(copy.size()); copy.growTo(sz); for (int i = 0; i < sz; i++) copy[i] = data[i]; } void moveTo(vec<T>& dest) { dest.clear(true); dest.data = data; dest.sz = sz; dest.cap = cap; data = NULL; sz = 0; cap = 0; } }; |