easy but couldnt see the error

[jw]

it crashes but why?thanks for the helps.
#include<vector>
#include<iostream>
using namespace std;

template<class Object>
class Stack{
private:
vector<Object>myVec;
int topOfStack;
public:
Stack()
{
topOfStack=-1;
}
void push(Object x)
{
if(topOfStack==myVec.size()-1) {myVec.resize(myVec.size()*3);}//if
stack is full resize it
myVec[++topOfStack]=x;

}
};

void main(){
Stack<int>m;
m.push(5);
m.push(10);
}

[gpriv]

You keep resizing vector to 0. And you don't need to resize it, there
is push_back method. STL has much better ways to do what you are
trying to do and vector is not the best choice.

[Neil Cerutti]

On 2005-11-11, jw <ja*****@gmail.com> wrote:

it crashes but why?thanks for the helps.
#include<vector>
#include<iostream>
using namespace std;

template<class Object>
class Stack{
private:
vector<Object>myVec;
int topOfStack;
public:
Stack()
{
topOfStack=-1;
}
void push(Object x)
{
if(topOfStack==myVec.size()-1) {myVec.resize(myVec.size()*3);}//if

What is zero times three?

--
Neil Cerutti

[berkay]

yes i know push_back but we must do it with out using push_back

[Neil Cerutti]

On 2005-11-11, berkay <be**********@gmail.com> wrote:

yes i know push_back but we must do it with out using push_back

Fool them all and use a deque and push_front, front, and
pop_front. ;-)

--
Neil Cerutti

[Andre Kostur]

Neil Cerutti <le*******@email.com> wrote in
news:sl*********************@FIAD06.norwich.edu:

On 2005-11-11, berkay <be**********@gmail.com> wrote:

yes i know push_back but we must do it with out using push_back

Fool them all and use a deque and push_front, front, and
pop_front. ;-)

Or how about std::stack<> ? :)