stack.cpp

目前最快速的字符串排序算法

/* Copyright 2007 Stefan Webb

This file is part of Burstsort.

Burstsort is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.

Burstsort is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with Burstsort; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA */

#include "main.h"

Stack::Stack(unsigned int capacity) {
	stack = (unsigned int*) malloc(capacity * sizeof(unsigned int));
	Stack::capacity = capacity;
	size = 0;
}

Stack::~Stack() {
	free(stack);
}

void Stack::push(unsigned int value) {
	if (size < capacity)
		stack[size++] = value;
}

unsigned int Stack::pop() {
	if (size)
		return stack[--size];
	else
		return 0;
}

unsigned int Stack::getsize() {
	return size;
}