#include <vector>
#include <set>
#include <cfloat>
#include <stdlib.h>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <array>
#include "PlatformDetermination.h"
#include "CPstrings.h"
#include "Exceptions.h"

Classes
class	Spline< X, Y >

class	Spline< X, Y >::Element

class	SplineClass

Macros
#define	M_PI 3.14159265358979323846

#define	COOLPROP_OK 1

#define	POW5(x) ((x) * (x) * (x) * (x) * (x))

#define	POW6(x) ((x) * (x) * (x) * (x) * (x) * (x))

#define	POW7(x) ((x) * (x) * (x) * (x) * (x) * (x) * (x))

Functions
template<typename T , size_t N>
std::array< T, N >	create_filled_array (T value)

bool	ValidNumber (double x)

template<typename T >
T	maxvectordiff (const std::vector< T > &z1, const std::vector< T > &z2)
	Return the maximum difference between elements in two vectors where comparing z1[i] and z2[i]. More...

template<typename T >
std::vector< T >	linspace (T xmin, T xmax, std::size_t n)
	Make a linearly spaced vector of points. More...

template<typename T >
std::vector< T >	log10space (T xmin, T xmax, std::size_t n)
	Make a base-10 logarithmically spaced vector of points. More...

template<typename T >
std::vector< T >	logspace (T xmin, T xmax, std::size_t n)
	Make a base-e logarithmically spaced vector of points. More...

template<typename T >
void	bisect_vector (const std::vector< T > &vec, T val, std::size_t &i)
	Use bisection to find the inputs that bisect the value you want, the trick here is that this function is allowed to have "holes" where parts of the the array are also filled with invalid numbers for which ValidNumber(x) is false. More...

template<typename T >
void	bisect_segmented_vector_slice (const std::vector< std::vector< T > > &mat, std::size_t j, T val, std::size_t &i)
	Use bisection to find the inputs that bisect the value you want, the trick here is that this function is allowed to have "holes" where parts of the the array are also filled with invalid numbers for which ValidNumber(x) is false. More...

std::size_t	powerset_dereference (std::set< std::size_t >::const_iterator v)

std::set< std::set< std::size_t > >	powerset (std::set< std::size_t > const &set)

bool	check_abs (double A, double B, double D)
	Some functions related to testing and comparison of values. More...

bool	check_abs (double A, double B)

template<class T >
void	normalize_vector (std::vector< T > &x)

template<class T >
T	factorial (T n)
	from http://stackoverflow.com/a/5721830/1360263 More...

template<class T1 , class T2 >
T1	nth_derivative_of_x_to_m (T1 x, T2 n, T2 m)

void	MatInv_2 (double A[2][2], double B[2][2])

double	root_sum_square (const std::vector< double > &x)

double	interp1d (const std::vector< double > x, const std::vector< double > y, double x0)

double	powInt (double x, int y)

template<class T >
T	POW2 (T x)

template<class T >
T	POW3 (T x)

template<class T >
T	POW4 (T x)

template<class T >
T	LinearInterp (T x0, T x1, T y0, T y1, T x)

template<class T1 , class T2 >
T2	LinearInterp (const std::vector< T1 > &x, const std::vector< T1 > &y, std::size_t i0, std::size_t i1, T2 val)

template<class T >
T	QuadInterp (T x0, T x1, T x2, T f0, T f1, T f2, T x)

template<class T1 , class T2 >
T2	QuadInterp (const std::vector< T1 > &x, const std::vector< T1 > &y, std::size_t i0, std::size_t i1, std::size_t i2, T2 val)

template<class T >
T	CubicInterp (T x0, T x1, T x2, T x3, T f0, T f1, T f2, T f3, T x)

template<class T >
T	CubicInterpFirstDeriv (T x0, T x1, T x2, T x3, T f0, T f1, T f2, T f3, T x)

template<class T1 , class T2 >
T2	CubicInterp (const std::vector< T1 > &x, const std::vector< T1 > &y, std::size_t i0, std::size_t i1, std::size_t i2, std::size_t i3, T2 val)

template<class T >
T	is_in_closed_range (T x1, T x2, T x)

void	solve_cubic (double a, double b, double c, double d, int &N, double &x0, double &x1, double &x2)
	Solve a cubic with coefficients in decreasing order. More...

void	solve_quartic (double a, double b, double c, double d, double e, int &N, double &x0, double &x1, double &x2, double &x3)

template<class T >
T	min3 (T x1, T x2, T x3)

