git://source.jalview.org
/
jalview.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
in progress...
[jalview.git]
/
forester
/
java
/
src
/
org
/
forester
/
datastructures
/
Queue.java
diff --git
a/forester/java/src/org/forester/datastructures/Queue.java
b/forester/java/src/org/forester/datastructures/Queue.java
index
c0c9c21
..
fa77834
100644
(file)
--- a/
forester/java/src/org/forester/datastructures/Queue.java
+++ b/
forester/java/src/org/forester/datastructures/Queue.java
@@
-21,7
+21,7
@@
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
//
// Contact: phylosoft @ gmail . com
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
//
// Contact: phylosoft @ gmail . com
-// WWW: www.phylosoft.org/forester
+// WWW: https://sites.google.com/site/cmzmasek/home/software/forester
package org.forester.datastructures;
package org.forester.datastructures;
@@
-31,9
+31,9
@@
import java.util.NoSuchElementException;
/*
* A simple Queue data structure. Created: 10/23/2005 by Christian M. Zmasek.
* Last modified: 10/23/2005 by Christian M. Zmasek.
/*
* A simple Queue data structure. Created: 10/23/2005 by Christian M. Zmasek.
* Last modified: 10/23/2005 by Christian M. Zmasek.
- *
+ *
* @author Christian M. Zmasek
* @author Christian M. Zmasek
- *
+ *
* @version 1.000
*/
public class Queue {
* @version 1.000
*/
public class Queue {
@@
-60,7
+60,7
@@
public class Queue {
/**
* Dequeues one element from this queue.
/**
* Dequeues one element from this queue.
- *
+ *
* @return the dequeued object
* @throws NoSuchElementException
* if this queue is empty
* @return the dequeued object
* @throws NoSuchElementException
* if this queue is empty
@@
-76,7
+76,7
@@
public class Queue {
// --------------
/**
* Adds Object element to thisqueue.
// --------------
/**
* Adds Object element to thisqueue.
- *
+ *
* @param element
* the Object to be enqueued
*/
* @param element
* the Object to be enqueued
*/
@@
-88,7
+88,7
@@
public class Queue {
// ---------------
/**
* Returns the LinkedList upon which this queue is based.
// ---------------
/**
* Returns the LinkedList upon which this queue is based.
- *
+ *
* @return the LinkedList upon which this queue is based
*/
private LinkedList<Object> getData() {
* @return the LinkedList upon which this queue is based
*/
private LinkedList<Object> getData() {
@@
-97,7
+97,7
@@
public class Queue {
/**
* Returns whether or not this queue is empty.
/**
* Returns whether or not this queue is empty.
- *
+ *
* @return true if this queue is empty, false otherwise
*/
public boolean isEmpty() {
* @return true if this queue is empty, false otherwise
*/
public boolean isEmpty() {