aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
scoringCache.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2026 by *
5 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
6 * - Christophe GONZALES(_at_AMU) *
7 * *
8 * The aGrUM/pyAgrum library is free software; you can redistribute it *
9 * and/or modify it under the terms of either : *
10 * *
11 * - the GNU Lesser General Public License as published by *
12 * the Free Software Foundation, either version 3 of the License, *
13 * or (at your option) any later version, *
14 * - the MIT license (MIT), *
15 * - or both in dual license, as here. *
16 * *
17 * (see https://agrum.gitlab.io/articles/dual-licenses-lgplv3mit.html) *
18 * *
19 * This aGrUM/pyAgrum library is distributed in the hope that it will be *
20 * useful, but WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *
21 * INCLUDING BUT NOT LIMITED TO THE WARRANTIES MERCHANTABILITY or FITNESS *
22 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE *
23 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER *
24 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, *
25 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *
26 * OTHER DEALINGS IN THE SOFTWARE. *
27 * *
28 * See LICENCES for more details. *
29 * *
30 * SPDX-FileCopyrightText: Copyright 2005-2026 *
31 * - Pierre-Henri WUILLEMIN(_at_LIP6) *
32 * - Christophe GONZALES(_at_AMU) *
33 * SPDX-License-Identifier: LGPL-3.0-or-later OR MIT *
34 * *
35 * Contact : info_at_agrum_dot_org *
36 * homepage : http://agrum.gitlab.io *
37 * gitlab : https://gitlab.com/agrumery/agrum *
38 * *
39 ****************************************************************************/
40
41
53#ifndef GUM_LEARNING_SCORING_CACHE_H
54#define GUM_LEARNING_SCORING_CACHE_H
55
56#include <utility>
57
58#include <agrum/agrum.h>
59
61
62namespace gum {
63
64 namespace learning {
65
66
80 public:
81 // ##########################################################################
83 // ##########################################################################
85
88
91
94
96 [[nodiscard]] virtual ScoringCache* clone() const;
97
99 virtual ~ScoringCache();
100
102
103
104 // ##########################################################################
106 // ##########################################################################
108
111
114
116
117
118 // ##########################################################################
120 // ##########################################################################
122
124
128 void insert(const IdCondSet& idset, double score);
129
131
135 void insert(IdCondSet&& idset, double score);
136
138
141 void erase(const IdCondSet& idset);
142
144
145 bool exists(const IdCondSet& idset) const;
146
148
150 double score(const IdCondSet& idset) const;
151
153
156
158 void clear();
159
161 std::size_t size() const;
162
164
165
166#ifndef DOXYGEN_SHOULD_SKIP_THIS
167
168 private:
171
172#endif /* DOXYGEN_SHOULD_SKIP_THIS */
173 };
174
175 } /* namespace learning */
176
177} /* namespace gum */
178
179// include the inlined functions if necessary
180#ifndef GUM_NO_INLINE
182#endif /* GUM_NO_INLINE */
183
184#endif /* GUM_LEARNING_SCORING_CACHE_H */
The class for generic Hash Tables.
Definition hashTable.h:640
A class for storing a pair of sets of NodeIds, the second one corresponding to a conditional set.
Definition idCondSet.h:214
ScoringCache & operator=(ScoringCache &&from)
move operator
void insert(const IdCondSet &idset, double score)
insert a new score into the cache
ScoringCache & operator=(const ScoringCache &from)
copy operator
void erase(const IdCondSet &idset)
removes a score (if it exists)
bool exists(const IdCondSet &idset) const
indicates whether a given score exists
void insert(IdCondSet &&idset, double score)
insert a new score into the cache
void clear()
removes all the stored scores
virtual ~ScoringCache()
destructor
double score(const IdCondSet &idset) const
returns a given score
ScoringCache()
default constructor
std::size_t size() const
returns the number of scores saved in the cache
optional_ref< double > tryGet(const IdCondSet &idset)
returns a pointer to a given score, or nullptr if not cached
ScoringCache(const ScoringCache &from)
copy constructor
virtual ScoringCache * clone() const
virtual copy constructor
ScoringCache(ScoringCache &&from)
move constructor
A lightweight wrapper around a pointer providing an optional-like API for references (not supported b...
A class used by learning caches to represent uniquely sets of variables.
include the inlined functions if necessary
Definition CSVParser.h:55
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
a cache for caching scores and independence tests results