Fields can be private
git-svn-id: https://svn.apache.org/repos/asf/commons/proper/collections/trunk@1477618 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
c7f3ce1ab6
commit
8041ccfe10
|
@ -61,7 +61,7 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
|
|||
private static final long serialVersionUID = 8836393098519411393L;
|
||||
|
||||
/** A list of the cursor currently open on this list */
|
||||
protected transient List<WeakReference<Cursor<E>>> cursors;
|
||||
private transient List<WeakReference<Cursor<E>>> cursors;
|
||||
|
||||
//-----------------------------------------------------------------------
|
||||
/**
|
||||
|
|
|
@ -63,7 +63,7 @@ public class LazyList<E> extends AbstractSerializableListDecorator<E> {
|
|||
private static final long serialVersionUID = -1708388017160694542L;
|
||||
|
||||
/** The factory to use to lazily instantiate the objects */
|
||||
protected final Factory<? extends E> factory;
|
||||
private final Factory<? extends E> factory;
|
||||
|
||||
/**
|
||||
* Factory method to create a lazily instantiating list.
|
||||
|
|
|
@ -47,24 +47,24 @@ public class NodeCachingLinkedList<E> extends AbstractLinkedList<E> implements S
|
|||
/**
|
||||
* The default value for {@link #maximumCacheSize}.
|
||||
*/
|
||||
protected static final int DEFAULT_MAXIMUM_CACHE_SIZE = 20;
|
||||
private static final int DEFAULT_MAXIMUM_CACHE_SIZE = 20;
|
||||
|
||||
/**
|
||||
* The first cached node, or <code>null</code> if no nodes are cached.
|
||||
* Cached nodes are stored in a singly-linked list with
|
||||
* <code>next</code> pointing to the next element.
|
||||
*/
|
||||
protected transient Node<E> firstCachedNode;
|
||||
private transient Node<E> firstCachedNode;
|
||||
|
||||
/**
|
||||
* The size of the cache.
|
||||
*/
|
||||
protected transient int cacheSize;
|
||||
private transient int cacheSize;
|
||||
|
||||
/**
|
||||
* The maximum size of the cache.
|
||||
*/
|
||||
protected int maximumCacheSize;
|
||||
private int maximumCacheSize;
|
||||
|
||||
//-----------------------------------------------------------------------
|
||||
/**
|
||||
|
|
|
@ -54,7 +54,7 @@ public class SetUniqueList<E> extends AbstractSerializableListDecorator<E> {
|
|||
private static final long serialVersionUID = 7196982186153478694L;
|
||||
|
||||
/** Internal Set to maintain uniqueness. */
|
||||
protected final Set<E> set;
|
||||
private final Set<E> set;
|
||||
|
||||
/**
|
||||
* Factory method to create a SetList using the supplied list to retain
|
||||
|
@ -368,8 +368,8 @@ public class SetUniqueList<E> extends AbstractSerializableListDecorator<E> {
|
|||
*/
|
||||
static class SetListIterator<E> extends AbstractIteratorDecorator<E> {
|
||||
|
||||
protected final Set<E> set;
|
||||
protected E last = null;
|
||||
private final Set<E> set;
|
||||
private E last = null;
|
||||
|
||||
protected SetListIterator(final Iterator<E> it, final Set<E> set) {
|
||||
super(it);
|
||||
|
@ -396,8 +396,8 @@ public class SetUniqueList<E> extends AbstractSerializableListDecorator<E> {
|
|||
static class SetListListIterator<E> extends
|
||||
AbstractListIteratorDecorator<E> {
|
||||
|
||||
protected final Set<E> set;
|
||||
protected E last = null;
|
||||
private final Set<E> set;
|
||||
private E last = null;
|
||||
|
||||
protected SetListListIterator(final ListIterator<E> it, final Set<E> set) {
|
||||
super(it);
|
||||
|
|
|
@ -987,31 +987,31 @@ public class TreeList<E> extends AbstractList<E> {
|
|||
*/
|
||||
static class TreeListIterator<E> implements ListIterator<E>, OrderedIterator<E> {
|
||||
/** The parent list */
|
||||
protected final TreeList<E> parent;
|
||||
private final TreeList<E> parent;
|
||||
/**
|
||||
* Cache of the next node that will be returned by {@link #next()}.
|
||||
*/
|
||||
protected AVLNode<E> next;
|
||||
private AVLNode<E> next;
|
||||
/**
|
||||
* The index of the next node to be returned.
|
||||
*/
|
||||
protected int nextIndex;
|
||||
private int nextIndex;
|
||||
/**
|
||||
* Cache of the last node that was returned by {@link #next()}
|
||||
* or {@link #previous()}.
|
||||
*/
|
||||
protected AVLNode<E> current;
|
||||
private AVLNode<E> current;
|
||||
/**
|
||||
* The index of the last node that was returned.
|
||||
*/
|
||||
protected int currentIndex;
|
||||
private int currentIndex;
|
||||
/**
|
||||
* The modification count that the list is expected to have. If the list
|
||||
* doesn't have this count, then a
|
||||
* {@link java.util.ConcurrentModificationException} may be thrown by
|
||||
* the operations.
|
||||
*/
|
||||
protected int expectedModCount;
|
||||
private int expectedModCount;
|
||||
|
||||
/**
|
||||
* Create a ListIterator for a list.
|
||||
|
|
Loading…
Reference in New Issue