3 #ifndef HASH_HASHKEYSTACK_H 4 #define HASH_HASHKEYSTACK_H 20 void pop() { assert(! data.empty()); data.pop_back(); }
26 vector_t::const_reverse_iterator p=data.rbegin()+n;
29 bool empty()
const {
return data.empty(); }
30 size_t size()
const {
return data.size(); }
friend bool operator==(const HashKeyStack &, const HashKeyStack &)
std::vector< HashKey > vector_t
const HashKey & top(size_t n=0) const
void push(const HashKey &)
HashKeyStack(size_t capacity=0)