Advertisement
cc2k

code

Aug 6th, 2015
211
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.10 KB | None | 0 0
  1. private void createNodeTree(List<Player>playerlist){
  2. int power =2;
  3. int totalTimes = 1;
  4.  
  5. while(power < mPlayerList.size()){
  6. power*=2;
  7. Log.i("power2", ""+power);
  8. totalTimes++;
  9. }
  10.  
  11.  
  12. if(power != mPlayerList.size()){
  13.  
  14. Log.i("power-mplayerlist.size", "="+(power-mPlayerList.size())+" playerlist size: "+mPlayerList.size()+" power: "+power);
  15.  
  16. int j=power-mPlayerList.size();
  17. for(int i =0;i<j;i++){
  18. mPlayerList.add(new Player("Bye"));
  19. }
  20. }
  21.  
  22.  
  23. TreeNode root = new TreeNode(null, null, null, null);
  24. List<Player> firstQuarterPlayerList = new ArrayList<Player>();
  25. List<Player> secondQuarterPlayerList = new ArrayList<Player>();
  26. List<Player> thirtQuarterPlayerList = new ArrayList<Player>();
  27. List<Player> fourtQuarterPlayerList = new ArrayList<Player>();
  28. List<Player> fiftQuarterPlayerList = new ArrayList<Player>();
  29. List<Player> sixstQuarterPlayerList = new ArrayList<Player>();
  30. List<Player> seventhQuarterPlayerList = new ArrayList<Player>();
  31. List<Player> eightQuarterPlayerList = new ArrayList<Player>();
  32.  
  33.  
  34. Long seed = System.nanoTime();
  35. Collections.shuffle(playerlist,new Random(seed));
  36. Collections.shuffle(playerlist,new Random(seed));
  37.  
  38. if (playerlist.size()== 4){
  39.  
  40. root.setRightDown(new TreeNode(null, null, root, new Pairing(playerlist.get(0), playerlist.get(1))));
  41. root.setRightUp(new TreeNode(null, null, root, new Pairing(playerlist.get(2), playerlist.get(3))));
  42.  
  43. } else {
  44.  
  45.  
  46. int quarterPlayerList = playerlist.size()/8;
  47. int eightOfTotalPL = playerlist.size()/8;
  48. int i = 0;
  49.  
  50. if (quarterPlayerList == eightOfTotalPL) {
  51. for(; i<quarterPlayerList;i++){
  52. firstQuarterPlayerList.add(playerlist.get(i));
  53. quarterPlayerList++;
  54. }
  55. }
  56.  
  57.  
  58. if(quarterPlayerList == eightOfTotalPL*2){
  59. for(; i<eightOfTotalPL*2;i++){
  60. secondQuarterPlayerList.add(playerlist.get(i));
  61. quarterPlayerList++;
  62. }
  63. }
  64.  
  65.  
  66. if(quarterPlayerList == eightOfTotalPL*3){
  67. for(; i<eightOfTotalPL*3;i++){
  68. thirtQuarterPlayerList.add(playerlist.get(i));
  69. quarterPlayerList++;
  70. }
  71. }
  72.  
  73.  
  74. if(quarterPlayerList == eightOfTotalPL*4){
  75. for(; i<eightOfTotalPL*4;i++){
  76. fourtQuarterPlayerList.add(playerlist.get(i));
  77. quarterPlayerList++;
  78. }
  79. }
  80.  
  81. if(quarterPlayerList == eightOfTotalPL*5){
  82. for(; i<eightOfTotalPL*5;i++){
  83. fiftQuarterPlayerList.add(playerlist.get(i));
  84. quarterPlayerList++;
  85. }
  86. }
  87.  
  88. if(quarterPlayerList == eightOfTotalPL*6){
  89. for(; i<eightOfTotalPL*6;i++){
  90. sixstQuarterPlayerList.add(playerlist.get(i));
  91. quarterPlayerList++;
  92. }
  93. }
  94.  
  95. if(quarterPlayerList == eightOfTotalPL*7){
  96. for(; i<eightOfTotalPL*7;i++){
  97. seventhQuarterPlayerList.add(playerlist.get(i));
  98. quarterPlayerList++;
  99. }
  100. }
  101.  
  102. if(quarterPlayerList == eightOfTotalPL*8){
  103. for(; i<=eightOfTotalPL*8;i++){
  104. eightQuarterPlayerList.add(playerlist.get(i));
  105. quarterPlayerList++;
  106. }
  107. }
  108. }
  109.  
  110.  
  111.  
  112.  
  113.  
  114. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement