Math

All the maths you'll need. More...

Collaboration diagram for Math:

Classes
class	gum::Formula
	Evaluates a string as a algebraic formula. More...
class	gum::Chi2
	Represent the chi2 distribution. More...
class	gum::Dirichlet
	A class for sampling w.r.t. More...
class	gum::FormulaPart
	Represents part of a formula. More...
class	gum::GammaLog2
	The class for computing Log2 (Gamma(x)). More...
class	gum::Rational< GUM_SCALAR >
	Class template used to approximate decimal numbers by rationals. More...
class	gum::VariableLog2ParamComplexity
	the class for computing the log2 of the parametric complexity of an r-ary multinomial variable More...

Integers Pow utility methods
unsigned long	gum::intPow (unsigned long base, unsigned long exponent)
	Specialized pow function with integers (faster implementation).
unsigned long	gum::int2Pow (unsigned long exponent)
	Specialized base 2 pow function with integer.
void	gum::superiorPow (unsigned long card, unsigned long &num_bits, unsigned long &new_card)
	Compute the superior and closest power of two of an integer.

Detailed Description

All the maths you'll need.

Function Documentation

int2Pow()

INLINE unsigned long gum::int2Pow

(

unsigned long

exponent

)

Specialized base 2 pow function with integer.

Parameters

exponent

The unsigned long integer exponent used to compute \(2^{exponent} \) which will hold the result of afterward.

Definition at line 69 of file pow_inl.h.

{ return 1UL << exponent; }

Referenced by gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization().

Here is the caller graph for this function:

intPow()

INLINE unsigned long gum::intPow	(	unsigned long	base,
		unsigned long	exponent )

Specialized pow function with integers (faster implementation).

Parameters

base	The constant unsigned long integer base used to compute \(base^{exponent} \).
exponent	The unsigned long integer exponent used which will hold the result afterward.

Definition at line 56 of file pow_inl.h.

                                                                          {
    if (exponent == 0) { return 1UL; }
 
    unsigned long out = base;
 
    for (unsigned long i = 1; i < exponent; i++)
      out *= base;
 
    return out;
  }

superiorPow()

INLINE void gum::superiorPow	(	unsigned long	card,
		unsigned long &	num_bits,
		unsigned long &	new_card )

Compute the superior and closest power of two of an integer.

Given an integer, compute it's - superior - and closest power of two, i.e. the number of bits necessary to represent this integer as well as the maximum integer that can be represented by those bits.

Parameters

card	The constant unsigned long integer we wish to represent by bits.
num_bits	The unsigned long integer used as a "return" value to get the minimum number of bits used to represend card.
new_card	The unsigned long integer used as a "return" value to get the maximum number those bits can represent, i.e. \( 2^{num\_bits} \).

Definition at line 75 of file pow_inl.h.

                                                                                                {
    if (card == 0) {
      num_bits = 0;
      new_card = 1;
      return;
    }
 
    num_bits = 1;
    new_card = 2;
 
    while (new_card < card) {
      new_card *= 2;
      num_bits++;
    }
  }

Referenced by gum::credal::CredalNet< GUM_SCALAR >::approximatedBinarization(), and gum::credal::VarMod2BNsMap< GUM_SCALAR >::setCNet().

Here is the caller graph for this function: