StatisticsCalculator.java 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434
  1. package weerstation1;
  2. import java.util.ArrayList;
  3. import java.util.Calendar;
  4. import java.util.Collections;
  5. public class StatisticsCalculator {
  6. public static double max(ArrayList<Double> array)
  7. {
  8. double max = 0;
  9. for(double waarde : array){
  10. if(waarde > max){
  11. max = waarde;
  12. }
  13. }
  14. return max;
  15. }
  16. public static double min(ArrayList<Double> array)
  17. {
  18. double min = array.get(0);
  19. for(double waarde : array){
  20. if(waarde < min){
  21. min = waarde;
  22. }
  23. }
  24. return min;
  25. }
  26. public static double avg(ArrayList<Double> array)
  27. {
  28. double avg = 0;
  29. for(double waarde : array){
  30. avg += waarde;
  31. }
  32. avg /= array.size();
  33. return avg;
  34. }
  35. public static double median(ArrayList<Double> array2){
  36. ArrayList<Double> array = new ArrayList<Double>();
  37. for(double db : array2)
  38. {
  39. array.add(db);
  40. }
  41. Collections.sort(array); //sort the array
  42. double median = 0;
  43. int middle = array.size()/2; //calculate the middle of the array
  44. if (array.size()%2 == 1) { //check if the array is even or uneven
  45. median = array.get(middle);
  46. } else {
  47. median = (array.get(middle-1) + array.get(middle+1)) / 2;
  48. }
  49. return median;
  50. }
  51. public static double modus(ArrayList<Double> array){
  52. double maxValue = 0;
  53. int maxCount = 0;
  54. for (int i = 0; i < array.size(); ++i){ //cycle through every number in the array
  55. int count = 0;
  56. for (int j = 0; j < array.size(); ++j) {
  57. if (array.get(j) == array.get(i)){
  58. ++count;
  59. }
  60. }
  61. if (count > maxCount) { //if the count is bigger then the max count, it will be the temporary modus
  62. maxCount = count;
  63. maxValue = array.get(i);
  64. }
  65. }
  66. return maxValue;
  67. }
  68. public static double afwijking(ArrayList<Double> array){
  69. double mediaan = StatisticsCalculator.median(array);
  70. double afwijking = 0;
  71. for(double m :array){
  72. afwijking += (mediaan-m)*(mediaan-m);
  73. }
  74. afwijking /= array.size();
  75. afwijking = Math.sqrt(afwijking);
  76. return afwijking;
  77. }
  78. public static double graadDagen(ArrayList<Double> array)
  79. {
  80. ArrayList<Double> avgTempDag = new ArrayList<Double>();
  81. int i = 0;
  82. double avgTemp = 0;
  83. //Breken de gemiddelde temperatuur per dag.
  84. for(double db : array)
  85. {
  86. i++;
  87. if(i%1440==0)
  88. {
  89. avgTempDag.add(avgTemp);
  90. avgTemp = 0;
  91. }
  92. avgTemp += db;
  93. }
  94. avgTemp /= array.size();
  95. int graaddagen = 0;
  96. int periodeBegin = 0;
  97. int periodeEind = 1439;
  98. for(int j = 0; j < avgTempDag.size(); j++)
  99. {
  100. if(avgTemp < 18)
  101. {
  102. graaddagen += 18 - avgTemp;
  103. }
  104. }
  105. periodeBegin += 1400;
  106. periodeEind += 1400;
  107. //graaddagen afronden
  108. return graaddagen;
  109. }
  110. public static int[] langsteDroogstePeriode(ArrayList<Double> array)
  111. {
  112. return langsteDroogstePeriodeMetMax(array, 0);
  113. }
  114. public static int[] langsteDroogstePeriodeMetMax(ArrayList<Double> array, int maxNeerslag)
  115. {
  116. int[] index = new int[2];
  117. int index1 = 0;
  118. int index2 = 0;
  119. //Code
  120. index[0] = index1;
  121. index[1] = index2;
  122. return index;
  123. }
  124. public static int[] langsteRegenPeriode(ArrayList<Double> array)
  125. {
  126. ArrayList<Double> rainday = new ArrayList<Double>();
  127. int i = 0;
  128. double longRainday = 0;
  129. // Bereken de Rainrate per dag
  130. for(double rain : array)
  131. {
  132. i++;
  133. if (i% 1440 ==0)
  134. {
  135. rainday.add(longRainday);
  136. longRainday = 0;
  137. }
  138. if (rain > longRainday)
  139. {
  140. longRainday = rain;
  141. }
  142. }
  143. int[] index = new int[2];
  144. int index1 = 0;
  145. int index2 = 0;
  146. int index1_1 = 0;
  147. boolean regen = false;
  148. int p = 0;
  149. int maxDays = 0;
  150. for(int t = 0; t < rainday.size(); t++)
  151. {
  152. if (rainday.get(t) > 0 )
  153. {
  154. p++;
  155. if(!regen)
  156. {
  157. regen = true;
  158. index1_1 = t;
  159. }
  160. else
  161. {
  162. if(p > maxDays)
  163. {
  164. maxDays = p;
  165. index1 = index1_1;
  166. index2 = t-1;
  167. regen=false;
  168. }
  169. p = 0;
  170. }
  171. }
  172. }
  173. index[0] = index1*1440;
  174. if(index2<0)
  175. {
  176. index2 =0;
  177. }
  178. index[1] = index2*1440;
  179. return index;
  180. }
  181. public static short maximaleRegenPeriode(ArrayList<Double> array)
  182. {
  183. short regen = 0;
  184. ArrayList<Short> regenPerUur = new ArrayList<Short>();
  185. for(int i=0; i<array.size();i++)
  186. {
  187. if(i%60==0)
  188. {
  189. regen /= 60;
  190. regenPerUur.add(regen);
  191. regen = 0;
  192. }
  193. regen += array.get(i);
  194. }
  195. short totaleRegen = 0;
  196. for(short sh : regenPerUur)
  197. {
  198. totaleRegen += sh;
  199. }
  200. return totaleRegen;
  201. }
  202. public static int[] langsteZomersePeriode(ArrayList<Double> array)
  203. {
  204. ArrayList<Double> maxTempDag = new ArrayList<Double>();
  205. int i = 0;
  206. double maxTemp = 0;
  207. //Bereken de maximale temperatuur per dag.
  208. for(double db : array)
  209. {
  210. i++;
  211. if(i%1440==0)
  212. {
  213. maxTempDag.add( (double) maxTemp);
  214. maxTemp = 0;
  215. }
  216. if(db > maxTemp)
  217. {
  218. maxTemp = db;
  219. }
  220. }
  221. //Creer een array met twee indexen
  222. int[] index = new int[2];
  223. int index1 = 0;
  224. int index2 = 0;
  225. //Een tijdelijke index om bij te houden wat de index was in het geval dat de vorige groter was.
  226. int index1_1 = 0;
  227. //Een boolean
  228. boolean zomers = false;
  229. int p = 0;
  230. int maxDays = 0;
  231. //Doorloop je maximale temperaturen en zoek de langste periode
  232. for(int t=0; t<maxTempDag.size(); t++) {
  233. if(maxTempDag.get(t) > 770) {
  234. p++;
  235. if(!zomers)
  236. {
  237. zomers = true;
  238. index1_1 = t;
  239. }
  240. }
  241. else {
  242. if(p > maxDays) {
  243. maxDays = p;
  244. index1 = index1_1;
  245. index2 = t-1;
  246. zomers=false;
  247. }
  248. p=0;
  249. }
  250. }
  251. //Het terugsturen van de gevonden indexen. Je doet ze keer 1440 omdat je bij het berekenen van
  252. //de temperatuur per dag je het in stukken van 1440 samenvoegde.
  253. index[0] = index1*1440;
  254. if(index2<0){index2=0;}
  255. index[1] = index2*1440;
  256. return index;
  257. }
  258. public static Periode langsteHittegolfPeriode(ArrayList<Measurement> array){
  259. double maxDay = 0;
  260. ArrayList<Double> maxTempPerDay = new ArrayList<Double>();
  261. //calculate the max for every day
  262. for(int i = 0; i < array.size(); i++){
  263. if((i % 1440) == 0){
  264. maxTempPerDay.add(maxDay);
  265. maxDay = 0;
  266. }
  267. if(array.get(i).getRawOutsideTemp() > maxDay){
  268. maxDay = array.get(i).getRawOutsideTemp();
  269. }
  270. }
  271. int periodLength = 0;
  272. int maxPeriodLength = 5;
  273. int numberOfTropicalDays = 0;
  274. Calendar begin = Calendar.getInstance();
  275. Calendar eind = Calendar.getInstance();
  276. Periode periode = new Periode(begin, eind, "Geen hittegolfperiode gevonden");
  277. for(int i = 0; i < maxTempPerDay.size(); i++){
  278. if( maxTempPerDay.get(i) >= 770){ // If the temperature is bigger then 25 degree Celcius (770 degree Fahrenheit) the summer period will start
  279. periodLength++;
  280. if (maxTempPerDay.get(i) >= 860){ // If the temperature is bigger then 30 degree Celcius (860 degree Fahrenheit) it will add a tropical day
  281. numberOfTropicalDays++;
  282. }
  283. }else if(periodLength > maxPeriodLength && numberOfTropicalDays >= 3){ //period has ended. If it is bigger then 5 days AND there are 3 or more tropical days, the period is a heat wave
  284. maxPeriodLength = periodLength;
  285. periodLength = 0;
  286. numberOfTropicalDays = 0;
  287. eind.setTimeInMillis(array.get((i-1)*1440).getDateStamp().getTime());
  288. periode = new Periode(eind, begin, "Langste hittegolf periode");
  289. }else{
  290. numberOfTropicalDays = 0;
  291. periodLength = 0;
  292. }
  293. if(periodLength == 5){
  294. begin.setTimeInMillis(array.get((i-5)*1440).getDateStamp().getTime());
  295. }
  296. }
  297. return periode;
  298. }
  299. public static int[] langsteTempStijgingPeriode(ArrayList<Double> array)
  300. {
  301. ArrayList<Double> maxTempDag = new ArrayList<Double>();
  302. ArrayList<Integer> periodeLengteList = new ArrayList<Integer>();
  303. ArrayList<Integer> periodeStartList = new ArrayList<Integer>();
  304. int[] index = new int[2];
  305. int index1 = 0;
  306. int index2 = 0;
  307. int indexStart = 0;
  308. int indexEind = 1;
  309. int periodeLengte = 0;
  310. int i = 0;
  311. double maxTemp = 0;
  312. //berekent maximale temp. per dag
  313. for(double db : array)
  314. {
  315. i ++;
  316. if(i % 1440 == 0)
  317. {
  318. maxTempDag.add(maxTemp);
  319. maxTemp = 0;
  320. }
  321. if(db > maxTemp)
  322. {
  323. maxTemp = db;
  324. }
  325. }
  326. for(int t = 1; t < maxTempDag.size(); t ++) //zoekt naar periodes van temp.stijgingen
  327. {
  328. if (maxTempDag.get(t) > maxTempDag.get(t - 1))
  329. {
  330. indexEind ++;
  331. }
  332. if (maxTempDag.get(t) <= maxTempDag.get(t - 1))
  333. {
  334. periodeLengte = indexEind - indexStart;
  335. periodeLengteList.add(periodeLengte);
  336. periodeStartList.add(indexStart);
  337. indexStart = indexEind;
  338. }
  339. }
  340. Integer tempMax = Collections.max(periodeLengteList); //onthoudt de grootste periode van een temp.stijging
  341. for (int u = 0; u < periodeLengteList.size(); u ++) //pakt de index van de grootste periode
  342. {
  343. if (tempMax == periodeLengteList.get(u))
  344. {
  345. index1 = u;
  346. index2 = tempMax - u;
  347. }
  348. }
  349. index[0] = index1 * 1440;
  350. index[1] = index2 * 1440;
  351. return index;
  352. }
  353. }