1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/******************************************************************************\
* This file is part of packup. *
* *
* packup is free software: you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation, either version 3 of the License, or *
* (at your option) any later version. *
* *
* packup is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with packup. If not, see <http://www.gnu.org/licenses/>. *
\******************************************************************************/
//jpms:bc
/*----------------------------------------------------------------------------*\
* File: cl_utils.hh
*
* Description: Clause set utilities.
*
* Author: jpms
*
* Copyright (c) 2010, Joao Marques-Silva
\*----------------------------------------------------------------------------*/
//jpms:ec
#ifndef _CL_UTILS_H
#define _CL_UTILS_H 1
//jpms:bc
/*----------------------------------------------------------------------------*\
* Namespace: ClSetUtils
*
* Purpose: Clause set utilities. Examples include intersection of two clsets.
\*----------------------------------------------------------------------------*/
//jpms:ec
namespace ClSetUtils {
// Template functions for performing intersection of two sets P and Q,
// such that Q is a subset of P
// Version 1: Direct deletion of elements from P
template <typename C,typename I,typename T,typename U>
void intersect_clset(T& P, U& Q) {
CHK(int psz = P.size(); int qsz = Q.size(););
// Create temporary container
vector<C> vect;
vect.resize(P.size()+Q.size(), NULL);
typename vector<C>::iterator vpos = vect.begin();
// Fill container with contents of P and Q
I ppos = P.begin();
I pend = P.end();
for(; ppos != pend; ++ppos, ++vpos) {
assert(vpos != vect.end()); *vpos = *ppos;
}
typename U::iterator qpos = Q.begin();
typename U::iterator qend = Q.end();
for(; qpos != qend; ++qpos, ++vpos) {
assert(vpos != vect.end()); *vpos = *qpos;
}
// Sort contents of container
sort(vect.begin(), vect.end());
// Keep duplicates; remove everything else
typename vector<C>::iterator vref = vect.begin();
typename vector<C>::iterator vend = vect.end();
vpos = vect.begin(); ++vpos;
for(; vref != vend; vref++, vpos++) {
if (vpos == vend || *vref != *vpos) {
assert(P.find(*vref) != P.end());
P.rm_clause(*vref);
}
else { vref++; vpos++; }
}
CHK(cout << "Init P size: " << psz << endl;
cout << "Init Q size: " << qsz << endl;
cout << " Final P size: " << P.size() << endl);
assert((LINT)P.size() == qsz);
vect.clear();
}
// Version 2: with callback for removing elements
template <typename C,typename I,typename E,typename T,typename U,typename V>
void intersect_clset(T& P, U& Q, E& robj, V rm_elem) {
CHK(int psz = P.size(); int qsz = Q.size(););
// Create temporary container
vector<C> vect;
vect.resize(P.size()+Q.size(), NULL);
typename vector<C>::iterator vpos = vect.begin();
// Fill container with contents of P and Q
I ppos = P.begin();
I pend = P.end();
for(; ppos != pend; ++ppos, ++vpos) {
assert(vpos != vect.end()); *vpos = *ppos;
}
typename U::iterator qpos = Q.begin();
typename U::iterator qend = Q.end();
for(; qpos != qend; ++qpos, ++vpos) {
assert(vpos != vect.end()); *vpos = *qpos;
}
// Sort contents of container
sort(vect.begin(), vect.end());
// Keep duplicates; remove everything else
typename vector<C>::iterator vref = vect.begin();
typename vector<C>::iterator vend = vect.end();
vpos = vect.begin(); ++vpos;
for(; vref != vend; vref++, vpos++) {
if (vpos == vend || *vref != *vpos) { (robj->*rm_elem)(*vref); }
else { vref++; vpos++; }
}
CHK(cout << "Init P size: " << psz << endl;
cout << "Init Q size: " << qsz << endl;
cout << " Final P size: " << P.size() << endl);
assert((LINT)P.size() == qsz);
vect.clear();
}
// Export clause set in WCNF format
template <typename C,typename U>
void export_wcnf(C& cset, U nv, ostream& outs=cout)
{
ULINT topw = cset.get_top();
outs << "p wcnf " << nv << " " << cset.size() << " " << topw << endl;
ClSetIterator cpos = cset.begin();
ClSetIterator cend = cset.end();
for (; cpos != cend; ++cpos) {
if (cset.is_cl_soft(*cpos)) {
outs << "1 " << **cpos << endl;
}
else {
outs << topw << " " << **cpos << endl;
}
}
}
}
#endif /* _CL_UTILS_H */
/*----------------------------------------------------------------------------*/
|
