GRASS GIS 7 Programmer's Manual
7.9.dev(2021)-e5379bbd7
|
Go to the source code of this file.
Data Structures | |
struct | triple |
struct | quaddata |
Macros | |
#define | NW 1 |
#define | NE 2 |
#define | SW 3 |
#define | SE 4 |
Functions | |
struct triple * | quad_point_new (double, double, double, double) |
struct quaddata * | quad_data_new (double, double, double, double, int, int, int, int) |
int | quad_compare (struct triple *, struct quaddata *) |
int | quad_add_data (struct triple *, struct quaddata *, double) |
int | quad_intersect (struct quaddata *, struct quaddata *) |
int | quad_division_check (struct quaddata *, int) |
struct quaddata ** | quad_divide_data (struct quaddata *, int, double) |
int | quad_get_points (struct quaddata *, struct quaddata *, int) |
#define NE 2 |
Definition at line 30 of file dataquad.h.
Referenced by N_callback_solute_transport_2d(), N_create_27star(), and N_create_9star().
#define NW 1 |
Definition at line 29 of file dataquad.h.
Referenced by N_callback_solute_transport_2d(), N_create_27star(), and N_create_9star().
#define SE 4 |
Definition at line 32 of file dataquad.h.
Referenced by N_callback_solute_transport_2d(), N_create_27star(), and N_create_9star().
#define SW 3 |
Definition at line 31 of file dataquad.h.
Referenced by N_callback_solute_transport_2d(), N_create_27star(), and N_create_9star().
Add point to a given data.
Definition at line 143 of file dataquad.c.
Return the quadrant the point should be inserted in
Definition at line 98 of file dataquad.c.
struct quaddata* quad_data_new | ( | double | x_or, |
double | y_or, | ||
double | xmax, | ||
double | ymax, | ||
int | rows, | ||
int | cols, | ||
int | n_points, | ||
int | kmax | ||
) |
Initialize quaddata structure with given arguments
This is a constructor of the quaddata structure and it allocates memory. It also creates (and allocates memory for) the given number of points (given by kmax). The point attributes are set to zero.
Definition at line 62 of file dataquad.c.
Divide data into four new ones
Divides data into 4 new datas reinserting data->points
in them by calling data function quad_compare()
to determine were to insert. Returns array of 4 new datas (allocates memory).
Definition at line 237 of file dataquad.c.
int quad_division_check | ( | struct quaddata * | data, |
int | kmax | ||
) |
Check if data needs to be divided
Checks if data needs to be divided. If data->points
is empty, returns -1; if its not empty but there aren't enough points in data for division returns 0. Otherwise (if its not empty and there are too many points) returns 1.
Definition at line 219 of file dataquad.c.
Gets such points from data that lie within region determined by data_inter. Called by tree function region_data()
.
Definition at line 323 of file dataquad.c.
Check intersection of two quaddata structures
Checks if region defined by data intersects the region defined by data_inter.
Definition at line 180 of file dataquad.c.
struct triple* quad_point_new | ( | double | x, |
double | y, | ||
double | z, | ||
double | sm | ||
) |
Initialize point structure with given arguments
This is a constructor of the point structure and it allocates memory.
Definition at line 38 of file dataquad.c.
References malloc(), NULL, triple::sm, triple::x, x, triple::y, and triple::z.