name() : std::vector<T>() { } \
name(size_type n) : std::vector<T>(n) { } \
name(size_type n, const_reference v) : std::vector<T>(n, v) { } \
+ template <class InputIterator> \
+ name(InputIterator first, InputIterator last) : std::vector<T>(first, last) { } \
\
void Empty() { clear(); } \
void Clear() { clear(); } \
e = rend(); \
for ( const_reverse_iterator i = b; i != e; ++i ) \
if ( *i == item ) \
- return (int)(i - b); \
+ return (int)(e - i - 1); \
} \
else \
{ \
void pop_back() { RemoveAt(size() - 1); } \
void push_back(const value_type& v) { Add(v); } \
void reserve(size_type n) { Alloc(n); } \
- void resize(size_type n, value_type v = value_type()) \
- { SetCount(n, v); } \
+ void resize(size_type count, value_type defval = value_type()) \
+ { \
+ if ( count < m_nCount ) \
+ m_nCount = count; \
+ else \
+ SetCount(count, defval); \
+ } \
\
iterator begin() { return m_pItems; } \
iterator end() { return m_pItems + m_nCount; } \
\
size_t Add(T lItem) \
{ return base::Add(lItem, (CMPFUNC)m_fnCompare); } \
+ void push_back(T lItem) \
+ { Add(lItem); } \
\
void RemoveAt(size_t uiIndex, size_t nRemove = 1) \
{ base::erase(begin() + uiIndex, begin() + uiIndex + nRemove); } \