00001 /********************************************************************************** 00002 * Copyright (c) 2003, Christoph Rueegg <opendev@cdrnet.ch> and Matthias Bader * 00003 * Partially based on ideas of Tim Weyrich <weyrich@inf.ethz.ch> * 00004 * and/or the Swiss Federal Institute of Technology http://www.ethz.ch * 00005 * All rights reserved. * 00006 * * 00007 * Project Website: http://www.cdrnet.net/projects/painter/ * 00008 * * 00009 * Redistribution and use in source and binary forms, with or without modification,* 00010 * are permitted provided that the following conditions are met: * 00011 * * 00012 * 1. Redistributions of source code must retain the above copyright notice, * 00013 * this list of conditions and the following disclaimer. * 00014 * * 00015 * 2. Redistributions in binary form must reproduce the above copyright notice, * 00016 * this list of conditions and the following disclaimer in the documentation * 00017 * and/or other materials provided with the distribution. * 00018 * * 00019 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * 00020 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * 00021 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * 00022 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE * 00023 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * 00024 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * 00025 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * 00026 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * 00027 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * 00028 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF * 00029 * THE POSSIBILITY OF SUCH DAMAGE. * 00030 **********************************************************************************/ 00031 00032 #include "fixedstack.h" 00033 00034 FixedStack::FixedStack(int size) 00035 { 00036 this->size = size; 00037 this->index = 0; 00038 data = new Position[size+2]; 00039 } 00040 00041 FixedStack::~FixedStack() 00042 { 00043 delete [] data; 00044 } 00045 00046 bool FixedStack::Push(int x, int y) 00047 { 00048 if(index == size-1) 00049 return(false); 00050 else 00051 { 00052 data[index].x = x; 00053 data[index++].y = y; 00054 return(true); 00055 } 00056 } 00057 00058 bool FixedStack::Pop(int *x, int *y) 00059 { 00060 if(index == 0) 00061 return(false); 00062 else 00063 { 00064 *x = data[--index].x; 00065 *y = data[index].y; 00066 return(true); 00067 } 00068 } 00069 00070 bool FixedStack::IsEmpty() 00071 { 00072 return(index == 0); 00073 } 00074
1.3-rc2