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