| /*******************************************************************************************[Alg.h] |
| MiniSat -- Copyright (c) 2003-2006, Niklas Een, Niklas Sorensson |
| |
| Permission is hereby granted, free of charge, to any person obtaining a copy of this software and |
| associated documentation files (the "Software"), to deal in the Software without restriction, |
| including without limitation the rights to use, copy, modify, merge, publish, distribute, |
| sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is |
| furnished to do so, subject to the following conditions: |
| |
| The above copyright notice and this permission notice shall be included in all copies or |
| substantial portions of the Software. |
| |
| THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT |
| NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |
| NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, |
| DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT |
| OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
| **************************************************************************************************/ |
| |
| #ifndef Alg_h |
| #define Alg_h |
| |
| //================================================================================================= |
| // Useful functions on vectors |
| |
| |
| #if 1 |
| template<class V, class T> |
| static inline void remove(V& ts, const T& t) |
| { |
| int j = 0; |
| 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(); |
| } |
| #else |
| template<class V, class T> |
| static inline void remove(V& ts, const T& t) |
| { |
| int j = 0; |
| for (; j < ts.size() && ts[j] != t; j++); |
| assert(j < ts.size()); |
| ts[j] = ts.last(); |
| ts.pop(); |
| } |
| #endif |
| |
| template<class V, class T> |
| static inline bool find(V& ts, const T& t) |
| { |
| int j = 0; |
| for (; j < ts.size() && ts[j] != t; j++); |
| return j < ts.size(); |
| } |
| |
| #endif |