protected void resetCountsAndRebuildRemainingItems() { // reset all counts back to zero for (Node<E> node : allItems) { node.setCount(0); } // now rebuild the whole thing this.rebuildRemainingItems(); }
protected void resetCountsAndRebuildRemainingItems() { // reset all counts back to zero for (Node<E> node : allItems) { node.setCount(0); } // now rebuild the whole thing this.rebuildRemainingItems(); }
@Override public void remove(E item) { // create a new node we'll use for searching and/or adding Node<E> newNode = new Node<E>(item); // try to find item in list 0(N) int i = allItems.indexOf(newNode); if (i < 0) { // item not in our list, don't do anything //logger.debug("Item is not in list"); } else { // remove from all items and possible items this.allItems.remove(i); this.remainingItems.remove(newNode); } // safety check -- if there are no more remaining items, but we still // have items in our list, rebuild our "remaining items" if (this.remainingItems.isEmpty() && this.allItems.size() > 0) { this.rebuildRemainingItems(); } }
@Override public void remove(E item) { // create a new node we'll use for searching and/or adding Node<E> newNode = new Node<E>(item); // try to find item in list 0(N) int i = allItems.indexOf(newNode); if (i < 0) { // item not in our list, don't do anything //logger.debug("Item is not in list"); } else { // remove from all items and possible items this.allItems.remove(i); this.remainingItems.remove(newNode); } // safety check -- if there are no more remaining items, but we still // have items in our list, rebuild our "remaining items" if (this.remainingItems.isEmpty() && this.allItems.size() > 0) { this.rebuildRemainingItems(); } }