Advertisement
Guest User

Untitled

a guest
Apr 19th, 2019
90
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.44 KB | None | 0 0
  1. package Pa_1;
  2.  
  3. import java.io.File;
  4. import java.io.FileNotFoundException;
  5. import java.util.Scanner;
  6.  
  7. public class Test {
  8.  
  9. public static void main(String[] args) throws FileNotFoundException
  10. {
  11. int first = 0;
  12. int sec = 0;
  13. int count = 1;
  14. Intervals I;
  15.  
  16. // I.intervalInsert(1, 10);
  17. // I.intervalInsert(2,9);
  18. // I.intervalInsert(3,8);
  19. // I.intervalInsert(4, 7);
  20. // I.intervalInsert(5,6);
  21. // System.out.println(I.findPOM());
  22. // printNode(I.getRBTree().getRoot().getParent());
  23. // System.out.println(I.getRBTree().getRoot().getParent().getEmax().getValue());
  24. // printNode(I.getRBTree().getRoot());
  25. // printNode(I.getRBTree().getRoot().rightC);
  26. // printNode(I.getRBTree().getRoot().rightC.rightC);
  27. // printNode(I.getRBTree().getRoot().rightC.leftC);
  28. // printNode(I.getRBTree().getRoot().rightC.leftC.rightC);
  29. // printNode(I.getRBTree().getRoot().rightC.leftC.leftC);
  30. // printNode(I.getRBTree().getRoot().rightC.leftC.leftC.rightC);
  31. // printNode(I.getRBTree().getRoot().leftC);
  32. //
  33. // printNode(I.getRBTree().getRoot());
  34.  
  35. for(int i = 1 ; i < 6 ; i ++)
  36. {
  37. I = new Intervals();
  38. File f = new File("\\\\my.files.iastate.edu\\Users\\xiuyuang\\Desktop\\res\\small_"+i+".txt");
  39. Scanner s = new Scanner(f);
  40.  
  41. String t = s.nextLine();
  42. while(s.hasNext())
  43. {
  44.  
  45. // String temp = s.next();
  46. // System.out.println(temp);
  47. if(count%2 != 0)
  48. first = Integer.parseInt(s.next());
  49. else
  50. {
  51. sec = Integer.parseInt(s.next());
  52. //System.out.println("First:" + first +"\nsec: " + sec);
  53. I.intervalInsert(first, sec);
  54.  
  55. }
  56. count++;
  57. }
  58.  
  59. System.out.println(I.findPOM());
  60. s.close();
  61. }
  62.  
  63. System.out.println("Medium: ");
  64.  
  65. for(int i = 1 ; i < 6 ; i ++)
  66. {
  67. I = new Intervals();
  68. File f = new File("\\\\my.files.iastate.edu\\Users\\xiuyuang\\Desktop\\res\\medium_"+i+".txt");
  69. Scanner s = new Scanner(f);
  70.  
  71. String t = s.nextLine();
  72. while(s.hasNext())
  73. {
  74.  
  75. // String temp = s.next();
  76. // System.out.println(temp);
  77. if(count%2 != 0)
  78. first = Integer.parseInt(s.next());
  79. else
  80. {
  81. sec = Integer.parseInt(s.next());
  82. //System.out.println("First:" + first +"\nsec: " + sec);
  83. I.intervalInsert(first, sec);
  84.  
  85. }
  86. count++;
  87. }
  88.  
  89. System.out.println(I.findPOM());
  90. s.close();
  91. }
  92.  
  93. System.out.println("Large: ");
  94.  
  95. for(int i = 1 ; i < 6 ; i ++)
  96. {
  97. I = new Intervals();
  98. File f = new File("\\\\my.files.iastate.edu\\Users\\xiuyuang\\Desktop\\res\\large_"+i+".txt");
  99. Scanner s = new Scanner(f);
  100.  
  101. String t = s.nextLine();
  102. while(s.hasNext())
  103. {
  104.  
  105. // String temp = s.next();
  106. // System.out.println(temp);
  107. if(count%2 != 0)
  108. first = Integer.parseInt(s.next());
  109. else
  110. {
  111. sec = Integer.parseInt(s.next());
  112. //System.out.println("First:" + first +"\nsec: " + sec);
  113. I.intervalInsert(first, sec);
  114.  
  115. }
  116. count++;
  117. }
  118.  
  119. System.out.println(I.findPOM());
  120. s.close();
  121. }
  122.  
  123. // for(int i = 1 ; i < 5 ; i ++)
  124. // {
  125. // I.intervalInsert(i, i+1);
  126. // }
  127. //I.intervalInsert(2, 3);
  128.  
  129.  
  130.  
  131. // printNode(I.getRBTree().getRoot());
  132. // System.out.println("Right");
  133. // printNode(I.getRBTree().getRoot().getRight());
  134. // printNode(I.getRBTree().getRoot().getRight().getLeft());
  135. // printNode(I.getRBTree().getRoot().getRight().getRight());
  136. // System.out.println("left");
  137. // printNode(I.getRBTree().getRoot().getLeft());
  138. // printNode(I.getRBTree().getRoot().getLeft().getLeft());
  139. // printNode(I.getRBTree().getRoot().getLeft().getRight());
  140. //printNode(I.getRBTree().getRoot().getParent());
  141.  
  142. }
  143.  
  144.  
  145.  
  146.  
  147. private static void loadInterval(Intervals I) throws FileNotFoundException
  148. {
  149. File f = new File("\\\\my.files.iastate.edu\\Users\\xiuyuang\\Desktop\\res");
  150. Scanner s = new Scanner(f);
  151.  
  152. while(s.hasNext())
  153. {
  154.  
  155. I.intervalInsert(s.nextInt(), s.nextInt());
  156. }
  157.  
  158. s.close();
  159.  
  160. }
  161.  
  162.  
  163. private static void printNode(Node x)
  164. {
  165. try
  166. {
  167. // if(!x.isNil())
  168. // {
  169. // printNode(x.leftC);
  170.  
  171.  
  172. System.out.println("ID: " + x.getEndpoint().ID +
  173. " Key: " + x.getKey() +
  174. " val: " + x.getVal() +
  175. " Max: " +x.getMaxVal() +
  176. " Emax: " + x.getEmax().getValue()+
  177. " P: " + x.getP() +
  178. " Color: " + x.getColor());
  179. //
  180. // printNode(x.rightC);
  181. // }
  182. }
  183. catch(Exception e)
  184. {
  185. System.out.println("Nil at there");
  186. }
  187. }
  188. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement