test_arrays.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871
  1. /*****************************************************************************
  2. *
  3. * MODULE: Grass PDE Numerical Library
  4. * AUTHOR(S): Soeren Gebbert, Berlin (GER) Dec 2006
  5. * soerengebbert <at> gmx <dot> de
  6. *
  7. * PURPOSE: Unit tests for arrays
  8. *
  9. * COPYRIGHT: (C) 2000 by the GRASS Development Team
  10. *
  11. * This program is free software under the GNU General Public
  12. * License (>=v2). Read the file COPYING that comes with GRASS
  13. * for details.
  14. *
  15. *****************************************************************************/
  16. #include <stdio.h>
  17. #include <stdlib.h>
  18. #include <string.h>
  19. #include <grass/glocale.h>
  20. #include <grass/N_pde.h>
  21. #include "test_gpde_lib.h"
  22. /* prototypes */
  23. static int fill_array_2d(N_array_2d * a);
  24. static int fill_array_2d_null(N_array_2d * a);
  25. static int compare_array_2d(N_array_2d * a, N_array_2d * b);
  26. static int fill_array_3d(N_array_3d * a);
  27. static int fill_array_3d_null(N_array_3d * a);
  28. static int compare_array_3d(N_array_3d * a, N_array_3d * b);
  29. static int test_array_2d(void);
  30. static int test_array_3d(void);
  31. static int io_bench_2d(void);
  32. static int io_bench_3d(void);
  33. /* ************************************************************************* */
  34. /* Performe the array unit tests ******************************************* */
  35. /* ************************************************************************* */
  36. int unit_test_arrays(void)
  37. {
  38. int sum = 0;
  39. io_bench_2d();
  40. return sum;
  41. G_message(_("\n++ Running array unit tests ++"));
  42. G_message(_("\t 1. testing 2d arrays"));
  43. sum += test_array_2d();
  44. G_message(_("\t 2. testing 3d arrays"));
  45. sum += test_array_3d();
  46. if (sum > 0)
  47. G_warning(_("\n-- Array unit tests failure --"));
  48. else
  49. G_message(_("\n-- Array unit tests finished successfully --"));
  50. return sum;
  51. }
  52. /* ************************************************************************* */
  53. /* Fill an 2d array with valid data **************************************** */
  54. /* ************************************************************************* */
  55. int fill_array_2d(N_array_2d * a)
  56. {
  57. int rows, cols, type;
  58. int i, j, res = 0;
  59. rows = a->rows;
  60. cols = a->cols;
  61. type = N_get_array_2d_type(a);
  62. #pragma omp parallel for private (i, j) shared (cols, rows, type, a) reduction(+:res)
  63. for (j = 0; j < rows; j++) {
  64. for (i = 0; i < cols; i++) {
  65. if (type == CELL_TYPE) {
  66. N_put_array_2d_c_value(a, i, j, (CELL) i * (CELL) j);
  67. if (N_get_array_2d_c_value(a, i, j) != (CELL) i * (CELL) j)
  68. res++;
  69. }
  70. if (type == FCELL_TYPE) {
  71. N_put_array_2d_f_value(a, i, j, (FCELL) i * (FCELL) j);
  72. if (N_get_array_2d_f_value(a, i, j) != (FCELL) i * (FCELL) j)
  73. res++;
  74. }
  75. if (type == DCELL_TYPE) {
  76. N_put_array_2d_d_value(a, i, j, (DCELL) i * (DCELL) j);
  77. if (N_get_array_2d_d_value(a, i, j) != (DCELL) i * (DCELL) j)
  78. res++;
  79. }
  80. }
  81. }
  82. return res;
  83. }
  84. /* ************************************************************************* */
  85. /* Fill an 2d array with null values *************************************** */
  86. /* ************************************************************************* */
  87. int fill_array_2d_null(N_array_2d * a)
  88. {
  89. int rows, cols;
  90. int i, j, res = 0;
  91. cols = a->cols;
  92. rows = a->rows;
  93. #pragma omp parallel for private (i, j) shared (rows, cols, a) reduction(+:res)
  94. for (j = 0; j < rows; j++) {
  95. for (i = 0; i < cols; i++) {
  96. N_put_array_2d_value_null(a, i, j);
  97. if (!N_is_array_2d_value_null(a, i, j))
  98. res++;
  99. }
  100. }
  101. return res;
  102. }
  103. /* ************************************************************************* */
  104. /* Compare two 2d arrays *************************************************** */
  105. /* ************************************************************************* */
  106. int compare_array_2d(N_array_2d * a, N_array_2d * b)
  107. {
  108. int rows, cols, type;
  109. int i, j, res = 0;
  110. cols = a->cols;
  111. rows = a->rows;
  112. type = N_get_array_2d_type(a);
  113. #pragma omp parallel for private (i, j) shared (cols, rows, type, a, b) reduction(+:res)
  114. for (j = 0; j < rows; j++) {
  115. for (i = 0; i < cols; i++) {
  116. if (type == CELL_TYPE) {
  117. if (N_get_array_2d_c_value(a, i, j) !=
  118. N_get_array_2d_c_value(b, i, j))
  119. res++;
  120. }
  121. if (type == FCELL_TYPE) {
  122. if (N_get_array_2d_f_value(a, i, j) !=
  123. N_get_array_2d_f_value(b, i, j))
  124. res++;
  125. }
  126. if (type == DCELL_TYPE) {
  127. if (N_get_array_2d_d_value(a, i, j) !=
  128. N_get_array_2d_d_value(b, i, j))
  129. res++;
  130. }
  131. }
  132. }
  133. return res;
  134. }
  135. /* ************************************************************************* */
  136. /* Fill an 3d array with valid data **************************************** */
  137. /* ************************************************************************* */
  138. int fill_array_3d(N_array_3d * a)
  139. {
  140. int rows, cols, depths, type;
  141. int i, j, k, res = 0;
  142. cols = a->cols;
  143. rows = a->rows;
  144. depths = a->depths;
  145. type = N_get_array_3d_type(a);
  146. #pragma omp parallel for private (i, j, k) shared (depths, rows, cols, type, a) reduction(+:res)
  147. for (k = 0; k < depths; k++) {
  148. for (j = 0; j < rows; j++) {
  149. for (i = 0; i < cols; i++) {
  150. if (type == FCELL_TYPE) {
  151. N_put_array_3d_f_value(a, i, j, k,
  152. (float)i * (float)j * (float)k);
  153. if (N_get_array_3d_f_value(a, i, j, k) !=
  154. (float)i * (float)j * (float)k)
  155. res++;
  156. }
  157. if (type == DCELL_TYPE) {
  158. N_put_array_3d_d_value(a, i, j, k,
  159. (double)i * (double)j * (double)k);
  160. if (N_get_array_3d_d_value(a, i, j, k) !=
  161. (double)i * (double)j * (double)k)
  162. res++;
  163. }
  164. }
  165. }
  166. }
  167. return res;
  168. }
  169. /* ************************************************************************* */
  170. /* Fill an 3d array with null data ***************************************** */
  171. /* ************************************************************************* */
  172. int fill_array_3d_null(N_array_3d * a)
  173. {
  174. int rows, cols, depths, type;
  175. int i, j, k, res = 0;
  176. cols = a->cols;
  177. rows = a->rows;
  178. depths = a->depths;
  179. type = N_get_array_3d_type(a);
  180. #pragma omp parallel for private (i, j, k) shared (cols, rows, depths, type, a) reduction(+:res)
  181. for (k = 0; k < depths; k++) {
  182. for (j = 0; j < rows; j++) {
  183. for (i = 0; i < cols; i++) {
  184. N_put_array_3d_value_null(a, i, j, k);
  185. if (!N_is_array_3d_value_null(a, i, j, k))
  186. res++;
  187. }
  188. }
  189. }
  190. return res;
  191. }
  192. /* ************************************************************************* */
  193. /* Compare two 3d arrays *************************************************** */
  194. /* ************************************************************************* */
  195. int compare_array_3d(N_array_3d * a, N_array_3d * b)
  196. {
  197. int rows, cols, depths, type;
  198. int i, j, k, res = 0;
  199. rows = a->rows;
  200. cols = a->cols;
  201. depths = a->depths;
  202. type = N_get_array_3d_type(a);
  203. #pragma omp parallel for private (i, j, k) shared (depths, rows, cols, type, a, b) reduction(+:res)
  204. for (k = 0; k < depths; k++) {
  205. for (i = 0; i < rows; i++) {
  206. for (j = 0; j < cols; j++) {
  207. if (type == FCELL_TYPE) {
  208. if (N_get_array_3d_f_value(a, i, j, k) !=
  209. N_get_array_3d_f_value(b, i, j, k))
  210. res++;
  211. }
  212. if (type == DCELL_TYPE) {
  213. if (N_get_array_3d_d_value(a, i, j, k) !=
  214. N_get_array_3d_d_value(b, i, j, k))
  215. res++;
  216. }
  217. }
  218. }
  219. }
  220. return res;
  221. }
  222. /* *************************************************************** */
  223. /* *************************************************************** */
  224. /* *************************************************************** */
  225. int io_bench_2d(void)
  226. {
  227. int sum = 0, res = 0;
  228. char buff[1024];
  229. struct Cell_head region;
  230. N_array_2d *data1;
  231. N_array_2d *data2;
  232. N_array_2d *data3;
  233. N_array_2d *tmp;
  234. G_get_set_window(&region);
  235. data1 = N_alloc_array_2d(region.cols, region.rows, 0, CELL_TYPE);
  236. data2 = N_alloc_array_2d(region.cols, region.rows, 0, FCELL_TYPE);
  237. data3 = N_alloc_array_2d(region.cols, region.rows, 0, DCELL_TYPE);
  238. fill_array_2d(data1);
  239. fill_array_2d(data2);
  240. fill_array_2d(data3);
  241. /*raster IO methods */
  242. N_write_array_2d_to_rast(data1, "gpde_lib_test_raster_1");
  243. N_write_array_2d_to_rast(data2, "gpde_lib_test_raster_2");
  244. N_write_array_2d_to_rast(data2, "gpde_lib_test_raster_3");
  245. tmp = N_read_rast_to_array_2d("gpde_lib_test_raster_1", NULL);
  246. N_read_rast_to_array_2d("gpde_lib_test_raster_1", tmp);
  247. N_free_array_2d(tmp);
  248. tmp = N_read_rast_to_array_2d("gpde_lib_test_raster_2", NULL);
  249. N_read_rast_to_array_2d("gpde_lib_test_raster_2", tmp);
  250. N_free_array_2d(tmp);
  251. tmp = N_read_rast_to_array_2d("gpde_lib_test_raster_3", NULL);
  252. N_read_rast_to_array_2d("gpde_lib_test_raster_3", tmp);
  253. N_free_array_2d(tmp);
  254. sprintf(buff,
  255. "g.remove rast=gpde_lib_test_raster_1,gpde_lib_test_raster_2,gpde_lib_test_raster_3");
  256. system(buff);
  257. N_free_array_2d(data1);
  258. N_free_array_2d(data2);
  259. N_free_array_2d(data3);
  260. return sum;
  261. }
  262. /* *************************************************************** */
  263. /* *************************************************************** */
  264. /* *************************************************************** */
  265. int test_array_2d(void)
  266. {
  267. int sum = 0, res = 0;
  268. struct Cell_head region;
  269. N_array_2d *data1;
  270. N_array_2d *data11;
  271. N_array_2d *data2;
  272. N_array_2d *data22;
  273. N_array_2d *data3;
  274. N_array_2d *data33;
  275. char buff[1024];
  276. double min, max, ssum;
  277. int nonzero;
  278. N_array_2d *tmp;
  279. /*Alloacte memory for all arrays */
  280. data1 = N_alloc_array_2d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, 1, CELL_TYPE);
  281. N_print_array_2d_info(data1);
  282. data11 = N_alloc_array_2d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, 1, CELL_TYPE);
  283. data2 = N_alloc_array_2d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, 1, FCELL_TYPE);
  284. N_print_array_2d_info(data2);
  285. data22 = N_alloc_array_2d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, 1, FCELL_TYPE);
  286. data3 = N_alloc_array_2d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, 1, DCELL_TYPE);
  287. N_print_array_2d_info(data3);
  288. data33 = N_alloc_array_2d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, 1, DCELL_TYPE);
  289. /*Fill the first arrays with data */
  290. res = fill_array_2d(data1);
  291. if (res != 0)
  292. G_warning("test_array_2d: error while filling array with values");
  293. sum += res;
  294. res = fill_array_2d(data2);
  295. if (res != 0)
  296. G_warning("test_array_2d: error while filling array with values");
  297. sum += res;
  298. res = fill_array_2d(data3);
  299. if (res != 0)
  300. G_warning("test_array_2d: error while filling array with values");
  301. sum += res;
  302. /*Copy the data */
  303. N_copy_array_2d(data1, data11);
  304. N_copy_array_2d(data2, data22);
  305. N_copy_array_2d(data3, data33);
  306. /*Compare the data */
  307. res = compare_array_2d(data1, data11);
  308. if (res != 0)
  309. G_warning("test_array_2d: error in N_copy_array_2d");
  310. sum += res;
  311. res = compare_array_2d(data2, data22);
  312. if (res != 0)
  313. G_warning("test_array_2d: error in N_copy_array_2d");
  314. sum += res;
  315. res = compare_array_2d(data3, data33);
  316. if (res != 0)
  317. G_warning("test_array_2d: error in N_copy_array_2d");
  318. sum += res;
  319. /*compute statistics */
  320. N_calc_array_2d_stats(data1, &min, &max, &ssum, &nonzero, 0);
  321. G_message("CELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  322. nonzero);
  323. if (min != 0 || max != 81 || ssum != 2025 || nonzero != 100) {
  324. G_warning("test_array_2d: error in N_calc_array_2d_stats");
  325. sum++;
  326. }
  327. N_calc_array_2d_stats(data1, &min, &max, &ssum, &nonzero, 1);
  328. G_message("CELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  329. nonzero);
  330. if (min != 0 || max != 81 || ssum != 2025 || nonzero != 144) {
  331. G_warning("test_array_2d: error in N_calc_array_2d_stats");
  332. sum++;
  333. }
  334. N_calc_array_2d_stats(data2, &min, &max, &ssum, &nonzero, 0);
  335. G_message("FCELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  336. nonzero);
  337. if (min != 0 || max != 81 || ssum != 2025 || nonzero != 100) {
  338. G_warning("test_array_2d: error in N_calc_array_2d_stats");
  339. sum++;
  340. }
  341. N_calc_array_2d_stats(data2, &min, &max, &ssum, &nonzero, 1);
  342. G_message("FCELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  343. nonzero);
  344. if (min != 0 || max != 81 || ssum != 2025 || nonzero != 144) {
  345. G_warning("test_array_2d: error in N_calc_array_2d_stats");
  346. sum++;
  347. }
  348. N_calc_array_2d_stats(data3, &min, &max, &ssum, &nonzero, 0);
  349. G_message("DCELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  350. nonzero);
  351. if (min != 0 || max != 81 || ssum != 2025 || nonzero != 100) {
  352. G_warning("test_array_2d: error in N_calc_array_2d_stats");
  353. sum++;
  354. }
  355. N_calc_array_2d_stats(data3, &min, &max, &ssum, &nonzero, 1);
  356. G_message("DCELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  357. nonzero);
  358. if (min != 0 || max != 81 || ssum != 2025 || nonzero != 144) {
  359. G_warning("test_array_2d: error in N_calc_array_2d_stats");
  360. sum++;
  361. }
  362. /*test the array math functions */
  363. tmp = N_math_array_2d(data1, data2, NULL, N_ARRAY_SUM);
  364. N_math_array_2d(data2, data2, tmp, N_ARRAY_SUM);
  365. res = N_convert_array_2d_null_to_zero(tmp);
  366. if (res != 0)
  367. G_warning("test_array_2d: error in N_convert_array_2d_null_to_zero");
  368. sum = res;
  369. N_free_array_2d(tmp);
  370. tmp = N_math_array_2d(data2, data3, NULL, N_ARRAY_DIF);
  371. N_math_array_2d(data1, data2, tmp, N_ARRAY_DIF);
  372. res = N_convert_array_2d_null_to_zero(tmp);
  373. if (res != 0)
  374. G_warning("test_array_2d: error in N_convert_array_2d_null_to_zero");
  375. sum = res;
  376. N_free_array_2d(tmp);
  377. tmp = N_math_array_2d(data1, data1, NULL, N_ARRAY_MUL);
  378. N_math_array_2d(data1, data1, tmp, N_ARRAY_MUL);
  379. res = N_convert_array_2d_null_to_zero(tmp);
  380. if (res != 0)
  381. G_warning("test_array_2d: error in N_convert_array_2d_null_to_zero");
  382. sum = res;
  383. N_free_array_2d(tmp);
  384. tmp = N_math_array_2d(data2, data3, NULL, N_ARRAY_DIV);
  385. N_math_array_2d(data1, data2, tmp, N_ARRAY_DIV);
  386. res = N_convert_array_2d_null_to_zero(tmp);
  387. if (res == 0) { /* if a division with zero is detected, the value is set to null, not to nan */
  388. G_warning("test_array_2d: error in N_convert_array_2d_null_to_zero");
  389. sum++;
  390. }
  391. N_free_array_2d(tmp);
  392. /*check for correct norm calculation */
  393. if (N_norm_array_2d(data1, data11, N_EUKLID_NORM) != 0.0) {
  394. G_warning("test_array_2d: error in N_norm_array_2d");
  395. sum++;
  396. }
  397. if (N_norm_array_2d(data1, data11, N_MAXIMUM_NORM) != 0.0) {
  398. G_warning("test_array_2d: error in N_norm_array_2d");
  399. sum++;
  400. }
  401. if (N_norm_array_2d(data2, data3, N_EUKLID_NORM) != 0.0) {
  402. G_warning("test_array_2d: error in N_norm_array_2d");
  403. sum++;
  404. }
  405. if (N_norm_array_2d(data2, data3, N_MAXIMUM_NORM) != 0.0) {
  406. G_warning("test_array_2d: error in N_norm_array_2d");
  407. sum++;
  408. }
  409. /*fill arrays with null values */
  410. res = fill_array_2d_null(data1);
  411. if (res != 0)
  412. G_warning
  413. ("test_array_2d: error while filling array with cell null values");
  414. sum += res;
  415. res = fill_array_2d_null(data2);
  416. if (res != 0)
  417. G_warning
  418. ("test_array_2d: error while filling array with fcell null values");
  419. sum += res;
  420. res = fill_array_2d_null(data3);
  421. if (res != 0)
  422. G_warning
  423. ("test_array_2d: error while filling array with dcell null values");
  424. sum += res;
  425. /*Copy the data */
  426. N_copy_array_2d(data1, data11);
  427. N_copy_array_2d(data2, data22);
  428. N_copy_array_2d(data3, data33);
  429. /*Compare the data */
  430. compare_array_2d(data1, data11);
  431. compare_array_2d(data2, data22);
  432. compare_array_2d(data3, data33);
  433. /*check for correct norm calculation in case of null values */
  434. if (N_norm_array_2d(data1, data11, N_EUKLID_NORM) != 0.0) {
  435. G_warning("test_array_2d: error in N_norm_array_2d");
  436. sum++;
  437. }
  438. if (N_norm_array_2d(data1, data11, N_MAXIMUM_NORM) != 0.0) {
  439. G_warning("test_array_2d: error in N_norm_array_2d");
  440. sum++;
  441. }
  442. if (N_norm_array_2d(data2, data3, N_EUKLID_NORM) != 0.0) {
  443. G_warning("test_array_2d: error in N_norm_array_2d");
  444. sum++;
  445. }
  446. if (N_norm_array_2d(data2, data3, N_MAXIMUM_NORM) != 0.0) {
  447. G_warning("test_array_2d: error in N_norm_array_2d");
  448. sum++;
  449. }
  450. /*test the array math functions with null values */
  451. tmp = N_math_array_2d(data1, data11, NULL, N_ARRAY_SUM);
  452. N_math_array_2d(data2, data22, tmp, N_ARRAY_SUM);
  453. res = N_convert_array_2d_null_to_zero(tmp);
  454. if (res == 0) {
  455. G_warning("test_array_2d: error in N_convert_array_2d_null_to_zero ");
  456. sum++;
  457. }
  458. N_free_array_2d(tmp);
  459. tmp = N_math_array_2d(data2, data22, NULL, N_ARRAY_DIF);
  460. N_math_array_2d(data3, data33, tmp, N_ARRAY_DIF);
  461. res = N_convert_array_2d_null_to_zero(tmp);
  462. if (res == 0) {
  463. G_warning("test_array_2d: error in N_convert_array_2d_null_to_zero");
  464. sum++;
  465. }
  466. N_free_array_2d(tmp);
  467. tmp = N_math_array_2d(data1, data11, NULL, N_ARRAY_MUL);
  468. N_math_array_2d(data3, data33, tmp, N_ARRAY_MUL);
  469. res = N_convert_array_2d_null_to_zero(tmp);
  470. if (res == 0) {
  471. G_warning("test_array_2d: error in N_convert_array_2d_null_to_zero");
  472. sum++;
  473. }
  474. N_free_array_2d(tmp);
  475. tmp = N_math_array_2d(data2, data3, NULL, N_ARRAY_DIV);
  476. N_math_array_2d(data1, data11, tmp, N_ARRAY_DIV);
  477. res = N_convert_array_2d_null_to_zero(tmp);
  478. if (res == 0) {
  479. G_warning("test_array_2d: error in N_convert_array_2d_null_to_zero");
  480. sum++;
  481. }
  482. N_free_array_2d(tmp);
  483. N_free_array_2d(data1);
  484. N_free_array_2d(data2);
  485. N_free_array_2d(data3);
  486. G_get_set_window(&region);
  487. data1 = N_alloc_array_2d(region.cols, region.rows, 0, CELL_TYPE);
  488. data2 = N_alloc_array_2d(region.cols, region.rows, 0, FCELL_TYPE);
  489. data3 = N_alloc_array_2d(region.cols, region.rows, 0, DCELL_TYPE);
  490. fill_array_2d(data1);
  491. fill_array_2d(data2);
  492. fill_array_2d(data3);
  493. /*raster IO methods */
  494. N_write_array_2d_to_rast(data1, "gpde_lib_test_raster_1");
  495. N_write_array_2d_to_rast(data2, "gpde_lib_test_raster_2");
  496. N_write_array_2d_to_rast(data2, "gpde_lib_test_raster_3");
  497. tmp = N_read_rast_to_array_2d("gpde_lib_test_raster_1", NULL);
  498. N_read_rast_to_array_2d("gpde_lib_test_raster_1", tmp);
  499. N_free_array_2d(tmp);
  500. tmp = N_read_rast_to_array_2d("gpde_lib_test_raster_2", NULL);
  501. N_read_rast_to_array_2d("gpde_lib_test_raster_2", tmp);
  502. N_free_array_2d(tmp);
  503. tmp = N_read_rast_to_array_2d("gpde_lib_test_raster_3", NULL);
  504. N_read_rast_to_array_2d("gpde_lib_test_raster_3", tmp);
  505. N_free_array_2d(tmp);
  506. sprintf(buff,
  507. "g.remove rast=gpde_lib_test_raster_1,gpde_lib_test_raster_2,gpde_lib_test_raster_3");
  508. system(buff);
  509. N_free_array_2d(data1);
  510. N_free_array_2d(data11);
  511. N_free_array_2d(data2);
  512. N_free_array_2d(data22);
  513. N_free_array_2d(data3);
  514. N_free_array_2d(data33);
  515. return sum;
  516. }
  517. /* *************************************************************** */
  518. /* *************************************************************** */
  519. /* *************************************************************** */
  520. int test_array_3d(void)
  521. {
  522. int sum = 0, res = 0;
  523. char buff[1024];
  524. RASTER3D_Region region;
  525. N_array_3d *data1;
  526. N_array_3d *data11;
  527. N_array_3d *data2;
  528. N_array_3d *data22;
  529. N_array_3d *tmp;
  530. double min, max, ssum;
  531. int nonzero;
  532. /*Alloacte memory for all arrays */
  533. data1 =
  534. N_alloc_array_3d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, TEST_N_NUM_DEPTHS, 2,
  535. FCELL_TYPE);
  536. N_print_array_3d_info(data1);
  537. data11 =
  538. N_alloc_array_3d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, TEST_N_NUM_DEPTHS, 2,
  539. FCELL_TYPE);
  540. data2 =
  541. N_alloc_array_3d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, TEST_N_NUM_DEPTHS, 2,
  542. DCELL_TYPE);
  543. N_print_array_3d_info(data2);
  544. data22 =
  545. N_alloc_array_3d(TEST_N_NUM_COLS, TEST_N_NUM_ROWS, TEST_N_NUM_DEPTHS, 2,
  546. DCELL_TYPE);
  547. /*Fill the first arrays with data */
  548. res = fill_array_3d(data1);
  549. if (res != 0)
  550. G_warning("test_array_3d: error while filling array with values");
  551. sum += res;
  552. res = fill_array_3d(data2);
  553. if (res != 0)
  554. G_warning("test_array_3d: error while filling array with values");
  555. sum += res;
  556. /*Copy the data */
  557. N_copy_array_3d(data1, data11);
  558. N_copy_array_3d(data2, data22);
  559. /*Compare the data */
  560. res = compare_array_3d(data1, data11);
  561. if (res != 0)
  562. G_warning("test_array_3d: error in N_copy_array_2d");
  563. sum += res;
  564. res = compare_array_3d(data1, data11);
  565. if (res != 0)
  566. G_warning("test_array_3d: error in N_copy_array_2d");
  567. sum += res;
  568. /*compute statistics */
  569. N_calc_array_3d_stats(data1, &min, &max, &ssum, &nonzero, 0);
  570. G_message("FELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  571. nonzero);
  572. if (min != 0 || max != 729 || ssum != 91125 || nonzero != 1000) {
  573. G_warning("test_array_3d: error in N_calc_array_3d_stats");
  574. sum++;
  575. }
  576. N_calc_array_3d_stats(data1, &min, &max, &ssum, &nonzero, 1);
  577. G_message("FELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  578. nonzero);
  579. if (min != 0 || max != 729 || ssum != 91125 || nonzero != 2744) {
  580. G_warning("test_array_3d: error in N_calc_array_3d_stats");
  581. sum++;
  582. }
  583. N_calc_array_3d_stats(data2, &min, &max, &ssum, &nonzero, 0);
  584. G_message("DCELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  585. nonzero);
  586. if (min != 0 || max != 729 || ssum != 91125 || nonzero != 1000) {
  587. G_warning("test_array_3d: error in N_calc_array_3d_stats");
  588. sum++;
  589. }
  590. N_calc_array_3d_stats(data2, &min, &max, &ssum, &nonzero, 1);
  591. G_message("DCELL Min %g Max %g Sum %g nonzero %i\n", min, max, ssum,
  592. nonzero);
  593. if (min != 0 || max != 729 || ssum != 91125 || nonzero != 2744) {
  594. G_warning("test_array_3d: error in N_calc_array_3d_stats");
  595. sum++;
  596. }
  597. /*test the array math functions */
  598. tmp = N_math_array_3d(data1, data2, NULL, N_ARRAY_SUM);
  599. N_math_array_3d(data2, data2, tmp, N_ARRAY_SUM);
  600. res = N_convert_array_3d_null_to_zero(tmp);
  601. if (res != 0)
  602. G_warning("test_array_3d: error in N_convert_array_3d_null_to_zero");
  603. sum = res;
  604. N_free_array_3d(tmp);
  605. tmp = N_math_array_3d(data2, data1, NULL, N_ARRAY_DIF);
  606. N_math_array_3d(data1, data2, tmp, N_ARRAY_DIF);
  607. res = N_convert_array_3d_null_to_zero(tmp);
  608. if (res != 0)
  609. G_warning("test_array_3d: error in N_convert_array_3d_null_to_zero");
  610. sum = res;
  611. N_free_array_3d(tmp);
  612. tmp = N_math_array_3d(data1, data1, NULL, N_ARRAY_MUL);
  613. N_math_array_3d(data1, data1, tmp, N_ARRAY_MUL);
  614. res = N_convert_array_3d_null_to_zero(tmp);
  615. if (res != 0)
  616. G_warning("test_array_3d: error in N_convert_array_3d_null_to_zero");
  617. sum = res;
  618. N_free_array_3d(tmp);
  619. tmp = N_math_array_3d(data2, data1, NULL, N_ARRAY_DIV);
  620. N_math_array_3d(data1, data2, tmp, N_ARRAY_DIV);
  621. res = N_convert_array_3d_null_to_zero(tmp);
  622. if (res == 0) { /* if a division with zero is detected, the value is set to null, not to nan */
  623. G_warning("test_array_3d: error in N_convert_array_3d_null_to_zero");
  624. sum++;
  625. }
  626. N_free_array_3d(tmp);
  627. /*check for correct norm calculation */
  628. if (N_norm_array_3d(data1, data11, N_EUKLID_NORM) != 0.0) {
  629. G_warning("test_array_3d: error in N_norm_array_3d");
  630. sum++;
  631. }
  632. if (N_norm_array_3d(data1, data11, N_MAXIMUM_NORM) != 0.0) {
  633. G_warning("test_array_3d: error in N_norm_array_3d");
  634. sum++;
  635. }
  636. if (N_norm_array_3d(data1, data2, N_EUKLID_NORM) != 0.0) {
  637. G_warning("test_array_3d: error in N_norm_array_3d");
  638. sum++;
  639. }
  640. if (N_norm_array_3d(data1, data2, N_MAXIMUM_NORM) != 0.0) {
  641. G_warning("test_array_3d: error in N_norm_array_3d");
  642. sum++;
  643. }
  644. /*fill arrays with null values */
  645. res = fill_array_3d_null(data1);
  646. if (res != 0)
  647. G_warning
  648. ("test_array_3d: error while filling array with float null values");
  649. sum += res;
  650. res = fill_array_3d_null(data2);
  651. if (res != 0)
  652. G_warning
  653. ("test_array_3d: error while filling array with double null values");
  654. sum += res;
  655. /*Copy the data */
  656. N_copy_array_3d(data1, data11);
  657. N_copy_array_3d(data2, data22);
  658. /*Compare the data */
  659. compare_array_3d(data1, data11);
  660. compare_array_3d(data2, data22);
  661. /*test the array math functions */
  662. tmp = N_math_array_3d(data1, data2, NULL, N_ARRAY_SUM);
  663. N_math_array_3d(data2, data2, tmp, N_ARRAY_SUM);
  664. res = N_convert_array_3d_null_to_zero(tmp);
  665. if (res == 0) {
  666. G_warning("test_array_3d: error in N_convert_array_3d_null_to_zero");
  667. sum++;
  668. }
  669. N_free_array_3d(tmp);
  670. tmp = N_math_array_3d(data2, data1, NULL, N_ARRAY_DIF);
  671. N_math_array_3d(data1, data2, tmp, N_ARRAY_DIF);
  672. res = N_convert_array_3d_null_to_zero(tmp);
  673. if (res == 0) {
  674. G_warning("test_array_3d: error in N_convert_array_3d_null_to_zero");
  675. sum++;
  676. }
  677. N_free_array_3d(tmp);
  678. tmp = N_math_array_3d(data1, data1, NULL, N_ARRAY_MUL);
  679. N_math_array_3d(data1, data1, tmp, N_ARRAY_MUL);
  680. res = N_convert_array_3d_null_to_zero(tmp);
  681. if (res == 0) {
  682. G_warning("test_array_3d: error in N_convert_array_3d_null_to_zero");
  683. sum++;
  684. }
  685. N_free_array_3d(tmp);
  686. tmp = N_math_array_3d(data2, data1, NULL, N_ARRAY_DIV);
  687. N_math_array_3d(data1, data2, tmp, N_ARRAY_DIV);
  688. res = N_convert_array_3d_null_to_zero(tmp);
  689. if (res == 0) {
  690. G_warning("test_array_3d: error in N_convert_array_3d_null_to_zero");
  691. sum++;
  692. }
  693. N_free_array_3d(tmp);
  694. /*check for correct norm calculation in case of null values */
  695. if (N_norm_array_3d(data1, data11, N_EUKLID_NORM) != 0.0) {
  696. G_warning("test_array_3d: error in N_norm_array_3d");
  697. sum++;
  698. }
  699. if (N_norm_array_3d(data1, data11, N_MAXIMUM_NORM) != 0.0) {
  700. G_warning("test_array_3d: error in N_norm_array_3d");
  701. sum++;
  702. }
  703. if (N_norm_array_3d(data1, data2, N_EUKLID_NORM) != 0.0) {
  704. G_warning("test_array_3d: error in N_norm_array_3d");
  705. sum++;
  706. }
  707. if (N_norm_array_3d(data1, data2, N_MAXIMUM_NORM) != 0.0) {
  708. G_warning("test_array_3d: error in N_norm_array_3d");
  709. sum++;
  710. }
  711. N_free_array_3d(data1);
  712. N_free_array_3d(data2);
  713. /*Set the defaults */
  714. Rast3d_initDefaults();
  715. Rast3d_getWindow(&region);
  716. data1 =
  717. N_alloc_array_3d(region.cols, region.rows, region.depths, 0,
  718. FCELL_TYPE);
  719. data2 =
  720. N_alloc_array_3d(region.cols, region.rows, region.depths, 0,
  721. DCELL_TYPE);
  722. fill_array_3d(data1);
  723. fill_array_3d(data2);
  724. /*Volume IO methods */
  725. N_write_array_3d_to_rast3d(data1, "gpde_lib_test_volume_1", 1);
  726. N_write_array_3d_to_rast3d(data2, "gpde_lib_test_volume_2", 1);
  727. tmp = N_read_rast3d_to_array_3d("gpde_lib_test_volume_1", NULL, 1);
  728. N_read_rast3d_to_array_3d("gpde_lib_test_volume_1", tmp, 1);
  729. N_free_array_3d(tmp);
  730. tmp = N_read_rast3d_to_array_3d("gpde_lib_test_volume_2", NULL, 1);
  731. N_read_rast3d_to_array_3d("gpde_lib_test_volume_2", tmp, 1);
  732. N_free_array_3d(tmp);
  733. sprintf(buff,
  734. "g.remove rast3d=gpde_lib_test_volume_1,gpde_lib_test_volume_2");
  735. system(buff);
  736. N_free_array_3d(data1);
  737. N_free_array_3d(data11);
  738. N_free_array_3d(data2);
  739. N_free_array_3d(data22);
  740. return sum;
  741. }