Detailed Description

This class holds the data for a single-phase interpolation table that is regularly spaced.

It contains very few members or methods, mostly it just holds the data

Definition at line 587 of file TabularBackends.h.

#include <TabularBackends.h>

Inheritance diagram for CoolProp::SinglePhaseGriddedTableData:

Public Member Functions
virtual void	set_limits ()=0

	SinglePhaseGriddedTableData ()

void	build (shared_ptr< CoolProp::AbstractState > &AS)
	Build this table. More...

	MSGPACK_DEFINE (revision, matrices, xmin, xmax, ymin, ymax)

void	resize (std::size_t Nx, std::size_t Ny)
	Resize all the matrices. More...

void	make_axis_vectors ()
	Make vectors for the x-axis values and the y-axis values. More...

void	make_good_neighbors ()
	Make matrices of good neighbors if the current value for i,j corresponds to a bad node. More...

void	pack ()
	Take all the matrices that are in the class and pack them into the matrices map for easy unpacking using msgpack. More...

std::map< std::string, std::vector< std::vector< double > > >::iterator	get_matrices_iterator (const std::string &name)

void	unpack ()
	Take all the matrices that are in the class and pack them into the matrices map for easy unpacking using msgpack. More...

bool	native_inputs_are_in_range (double x, double y)
	Check that the native inputs (the inputs the table is based on) are in range. More...

void	find_native_nearest_neighbor (double x, double y, std::size_t &i, std::size_t &j)
	Find the nearest neighbor for native inputs (the inputs the table is based on) Does not check whether this corresponds to a valid node or not Use bisection since it is faster than calling a logarithm (surprising, but true) More...

void	find_nearest_neighbor (parameters givenkey, double givenval, parameters otherkey, double otherval, std::size_t &i, std::size_t &j)
	Find the nearest neighbor for one (given) variable native, one variable non-native. More...

void	find_native_nearest_good_neighbor (double x, double y, std::size_t &i, std::size_t &j)

void	find_native_nearest_good_cell (double x, double y, std::size_t &i, std::size_t &j)

const std::vector< std::vector< double > > &	get (parameters key)

Public Attributes
std::size_t	Nx

std::size_t	Ny

CoolProp::parameters	xkey

CoolProp::parameters	ykey

shared_ptr< CoolProp::AbstractState >	AS

std::vector< double >	xvec

std::vector< double >	yvec

std::vector< std::vector< std::size_t > >	nearest_neighbor_i

std::vector< std::vector< std::size_t > >	nearest_neighbor_j

bool	logx

bool	logy

double	xmin

double	ymin

double	xmax

double	ymax

LIST_OF_MATRICES int	revision

std::map< std::string, std::vector< std::vector< double > > >	matrices

Constructor & Destructor Documentation

◆ SinglePhaseGriddedTableData()

CoolProp::SinglePhaseGriddedTableData::SinglePhaseGriddedTableData ( )

inline

Definition at line 601 of file TabularBackends.h.

Member Function Documentation

◆ build()

void CoolProp::SinglePhaseGriddedTableData::build ( shared_ptr< CoolProp::AbstractState > & AS )

Build this table.

Definition at line 225 of file TabularBackends.cpp.

◆ find_native_nearest_good_cell()

void CoolProp::SinglePhaseGriddedTableData::find_native_nearest_good_cell	(	double	x,
		double	y,
		std::size_t &	i,
		std::size_t &	j
	)

inline

Find the nearest cell with lower left coordinate (i,j) where (i,j) is a good node, and so are (i+1,j), (i,j+1), (i+1,j+1) This is needed for bicubic interpolation

Definition at line 771 of file TabularBackends.h.

◆ find_native_nearest_good_neighbor()

void CoolProp::SinglePhaseGriddedTableData::find_native_nearest_good_neighbor	(	double	x,
		double	y,
		std::size_t &	i,
		std::size_t &	j
	)

inline

Find the nearest good neighbor node for inputs that are the same as the grid inputs If the straightforward node (i,j) obtained by bisection is no good, find its nearest good node

Definition at line 756 of file TabularBackends.h.

◆ find_native_nearest_neighbor()

void CoolProp::SinglePhaseGriddedTableData::find_native_nearest_neighbor	(	double	x,
		double	y,
		std::size_t &	i,
		std::size_t &	j
	)

inline

Find the nearest neighbor for native inputs (the inputs the table is based on) Does not check whether this corresponds to a valid node or not Use bisection since it is faster than calling a logarithm (surprising, but true)

Definition at line 699 of file TabularBackends.h.

◆ find_nearest_neighbor()

void CoolProp::SinglePhaseGriddedTableData::find_nearest_neighbor	(	parameters	givenkey,
		double	givenval,
		parameters	otherkey,
		double	otherval,
		std::size_t &	i,
		std::size_t &	j
	)

inline

Find the nearest neighbor for one (given) variable native, one variable non-native.

Definition at line 726 of file TabularBackends.h.

◆ get()

const std::vector< std::vector< double > > & CoolProp::SinglePhaseGriddedTableData::get ( parameters key )

inline

Definition at line 775 of file TabularBackends.h.

◆ get_matrices_iterator()

std::map< std::string, std::vector< std::vector< double > > >::iterator CoolProp::SinglePhaseGriddedTableData::get_matrices_iterator ( const std::string & name )

inline

Definition at line 673 of file TabularBackends.h.

◆ make_axis_vectors()

void CoolProp::SinglePhaseGriddedTableData::make_axis_vectors ( )

inline

