API tools faq
paste
Advertisement
drorgrebel

Airport_Tester

drorgrebel
Dec 9th, 2017
1,174
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 17.43 KB | None | 0 0
raw download clone embed print report
  1. import static org.junit.Assert.*;
  2. import org.junit.Test;
  3. /**
  4. * Airport_Tester
  5. * Tests Flight class.
  6. *
  7. * @author Dror
  8. * @version 20441/Maman_13/2018A
  9. */
  10. public class Airport_Tester
  11. {
  12.  
  13. //Create flights[] array to concentrate all flights in before inserting into Airport a1.
  14. final int MAX_FLIGHTS = 200;
  15. private Flight[] flights = new Flight[MAX_FLIGHTS+1];
  16.  
  17. //Test Airport Constructors and tests methods on empty object
  18. @Test //see that an empty a1 object is created.
  19. public void testAirport_ctor()
  20. {
  21. Airport a1 = new Airport("Tel-Aviv");
  22. //Print it
  23. assertEquals("a1 is Empty:" , "The flights from airport Tel-Aviv today are:\n", a1.toString() );
  24. //firstFlightFromDestination
  25. Time1 t1 = a1.firstFlightFromDestination("Tel-Aviv"); //should return null
  26. assertEquals("First Flight from Destination in empty-Airport" , null, t1 );
  27. //howManyFullFlights
  28. assertEquals("How many Full Flights in empty-Airport" , 0 , a1.howManyFullFlights() );
  29. //howManyFlightsBetween
  30. assertEquals("How many flights between cities in empty-Airport" , 0 , a1.howManyFlightsBetween("Tel-Aviv","Berlin") );
  31. assertEquals("How many flights between cities in empty-Airport" , 0 , a1.howManyFlightsBetween("town1","city2") );
  32. //mostPopularDestination
  33. assertEquals("Most Popular Destination in empty-Airport" , null , a1.mostPopularDestination() );
  34. //mostExpensiveTicket
  35. assertEquals("Most Expensive Ticket" , null , a1.mostExpensiveTicket() );
  36. //longestFlight
  37. assertEquals("longest Flight" , null , a1.longestFlight());
  38. }
  39.  
  40.  
  41. //Test Flights adding
  42. @Test
  43. public void testFlightsAdding()
  44. {
  45. Airport a1 = new Airport("Tel-Aviv");
  46. //Create 20 "specific" flights In "Tel-Aviv" Airport a1
  47. flights[1] = new Flight("Tel-Aviv", "Paris", 0, 0, 1000, 100, 2000);
  48. flights[2] = new Flight("Paris", "Tel-Aviv", 0, 10, 1000, 100, 2000);
  49. flights[3] = new Flight("Tel-Aviv", "Tel-Aviv", 2, 12, 1000, 100, 2000);
  50. flights[4] = new Flight("Tel-Aviv", "London", 23, 59, 1000, 100, 2000);
  51. flights[5] = new Flight("London", "Tel-Aviv", 0, 1, 1000, 100, 2000);
  52. flights[6] = new Flight("Rome", "Tel-Aviv", 0, 0, 1000, 100, 2000);
  53. flights[7] = new Flight("Tel-Aviv", "Rome", 0, 10, 1000, 100, 2000);
  54. flights[8] = new Flight("Amsterdam", "Tel-Aviv", 2, 12, 1000, 100, 2000);
  55. flights[9] = new Flight("Amsterdam", "Tel-Aviv", 23, 59, 1000, 100, 2000);
  56. flights[10] = new Flight("New-York", "Tel-Aviv", 0, 1, 1000, 100, 2000);
  57. flights[11] = new Flight("Tel-Aviv", "Paris", 0, 0, 1000, 100, 2000);
  58. flights[12] = new Flight("Tel-Aviv", "New-York", 0, 10, 1000, 100, 2000);
  59. flights[13] = new Flight("Tel-Aviv", "Los-Angeles", 2, 12, 1000, 100, 2000);
  60. flights[14] = new Flight("Los-Angeles", "Tel-Aviv", 23, 59, 1000, 100, 2000);
  61. flights[15] = new Flight("Tel-Aviv", "London", 0, 1, 1000, 100, 2000);
  62. flights[16] = new Flight("Rome", "Tel-Aviv", 0, 0, 1000, 100, 2000);
  63. flights[17] = new Flight("Tel-Aviv", "Venice", 0, 10, 1000, 100, 2000);
  64. flights[18] = new Flight("Berlin", "Tel-Aviv", 2, 12, 1000, 100, 2000);
  65. flights[19] = new Flight("Tel-Aviv", "Berlin", 23, 59, 1000, 100, 2000);
  66. flights[20] = new Flight("Tel-Aviv", "Odessa", 0, 1, 1000, 100, 2000);
  67. //Add the flights successfully:
  68. for(int i=1; i<= 20; i++){
  69. assertEquals("adding Flight:" + i , true, a1.addFlight(flights[i]) );
  70. }
  71.  
  72. //Flights that shouldn't be added to Airport because they dont travel to/From Tel-Aviv
  73. flights[21] = new Flight("Amsterdam", "Rome", 23, 59, 1000, 100, 2000);
  74. flights[22] = new Flight("Berlin", "Odessa", 0, 1, 1000, 100, 2000);
  75. //Get false trying to add: Flights don't travel to/from TLV
  76. for(int i=21; i<= 22; i++){
  77. assertEquals("adding Flight:" + i , false, a1.addFlight(flights[i]) );
  78. }
  79. }//End testFlightsAdding
  80.  
  81.  
  82. //Test Flights adding
  83. @Test
  84. public void testFlightsAdding_2()
  85. {
  86. Airport a1 = new Airport("Tel-Aviv");
  87. //Add 200 and see success
  88. for(int i=1; i< 201; i++){
  89. flights[i] = new Flight("Tel-Aviv", "Paris", i%23, i%59, 3*i, i, 20*i);
  90. assertEquals("adding Flight:" + i , true, a1.addFlight(flights[i]) );
  91.  
  92. }
  93. //Add more than 200 and see that fails:
  94. for(int i=1; i< 10; i++){
  95. Flight flight = new Flight("Tel-Aviv", "Paris", i%23, i%59, 3*i, i, 20*i);
  96. assertEquals("adding Flight:" + i , false, a1.addFlight(flight) );
  97.  
  98. }
  99.  
  100. }//End testFlightsAdding_2
  101.  
  102.  
  103. //Test Flights removing
  104. @Test
  105. public void testFlightsRemove()
  106. {
  107. Airport a1 = new Airport("Tel-Aviv");
  108. //Create 20 "specific" flights In "Tel-Aviv" Airport a1
  109. flights[1] = new Flight("Tel-Aviv", "Paris", 0, 0, 1000, 100, 2000);
  110. flights[2] = new Flight("Paris", "Tel-Aviv", 0, 10, 1000, 100, 2000);
  111. flights[3] = new Flight("Tel-Aviv", "Tel-Aviv", 2, 12, 1000, 100, 2000);
  112. flights[4] = new Flight("Tel-Aviv", "London", 23, 59, 1000, 100, 2000);
  113. flights[5] = new Flight("London", "Tel-Aviv", 0, 1, 1000, 100, 2000);
  114. flights[6] = new Flight("Rome", "Tel-Aviv", 0, 0, 1000, 100, 2000);
  115. flights[7] = new Flight("Tel-Aviv", "Rome", 0, 10, 1000, 100, 2000);
  116. flights[8] = new Flight("Amsterdam", "Tel-Aviv", 2, 12, 1000, 100, 2000);
  117. flights[9] = new Flight("Amsterdam", "Tel-Aviv", 23, 59, 1000, 100, 2000);
  118. flights[10] = new Flight("New-York", "Tel-Aviv", 0, 1, 1000, 100, 2000);
  119. flights[11] = new Flight("Tel-Aviv", "Paris", 0, 0, 1000, 100, 2000);
  120. flights[12] = new Flight("Tel-Aviv", "New-York", 0, 10, 1000, 100, 2000);
  121. flights[13] = new Flight("Tel-Aviv", "Los-Angeles", 2, 12, 1000, 100, 2000);
  122. flights[14] = new Flight("Los-Angeles", "Tel-Aviv", 23, 59, 1000, 100, 2000);
  123. flights[15] = new Flight("Tel-Aviv", "London", 0, 1, 1000, 100, 2000);
  124. flights[16] = new Flight("Rome", "Tel-Aviv", 0, 0, 1000, 100, 2000);
  125. flights[17] = new Flight("Tel-Aviv", "Venice", 0, 10, 1000, 100, 2000);
  126. flights[18] = new Flight("Berlin", "Tel-Aviv", 2, 12, 1000, 100, 2000);
  127. flights[19] = new Flight("Tel-Aviv", "Berlin", 23, 59, 1000, 100, 2000);
  128. flights[20] = new Flight("Tel-Aviv", "Odessa", 0, 1, 1000, 100, 2000);
  129. //Add the flights successfully:
  130. for(int i=1; i<= 20; i++){
  131. assertEquals("adding Flight:" + i , true, a1.addFlight(flights[i]) );
  132. }
  133.  
  134. //Flights that shouldn't be added to Airport because they don't pass in/From Tel-Aviv
  135. flights[21] = new Flight("Amsterdam", "Rome", 23, 59, 1000, 100, 2000);
  136. flights[22] = new Flight("Berlin", "Odessa", 0, 1, 1000, 100, 2000);
  137. //Get false trying to add: Flights don't travel to/from TLV
  138. for(int i=21; i<= 22; i++){
  139. assertEquals("adding Flight:" + i , false, a1.addFlight(flights[i]) );
  140. }
  141.  
  142. //Remove flights that were not added:
  143. for(int i=21; i<= 22; i++){
  144. assertEquals("Remove Flight:" + i , false, a1.removeFlight(flights[i]) );
  145. }
  146. //Remove all flights inside a1
  147. for(int i=1; i<= 20; i++){
  148. assertEquals("remove Flight:" + i , true, a1.removeFlight(flights[i]) );
  149. }
  150. //Print an empty a1:
  151. assertEquals("a1 is Empty:" , "The flights from airport Tel-Aviv today are:\n", a1.toString() );
  152. }//End testFlightsRemove
  153.  
  154. //Test firstFlightFromDestination
  155. //will bring the earliest flight to depart from place
  156. @Test
  157. public void test_firstFlightFromDestination()
  158. {
  159. Airport a1 = new Airport("Tel-Aviv");
  160. //Create 10 "specific" flights In "Tel-Aviv" Airport a1
  161. flights[1] = new Flight("Tel-Aviv", "Paris", 0, 0, 100, 250, 2000);
  162. flights[2] = new Flight("Paris", "Tel-Aviv", 1, 10, 150, 200, 2000);
  163. flights[3] = new Flight("Tel-Aviv", "Amsterdam", 2, 12, 1000, 100, 3000);
  164. flights[4] = new Flight("Tel-Aviv", "London", 23, 59, 168, 100, 2000);
  165. flights[5] = new Flight("London", "Tel-Aviv", 0, 1, 1004, 100, 2000);
  166. flights[6] = new Flight("Rome", "Tel-Aviv", 0, 0, 105, 105, 2000);
  167. flights[7] = new Flight("Tel-Aviv", "Rome", 0, 10, 980, 150, 2000);
  168. flights[8] = new Flight("Amsterdam", "Tel-Aviv", 12, 12, 712, 100, 2000);
  169. flights[9] = new Flight("Amsterdam", "Tel-Aviv", 23, 59, 889, 120, 2000);
  170. flights[10] = new Flight("Paris", "Tel-Aviv", 10, 12, 230, 130, 2020);
  171. //Add the flights successfully:
  172. for(int i=1; i<= 10; i++){
  173. assertEquals("adding Flight:" + i , true, a1.addFlight(flights[i]) );
  174. }
  175.  
  176. //Earliest flight from Tel-Aviv: "Tel-Aviv", "Paris", 0, 0, 100, 250, 2000)
  177. Time1 earliestFromTLV = a1.firstFlightFromDestination("Tel-Aviv");
  178. String earliestFromTLV_str = earliestFromTLV.toString();
  179. assertEquals("First Flight From TLV:" ,earliestFromTLV_str , "00:00");
  180. //Earliest flight from Amsterdam: ("Amsterdam", "Tel-Aviv", 12, 12, 712, 100, 2000)
  181. Time1 earliestFromAMS = a1.firstFlightFromDestination("Amsterdam");
  182. String earliestFromAMS_str = earliestFromAMS.toString();
  183. assertEquals("First Flight From Amsterdam:" ,earliestFromAMS_str , "12:12");
  184. //Earliest flight from Paris: ("Paris", "Tel-Aviv", 10, 12, 230, 130, 2020);
  185. Time1 earliestFromPRS = a1.firstFlightFromDestination("Amsterdam");
  186. String earliestFromPRS_str = earliestFromAMS.toString();
  187. assertEquals("First Flight From Amsterdam:" ,earliestFromAMS_str , "12:12");
  188. }//End testFlightsRemove
  189.  
  190.  
  191. //Test howManyFullFlights
  192. //will test howManyFlightsBetween()
  193. @Test
  194. public void test_howManyFullFlights()
  195. {
  196. Airport a1 = new Airport("Tel-Aviv");
  197. //Create 10 "specific" flights In "Tel-Aviv" Airport a1
  198. flights[1] = new Flight("Tel-Aviv", "Paris", 0, 0, 100, 250, 2000); //Full flight
  199. flights[2] = new Flight("Paris", "Tel-Aviv", 1, 10, 150, 200, 2000);
  200. flights[3] = new Flight("Tel-Aviv", "Amsterdam", 2, 12, 1000, 100, 3000);
  201. flights[4] = new Flight("Tel-Aviv", "London", 23, 59, 168, 100, 2000);
  202. flights[5] = new Flight("London", "Tel-Aviv", 0, 1, 1004, 100, 2000);
  203. flights[6] = new Flight("Rome", "Tel-Aviv", 0, 0, 105, 105, 2000);
  204. flights[7] = new Flight("Tel-Aviv", "Rome", 0, 10, 980, 250, 2000); //Full flight
  205. flights[8] = new Flight("Amsterdam", "Tel-Aviv", 12, 12, 712, 100, 2000);
  206. flights[9] = new Flight("Amsterdam", "Tel-Aviv", 23, 59, 889, 120, 2000);
  207. flights[10] = new Flight("Paris", "Tel-Aviv", 10, 12, 230, 130, 2020);
  208. //Add the flights successfully:
  209. for(int i=1; i<= 10; i++){
  210. assertEquals("adding Flight:" + i , true, a1.addFlight(flights[i]) );
  211. }
  212. //Count the full flights
  213. assertEquals("HowmanyFullFlights:" , 2 , a1.howManyFullFlights());
  214. }//End howManyFullFlights
  215.  
  216.  
  217.  
  218. //Test howManyFlightsBetween
  219. //will count how many flights between cities.
  220. @Test
  221. public void test_howManyFlightsBetween()
  222. {
  223. Airport a1 = new Airport("Tel-Aviv");
  224. //Create 10 "specific" flights In "Tel-Aviv" Airport a1
  225. flights[1] = new Flight("Tel-Aviv", "Paris", 0, 0, 100, 250, 2000); //Full flight
  226. flights[2] = new Flight("Paris", "Tel-Aviv", 1, 10, 150, 200, 2000);
  227. flights[3] = new Flight("Tel-Aviv", "Amsterdam", 2, 12, 1000, 100, 3000);
  228. flights[4] = new Flight("Tel-Aviv", "London", 23, 59, 168, 100, 2000);
  229. flights[5] = new Flight("London", "Tel-Aviv", 0, 1, 1004, 100, 2000);
  230. flights[6] = new Flight("Rome", "Tel-Aviv", 0, 0, 105, 105, 2000);
  231. flights[7] = new Flight("Tel-Aviv", "Rome", 0, 10, 980, 250, 2000); //Full flight
  232. flights[8] = new Flight("Amsterdam", "Tel-Aviv", 12, 12, 712, 100, 2000);
  233. flights[9] = new Flight("Amsterdam", "Tel-Aviv", 23, 59, 889, 120, 2000);
  234. flights[10] = new Flight("Paris", "Tel-Aviv", 10, 12, 230, 130, 2020);
  235. //Add the flights successfully:
  236. for(int i=1; i<= 10; i++){
  237. assertEquals("adding Flight:" + i , true, a1.addFlight(flights[i]) );
  238. }
  239. //Count the full flights
  240. assertEquals("HowmanyFullFlights:" , 3 , a1.howManyFlightsBetween("Tel-Aviv", "Paris"));
  241. assertEquals("HowmanyFullFlights:" , 3 , a1.howManyFlightsBetween("Tel-Aviv", "Amsterdam"));
  242. assertEquals("HowmanyFullFlights:" , 0 , a1.howManyFlightsBetween("Amsterdam", "Paris"));
  243. }//End howManyFlightsBetween
  244.  
  245.  
  246. //Test mostPopularDestination
  247. //will return the name of the city which biggest number of flights arrive to.
  248. @Test
  249. public void test_mostPopularDestination()
  250. {
  251. Airport a1 = new Airport("Tel-Aviv");
  252. //Create 10 "specific" flights In "Tel-Aviv" Airport a1
  253. flights[1] = new Flight("Tel-Aviv", "Paris", 0, 0, 100, 250, 2000); //Full flight
  254. flights[2] = new Flight("Paris", "Tel-Aviv", 1, 10, 150, 200, 2000);
  255. flights[3] = new Flight("Tel-Aviv", "Amsterdam", 2, 12, 1000, 100, 3000);
  256. flights[4] = new Flight("Tel-Aviv", "London", 23, 59, 168, 100, 2000);
  257. flights[5] = new Flight("Tel-Aviv", "Paris", 0, 1, 1004, 100, 2000);
  258. flights[6] = new Flight("Rome", "Tel-Aviv", 0, 0, 105, 105, 2000);
  259. flights[7] = new Flight("Tel-Aviv", "Rome", 0, 10, 980, 250, 2000); //Full flight
  260. flights[8] = new Flight("Tel-Aviv", "Paris", 12, 12, 712, 100, 2000);
  261. flights[9] = new Flight("Amsterdam", "Tel-Aviv", 23, 59, 889, 120, 2000);
  262. flights[10] = new Flight("Tel-Aviv", "Paris", 10, 12, 230, 130, 2020);
  263. //Add the flights successfully:
  264. for(int i=1; i<= 10; i++){
  265. assertEquals("adding Flight:" + i , true, a1.addFlight(flights[i]) );
  266. }
  267. //Count the full flights
  268. assertEquals("HowmanyFullFlights:" , "Paris" , a1.mostPopularDestination());
  269. assertFalse("Tel-Aviv".equals(a1.mostPopularDestination()) );
  270. }//End mostPopularDestination
  271.  
  272.  
  273. //Test mostExpensiveTicket
  274. //will return the Flight with the most Expensive Ticket.
  275. @Test
  276. public void test_mostExpensiveTicket()
  277. {
  278. Airport a1 = new Airport("Tel-Aviv");
  279. //Create 10 "specific" flights In "Tel-Aviv" Airport a1
  280. flights[1] = new Flight("Tel-Aviv", "Paris", 0, 0, 100, 250, 2000);
  281. flights[2] = new Flight("Paris", "Tel-Aviv", 1, 10, 150, 200, 2000);
  282. flights[3] = new Flight("Tel-Aviv", "Amsterdam", 2, 12, 1000, 100, 3000); //most Expensive
  283. flights[4] = new Flight("Tel-Aviv", "London", 23, 59, 168, 100, 2000);
  284. flights[5] = new Flight("Tel-Aviv", "Paris", 0, 1, 1004, 100, 2000);
  285. flights[6] = new Flight("Rome", "Tel-Aviv", 0, 0, 105, 105, 2000);
  286. flights[7] = new Flight("Tel-Aviv", "Rome", 0, 10, 980, 250, 2000);
  287. flights[8] = new Flight("Tel-Aviv", "Paris", 12, 12, 712, 100, 2000);
  288. flights[9] = new Flight("Amsterdam", "Tel-Aviv", 23, 59, 889, 120, 2000);
  289. flights[10] = new Flight("Tel-Aviv", "Paris", 10, 12, 230, 130, 2020);
  290. //Add the flights successfully:
  291. for(int i=1; i<= 10; i++){
  292. assertEquals("adding Flight:" + i , true, a1.addFlight(flights[i]) );
  293. }
  294. //Count the full flights
  295. assertEquals("Most Expensive Ticket:" , flights[3].toString() , a1.mostExpensiveTicket().toString()); //equals
  296. assertFalse(flights[4].toString().equals(a1.mostExpensiveTicket()) ); //not-equals
  297. }//End mostExpensiveTicket
  298.  
  299.  
  300. //Test longestFlight
  301. //will return the Flight with the longest travel.
  302. @Test
  303. public void test_longestFlight()
  304. {
  305. Airport a1 = new Airport("Tel-Aviv");
  306. //Create 10 "specific" flights In "Tel-Aviv" Airport a1
  307. flights[1] = new Flight("Tel-Aviv", "Paris", 0, 0, 100, 250, 2000);
  308. flights[2] = new Flight("Paris", "Tel-Aviv", 1, 10, 150, 200, 2000);
  309. flights[3] = new Flight("Tel-Aviv", "Amsterdam", 2, 12, 1000, 100, 3000);
  310. flights[4] = new Flight("Tel-Aviv", "London", 23, 59, 168, 100, 2000);
  311. flights[5] = new Flight("Tel-Aviv", "Paris", 0, 1, 1004, 100, 2000); //longest flight
  312. flights[6] = new Flight("Rome", "Tel-Aviv", 0, 0, 105, 105, 2000);
  313. flights[7] = new Flight("Tel-Aviv", "Rome", 0, 10, 980, 250, 2000);
  314. flights[8] = new Flight("Tel-Aviv", "Paris", 12, 12, 712, 100, 2000);
  315. flights[9] = new Flight("Amsterdam", "Tel-Aviv", 23, 59, 889, 120, 2000);
  316. flights[10] = new Flight("Tel-Aviv", "Paris", 10, 12, 230, 130, 2020);
  317. //Add the flights successfully:
  318. for(int i=1; i<= 10; i++){
  319. assertEquals("adding Flight:" + i , true, a1.addFlight(flights[i]) );
  320. }
  321. //Count the full flights
  322. assertEquals("longest Flight:" , 1004 , a1.longestFlight().getFlightDuration()); //equals
  323. assertFalse(flights[4].toString().equals(a1.mostExpensiveTicket()) ); //not-equals
  324. }//End longestFlight()
  325.  
  326. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!