mirror of
https://github.com/YosysHQ/yosys
synced 2025-11-04 05:19:11 +00:00
84 lines
2.8 KiB
C++
84 lines
2.8 KiB
C++
/*******************************************************************************************[Alg.h]
|
|
Copyright (c) 2003-2006, Niklas Een, Niklas Sorensson
|
|
Copyright (c) 2007-2010, 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 Minisat_Alg_h
|
|
#define Minisat_Alg_h
|
|
|
|
#include "Vec.h"
|
|
|
|
namespace Minisat {
|
|
|
|
//=================================================================================================
|
|
// Useful functions on vector-like types:
|
|
|
|
//=================================================================================================
|
|
// Removing and searching for elements:
|
|
//
|
|
|
|
template<class V, class T>
|
|
static inline void remove(V& ts, const T& t)
|
|
{
|
|
int j = 0;
|
|
for (; j < (int)ts.size() && ts[j] != t; j++);
|
|
assert(j < (int)ts.size());
|
|
for (; j < (int)ts.size()-1; j++) ts[j] = ts[j+1];
|
|
ts.pop();
|
|
}
|
|
|
|
|
|
template<class V, class T>
|
|
static inline bool find(V& ts, const T& t)
|
|
{
|
|
int j = 0;
|
|
for (; j < (int)ts.size() && ts[j] != t; j++);
|
|
return j < (int)ts.size();
|
|
}
|
|
|
|
|
|
//=================================================================================================
|
|
// Copying vectors with support for nested vector types:
|
|
//
|
|
|
|
// Base case:
|
|
template<class T>
|
|
static inline void copy(const T& from, T& to)
|
|
{
|
|
to = from;
|
|
}
|
|
|
|
// Recursive case:
|
|
template<class T>
|
|
static inline void copy(const vec<T>& from, vec<T>& to, bool append = false)
|
|
{
|
|
if (!append)
|
|
to.clear();
|
|
for (int i = 0; i < from.size(); i++){
|
|
to.push();
|
|
copy(from[i], to.last());
|
|
}
|
|
}
|
|
|
|
template<class T>
|
|
static inline void append(const vec<T>& from, vec<T>& to){ copy(from, to, true); }
|
|
|
|
//=================================================================================================
|
|
}
|
|
|
|
#endif
|