StatisticsCalculator.java 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325
  1. import java.util.ArrayList;
  2. import java.util.Collections;
  3. public class StatisticsCalculator {
  4. public static double max(ArrayList<Double> array)
  5. {
  6. double max = 0;
  7. for(double waarde : array){
  8. if(waarde > max){
  9. max = waarde;
  10. }
  11. }
  12. return max;
  13. }
  14. public static double min(ArrayList<Double> array)
  15. {
  16. double min = array.get(0);
  17. for(double waarde : array){
  18. if(waarde < min){
  19. min = waarde;
  20. }
  21. }
  22. return min;
  23. }
  24. public static double avg(ArrayList<Double> array)
  25. {
  26. double avg = 0;
  27. for(double waarde : array){
  28. avg += waarde;
  29. }
  30. avg /= array.size();
  31. return avg;
  32. }
  33. public static double median(ArrayList<Double> array2){
  34. ArrayList<Double> array = new ArrayList<Double>();
  35. for(double db : array2)
  36. {
  37. array.add(db);
  38. }
  39. Collections.sort(array); //sort the array
  40. double median = 0;
  41. int middle = array.size()/2; //calculate the middle of the array
  42. if (array.size()%2 == 1) { //check if the array is even or uneven
  43. median = array.get(middle);
  44. } else {
  45. median = (array.get(middle-1) + array.get(middle+1)) / 2;
  46. }
  47. return median;
  48. }
  49. public static double modus(ArrayList<Double> array){
  50. double maxValue = 0;
  51. int maxCount = 0;
  52. for (int i = 0; i < array.size(); ++i){ //cycle through every number in the array
  53. int count = 0;
  54. for (int j = 0; j < array.size(); ++j) {
  55. if (array.get(j) == array.get(i)){
  56. ++count;
  57. }
  58. }
  59. if (count > maxCount) { //if the count is bigger then the max count, it will be the temporary modus
  60. maxCount = count;
  61. maxValue = array.get(i);
  62. }
  63. }
  64. return maxValue;
  65. }
  66. public static double afwijking(ArrayList<Double> array){
  67. double mediaan = StatisticsCalculator.median(array);
  68. double afwijking = 0;
  69. for(double m :array){
  70. afwijking += (mediaan-m)*(mediaan-m);
  71. }
  72. afwijking /= array.size();
  73. afwijking = Math.sqrt(afwijking);
  74. return afwijking;
  75. }
  76. public static double graadDagen(ArrayList<Double> array)
  77. {
  78. ArrayList<Double> avgTempDag = new ArrayList<Double>();
  79. int i = 0;
  80. double avgTemp = 0;
  81. //Breken de gemiddelde temperatuur per dag.
  82. for(double db : array)
  83. {
  84. i++;
  85. if(i%1440==0)
  86. {
  87. avgTempDag.add(avgTemp);
  88. avgTemp = 0;
  89. }
  90. avgTemp += db;
  91. }
  92. avgTemp /= array.size();
  93. int graaddagen = 0;
  94. int periodeBegin = 0;
  95. int periodeEind = 1439;
  96. for(int j = 0; j < avgTempDag.size(); j++)
  97. {
  98. if(avgTemp < 18)
  99. {
  100. graaddagen += 18 - avgTemp;
  101. }
  102. }
  103. periodeBegin += 1400;
  104. periodeEind += 1400;
  105. //graaddagen afronden
  106. return graaddagen;
  107. }
  108. public static int[] langsteDroogstePeriode(ArrayList<Double> array)
  109. {
  110. return langsteDroogstePeriodeMetMax(array, 0);
  111. }
  112. public static int[] langsteDroogstePeriodeMetMax(ArrayList<Double> array, int maxNeerslag)
  113. {
  114. int[] index = new int[2];
  115. int index1 = 0;
  116. int index2 = 0;
  117. //Code
  118. index[0] = index1;
  119. index[1] = index2;
  120. return index;
  121. }
  122. public static int[] langsteRegenPeriode(ArrayList<Double> array)
  123. {
  124. ArrayList<Double> rainday = new ArrayList<Double>();
  125. int i = 0;
  126. double longRainday = 0;
  127. // Bereken de Rainrate per dag
  128. for(double rain : array)
  129. {
  130. i++;
  131. if (i% 1440 ==0)
  132. {
  133. rainday.add(longRainday);
  134. longRainday = 0;
  135. }
  136. if (rain > longRainday)
  137. {
  138. longRainday = rain;
  139. }
  140. }
  141. int[] index = new int[2];
  142. int index1 = 0;
  143. int index2 = 0;
  144. int index1_1 = 0;
  145. boolean regen = false;
  146. int p = 0;
  147. int maxDays = 0;
  148. for(int t = 0; t < rainday.size(); t++)
  149. {
  150. if (rainday.get(t) > 0 )
  151. {
  152. p++;
  153. if(!regen)
  154. {
  155. regen = true;
  156. index1_1 = t;
  157. }
  158. else
  159. {
  160. if(p > maxDays)
  161. {
  162. maxDays = p;
  163. index1 = index1_1;
  164. index2 = t-1;
  165. regen=false;
  166. }
  167. p = 0;
  168. }
  169. }
  170. }
  171. index[0] = index1*1440;
  172. if(index2<0)
  173. {
  174. index2 =0;
  175. }
  176. index[1] = index2*1440;
  177. return index;
  178. }
  179. public static short maximaleRegenPeriode(ArrayList<Short> array)
  180. {
  181. short totaleRegen = 0;
  182. for(short db : array)
  183. {
  184. totaleRegen += db;
  185. }
  186. return totaleRegen;
  187. }
  188. public static int[] langsteZomersePeriode(ArrayList<Short> array)
  189. {
  190. ArrayList<Double> maxTempDag = new ArrayList<Double>();
  191. int i = 0;
  192. short maxTemp = 0;
  193. //Bereken de maximale temperatuur per dag.
  194. for(short db : array)
  195. {
  196. i++;
  197. if(i%1440==0)
  198. {
  199. maxTempDag.add( (double) maxTemp);
  200. maxTemp = 0;
  201. }
  202. if(db > maxTemp)
  203. {
  204. maxTemp = db;
  205. }
  206. }
  207. //Creer een array met twee indexen
  208. int[] index = new int[2];
  209. int index1 = 0;
  210. int index2 = 0;
  211. //Een tijdelijke index om bij te houden wat de index was in het geval dat de vorige groter was.
  212. int index1_1 = 0;
  213. //Een boolean
  214. boolean zomers = false;
  215. int p = 0;
  216. int maxDays = 0;
  217. //Doorloop je maximale temperaturen en zoek de langste periode
  218. for(int t=0; t<maxTempDag.size(); t++) {
  219. if(maxTempDag.get(t) > 25) {
  220. p++;
  221. if(!zomers)
  222. {
  223. zomers = true;
  224. index1_1 = t;
  225. }
  226. }
  227. else {
  228. if(p > maxDays) {
  229. maxDays = p;
  230. index1 = index1_1;
  231. index2 = t-1;
  232. zomers=false;
  233. }
  234. p=0;
  235. }
  236. }
  237. //Het terugsturen van de gevonden indexen. Je doet ze keer 1440 omdat je bij het berekenen van
  238. //de temperatuur per dag je het in stukken van 1440 samenvoegde.
  239. index[0] = index1*1440;
  240. if(index2<0){index2=0;}
  241. index[1] = index2*1440;
  242. return index;
  243. }
  244. public static int[] langsteHitteGolfPeriode(ArrayList<Double> array)
  245. {
  246. int[] index = new int[2];
  247. int index1 = 0;
  248. int index2 = 0;
  249. //Code
  250. index[0] = index1;
  251. index[1] = index2;
  252. return index;
  253. }
  254. public static int[] langsteTempStijgingPeriode(ArrayList<Double> array)
  255. {
  256. int[] index = new int[2];
  257. int index1 = 0;
  258. int index2 = 0;
  259. //Code
  260. index[0] = index1;
  261. index[1] = index2;
  262. return index;
  263. }
  264. }