Skip to content

Commit

Permalink
Remove extra blank lines
Browse files Browse the repository at this point in the history
  • Loading branch information
garydgregory committed Nov 26, 2023
1 parent 1df5606 commit d013752
Show file tree
Hide file tree
Showing 74 changed files with 0 additions and 101 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,6 @@
*/
final class ArrayUtils {


/**
* Don't allow instances.
*/
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -1795,7 +1795,6 @@ public static <O> List<O> collate(final Iterable<? extends O> iterableA, final I
return mergedList;
}


/**
* Returns a {@link Collection} of all the permutations of the input collection.
* <p>
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -63,7 +63,6 @@ public int size() {
}
}


/**
* A helper class used to construct the longest common subsequence.
*/
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -42,7 +42,6 @@ public class QueueUtils {
*/
private QueueUtils() {}


/**
* Returns a synchronized (thread-safe) queue backed by the given queue.
* In order to guarantee serial access, it is critical that all access to the
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -198,7 +198,6 @@ public static <T> Set<T> emptyIfNull(final Set<T> set) {
return set == null ? Collections.<T>emptySet() : set;
}


/**
* Gets a typed empty unmodifiable Set.
* @param <E> the element type
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -43,7 +43,6 @@ public class SplitMapUtils {
*/
private SplitMapUtils() {}


private static final class WrappedGet<K, V> implements IterableMap<K, V>, Unmodifiable {
private final Get<K, V> get;

Expand Down Expand Up @@ -218,7 +217,6 @@ public Collection<V> values() {
}
}


/**
* Gets the specified {@link Get} as an instance of {@link IterableMap}.
* If {@code get} implements {@link IterableMap} directly, no conversion will take place.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -73,7 +73,6 @@ public int hashCode() {
return decorated().hashCode();
}


@Override
public int getCount(final Object object) {
return decorated().getCount(object);
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -62,7 +62,6 @@ protected SortedBag<E> decorated() {
return (SortedBag<E>) super.decorated();
}


@Override
public E first() {
return decorated().first();
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -101,7 +101,6 @@ public int hashCode() {
return decorated().hashCode();
}


@Override
public boolean add(final E object, final int count) {
validate(object);
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -89,7 +89,6 @@ protected SortedBag<E> decorated() {
return (SortedBag<E>) super.decorated();
}


@Override
public E first() {
return decorated().first();
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -100,7 +100,6 @@ public int hashCode() {
}
}


@Override
public boolean add(final E object, final int count) {
synchronized (lock) {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -83,7 +83,6 @@ protected SortedBag<E> getSortedBag() {
return (SortedBag<E>) decorated();
}


@Override
public synchronized E first() {
synchronized (lock) {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -121,7 +121,6 @@ public int hashCode() {
return decorated().hashCode();
}


@Override
public int getCount(final Object object) {
return getBag().getCount(object);
Expand All @@ -132,7 +131,6 @@ public boolean remove(final Object object, final int nCopies) {
return getBag().remove(object, nCopies);
}


@Override
public boolean add(final E object, final int nCopies) {
return getBag().add(transform(object), nCopies);
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -112,7 +112,6 @@ protected SortedBag<E> getSortedBag() {
return (SortedBag<E>) decorated();
}


@Override
public E first() {
return getSortedBag().first();
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -95,7 +95,6 @@ public boolean add(final E object) {
return super.add(object);
}


@Override
public E first() {
return getMap().firstKey();
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -130,7 +130,6 @@ protected DualTreeBidiMap<V, K> createBidiMap(final Map<V, K> normalMap, final M
return new DualTreeBidiMap<>(normalMap, reverseMap, inverseMap);
}


@Override
public Comparator<? super K> comparator() {
return ((SortedMap<K, V>) normalMap).comparator();
Expand Down Expand Up @@ -205,7 +204,6 @@ public OrderedBidiMap<V, K> inverseOrderedBidiMap() {
return inverseBidiMap();
}


@Override
public SortedMap<K, V> headMap(final K toKey) {
final SortedMap<K, V> sub = ((SortedMap<K, V>) normalMap).headMap(toKey);
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -672,7 +672,6 @@ private Node<K, V> nextSmaller(final Node<K, V> node, final DataElement dataElem
return rval;
}


/**
* Compares two objects.
*
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -103,7 +103,6 @@ protected void setCollection(final Collection<E> coll) {
this.collection = coll;
}


@Override
public boolean add(final E object) {
return decorated().add(object);
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -257,7 +257,6 @@ public boolean retainAll(final Collection<?> coll) {
return changed;
}


/**
* Provides checking for adding the index.
*
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -96,7 +96,6 @@ protected Collection<E> decorated() {
return collection;
}


@Override
public boolean add(final E object) {
synchronized (lock) {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -52,7 +52,6 @@ protected ListIterator<E> getListIterator() {
return iterator;
}


/** {@inheritDoc} */
@Override
public boolean hasNext() {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -53,7 +53,6 @@ protected MapIterator<K, V> getMapIterator() {
return iterator;
}


/** {@inheritDoc} */
@Override
public boolean hasNext() {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -53,7 +53,6 @@ protected OrderedMapIterator<K, V> getOrderedMapIterator() {
return iterator;
}


/** {@inheritDoc} */
@Override
public boolean hasNext() {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -49,7 +49,6 @@ public class BoundedIterator<E> implements Iterator<E> {
/** The position of the current element */
private long pos;


/**
* Decorates the specified iterator to return at most the given number of elements,
* skipping all elements until the iterator reaches the position at {@code offset}.
Expand Down Expand Up @@ -88,7 +87,6 @@ private void init() {
}
}


@Override
public boolean hasNext() {
if (!checkBounds()) {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,6 @@

import org.apache.commons.collections4.list.UnmodifiableList;


/**
* Provides an ordered iteration over the elements contained in a collection of
* ordered Iterators.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -63,7 +63,6 @@ public abstract class LazyIteratorChain<E> implements Iterator<E> {
*/
private Iterator<? extends E> lastUsedIterator;


/**
* Gets the next iterator after the previous one has been exhausted.
* <p>
Expand Down Expand Up @@ -100,7 +99,6 @@ private void updateCurrentIterator() {
}
}


/**
* Return true if any Iterator in the chain has a remaining element.
*
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -64,7 +64,6 @@ public static <E> PeekingIterator<E> peekingIterator(final Iterator<? extends E>
return new PeekingIterator<>(iterator);
}


/**
* Constructor.
*
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -61,7 +61,6 @@ public static <E> PushbackIterator<E> pushbackIterator(final Iterator<? extends
return new PushbackIterator<>(iterator);
}


/**
* Constructor.
*
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,6 @@ public class SkippingIterator<E> extends AbstractIteratorDecorator<E> {
/** The position of the current element */
private long pos;


/**
* Decorates the specified iterator to skip all elements until the iterator
* reaches the position at {@code offset}.
Expand Down Expand Up @@ -71,7 +70,6 @@ private void init() {
}
}


@Override
public E next() {
final E next = super.next();
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -53,7 +53,6 @@ protected Map.Entry<K, V> getMapEntry() {
return entry;
}


@Override
public K getKey() {
return entry.getKey();
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -131,7 +131,6 @@ public MultiKey(final K key1, final K key2) {
this(newArray(key1, key2), false);
}


/**
* Constructor taking three keys.
* <p>
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -99,7 +99,6 @@ protected void init() {
header = createHeaderNode();
}


@Override
public int size() {
return size;
Expand All @@ -116,7 +115,6 @@ public E get(final int index) {
return node.getValue();
}


@Override
public Iterator<E> iterator() {
return listIterator();
Expand All @@ -132,7 +130,6 @@ public ListIterator<E> listIterator(final int fromIndex) {
return new LinkedListIterator<>(this, fromIndex);
}


@Override
public int indexOf(final Object value) {
int i = 0;
Expand Down Expand Up @@ -172,7 +169,6 @@ public boolean containsAll(final Collection<?> coll) {
return true;
}


@Override
public Object[] toArray() {
return toArray(new Object[size]);
Expand Down Expand Up @@ -210,7 +206,6 @@ public List<E> subList(final int fromIndexInclusive, final int toIndexExclusive)
return new LinkedSubList<>(this, fromIndexInclusive, toIndexExclusive);
}


@Override
public boolean add(final E value) {
addLast(value);
Expand All @@ -237,7 +232,6 @@ public boolean addAll(final int index, final Collection<? extends E> coll) {
return true;
}


@Override
public E remove(final int index) {
final Node<E> node = getNode(index, false);
Expand Down Expand Up @@ -279,7 +273,6 @@ public boolean removeAll(final Collection<?> coll) {
return modified;
}


/**
* {@inheritDoc}
* <p>
Expand Down Expand Up @@ -315,7 +308,6 @@ public void clear() {
removeAllNodes();
}


public E getFirst() {
final Node<E> node = header.next;
if (node == header) {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -74,7 +74,6 @@ public int hashCode() {
return decorated().hashCode();
}


@Override
public void add(final int index, final E object) {
decorated().add(index, object);
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -105,7 +105,6 @@ public int hashCode() {
return decorated().hashCode();
}


@Override
public E get(final int index) {
return decorated().get(index);
Expand All @@ -126,7 +125,6 @@ public E remove(final int index) {
return decorated().remove(index);
}


@Override
public void add(final int index, final E object) {
validate(object);
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -124,7 +124,6 @@ public int hashCode() {
return decorated().hashCode();
}


@Override
public E get(final int index) {
return getList().get(index);
Expand All @@ -145,7 +144,6 @@ public E remove(final int index) {
return getList().remove(index);
}


@Override
public void add(final int index, E object) {
object = transform(object);
Expand Down
Loading

0 comments on commit d013752

Please sign in to comment.