Solved Getting highest number from config?(Will post fix when get home had to leave in a hurry)

Hi there I was wondering how I could get the highest number from a config that looks like this(want to get the highest number of deaths):

Code:

players:
  o3bubbles09:
    exists: true
    deaths: 1
  bubbles:
    exists: true
    deaths: 0

My failed attempt at trying to do this:

Code:java

    /* Check top deaths */
    public String topDeaths() {
        ArrayList<String> players = new ArrayList<String>();
        ArrayList<Integer> deaths = new ArrayList<Integer>();
        HashMap<String, Integer> player_deaths = new HashMap<String, Integer>();
 
        for(String s : getConfig().getConfigurationSection("players").getKeys(false)) {
            players.add(s);
        }
 
        for(int i = 0; i > players.size(); i++) {
            deaths.add(getDeaths(players.get(i)));
        }
 
        for(int i = 0; i > players.size(); i++) {
            player_deaths.put(players.get(i), deaths.get(i));
        }
 
        return null;
    }

 

Firstly, I take no credit for the MapUtil class, a friend gave it to me.

Code:java

package com.kThisIsCvpv.RankTags;
 
import java.util.*;
 
public class MapUtil{
    public static <K, V extends Comparable<? super V>> Map<K, V>
        sortByValue( Map<K, V> map ){
        List<Map.Entry<K, V>> list = new LinkedList<Map.Entry<K, V>>( map.entrySet() );
        Collections.sort( list, new Comparator<Map.Entry<K, V>>(){
            public int compare( Map.Entry<K, V> o1, Map.Entry<K, V> o2 ){
                return (o1.getValue()).compareTo( o2.getValue() );
            }
        });
 
        Map<K, V> result = new LinkedHashMap<K, V>();
        for (Map.Entry<K, V> entry : list){
            result.put( entry.getKey(), entry.getValue() );
        }
        return result;
    }
}
 

You'd want to make a new class somewhere, name it MapUtil, and paste that code in.
That code sorts Maps by highest value.

Next, load a Map<String, Integer>.
This is using your format.

Code:java

Map<String, Integer> compareDeaths = new HashMap<String, Integer>();
for(String s : getConfig().getConfigurationSection("players").getKeys(false))
    compareDeaths.put(s, getConfig().getInt("players." + s + ".deaths"));

Next sort the HashMap.

Code:java

compareDeaths = (HashMap<String, Integer>) MapUtil.sortByValue(compareDeaths);

Your Hashmap is now in order from Lowest to Highest.

We'll load the HashMap's KeySet onto an ArrayList.

Code:java

ArrayList<String> KeySet = new ArrayList<String>();
for(String s : compareDeaths.keySet())
    KeySet.add(s);

If you want to get the last entry in the HashMap, you'd do the following...

Code:java

String playerNameMostDeaths = KeySet.get(KeySet.size() - 1);
int MostDeathNumber = compareDeaths.get(playerNameMostDeaths);

If you want the get the first entry on the HashMap, you'd do the following...

Code:java

String playerNameLeastDeaths = KeySet.get(0);
int LeastNumber = compareDeaths.get(playerNameLeastDeaths);

Please be careful however. If your HashMap is empty, there will be errors.

 

O3Bubbles09
I whipped up this quick basic example of how you can sort the values. Basically I add each player & their death count to a TreeMap. TreeMaps automatically sort values from least to greatest. Then, you can get however many of the top values you want.

Code:java

public class Test {
 
    private Map<String, Integer> map = new TreeMap<String, Integer>(); //TreeMaps automatically sort values
 
    public void sortValues(){
        Set<String> players = getConfig().getConfigurationSection("players").getKeys(false); //get all the players in the config section
 
        for (String plyr : players){ //loop through the players in the set
            map.put(plyr, getConfig().getConfigurationSection("players." + plyr).getInt(".deaths")); //add the player & their deaths to the map
        }
    }
}

 

The Gaming Grunts TreeMaps sort key based. Use a TreeMultimap with the death as key and the name as value instead (which allows you to get two+ people if there are multiple people with the highest score)

 

fireblast709
That's true. O3Bubbles09 could also just change the map to TreeMap<Integer, String>.

 

The Gaming Grunts do note that a TreeMap won't work well when two+ people have the same score

 

The Gaming Grunts fireblast709 Wow thank you guys! This is a lot better than the solution I came up with!

 

fireblast709
This is true, but it depends on what O3Bubbles09 is going for

 

The Gaming Grunts So I thought I could figure this out with the information you guys gave me but man was I wrong.... I do not understand this TreeMaps at all.

 

O3Bubbles09
Can you explain a bit? The example I provided should do exactly what you want. As for TreeMaps themselves, they work exactly like your standard HashMap except they automatically sort their contents.

 

@TheGamingGrunts

Okay so here is what I have tried:

Code:java

 /* Check top deaths */
private Map<String, Integer> map = new TreeMap<String, Integer>();
 
public String topDeaths() {
Set<String> players = getConfig().getConfigurationSection("players").getKeys(false);
String list = "";
 
for(String s : players) {
map.put(s, getDeaths(s));
 
list += s + ": " + map.get(s) + "\n";
}
 
return list;
}

Yes it does get the players names and theirs deaths but it doesn't sort them from highest to lowest... Idk why.