blob: 5d6562a31956399f0991ba9d6f39d6aab1fae9de (
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
54
55
56
57
58
59
60
61
62
63
64
|
/*
* 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/>.
*/
#pragma once
/// @file clause_store.h
/// @brief Central clause storage — owns all clauses, assigns ClauseIds.
///
/// Extracted from Prover to separate storage responsibility from search logic.
/// This enables swapping search strategies (OTTER loop / DISCOUNT loop)
/// without touching clause lifecycle management.
#include "atp/core/clause.h"
#include "atp/core/types.h"
#include <functional>
#include <vector>
namespace atp {
/// Central clause store. Owns all clauses and assigns unique ClauseIds.
/// All modules access clauses through this store via ClauseId references.
class ClauseStore {
public:
ClauseStore() = default;
/// Add a clause, assign it a ClauseId, and return the ID.
ClauseId addClause(Clause clause);
/// Access a clause by its ID. UB if id is out of range.
[[nodiscard]] const Clause& getClause(ClauseId id) const;
/// Mutable access (for marking clauses as deleted, etc.)
[[nodiscard]] Clause& getMutableClause(ClauseId id);
/// Total number of stored clauses.
[[nodiscard]] size_t size() const;
/// Iterate over all clauses with a visitor.
void forEach(const std::function<void(const Clause&)>& visitor) const;
// function may have type erasure overhead, consider using a template
// template <typename Visitor>
// void forEach(Visitor&& visitor) const;
private:
std::vector<Clause> clauses_;
};
} // namespace atp
|