template<class T >
T	max3 (T x1, T x2, T x3)

template<class T >
T	min4 (T x1, T x2, T x3, T x4)

template<class T >
T	max4 (T x1, T x2, T x3, T x4)

bool	double_equal (double a, double b)

template<class T >
T	max_abs_value (const std::vector< T > &x)

template<class T >
T	min_abs_value (const std::vector< T > &x)

int	Kronecker_delta (std::size_t i, std::size_t j)

int	Kronecker_delta (int i, int j)

template<typename T >
void	sort3 (T &a, T &b, T &c)
	Sort three values in place; see http://codereview.stackexchange.com/a/64763. More...

template<class T >
T	angle_difference (T angle1, T angle2)

double	get_HUGE ()
	A simple function for use in wrappers where macros cause problems. More...

Macro Definition Documentation

◆ COOLPROP_OK

#define COOLPROP_OK 1

Definition at line 42 of file CPnumerics.h.

◆ M_PI

#define M_PI 3.14159265358979323846

Definition at line 38 of file CPnumerics.h.

◆ POW5

#define POW5 ( x ) ((x) * (x) * (x) * (x) * (x))

Definition at line 496 of file CPnumerics.h.

◆ POW6

#define POW6 ( x ) ((x) * (x) * (x) * (x) * (x) * (x))

Definition at line 497 of file CPnumerics.h.

◆ POW7

#define POW7 ( x ) ((x) * (x) * (x) * (x) * (x) * (x) * (x))

Definition at line 498 of file CPnumerics.h.

Function Documentation

◆ angle_difference()

template<class T >

T angle_difference	(	T	angle1,
		T	angle2
	)

Due to the periodicity of angles, you need to handle the case where the angles wrap around - suppose theta_d is 6.28 and you are at an angles of 0.1 rad, the difference should be around 0.1, not -6.27

This brilliant method is from http://blog.lexique-du-net.com/index.php?post/Calculate-the-real-difference-between-two-angles-keeping-the-sign and the comment of user tk

Originally implemented in PDSim

Definition at line 668 of file CPnumerics.h.

◆ bisect_segmented_vector_slice()

template<typename T >

void bisect_segmented_vector_slice	(	const std::vector< std::vector< T > > &	mat,
		std::size_t	j,
		T	val,
		std::size_t &	i
	)

Use bisection to find the inputs that bisect the value you want, the trick here is that this function is allowed to have "holes" where parts of the the array are also filled with invalid numbers for which ValidNumber(x) is false.

Parameters

matrix	The vector to be bisected
j	The index of the matric in the off-grain dimension
val	The value to be found
i	The index to the left of the final point; i and i+1 bound the value

Definition at line 311 of file CPnumerics.h.

◆ bisect_vector()

template<typename T >

void bisect_vector	(	const std::vector< T > &	vec,
		T	val,
		std::size_t &	i
	)

Use bisection to find the inputs that bisect the value you want, the trick here is that this function is allowed to have "holes" where parts of the the array are also filled with invalid numbers for which ValidNumber(x) is false.

Parameters

vec	The vector to be bisected
val	The value to be found
i	The index to the left of the final point; i and i+1 bound the value

Definition at line 231 of file CPnumerics.h.

◆ check_abs() [1/2]

bool check_abs	(	double	A,
		double	B
	)

inline

Definition at line 427 of file CPnumerics.h.

◆ check_abs() [2/2]

bool check_abs	(	double	A,
		double	B,
		double	D
	)

inline

Some functions related to testing and comparison of values.

Definition at line 414 of file CPnumerics.h.

◆ create_filled_array()

template<typename T , size_t N>

std::array< T, N > create_filled_array ( T value )

Definition at line 26 of file CPnumerics.h.

◆ CubicInterp() [1/2]

template<class T1 , class T2 >

T2 CubicInterp	(	const std::vector< T1 > &	x,
		const std::vector< T1 > &	y,
		std::size_t	i0,
		std::size_t	i1,
		std::size_t	i2,
		std::size_t	i3,
		T2	val
	)

Definition at line 555 of file CPnumerics.h.

◆ CubicInterp() [2/2]

template<class T >

T CubicInterp	(	T	x0,
		T	x1,
		T	x2,
		T	x3,
		T	f0,
		T	f1,
		T	f2,
		T	f3,
		T	x
	)

Definition at line 527 of file CPnumerics.h.

◆ CubicInterpFirstDeriv()

template<class T >

