iterator begin()
{
/*	std::vector<T>	v;
	T		top;
	iterato		ret;
	int		n = 0;
	while (!this->empty())
	{
		top = this->top();
		v.push_back(top);
		this->pop();
		n++;
	}
	this->push(v[n - 1]);
	n--;
	ret = &(this->top());
	while (n--)
		this->push(v[n]);
	return (ret);*/
	return (&this->top() - std::stack<T>::size());
}