All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.jbox2d.pooling.OrderedStack Maven / Gradle / Ivy

There is a newer version: 1.9.1
Show newest version
/*******************************************************************************
 * Copyright (c) 2011, Daniel Murphy
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * 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.
 *     * Neither the name of the  nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 DANIEL MURPHY 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.
 ******************************************************************************/
/**
 * Created at 12:52:04 AM Jan 20, 2011
 */
package org.jbox2d.pooling;

/**
 * @author Daniel Murphy
 */
public abstract class OrderedStack implements IOrderedStack {

  protected E[] pool;
	private int index;
	private final int size;
	protected E[] container;
	
	public OrderedStack(int argStackSize, int argContainerSize){
	  index = 0;
		size = argStackSize;
		//pool = (E[]) Array.newInstance(argClass, argStackSize);
		//container = (E[]) Array.newInstance(argClass, argContainerSize);
	}

	 protected abstract E[] createArray(int argSize, E[] argOld);

	/* (non-Javadoc)
	 * @see org.jbox2d.pooling.IPoolingStack#pop()
	 */
	@Override
  public final E pop(){
		assert(index < size) : "End of stack reached, there is probably a leak somewhere";
		return pool[index++];
	}
	
	/* (non-Javadoc)
	 * @see org.jbox2d.pooling.IPoolingStack#pop(int)
	 */
	@Override
  public final E[] pop(int argNum){
		assert(index + argNum < size) : "End of stack reached, there is probably a leak somewhere";
		assert(argNum <= container.length) : "Container array is too small";
		// System.arraycopy(pool, index, container, 0, argNum);
		for (int i = 0; i < argNum; i++) {
		  container[i] = pool[index + i];
		}
		index += argNum;
		return container;
	}
	
	/* (non-Javadoc)
	 * @see org.jbox2d.pooling.IPoolingStack#push(int)
	 */
	@Override
  public final void push(int argNum){
		index -= argNum;
		assert (index >= 0) : "Beginning of stack reached, push/pops are unmatched";
	}
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy