xmedian.c 2.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154
  1. #include <stdlib.h>
  2. #include <grass/gis.h>
  3. #include <grass/raster.h>
  4. #include <grass/raster.h>
  5. #include <grass/calc.h>
  6. /**********************************************************************
  7. median(x1,x2,..,xn)
  8. return median of arguments
  9. **********************************************************************/
  10. static int icmp(const void *aa, const void *bb)
  11. {
  12. const CELL *a = aa;
  13. const CELL *b = bb;
  14. return *a - *b;
  15. }
  16. static int fcmp(const void *aa, const void *bb)
  17. {
  18. const FCELL *a = aa;
  19. const FCELL *b = bb;
  20. if (*a < *b)
  21. return -1;
  22. if (*a > *b)
  23. return 1;
  24. return 0;
  25. }
  26. static int dcmp(const void *aa, const void *bb)
  27. {
  28. const DCELL *a = aa;
  29. const DCELL *b = bb;
  30. if (*a < *b)
  31. return -1;
  32. if (*a > *b)
  33. return 1;
  34. return 0;
  35. }
  36. int f_median(int argc, const int *argt, void **args)
  37. {
  38. static void *array;
  39. static int alloc;
  40. int size = argc * Rast_cell_size(argt[0]);
  41. int i, j;
  42. if (argc < 1)
  43. return E_ARG_LO;
  44. for (i = 1; i <= argc; i++)
  45. if (argt[i] != argt[0])
  46. return E_ARG_TYPE;
  47. if (size > alloc) {
  48. alloc = size;
  49. array = G_realloc(array, size);
  50. }
  51. switch (argt[0]) {
  52. case CELL_TYPE:
  53. {
  54. CELL *res = args[0];
  55. CELL **argv = (CELL **) &args[1];
  56. CELL *a = array;
  57. CELL *a1 = &a[(argc - 1) / 2];
  58. CELL *a2 = &a[argc / 2];
  59. for (i = 0; i < columns; i++) {
  60. int nv = 0;
  61. for (j = 0; j < argc && !nv; j++) {
  62. if (IS_NULL_C(&argv[j][i]))
  63. nv = 1;
  64. else
  65. a[j] = argv[j][i];
  66. }
  67. if (nv)
  68. SET_NULL_C(&res[i]);
  69. else {
  70. qsort(a, argc, sizeof(CELL), icmp);
  71. res[i] = (*a1 + *a2) / 2;
  72. }
  73. }
  74. return 0;
  75. }
  76. case FCELL_TYPE:
  77. {
  78. FCELL *res = args[0];
  79. FCELL **argv = (FCELL **) &args[1];
  80. FCELL *a = array;
  81. FCELL *a1 = &a[(argc - 1) / 2];
  82. FCELL *a2 = &a[argc / 2];
  83. for (i = 0; i < columns; i++) {
  84. int nv = 0;
  85. for (j = 0; j < argc && !nv; j++) {
  86. if (IS_NULL_F(&argv[j][i]))
  87. nv = 1;
  88. else
  89. a[j] = argv[j][i];
  90. }
  91. if (nv)
  92. SET_NULL_F(&res[i]);
  93. else {
  94. qsort(a, argc, sizeof(FCELL), fcmp);
  95. res[i] = (*a1 + *a2) / 2;
  96. }
  97. }
  98. return 0;
  99. }
  100. case DCELL_TYPE:
  101. {
  102. DCELL *res = args[0];
  103. DCELL **argv = (DCELL **) &args[1];
  104. DCELL *a = array;
  105. DCELL *a1 = &a[(argc - 1) / 2];
  106. DCELL *a2 = &a[argc / 2];
  107. for (i = 0; i < columns; i++) {
  108. int nv = 0;
  109. for (j = 0; j < argc && !nv; j++) {
  110. if (IS_NULL_D(&argv[j][i]))
  111. nv = 1;
  112. else
  113. a[j] = argv[j][i];
  114. }
  115. if (nv)
  116. SET_NULL_D(&res[i]);
  117. else {
  118. qsort(a, argc, sizeof(DCELL), dcmp);
  119. res[i] = (*a1 + *a2) / 2;
  120. }
  121. }
  122. return 0;
  123. }
  124. default:
  125. return E_INV_TYPE;
  126. }
  127. }