aGrUM 2.3.2
a C++ library for (probabilistic) graphical models
min_tpl.h
Go to the documentation of this file.
1/****************************************************************************
2 * This file is part of the aGrUM/pyAgrum library. *
3 * *
4 * Copyright (c) 2005-2025 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-2025 *
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#pragma once
41
42
49
50// to ease parser in IDEs
53
54namespace gum {
55
56 namespace aggregator {
57
58 // Default constructor
59 template < typename GUM_SCALAR >
60 INLINE Min< GUM_SCALAR >::Min() : MultiDimAggregator< GUM_SCALAR >() {
61 this->decomposable_ = true;
62 GUM_CONSTRUCTOR(Min);
63 }
64
65 // Default constructor
66 template < typename GUM_SCALAR >
68 MultiDimAggregator< GUM_SCALAR >(from) {
69 GUM_CONS_CPY(Min);
70 }
71
72 // destructor
73 template < typename GUM_SCALAR >
75 GUM_DESTRUCTOR(Min);
76 }
77
78 template < typename GUM_SCALAR >
80 return std::numeric_limits< Idx >::max();
81 }
82
83 template < typename GUM_SCALAR >
85 Idx i1,
86 Idx i2,
87 bool& stop_iteration) const {
88 return (i1 < i2) ? i1 : i2;
89 }
90
91 template < typename GUM_SCALAR >
92 INLINE std::string Min< GUM_SCALAR >::aggregatorName() const {
93 return "min";
94 }
95
96 template < typename GUM_SCALAR >
100
101 } // namespace aggregator
102} // namespace gum
Base class for discrete random variable.
Abstract base class for all multi dimensionnal containers.
virtual std::string aggregatorName() const
Definition min_tpl.h:92
virtual MultiDimContainer< GUM_SCALAR > * newFactory() const
This method creates a clone of this object, withouth its content (including variable),...
Definition min_tpl.h:97
virtual Idx neutralElt_() const
neutralElt_() is the result value for the first application of fold_
Definition min_tpl.h:79
virtual Idx fold_(const DiscreteVariable &v, Idx i1, Idx i2, bool &stop_iteration) const
fold_ is applied on value i1 for variable v. the actual result for precedent applications is i2.
Definition min_tpl.h:84
bool decomposable_
decomposable_ indicates if the aggregator can be decomposed
Size Idx
Type for indexes.
Definition types.h:79
min aggregator
MultiDimAggregator.
Aggregators are functional description of CPTs.
Definition agrum.h:55
gum is the global namespace for all aGrUM entities
Definition agrum.h:46