/*
 * libSpiff - XSPF playlist handling library
 *
 * Copyright (C) 2007, Sebastian Pipping / Xiph.Org Foundation
 * 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 Xiph.Org Foundation 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  THE
 * COPYRIGHT OWNER OR CONTRIBUTORS 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.
 *
 * Sebastian Pipping, sping@xiph.org
 */

/**
 * @file SpiffStack.cpp
 * Implementation of SpiffStack.
 */

#include <spiff/SpiffStack.h>
#include <vector>
using namespace std;

namespace Spiff {



/// @cond DOXYGEN_NON_API

/**
 * D object for SpiffStack.
 */
class SpiffStackPrivate {

	friend class SpiffStack;

	vector<unsigned int> stack; ///< Stack backend

	/**
	 * Creates a new D object.
	 */
	SpiffStackPrivate() {

	}

	/**
	 * Destroys this D object.
	 */
	~SpiffStackPrivate() {

	}

};

/// @endcond



SpiffStack::SpiffStack() : d(new SpiffStackPrivate()) {

}



SpiffStack::SpiffStack(const SpiffStack & source)
		: d(new SpiffStackPrivate(*(source.d))) {

}



SpiffStack & SpiffStack::operator=(const SpiffStack & source) {
	if (this != &source) {
		*(this->d) = *(source.d);
	}
	return *this;
}



SpiffStack::~SpiffStack() {
	delete this->d;
}



void SpiffStack::push(unsigned int tag) {
	this->d->stack.push_back(tag);
}



unsigned int SpiffStack::top() const {
	if (this->d->stack.empty()) {
		return 0;
	}
	return this->d->stack.back();
}



void SpiffStack::pop() {
	if (this->d->stack.empty()) {
		return;
	}
	this->d->stack.pop_back();
}



int SpiffStack::getSize() const {
	return static_cast<int>(this->d->stack.size());
}



void SpiffStack::clear() {
	this->d->stack.clear();
}



}