aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
pow_inl.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#pragma once
42
43
50
51// To help IDE Parsers
53
54namespace gum {
55 //@beforeMerging is this really faster ?
56 // Specialized pow function with integers (faster implementation).
57 INLINE unsigned long intPow(unsigned long base, unsigned long exponent) {
58 if (exponent == 0) { return 1UL; }
59
60 unsigned long out = base;
61
62 for (unsigned long i = 1; i < exponent; i++)
63 out *= base;
64
65 return out;
66 }
67
68 //@beforeMerging is this really faster ?
69 // Specialized base 2 pow function with integer.
70 INLINE uint64_t int2Pow(uint64_t exponent) {
71 if (exponent >= 64) { GUM_ERROR(OutOfBounds, "int2Pow: exponent " << exponent << " >= 64") }
72 return static_cast< uint64_t >(1) << exponent;
73 }
74
75 //@beforeMerging is this really faster ?
76 // Given an integer, compute it's - superior - and closest power of two, i.e.
77 // the number of bits necessary to represent this integer as well as the
78 // maximum integer that can be represented by those bits.
79 INLINE void superiorPow(unsigned long card, unsigned long& num_bits, unsigned long& new_card) {
80 if (card == 0) {
81 num_bits = 0;
82 new_card = 1;
83 return;
84 }
85
86 num_bits = 1;
87 new_card = 2;
88
89 while (new_card < card) {
90 new_card *= 2;
91 num_bits++;
92 }
93 }
94
95} // namespace gum
Exception : out of bound.
#define GUM_ERROR(type, msg)
Definition exceptions.h:76
uint64_t int2Pow(uint64_t exponent)
Specialized base 2 pow function with integer.
Definition pow_inl.h:70
unsigned long intPow(unsigned long base, unsigned long exponent)
Specialized pow function with integers (faster implementation).
Definition pow_inl.h:57
void superiorPow(unsigned long card, unsigned long &num_bits, unsigned long &new_card)
Compute the superior and closest power of two of an integer.
Definition pow_inl.h:79
gum is the global namespace for all aGrUM entities
Definition agrum.h:46
Implementation of pow functions with integers, faster than stl implementation.