吉林大学软件设计模式平时作业

package Player; import java.util.ArrayList; import java.util.List; import java.util.function.Predicate; import Maps.Block; import Maps.IBlock; import Maps.MapMgr; import Menus.MenuMgr; import Skeletons.FixedStepStrategy; import Skeletons.ProbabilityDirStrategy; import Skeletons.RandomDirStrategy; import Skeletons.RandomStepStrategy; /** * @author 12525 */ public class PlayerMgr{ private Player mActivePlayer; // 当前活动Player private List<Player> mPlayers = new ArrayList<>(); // 全部Player /* public void startRound() { // Continuously advance until the next UserPlayer is encountered boolean goon = mActivePlayer.advance(); while (goon) { nextPlayer(); goon = mActivePlayer.advance(); } }*/ private static PlayerMgr instance; public static PlayerMgr getInstance() { if (instance == null) { instance = new PlayerMgr(); } return instance; } // 重置游戏人数（重新开始） // Getters/Setters public List<Player> getAllPlayers() { return mPlayers; } public void addPlayer(Player p) { mPlayers.add(p); } public Player getActivePlayer() { return mActivePlayer; } public void setActivePlayer(Player player) { mActivePlayer = player; } // 重置游戏人数（重新开始） /* public void resetPlayers(int num) { // 确保至少一个玩家，至多8个 if (num < 1) { num = 1; } if (num > 8) { num = 8; } final String[] names = { "赵一伤", "钱二败", "孙三毁", "李四摧", "周五输", "吴六破", "郑七灭", "王八衰" }; // 释放原有players mPlayers.clear(); // 取第一个Block Block firstBlock = MapMgr.getInstance().getActivedMap().getBlockByIndex(0); // 建立全部玩家 for (int i = 0; i < num; i++) { Player player; if (i == num - 1) { // 最后一个是用户玩家 player = new UserPlayer(); } else { player = new AutoPlayer(); } player.setName(names[i]); // 设置Player的初始位置 player.setStand(Dir.Direction.UNKNOWN, firstBlock); mPlayers.add(player); } // 当前Player为第一个 setActivePlayer(mPlayers.get(0)); } */ // 激活下一个 /* public Player nextPlayer() { // 当前位置 final Player curPlayer = mActivePlayer; Predicate<Player> func = player -> player == curPlayer; int index = mPlayers.indexOf(mPlayers.stream().filter(func).findFirst().orElse(null)); if (++index < mPlayers.size()) { // 下一个Player setActivePlayer(mPlayers.get(index)); } else { // 已到最后，取第一个 setActivePlayer(mPlayers.get(0)); } return mActivePlayer; } */ private PlayerMgr() { // 私有构造函数 } public void resetPlayers(int num) { if (num < 1) { num = 1; } if (num > 8) { num = 8; } String[] names = { "赵一伤", "钱二败", "孙三毁", "李四摧", "周五输", "吴六破", "郑七灭", "王八衰" }; mPlayers.clear(); IBlock firstBlock = MapMgr.getInstance().getActivedMap().getBlockByIndex(0); /* for (int i = 0; i < num; i++) { Player player = new Player(); if (i == num - 1) { player.setImp(new UserPlayerImp()); } else { player.setImp(new AutoPlayerImp()); } player.setName(names[i]); player.setStand(Dir.Direction.UNKNOWN, firstBlock); addPlayer(player);*/ // 建立全部玩家 for (int i = 0; i < num; i++) { Player player = new ExtPlayer(); if (i == num - 1) { // 最后一个是用户玩家 player.setImp(new Step2UserPlayerImp()); // 设置策略 player.setStepStrategy(new FixedStepStrategy(2)); player.setDirStrategy(new ProbabilityDirStrategy()); } else { player.setImp(new Step3AutoPlayerImp()); // 设置策略 player.setStepStrategy(new RandomStepStrategy()); player.setDirStrategy(new RandomDirStrategy()); } player.setName(names[i]); player.setStand(Dir.Direction.UNKNOWN, firstBlock); addPlayer(player); } setActivePlayer(mPlayers.get(0)); } public Player nextPlayer() { Player curPlayer = mActivePlayer; int curIndex = mPlayers.indexOf(curPlayer); int nextIndex = (curIndex + 1) % mPlayers.size(); setActivePlayer(mPlayers.get(nextIndex)); return mActivePlayer; } public Player findPlayerOnBlock(IBlock block) { for (Player player : mPlayers) { if (player.getStand() == block) { return player; } } return null; } public void startRound() { boolean goon = mActivePlayer.advance(); while (goon) { nextPlayer(); goon = mActivePlayer.advance(); } } public boolean advance() { return false; } /* public Player findPlayerOnBlock(Block block) { Player found = null; for (Player player : mPlayers) { if (player.getStand() == block) { found = player; break; } } // 若多个玩家站Block，返回UserPlayer return found; }*/ public char flagChar(Dir.Direction d) { return 0; } }