1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
// -*- C++ -*-
//
// $Id$
#include <algorithm>
ACE_BEGIN_VERSIONED_NAMESPACE_DECL
template <class T, size_t DEFAULT_SIZE> ACE_INLINE
ACE_Vector<T, DEFAULT_SIZE>::ACE_Vector (const size_t init_size,
ACE_Allocator* alloc)
: ACE_Array<T> (init_size == 0 ? DEFAULT_SIZE : init_size, alloc),
length_ (0)
{
this->curr_max_size_ = this->max_size ();
}
template <class T, size_t DEFAULT_SIZE> ACE_INLINE
ACE_Vector<T, DEFAULT_SIZE>::~ACE_Vector ()
{
}
template <class T, size_t DEFAULT_SIZE> ACE_INLINE
size_t ACE_Vector<T, DEFAULT_SIZE>::capacity (void) const
{
return curr_max_size_;
}
template <class T, size_t DEFAULT_SIZE> ACE_INLINE
size_t ACE_Vector<T, DEFAULT_SIZE>::size (void) const
{
return length_;
}
template <class T, size_t DEFAULT_SIZE> ACE_INLINE
void ACE_Vector<T, DEFAULT_SIZE>::clear (void)
{
length_ = 0;
}
template <class T, size_t DEFAULT_SIZE> ACE_INLINE
void ACE_Vector<T, DEFAULT_SIZE>::pop_back (void)
{
if (length_ > 0)
{
--length_;
ACE_Array<T>::size (length_);
}
}
// Compare this vector with <s> for inequality.
template <class T, size_t DEFAULT_SIZE> ACE_INLINE bool
ACE_Vector<T, DEFAULT_SIZE>::operator!= (const ACE_Vector<T, DEFAULT_SIZE> &s) const
{
return !(*this == s);
}
template <class T, size_t DEFAULT_SIZE> ACE_INLINE void
ACE_Vector<T, DEFAULT_SIZE>::swap (ACE_Vector &rhs)
{
ACE_Array<T>::swap (rhs);
std::swap (this->length_, rhs.length_);
std::swap (this->curr_max_size_, rhs.curr_max_size_);
}
// ****************************************************************
template <class T, size_t DEFAULT_SIZE> ACE_INLINE void
ACE_Vector_Iterator<T, DEFAULT_SIZE>::dump (void) const
{
// ACE_TRACE ("ACE_Vector_Iterator<T>::dump");
}
template <class T, size_t DEFAULT_SIZE> ACE_INLINE
ACE_Vector_Iterator<T, DEFAULT_SIZE>::ACE_Vector_Iterator (ACE_Vector<T, DEFAULT_SIZE> &v)
: current_ (0),
vector_ (v)
{
// ACE_TRACE ("ACE_Vector_Iterator<T>::ACE_Vector_Iterator");
}
template <class T, size_t DEFAULT_SIZE> ACE_INLINE int
ACE_Vector_Iterator<T, DEFAULT_SIZE>::advance (void)
{
// ACE_TRACE ("ACE_Vector_Iterator<T>::advance");
if (this->current_ < vector_.size ())
{
++this->current_;
return 1;
}
else
// Already finished iterating.
return 0;
}
template <class T, size_t DEFAULT_SIZE> ACE_INLINE int
ACE_Vector_Iterator<T, DEFAULT_SIZE>::done (void) const
{
ACE_TRACE ("ACE_Vector_Iterator<T>::done");
return this->current_ >= vector_.size ();
}
ACE_END_VERSIONED_NAMESPACE_DECL
|