Make vectors for the x-axis values and the y-axis values.

Definition at line 628 of file TabularBackends.h.

◆ make_good_neighbors()

void CoolProp::SinglePhaseGriddedTableData::make_good_neighbors ( )

inline

Make matrices of good neighbors if the current value for i,j corresponds to a bad node.

Definition at line 641 of file TabularBackends.h.

◆ MSGPACK_DEFINE()

CoolProp::SinglePhaseGriddedTableData::MSGPACK_DEFINE	(	revision	,
		matrices	,
		xmin	,
		xmax	,
		ymin	,
		ymax
	)

◆ native_inputs_are_in_range()

bool CoolProp::SinglePhaseGriddedTableData::native_inputs_are_in_range	(	double	x,
		double	y
	)

inline

Check that the native inputs (the inputs the table is based on) are in range.

Definition at line 692 of file TabularBackends.h.

◆ pack()

void CoolProp::SinglePhaseGriddedTableData::pack ( )

inline

Take all the matrices that are in the class and pack them into the matrices map for easy unpacking using msgpack.

Definition at line 667 of file TabularBackends.h.

◆ resize()

void CoolProp::SinglePhaseGriddedTableData::resize	(	std::size_t	Nx,
		std::size_t	Ny
	)

inline

Resize all the matrices.

Definition at line 620 of file TabularBackends.h.

◆ set_limits()

virtual void CoolProp::SinglePhaseGriddedTableData::set_limits ( )

pure virtual

Implemented in CoolProp::LogPHTable, and CoolProp::LogPTTable.

◆ unpack()

void CoolProp::SinglePhaseGriddedTableData::unpack ( )

inline

Take all the matrices that are in the class and pack them into the matrices map for easy unpacking using msgpack.

Definition at line 681 of file TabularBackends.h.

Member Data Documentation

◆ AS

shared_ptr<CoolProp::AbstractState> CoolProp::SinglePhaseGriddedTableData::AS

Definition at line 593 of file TabularBackends.h.

◆ logx

bool CoolProp::SinglePhaseGriddedTableData::logx

Definition at line 596 of file TabularBackends.h.

◆ logy

bool CoolProp::SinglePhaseGriddedTableData::logy

Definition at line 596 of file TabularBackends.h.

◆ matrices

std::map<std::string, std::vector<std::vector<double> > > CoolProp::SinglePhaseGriddedTableData::matrices

Definition at line 614 of file TabularBackends.h.

◆ nearest_neighbor_i

std::vector<std::vector<std::size_t> > CoolProp::SinglePhaseGriddedTableData::nearest_neighbor_i

Definition at line 595 of file TabularBackends.h.

◆ nearest_neighbor_j

std::vector<std::vector<std::size_t> > CoolProp::SinglePhaseGriddedTableData::nearest_neighbor_j

Definition at line 595 of file TabularBackends.h.

◆ Nx

std::size_t CoolProp::SinglePhaseGriddedTableData::Nx

Definition at line 591 of file TabularBackends.h.

◆ Ny

std::size_t CoolProp::SinglePhaseGriddedTableData::Ny

Definition at line 591 of file TabularBackends.h.

◆ revision

LIST_OF_MATRICES int CoolProp::SinglePhaseGriddedTableData::revision

Definition at line 613 of file TabularBackends.h.

◆ xkey

CoolProp::parameters CoolProp::SinglePhaseGriddedTableData::xkey

Definition at line 592 of file TabularBackends.h.

◆ xmax

double CoolProp::SinglePhaseGriddedTableData::xmax

Definition at line 597 of file TabularBackends.h.

◆ xmin

double CoolProp::SinglePhaseGriddedTableData::xmin

Definition at line 597 of file TabularBackends.h.

◆ xvec

std::vector<double> CoolProp::SinglePhaseGriddedTableData::xvec

Definition at line 594 of file TabularBackends.h.

◆ ykey

CoolProp::parameters CoolProp::SinglePhaseGriddedTableData::ykey

Definition at line 592 of file TabularBackends.h.

◆ ymax

double CoolProp::SinglePhaseGriddedTableData::ymax

Definition at line 597 of file TabularBackends.h.

◆ ymin

double CoolProp::SinglePhaseGriddedTableData::ymin

Definition at line 597 of file TabularBackends.h.

◆ yvec

std::vector<double> CoolProp::SinglePhaseGriddedTableData::yvec

Definition at line 594 of file TabularBackends.h.

The documentation for this class was generated from the following files:

src/Backends/Tabular/TabularBackends.h
src/Backends/Tabular/TabularBackends.cpp

Detailed Description

Public Member Functions

Public Attributes

Constructor & Destructor Documentation

◆ SinglePhaseGriddedTableData()

Member Function Documentation

◆ build()

◆ find_native_nearest_good_cell()

◆ find_native_nearest_good_neighbor()

◆ find_native_nearest_neighbor()

◆ find_nearest_neighbor()

◆ get()

◆ get_matrices_iterator()

◆ make_axis_vectors()

◆ make_good_neighbors()

◆ MSGPACK_DEFINE()

◆ native_inputs_are_in_range()

◆ pack()

◆ resize()

◆ set_limits()

◆ unpack()

Member Data Documentation

◆ AS

◆ logx

◆ logy

◆ matrices

◆ nearest_neighbor_i

◆ nearest_neighbor_j

◆ Nx

◆ Ny

◆ revision

◆ xkey

◆ xmax

◆ xmin

◆ xvec

◆ ykey

◆ ymax

◆ ymin

◆ yvec