DaniWeb Forum Index > Software Development > C++

C++ RSS

Dynamic stack in c++

Please support our C++ advertiser: Intel Parallel Studio Home

•

Join Date: Dec 2007

Posts: 2

Reputation: cessna172 is an unknown quantity at this point

Solved Threads: 0

cessna172

Offline

Newbie Poster

Dynamic stack in c++

Feb 22nd, 2008

 Help with Code Tags 
 C++ Syntax (Toggle Plain Text) 
NODE *head;
public:
 
void push(int value){
NODE *temp = (NODE*) new NODE;
temp->value = value;
temp->link = head;
head = temp;
}//end of push.
 
void pop(int&value) {
NODE *temp = head;
value = head->value;
head = head->link;
delete temp;
}//end of pop.
 
int is_empty(void){
return head == NULL;
}//end of is_empty.
 
STACK (void) {head = NULL;}
~STACK(){
int value;
while(!is_empty()) pop(value);
}//end of destructor.
 
};//end of STACK.
 
int main(void) {
STACK S;
int value;
S.push(5);
S.push(10);
S.push(15);
 
for(int i=0; i<3; i++){
S.pop(value);
cout<<"Popped: "<<value<<endl;
}//end of for.
 
return(0);
}//end of main.
NODE *head;
public:

void push(int value){
NODE *temp = (NODE*) new NODE;
temp->value = value;
temp->link = head;
head = temp;
}//end of push.

void pop(int&value) {
NODE *temp = head;
value = head->value;
head = head->link;
delete temp;
}//end of pop.

int is_empty(void){
return head == NULL;
}//end of is_empty.

STACK (void) {head = NULL;}
~STACK(){
int value;
while(!is_empty()) pop(value);
}//end of destructor.

};//end of STACK.

int main(void) {
STACK S;
int value;
S.push(5);
S.push(10);
S.push(15);

for(int i=0; i<3; i++){
S.pop(value);
cout<<"Popped: "<<value<<endl;
}//end of for.

return(0);
}//end of main.

Can anyone please tell me briefly what this program actually does and how it works?

•

Join Date: Apr 2004

Posts: 4,362

Reputation: Dave Sinkula has a brilliant future

Solved Threads: 241

Dave Sinkula Dave Sinkula is offline

Offline

long time no c

Re: Dynamic stack in c++

Feb 22nd, 2008

Have you ever heard of "debugging with printf"? A similar thing can be done with cout as well. You pepper this code with statements that display for you any items of interest while the program is running. It's a good way to see for yourself what is going on in code.

"One of the methods used by statists to destroy capitalism consists in establishing controls that tie a given industry hand and foot, making it unable to solve its problems, then declaring that freedom has failed and stronger controls are necessary." --Ayn Rand

•

Join Date: Aug 2005

Posts: 598

Reputation: SpS is on a distinguished road

Solved Threads: 32

SpS

Offline

Posting Pro

Re: Dynamic stack in c++

Feb 22nd, 2008

Why are you taking pain by handling memory yourself. Use power of STL.

 Help with Code Tags 
 C++ Syntax (Toggle Plain Text) 
#include <vector>
#include <stdexcept>
 
template <typename T>
class Stack
{
private:
    std::vector<T> elems;     // elements
 
public:
    void push(T const&);      // push element
    void pop();               // pop element
    T top() const;            // return top element
    bool empty() const        // return whether the stack is empty
    {
        return elems.empty();
    }
};
template <typename T>
void Stack<T>::push (T const& elem)
{
    elems.push_back(elem);    // append copy of passed elem
}
 
template<typename T>
void Stack<T>::pop ()
{
    if (elems.empty())
    {
        throw std::out_of_range("Stack<>::pop(): empty stack");
    }
    elems.pop_back();         // remove last element
}
 
template <typename T>
T Stack<T>::top () const
{
    if (elems.empty())
    {
        throw std::out_of_range("Stack<>::top(): empty stack");
    }
    return elems.back();      // return copy of last element
}
#include <vector>
#include <stdexcept>

template <typename T>
class Stack
{
private:
    std::vector<T> elems;     // elements

public:
    void push(T const&);      // push element
    void pop();               // pop element
    T top() const;            // return top element
    bool empty() const        // return whether the stack is empty
    {
        return elems.empty();
    }
};
template <typename T>
void Stack<T>::push (T const& elem)
{
    elems.push_back(elem);    // append copy of passed elem
}

template<typename T>
void Stack<T>::pop ()
{
    if (elems.empty())
    {
        throw std::out_of_range("Stack<>::pop(): empty stack");
    }
    elems.pop_back();         // remove last element
}

template <typename T>
T Stack<T>::top () const
{
    if (elems.empty())
    {
        throw std::out_of_range("Stack<>::top(): empty stack");
    }
    return elems.back();      // return copy of last element
}