blob: a0adbe683a74b1d76f796b34ab4d0bea32a7050d (
plain)
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
|
/*
* richard-atp-engine: A saturation-based automated theorem prover for first-order logic.
* Copyright (C) 2026 Richard Qin
*
* This program 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.
*
* 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "atp/core/clause_store.h"
#include <cassert>
#include <utility>
namespace atp {
ClauseId ClauseStore::addClause(Clause clause) {
auto new_id = static_cast<ClauseId>(clauses_.size());
clause.id = new_id;
clauses_.push_back(std::move(clause));
return new_id;
}
const Clause& ClauseStore::getClause(ClauseId id) const {
assert(id < clauses_.size() && "ClauseId out of bounds!");
return clauses_[id];
}
Clause& ClauseStore::getMutableClause(ClauseId id) {
assert(id < clauses_.size() && "ClauseId out of bounds!");
return clauses_[id];
}
size_t ClauseStore::size() const {
return clauses_.size();
}
void ClauseStore::forEach(const std::function<void(const Clause&)>& visitor) const {
for (const auto& clause : clauses_) {
// TODO: Tombstone mechanism
visitor(clause);
}
}
} // namespace atp
|