T CubicInterpFirstDeriv	(	T	x0,
		T	x1,
		T	x2,
		T	x3,
		T	f0,
		T	f1,
		T	f2,
		T	f3,
		T	x
	)

/brief Calculate the first derivative of the function using a cubic interpolation form

Definition at line 542 of file CPnumerics.h.

◆ double_equal()

bool double_equal	(	double	a,
		double	b
	)

inline

Definition at line 598 of file CPnumerics.h.

◆ factorial()

template<class T >

T factorial ( T n )

from http://stackoverflow.com/a/5721830/1360263

Definition at line 463 of file CPnumerics.h.

◆ get_HUGE()

double get_HUGE ( )

inline

A simple function for use in wrappers where macros cause problems.

Definition at line 673 of file CPnumerics.h.

◆ interp1d()

double interp1d	(	const std::vector< double > *	x,
		const std::vector< double > *	y,
		double	x0
	)

Definition at line 12 of file CPnumerics.cpp.

◆ is_in_closed_range()

template<class T >

T is_in_closed_range	(	T	x1,
		T	x2,
		T	x
	)

Definition at line 560 of file CPnumerics.h.

◆ Kronecker_delta() [1/2]

int Kronecker_delta	(	int	i,
		int	j
	)

inline

Definition at line 635 of file CPnumerics.h.

◆ Kronecker_delta() [2/2]

int Kronecker_delta	(	std::size_t	i,
		std::size_t	j
	)

inline

Definition at line 628 of file CPnumerics.h.

◆ LinearInterp() [1/2]

template<class T1 , class T2 >

T2 LinearInterp	(	const std::vector< T1 > &	x,
		const std::vector< T1 > &	y,
		std::size_t	i0,
		std::size_t	i1,
		T2	val
	)

Definition at line 505 of file CPnumerics.h.

◆ LinearInterp() [2/2]

template<class T >

T LinearInterp	(	T	x0,
		T	x1,
		T	y0,
		T	y1,
		T	x
	)

Definition at line 501 of file CPnumerics.h.

◆ linspace()

template<typename T >

std::vector< T > linspace	(	T	xmin,
		T	xmax,
		std::size_t	n
	)

Make a linearly spaced vector of points.

Definition at line 191 of file CPnumerics.h.

◆ log10space()

template<typename T >

std::vector< T > log10space	(	T	xmin,
		T	xmax,
		std::size_t	n
	)

Make a base-10 logarithmically spaced vector of points.

Definition at line 201 of file CPnumerics.h.

◆ logspace()

template<typename T >

std::vector< T > logspace	(	T	xmin,
		T	xmax,
		std::size_t	n
	)

Make a base-e logarithmically spaced vector of points.

Definition at line 212 of file CPnumerics.h.

◆ MatInv_2()

void MatInv_2	(	double	A[2][2],
		double	B[2][2]
	)

Definition at line 70 of file CPnumerics.cpp.

◆ max3()

template<class T >

T max3	(	T	x1,
		T	x2,
		T	x3
	)

inline

Definition at line 586 of file CPnumerics.h.

◆ max4()

template<class T >

T max4	(	T	x1,
		T	x2,
		T	x3,
		T	x4
	)

inline

Definition at line 594 of file CPnumerics.h.

◆ max_abs_value()

template<class T >

T max_abs_value ( const std::vector< T > & x )

Definition at line 603 of file CPnumerics.h.

◆ maxvectordiff()

template<typename T >

T maxvectordiff	(	const std::vector< T > &	z1,
		const std::vector< T > &	z2
	)

Return the maximum difference between elements in two vectors where comparing z1[i] and z2[i].

Definition at line 178 of file CPnumerics.h.

◆ min3()

template<class T >

T min3	(	T	x1,
		T	x2,
		T	x3
	)

inline

Definition at line 582 of file CPnumerics.h.

◆ min4()

template<class T >

T min4	(	T	x1,
		T	x2,
		T	x3,
		T	x4
	)

inline

Definition at line 590 of file CPnumerics.h.

◆ min_abs_value()

template<class T >

T min_abs_value ( const std::vector< T > & x )

Definition at line 616 of file CPnumerics.h.

◆ normalize_vector()

template<class T >

void normalize_vector ( std::vector< T > & x )

Definition at line 432 of file CPnumerics.h.

◆ nth_derivative_of_x_to_m()

template<class T1 , class T2 >

T1 nth_derivative_of_x_to_m	(	T1	x,
		T2	n,
		T2	m
	)

