Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

Alg.h
Go to the documentation of this file.
1 /*******************************************************************************************[Alg.h]
2 Copyright (c) 2003-2006, Niklas Een, Niklas Sorensson
3 Copyright (c) 2007-2010, Niklas Sorensson
4 
5 Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
6 associated documentation files (the "Software"), to deal in the Software without restriction,
7 including without limitation the rights to use, copy, modify, merge, publish, distribute,
8 sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
9 furnished to do so, subject to the following conditions:
10 
11 The above copyright notice and this permission notice shall be included in all copies or
12 substantial portions of the Software.
13 
14 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT
15 NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
16 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
17 DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT
18 OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
19 **************************************************************************************************/
20 
21 #pragma once
22 
24 
25 namespace Minisat {
26 namespace Internal {
27 
28 //=================================================================================================
29 // Useful functions on vector-like types:
30 
31 //=================================================================================================
32 // Removing and searching for elements:
33 //
34 
35 template<class V, class T>
36 static inline void remove(V& ts, const T& t)
37 {
38  int j = 0;
39  for (; j < ts.size() && ts[j] != t; j++);
40  assert(j < ts.size());
41  for (; j < ts.size()-1; j++) ts[j] = ts[j+1];
42  ts.pop();
43 }
44 
45 
46 template<class V, class T>
47 static inline bool find(V& ts, const T& t)
48 {
49  int j = 0;
50  for (; j < ts.size() && ts[j] != t; j++);
51  return j < ts.size();
52 }
53 
54 
55 //=================================================================================================
56 // Copying vectors with support for nested vector types:
57 //
58 
59 // Base case:
60 template<class T>
61 static inline void copy(const T& from, T& to)
62 {
63  to = from;
64 }
65 
66 // Recursive case:
67 template<class T>
68 static inline void copy(const vec<T>& from, vec<T>& to, bool append = false)
69 {
70  if (!append)
71  to.clear();
72  for (int i = 0; i < from.size(); i++){
73  to.push();
74  copy(from[i], to.last());
75  }
76 }
77 
78 template<class T>
79 static inline void append(const vec<T>& from, vec<T>& to){ copy(from, to, true); }
80 
81 //=================================================================================================
82 } // namespace Internal
83 } // namespace Minisat
Vec.h
Minisat::Internal::copy
static void copy(const T &from, T &to)
Definition: Alg.h:61
Minisat::Internal::vec::size
int size(void) const
Definition: Vec.h:63
Minisat::Internal::vec::push
void push(void)
Definition: Vec.h:73
Minisat
Definition: Minisat.h:50
Minisat::Internal::vec
Definition: Vec.h:38
Minisat::Internal::vec::clear
void clear(bool dealloc=false)
Definition: Vec.h:121
Minisat::Internal::vec::last
const T & last(void) const
Definition: Vec.h:82
Minisat::Internal::remove
static void remove(V &ts, const T &t)
Definition: Alg.h:36
Minisat::Internal::find
static bool find(V &ts, const T &t)
Definition: Alg.h:47
Minisat::Internal::append
static void append(const vec< T > &from, vec< T > &to)
Definition: Alg.h:79