### Question:
BoundedSortedList { public List<T> getItems() { List<T> result = new LinkedList<>(); lock.readLock().lock(); try { for (ComparableItem<T, C> comparableItem : items) { result.add(comparableItem.getItem()); if (result.size() >= capacity) { break; } } return result; } finally { lock.readLock().unlock(); } } BoundedSortedList(int capacity);  BoundedSortedList(int capacity, final Comparator<C> comparator);  BoundedSortedList(int capacity, int maxCapacity);  BoundedSortedList(int capacity, int maxCapacity, final Comparator<C> comparator); List<T> getItems(); void add(T item, C quantity);  }### Answer:
@Test public void emptyListShouldProduceEmptyList() { BoundedSortedList<String, Integer> list = new BoundedSortedList<>(10); assertTrue(list.getItems().isEmpty()); }