see https://proofwiki.org/wiki/Nth_Derivative_of_Mth_Power and https://proofwiki.org/wiki/Definition:Falling_Factorial

Definition at line 470 of file CPnumerics.h.

◆ POW2()

template<class T >

T POW2 ( T x )

Definition at line 485 of file CPnumerics.h.

◆ POW3()

template<class T >

T POW3 ( T x )

Definition at line 489 of file CPnumerics.h.

◆ POW4()

template<class T >

T POW4 ( T x )

Definition at line 493 of file CPnumerics.h.

◆ powerset()

std::set< std::set< std::size_t > > powerset ( std::set< std::size_t > const & set )

inline

Definition at line 387 of file CPnumerics.h.

◆ powerset_dereference()

std::size_t powerset_dereference ( std::set< std::size_t >::const_iterator v )

inline

Definition at line 382 of file CPnumerics.h.

◆ powInt()

double powInt	(	double	x,
		int	y
	)

Definition at line 39 of file CPnumerics.cpp.

◆ QuadInterp() [1/2]

template<class T1 , class T2 >

T2 QuadInterp	(	const std::vector< T1 > &	x,
		const std::vector< T1 > &	y,
		std::size_t	i0,
		std::size_t	i1,
		std::size_t	i2,
		T2	val
	)

Definition at line 522 of file CPnumerics.h.

◆ QuadInterp() [2/2]

template<class T >

T QuadInterp	(	T	x0,
		T	x1,
		T	x2,
		T	f0,
		T	f1,
		T	f2,
		T	x
	)

Definition at line 510 of file CPnumerics.h.

◆ root_sum_square()

double root_sum_square ( const std::vector< double > & x )

Definition at line 5 of file CPnumerics.cpp.

◆ solve_cubic()

void solve_cubic	(	double	a,
		double	b,
		double	c,
		double	d,
		int &	N,
		double &	x0,
		double &	x1,
		double &	x2
	)

Solve a cubic with coefficients in decreasing order.

0 = ax^3 + b*x^2 + c*x + d

Parameters

a	The x^3 coefficient
b	The x^2 coefficient
c	The x^1 coefficient
d	The x^0 coefficient
N	The number of unique real solutions found
x0	The first solution found
x1	The second solution found
x2	The third solution found

Definition at line 81 of file CPnumerics.cpp.

◆ solve_quartic()

void solve_quartic	(	double	a,
		double	b,
		double	c,
		double	d,
		double	e,
		int &	N,
		double &	x0,
		double &	x1,
		double &	x2,
		double &	x3
	)

Definition at line 133 of file CPnumerics.cpp.

◆ sort3()

template<typename T >

void sort3	(	T &	a,
		T &	b,
		T &	c
	)

Sort three values in place; see http://codereview.stackexchange.com/a/64763.

Definition at line 645 of file CPnumerics.h.

◆ ValidNumber()

bool ValidNumber ( double x )

inline

Definition at line 32 of file CPnumerics.h.

Classes

Macros

Functions

Macro Definition Documentation

◆ COOLPROP_OK

◆ M_PI

◆ POW5

◆ POW6

◆ POW7

Function Documentation

◆ angle_difference()

◆ bisect_segmented_vector_slice()

◆ bisect_vector()

◆ check_abs() [1/2]

◆ check_abs() [2/2]

◆ create_filled_array()

◆ CubicInterp() [1/2]

◆ CubicInterp() [2/2]

◆ CubicInterpFirstDeriv()

◆ double_equal()

◆ factorial()

◆ get_HUGE()

◆ interp1d()

◆ is_in_closed_range()

◆ Kronecker_delta() [1/2]

◆ Kronecker_delta() [2/2]

◆ LinearInterp() [1/2]

◆ LinearInterp() [2/2]

◆ linspace()

◆ log10space()

◆ logspace()

◆ MatInv_2()

◆ max3()

◆ max4()

◆ max_abs_value()

◆ maxvectordiff()

◆ min3()

◆ min4()

◆ min_abs_value()

◆ normalize_vector()

◆ nth_derivative_of_x_to_m()

◆ POW2()

◆ POW3()

◆ POW4()

◆ powerset()

◆ powerset_dereference()

◆ powInt()

◆ QuadInterp() [1/2]

◆ QuadInterp() [2/2]

◆ root_sum_square()

◆ solve_cubic()

◆ solve_quartic()

◆ sort3()

◆ ValidNumber()