Go to the source code of this file.
|
int | int_max2 (int x, int y) |
|
int | int_max3 (int x, int y, int z) |
|
double * | alloc_zeros_1d (int n) |
|
double ** | alloc_zeros_2d (int n, int m) |
|
void | free_2d (double **array, int n) |
|
void | libgrpp_daxpy (int n, double a, double *x, double *y) |
|
void | libgrpp_multiply_matrices (int M, int N, int K, double *A, double *B, double *C) |
|
double | distance_squared (double *A, double *B) |
|
double | distance (double *A, double *B) |
|
int | points_are_equal (double *a, double *b) |
|
◆ int_max2()
int int_max2 |
( |
int |
x, |
|
|
int |
y |
|
) |
| |
|
inline |
◆ int_max3()
int int_max3 |
( |
int |
x, |
|
|
int |
y, |
|
|
int |
z |
|
) |
| |
|
inline |
◆ alloc_zeros_1d()
double * alloc_zeros_1d |
( |
int |
n | ) |
|
◆ alloc_zeros_2d()
double ** alloc_zeros_2d |
( |
int |
n, |
|
|
int |
m |
|
) |
| |
◆ free_2d()
void free_2d |
( |
double ** |
array, |
|
|
int |
n |
|
) |
| |
◆ libgrpp_daxpy()
void libgrpp_daxpy |
( |
int |
n, |
|
|
double |
a, |
|
|
double * |
x, |
|
|
double * |
y |
|
) |
| |
◆ libgrpp_multiply_matrices()
void libgrpp_multiply_matrices |
( |
int |
M, |
|
|
int |
N, |
|
|
int |
K, |
|
|
double * |
A, |
|
|
double * |
B, |
|
|
double * |
C |
|
) |
| |
◆ distance_squared()
double distance_squared |
( |
double * |
A, |
|
|
double * |
B |
|
) |
| |
◆ distance()
double distance |
( |
double * |
A, |
|
|
double * |
B |
|
) |
| |
◆ points_are_equal()
int points_are_equal |
( |
double * |
a, |
|
|
double * |
b |
|
) |
| |
Checks if two 3d points coincide with each other.
Definition at line 80 of file grpp_utils.c.