linkedqueueuos.java

国外的数据结构与算法分析用书

/* LinkedQueueUos.java
 * ---------------------------------------------
 * Copyright (c) 2001 University of Saskatchewan
 * All Rights Reserved
 * --------------------------------------------- */

package dslib.dispenser;

import dslib.list.LinkedLastListUos;
import dslib.exception.ContainerFullUosException;

/**	An implementation of QueueUos that uses a LinkedLastListUos to store 
	the items.  Item refers to the item at the front of the queue,
	which can be deleted.  There are also routines to insert items
	and check for empty. Implementation by means of a LinkedLastListUos.
 */
public class LinkedQueueUos extends QueueUos
{
	/**	Construct an empty queue. <br>
		Analysis: Time = O(1) */
	public LinkedQueueUos()
	{
		rep = new LinkedLastListUos();
	}
}