public static int maxOfMostFreq(int... items) { // Java 6 sucks. ArrayList<Integer> list = new ArrayList<>(items.length); for (int item : items) list.add(item); return maxOfMostFreq(list); }
public static int maxOfMostFreq(int... items) { // Java 6 sucks. ArrayList<Integer> list = new ArrayList<Integer>(items.length); for (int item : items) list.add(item); return maxOfMostFreq(list); }
public static int maxOfMostFreq(int... items) { // Java 6 sucks. ArrayList<Integer> list = new ArrayList<Integer>(items.length); for (int item : items) list.add(item); return maxOfMostFreq(list); }
public static int maxOfMostFreq(int... items) { // Java 6 sucks. ArrayList<Integer> list = new ArrayList<>(items.length); for (int item : items) list.add(item); return maxOfMostFreq(list); }
/** * Returns most commonly reported chain height from the given list of {@link Peer}s. * If multiple heights are tied, the highest is returned. If no peers are connected, returns zero. */ public static int getMostCommonChainHeight(final List<Peer> peers) { if (peers.isEmpty()) return 0; List<Integer> heights = new ArrayList<>(peers.size()); for (Peer peer : peers) heights.add((int) peer.getBestHeight()); return Utils.maxOfMostFreq(heights); }
/** * Returns most commonly reported chain height from the given list of {@link Peer}s. * If multiple heights are tied, the highest is returned. If no peers are connected, returns zero. */ public static int getMostCommonChainHeight(final List<Peer> peers) { if (peers.isEmpty()) return 0; List<Integer> heights = new ArrayList<Integer>(peers.size()); for (Peer peer : peers) heights.add((int) peer.getBestHeight()); return Utils.maxOfMostFreq(heights); }
/** * Returns most commonly reported chain height from the given list of {@link Peer}s. * If multiple heights are tied, the highest is returned. If no peers are connected, returns zero. */ public static int getMostCommonChainHeight(final List<Peer> peers) { if (peers.isEmpty()) return 0; List<Integer> heights = new ArrayList<>(peers.size()); for (Peer peer : peers) heights.add((int) peer.getBestHeight()); return Utils.maxOfMostFreq(heights); }
/** * Returns most commonly reported chain height from the given list of {@link Peer}s. * If multiple heights are tied, the highest is returned. If no peers are connected, returns zero. */ public static int getMostCommonChainHeight(final List<Peer> peers) { if (peers.isEmpty()) return 0; List<Integer> heights = new ArrayList<Integer>(peers.size()); for (Peer peer : peers) heights.add((int) peer.getBestHeight()); return Utils.maxOfMostFreq(heights); }
@Test public void testMaxOfMostFreq() throws Exception { assertEquals(0, Utils.maxOfMostFreq()); assertEquals(0, Utils.maxOfMostFreq(0, 0, 1)); assertEquals(2, Utils.maxOfMostFreq(1, 1, 2, 2)); assertEquals(1, Utils.maxOfMostFreq(1, 1, 2, 2, 1)); assertEquals(-1, Utils.maxOfMostFreq(-1, -1, 2, 2, -1)); }