### Question:
HMapIL implements MapIL, Cloneable, Serializable { public MapIL.Entry[] getEntriesSortedByValue() { if (this.size() == 0) return null; MapIL.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<MapIL.Entry>() { public int compare(MapIL.Entry e1, MapIL.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; } HMapIL(int initialCapacity, float loadFactor);  HMapIL(int initialCapacity);  HMapIL();  HMapIL(MapIL m); @Override int size(); @Override boolean isEmpty(); @Override long get(int key); @Override boolean containsKey(int key); @Override long put(int key, long value); @Override void putAll(MapIL m); @Override long remove(int key); @Override void clear(); @Override boolean containsValue(long value); @Override Object clone(); @Override Set<Integer> keySet(); @Override Collection<Long> values(); @Override Set<MapIL.Entry> entrySet(); @Override String toString(); @Override void plus(MapIL m); @Override long dot(MapIL m); @Override void increment(int key); @Override void increment(int key, long value); MapIL.Entry[] getEntriesSortedByValue(); MapIL.Entry[] getEntriesSortedByValue(int n);  }### Answer:
@Test public void testSortedEntries4() { HMapIL m = new HMapIL(); MapIL.Entry[] e = m.getEntriesSortedByValue(); assertTrue(e == null); }