/////////////////////////////////////////////////////////////////////////////
// Name: vector.h
-// Purpose: documentation for wxVector<T> class
+// Purpose: interface of wxVector<T>
// Author: wxWidgets team
// RCS-ID: $Id$
// Licence: wxWindows license
@library{wxbase}
@category{FIXME}
- @seealso
- @ref overview_wxcontaineroverview "Container classes overview", wxListT,
- wxArrayT
+ @see @ref overview_wxcontaineroverview, wxListT(), wxArrayT()
*/
class wxVector<T>
{
Returns item at position @e idx.
*/
const value_type at(size_type idx);
- value_type at(size_type idx);
+ const value_type at(size_type idx);
//@}
//@{
Return last item.
*/
const value_type back();
- value_type back();
+ const value_type back();
//@}
//@{
Return iterator to beginning of the vector.
*/
const_iterator begin();
- iterator begin();
+ const iterator begin();
//@}
/**
*/
- size_type capacity();
+ size_type capacity() const;
/**
Clears the vector.
/**
Returns @true if the vector is empty.
*/
- bool empty();
+ bool empty() const;
//@{
/**
Returns iterator to the end of the vector.
*/
const_iterator end();
- iterator end();
+ const iterator end();
//@}
//@{
Returns first item.
*/
const value_type front();
- value_type front();
+ const value_type front();
//@}
/**
)
-
Insert an item. When using values other than built-in integrals
or classes with reference counting this can be an inefficient
operation.
Returns item at position @e idx.
*/
const value_type operator[](size_type idx);
- value_type operator[](size_type idx);
+ const value_type operator[](size_type idx);
//@}
/**
void push_back(const value_type& v);
/**
- Reserves more memory of @e n is greater then
+ Reserves more memory of @a n is greater then
wxVector::size. Other this call has
no effect.
*/
void reserve(size_type n);
};
+