### Question:
HMapIF implements MapIF, Cloneable, Serializable { public MapIF.Entry[] getEntriesSortedByValue() { if (this.size() == 0) return null; MapIF.Entry[] entries = new Entry[this.size()]; int i = 0; Entry next = null; int index = 0; while (index < table.length && (next = table[index++]) == null) ; while (next != null) { Entry e = next; next = e.next; if ((next = e.next) == null) { while (index < table.length && (next = table[index++]) == null) ; } entries[i++] = e; } Arrays.sort(entries, new Comparator<MapIF.Entry>() { public int compare(MapIF.Entry e1, MapIF.Entry e2) { if (e1.getValue() > e2.getValue()) { return -1; } else if (e1.getValue() < e2.getValue()) { return 1; } if (e1.getKey() == e2.getKey()) return 0; return e1.getKey() > e2.getKey() ? 1 : -1; } }); return entries; } HMapIF(int initialCapacity, float loadFactor);  HMapIF(int initialCapacity);  HMapIF();  HMapIF(MapIF m); int size(); boolean isEmpty(); float get(int key); boolean containsKey(int key); float put(int key, float value); void putAll(MapIF m); float remove(int key); void clear(); boolean containsValue(float value); Object clone(); Set<Integer> keySet(); Collection<Float> values(); Set<MapIF.Entry> entrySet(); String toString(); @Override void plus(MapIF m); @Override double dot(MapIF m); @Override void increment(int key); @Override void increment(int key, float value); float length(); void normalize(); MapIF.Entry[] getEntriesSortedByValue(); MapIF.Entry[] getEntriesSortedByValue(int n);  }### Answer:
@Test public void testSortedEntries4() { HMapIF m = new HMapIF(); MapIF.Entry[] e = m.getEntriesSortedByValue(); assertTrue(e == null); }