Author: toad
Date: 2007-09-22 18:41:52 +0000 (Sat, 22 Sep 2007)
New Revision: 15274
Modified:
trunk/freenet/src/freenet/support/LRUQueue.java
Log:
javadocs
Modified: trunk/freenet/src/freenet/support/LRUQueue.java
===================================================================
--- trunk/freenet/src/freenet/support/LRUQueue.java 2007-09-22 18:34:51 UTC
(rev 15273)
+++ trunk/freenet/src/freenet/support/LRUQueue.java 2007-09-22 18:41:52 UTC
(rev 15274)
@@ -106,14 +106,27 @@
}
}
+ /**
+ * Return the objects in the queue as an array in an arbitrary and
meaningless
+ * order.
+ */
public synchronized Object[] toArray() {
return hash.keySet().toArray();
}
+ /**
+ * Return the objects in the queue as an array in an arbitrary and
meaningless
+ * order.
+ * @param array The array to fill in. If it is too small a new array of
the same type will be allocated.
+ */
public synchronized Object[] toArray(Object[] array) {
return hash.keySet().toArray(array);
}
+ /**
+ * Return the objects in the queue as an array. The least recently used
object
+ * is in [0], the most recently used object is in [array.length-1].
+ */
public synchronized Object[] toArrayOrdered() {
Object[] array = new Object[list.size()];
int x = 0;
@@ -124,6 +137,8 @@
}
/**
+ * Return the objects in the queue as an array. The least recently used
object
+ * is in [0], the most recently used object is in [array.length-1].
* @param array The array to fill in. If it is too small a new array of
the same type will be allocated.
*/
public synchronized Object[] toArrayOrdered(Object[] array) {
