/*
 * Copyright (C) 1995,1996 By Radu Sion 
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    This product includes software developed by Radu Sion (radus@cs.pub.ro)
 *
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR `AS IS'' AND ANY EXPRESS OR 
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, 
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF 
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * (radus@cs.pub.ro, http://www.dsp.pub.ro/radu.html)
 *
 */






import FullException;


/**
 * A class able to dynamically allocate and dealocate unique numbers in a given range.
 * Once allocated, a number must be freed in order to be allocable again.<br><br>
 * Written: <a href="http://www.dsp.pub.ro/radu.html">Radu Sion</a><br>
 * Version: 0.12<br>
 * Source: <a href="src/DynamicNumbers.java">DynamicNumbers.java</a>
 */
public class 
DynamicNumbers
extends Object
{
boolean	data[]; /* true=allocated number, false=free number */
int	range;
static final int DEF_MAX_RANGE=1000;

/**
 * @param maxrange	The range in which to allocate numbers. The numbers will be allocated in the range 1 to maxrange-1
 */
public
DynamicNumbers(int maxrange)
	{
	int dummy;
	range = maxrange;
	if (range<=1) range=DEF_MAX_RANGE; 
	data = new boolean[range];
	/* marking all numbers as available */
	for (dummy=1;dummy<range;dummy++) data[dummy]=false; 
	}

/**
 * Allocates a new unique number in the given range.
 * @return 	The allocated integer
 * @exception 	FullException	When there are no more unallocated numbers available
 */
public synchronized int
getFreeNumber()
throws FullException
	{
	int dummy;
	for (dummy=1;dummy<range;dummy++)
		if (data[dummy] == false) 
			{
			data[dummy] = true;
			return dummy;
			}
	throw new FullException();
	}

/**
 * Deallocates a number. (no checkings are performed)
 * @param 	nr	The number to dealocate
 */
public synchronized void
freeNumber(int nr)
	{
	System.err.println("DN: number dealocated is ......... " + nr );
	if ((nr<0) || (nr>range)) return;
	data[nr]=false;
	System.err.println("DN: done dealocating ...");
	}
}
/*eoc*/