need help with scoreboard top kills

hi, i got some problems with my scoreboard it works using

Code:java

o2 = board2.registerNewObjective("killcount", "playerKillCount");
        o2.setDisplayName(ChatColor.RED + "" + ChatColor.BOLD + "RebelTopKills" + ChatColor.GREEN +  "");
        o2.setDisplaySlot(DisplaySlot.SIDEBAR);
        o2.getScoreboard().

but if it gets to much players it will stop displaying can i set a max to how many lines of players it can display?

 

Unisteven I dont think you can bypass this limit, however - you can scroll thru the strings and display them...

 

Someone_Like_You how do you mean? and how should i do that

 

Unisteven bukkit runnable that "recreating" the scoreboard every few ticks, but with diffrent string in it.
your list contains : X, Y , Z, U, I, N
you can fit only 4 letters inside a scoreboard (pretendring, just giving an exmaple )
so what you will do is showing all the players X Y Z and U, after few seconds youll kick off X and show them Y Z U I, etc

 

Someone_Like_You could you give me a code example that would work if i copy it in and ajust it offcource.

 

Unisteven Im not going to spoon feed you, theres 999 ways of doing it, Il help you in one of them, what I would do :
1. put all the names in arraylist, every X ticks, get some of them (amount that fill up in the scoreboard) and display them to all the players,
2. take the names you just displayed and add them into a new arraylist and remove them from the first one.
3. keep doing 1 and 2 untill the first arraylist is empty or almost empty, (arraylist.size() = 0).
4. take all the names from the new arraylist at 2, and "reset" them into the new arraylist
it is kind of complicated, Im 100% sure theres easier ways of doing it, the hard part is to think how youll do it good luck!

 

It's not very complicated, here you go. Fix it to work with what you need:

Code:java

  @SuppressWarnings({ "hiding", "rawtypes" })
  public static <Player, Integer extends Comparable> Map<Player, Integer> sortByValues(Map<Player, Integer> map) {
      List<Map.Entry<Player, Integer>> entries = new LinkedList<Map.Entry<Player, Integer>>(map.entrySet());
 
      Collections.sort(entries, new Comparator<Map.Entry<Player, Integer>>() {
        @SuppressWarnings("unchecked")
        @Override
        public int compare(Entry<Player, Integer> o1, Entry<Player, Integer> o2) {
            return o1.getValue().compareTo(o2.getValue());
        }
      });
      Map<Player, Integer> sortedMap = new LinkedHashMap<Player, Integer>();
      for (Map.Entry<Player, Integer> entry : entries) {
        sortedMap.put(entry.getKey(), entry.getValue());
      }
      return sortedMap;
  }

Simply supply it with a map containing the players and how many points they have, and it will return a map with the highest values first. Not the most beautiful method, but it works.