关于top push pop bool

const int maxstack=10000;
class Stack{
public:
    Stack();
    bool empty()const;                // 常函数只读
    Error_code pop();
    Error_code top(Stack_entry&item)const;
    Error_code push(const Stack_entry&item);
private:
    int count;
  Stack_entry entry[maxstack];
}
Error_code Stack::push(const Stack_entry &item)
{ 
 Error_code outcome=success;
 if(count>=maxstack)
  outcome=overflow;
 else 
  entry[count++]=item;
 return outcome;
}
Error_code Stack::pop()
{
Error_code outcome=success;
if(count==0)
out=underflow;
else--count;
return outcome;
}
Error_code Stack::top(Stack_entry &item)const
{
Error_code outcome=success;
if(count==0)
outcome=underflow;
else
item=entry[count-1];
return outcome;
}
bool Stack::empty()const
{
    bool outcome=true;
    if(count>0)outcome=false;
    return outcome;
}


Stack::Stack()
{
    count=0;
}