/* -*- C++ -*- */ // Vector_T.i,v 4.3 2003/12/03 17:19:20 shuston Exp template ACE_INLINE ACE_Vector::ACE_Vector (const size_t init_size, ACE_Allocator* alloc) : ACE_Array (init_size == 0 ? DEFAULT_SIZE : init_size, alloc) { length_ = 0; curr_max_size_ = this->max_size (); } template ACE_INLINE ACE_Vector::~ACE_Vector () { } template ACE_INLINE size_t ACE_Vector::capacity (void) const { return curr_max_size_; } template ACE_INLINE size_t ACE_Vector::size (void) const { return length_; } template ACE_INLINE void ACE_Vector::clear (void) { length_ = 0; } template ACE_INLINE void ACE_Vector::pop_back (void) { if (length_ > 0) --length_; } // Compare this vector with for inequality. template ACE_INLINE int ACE_Vector::operator!= (const ACE_Vector &s) const { return !(*this == s); } // **************************************************************** template ACE_INLINE void ACE_Vector_Iterator::dump (void) const { // ACE_TRACE ("ACE_Vector_Iterator::dump"); } template ACE_INLINE ACE_Vector_Iterator::ACE_Vector_Iterator (ACE_Vector &v) : current_ (0), vector_ (v) { // ACE_TRACE ("ACE_Vector_Iterator::ACE_Vector_Iterator"); } template ACE_INLINE int ACE_Vector_Iterator::advance (void) { // ACE_TRACE ("ACE_Vector_Iterator::advance"); if (this->current_ < vector_.size ()) { ++this->current_; return 1; } else { // Already finished iterating. return 0; } } template ACE_INLINE int ACE_Vector_Iterator::done (void) const { ACE_TRACE ("ACE_Vector_Iterator::done"); return this->current_ >= vector_.size (); }