| calc_node_gradient(const double *f, const int method, double *grad, const int n_it=20) const | AMP::DelaunayInterpolation< TYPE > | |
| clear() | AMP::DelaunayInterpolation< TYPE > | |
| compute_Barycentric(const int ndim, const double *x, const double *xi, double *L) | AMP::DelaunayInterpolation< TYPE > | static |
| copy_tessellation() const | AMP::DelaunayInterpolation< TYPE > | |
| create_kdtree() const | AMP::DelaunayInterpolation< TYPE > | private |
| create_node_neighbors() const | AMP::DelaunayInterpolation< TYPE > | private |
| create_node_tri() const | AMP::DelaunayInterpolation< TYPE > | private |
| create_tessellation(const AMP::Array< TYPE > &x) | AMP::DelaunayInterpolation< TYPE > | |
| create_tessellation(size_t N, const TYPE *x, const TYPE *y, const TYPE *z) | AMP::DelaunayInterpolation< TYPE > | |
| create_tessellation(const Array< TYPE > &x, const Array< int > &tri) | AMP::DelaunayInterpolation< TYPE > | |
| create_tri_neighbors() const | AMP::DelaunayInterpolation< TYPE > | private |
| d_N_node | AMP::DelaunayInterpolation< TYPE > | mutableprivate |
| d_N_node_sum | AMP::DelaunayInterpolation< TYPE > | mutableprivate |
| d_node_list | AMP::DelaunayInterpolation< TYPE > | mutableprivate |
| d_node_tri | AMP::DelaunayInterpolation< TYPE > | mutableprivate |
| d_tree | AMP::DelaunayInterpolation< TYPE > | mutableprivate |
| d_tri | AMP::DelaunayInterpolation< TYPE > | private |
| d_tri_nab | AMP::DelaunayInterpolation< TYPE > | mutableprivate |
| d_x | AMP::DelaunayInterpolation< TYPE > | private |
| DelaunayInterpolation() | AMP::DelaunayInterpolation< TYPE > | |
| DelaunayInterpolation(const DelaunayInterpolation &)=delete | AMP::DelaunayInterpolation< TYPE > | |
| find_nearest(const Array< TYPE2 > &xi) const | AMP::DelaunayInterpolation< TYPE > | |
| find_tri(const Array< TYPE2 > &xi, bool extrap=false) const | AMP::DelaunayInterpolation< TYPE > | |
| get_N_tri() const | AMP::DelaunayInterpolation< TYPE > | |
| get_tri() const | AMP::DelaunayInterpolation< TYPE > | |
| get_tri_nab() const | AMP::DelaunayInterpolation< TYPE > | |
| interp_cubic(const AMP::Array< double > &f, const AMP::Array< double > &g, const AMP::Array< TYPE2 > &xi, const AMP::Array< int > &index, int extrap=0) const | AMP::DelaunayInterpolation< TYPE > | |
| interp_cubic_single(const double f[], const double g[], const double xi[], const int index, double &fi, double *gi, int extrap) const | AMP::DelaunayInterpolation< TYPE > | private |
| interp_linear(const AMP::Array< double > &f, const AMP::Array< TYPE2 > &xi, const AMP::Array< int > &index, bool extrap=false) const | AMP::DelaunayInterpolation< TYPE > | |
| interp_nearest(const Array< double > &f, const Array< TYPE2 > &xi, const Array< size_t > &nearest) const | AMP::DelaunayInterpolation< TYPE > | |
| operator=(const DelaunayInterpolation &)=delete | AMP::DelaunayInterpolation< TYPE > | |
| ~DelaunayInterpolation() | AMP::DelaunayInterpolation< TYPE > | |
