View difference between Paste ID: KpjpNAdr and AH6k8GRN

 /************ stack.h ************/
 #include<vector>
 #include<iostream>
 #include<algorithm>
 using namespace std;
 class stack
 {
     public:
-    bool push(const string&);
+
-    bool pop(string &elem);
+
-    bool peek(string &elem);
+...
-    bool empty() const {return _stack.empty();}
+...
-    bool full() const {return _stack.size()==_stack.max_size();}
+
-    int size() const {return _stack.size();}
+
 
 };
 
 /********** stack.cpp **********/
 
 #include "stack.h"
 ...
 ...
 bool stack::find (const string &elem) const
 {
     vector<string>::const_iterator it = _stack.begin();
-bool stack::push(const string& str)
+
 }
-    if(full()) return false;
+
-    _stack.push_back(str);
+
-    return true;
+
     return (::count(_stack.begin(),_stack.end(),elem));
-bool stack::pop(string& elem)
+
 
-    if(empty()) return false;
+
-    elem = _stack.back();
+
-    _stack.pop_back();
+
-    return true;
+
 {
-bool stack::peek(string& elem)
+
     string str;
-    if(empty()) return false;
+
-    elem = _stack.back();
+
-    return true;
+
         st.push(str);
     }
 ...
     cout<<"\nEnter a word to search: ";
     cin>>str;
     if(st.find(str))
         cout<<"The word was found "<<st.count(str)<<" no. of times"<<endl;
     else
         cout<<"The word was not found"<<endl;
     return 0;
 
 }