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

// ClauseSetPool.hpp
//
// Clause Set Pool for NDP-5.6.7
//
// Copyright (c) 2025 GridSAT Stiftung
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program 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 Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program. If not, see <https://www.gnu.org/licenses/>.
//
// GridSAT Stiftung - Georgstr. 11 - 30159 Hannover - Germany - ipns://gridsat.eth - info@gridsat.io
//
//
// +++ READ.me +++
//
// Save to working directory of NDP-5.6.7
//
#ifndef CLAUSE_SET_POOL_HPP
#define CLAUSE_SET_POOL_HPP

#include <vector>
#include <cstdint>



// Using default allocation for ClauseSet.

struct Clause3 {
int l[3];
};

using ClauseSet = std::vector<Clause3>;

struct ClauseSetPool {
std::vector<ClauseSet*> freeList;

ClauseSet* obtain(std::size_t reserveSize = 0) {
if (!freeList.empty()) {
ClauseSet* cs = freeList.back();
freeList.pop_back();
cs->clear();
if(reserveSize)
cs->reserve(reserveSize);
return cs;
}
ClauseSet* cs = new ClauseSet();
if(reserveSize)
cs->reserve(reserveSize);
return cs;
}

void release(ClauseSet* cs) {
freeList.push_back(cs);
}

~ClauseSetPool() {
for(auto cs : freeList)
delete cs;
}
};

#endif // CLAUSE_SET_POOL_HPP