Changeset 177ef573

Timestamp:

Aug 6, 2018 3:14:15 PM (2 years ago)

Author:

slumlord <slumlord@…>

Branches:

master

Children:

f97ec88

Parents:

fc22d0f

Message:

Update javadocs for CachedIteratorCollection?

File:

• router/java/src/net/i2p/router/util/CachedIteratorCollection.java (modified) (6 diffs)

router/java/src/net/i2p/router/util/CachedIteratorCollection.java

@@ -1 @@
-// Extend `java.util.AbstractCollection` to create a collection that can be iterated over without creation of a new
-// object
-
-// https://docs.oracle.com/javase/7/docs/api/java/util/AbstractCollection.html
-
+// The Node class below is derived from Java's LinkedList.java
 /*
  * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
@@ -28 +24 @@
  * questions.
  */
-// The Node class below is from Java's LinkedList.java
 
 package net.i2p.router.util;
@@ -38 +33 @@
 import net.i2p.I2PAppContext;
 import net.i2p.util.Log;
+
+/**
+ * Extend java.util.AbstractCollection to create a collection that can be
+ * iterated over without creation of a new object
+ *
+ * @since 0.9.36
+ *
+ */
 
 public class CachedIteratorCollection<E> extends AbstractCollection<E> {
@@ -61 +64 @@
         Node<E> prev;
 
-        Node(Node<E> prev, E element, Node<E> next) {
+        Node(Node<E> prev, E element) {
             this.item = element;
             this.prev = prev;
-            this.next = next;
+            this.next = null;
         }
     }
 
     // First Node in the AbstractCollectionTest object
-    private transient Node<E> first;
+    private transient Node<E> first = null;
 
     // Last Node in the AbstractCollectionTest object
-    private transient Node<E> last;
+    private transient Node<E> last = null;
 
     /**
@@ -86 +89 @@
     @Override
     public boolean add(E element) {
+        final Node<E> newNode = new Node<>(null, element);
         if (this.size == 0) {
-            final Node<E> newNode = new Node<>(null, element, null);
             this.first = newNode;
             this.last = newNode;
         } else {
-            final Node<E> newLast = new Node<>(this.last, element, null);
-            this.last.next = newLast;
-            this.last = newLast;
+            this.last.next = newNode;
+            this.last = newNode;
         }
         this.size++;
@@ -206 +208 @@
      * Return size of current LinkedListTest object
      */
-    public int size() { return this.size; }
+    public int size() {
+        return this.size;
+    }
 }