// Copyright (C) 2008-2009 Christian M. Zmasek
// Copyright (C) 2008-2009 Burnham Institute for Medical Research
// All rights reserved
-//
+//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
-//
+//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// 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;
/*
* 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
- *
+ *
* @version 1.000
*/
public class Queue {
/**
* Dequeues one element from this queue.
- *
+ *
* @return the dequeued object
* @throws NoSuchElementException
* if this queue is empty
// --------------
/**
* Adds Object element to thisqueue.
- *
+ *
* @param element
* the Object to be enqueued
*/
// ---------------
/**
* Returns the LinkedList upon which this queue is based.
- *
+ *
* @return the LinkedList upon which this queue is based
*/
private LinkedList<Object> getData() {
/**
* Returns whether or not this queue is empty.
- *
+ *
* @return true if this queue is empty, false otherwise
*/
public boolean isEmpty() {